1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
int M;
int L;
int N;
int add(int a0[],int a1[], int a2[],int b0[],int b1[],int b2[],int c0[],int c1[],int c2[])
{
int i;
i=0;
while(i<M)
{
c0[i]=a0[i]+b0[i];
c1[i]=a1[i]+b1[i];
c2[i]=a2[i]+b2[i];
i=i+1;
}
return 0;
}
int main()
{
N=3;
M=3;
L=3;
int a0[3];int a1[3]; int a2[3];int b0[3];int b1[3];int b2[3];int c0[6];int c1[3];int c2[3];
int i;
i=0;
while(i<M)
{
a0[i]=i;
a1[i]=i;
a2[i]=i;
b0[i]=i;
b1[i]=i;
b2[i]=i;
i=i+1;
}
i=add( a0, a1, a2, b0, b1, b2, c0, c1, c2);
int x;
while(i<N)
{
x = c0[i];
putint(x);
i=i+1;
}
x = 10;
putch(x);
i=0;
while(i<N)
{
x = c1[i];
putint(x);
i=i+1;
}
x = 10;
putch(x);
i=0;
while(i<N)
{
x = c2[i];
putint(x);
i=i+1;
}
x = 10;
putch(x);
return 0;
}
|
