tests/performance/18_mv_new.sy


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
71
72
73
74
75
76
77
78
79
80
81
82
83


int A[1024][1024];
int B[1024];
int C[1024];

void mv(int n, int A[][1024], int B[], int C[])
{
    int i, k;

    i = 0;
    while (i < n)
    {
        C[i] = 0;
        i = i + 1;
    }

    i = 0;
    k = 0;
    while (k < n)
    {
        i = 0;
        while (i < n) //L8
        {
            C[i] = C[i] + A[k][i] * B[i];
            i = i + 1;
        }
        k = k + 1;
    }
}

int main()
{
    int n = getint();
    int i, j;

    i = 0;
    j = 0;
    while (i < n)
    {
        j = 0;
        while (j < n)
        {
            A[i][j] = getint();
            j = j + 1;
        }
        i = i + 1;
    }
    i = 0;
    j = 0;
    while (i < n)
    {
        B[i] = getint();
        i = i + 1;
    }

    starttime();

    i = 0;
    while (i < 500)
    {
        mv(n, A, B, C);
        mv(n, A, C, B);
        i = i + 1;
    }

    int ans = 0;
    i = 0;
    while (i < n)
    {
        j = 0;
        while (j < n)
        {
            ans = ans + B[i];
            j = j + 1;
        }
        i = i + 1;
    }
    stoptime();
    putint(ans);
    putch(10);

    return 0;
}