-
Notifications
You must be signed in to change notification settings - Fork 0
/
试验4.2
67 lines (62 loc) · 1.1 KB
/
试验4.2
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
#include <stdio.h>
#include <malloc.h>
int *ji(int *a,int *b,int size){
int *c;
int i,j,k,l;
c = (int *)malloc(size * size * sizeof(int));
for(i = 0;i < size ; i ++ )
{
for(j = 0; j < size; j++)
{
l = 0;
for(k = 0;k < size;k ++)
{
l +=( *(a + i * size + k) * *(b + k * size + j));
}
*(c + i * size + j) = l;
}
}
return c;
}
int *mi(int *ans,int *n,int size,int m){
int i,j;
if(m == 0)
{
for(i = 0;i < size ; i ++ )
{
for(j = 0; j < size; j++)
{
if(i == j)
*(ans + i * size + j) = 1;
else
*(ans + i * size + j) = 0;
}
}
}
else
ans = ji(mi(ans,n,size,m - 1 ),n,size);
return ans;
}
int main(void)
{
int size;
int *n,*ans;
int i,j,m;
scanf("%d",&size);
n = (int *)malloc(size * size * sizeof(int));
ans = (int *)malloc(size * size * sizeof(int));
for(i = 0;i < size ; i ++ )
{
for(j = 0; j < size; j++)
scanf("%d",n + i * size + j);
}
scanf("%d",&m);
ans = mi(ans,n,size,m);
for(i = 0;i < size ; i ++ )
{
for(j = 0; j < size; j++)
printf("%d ",*(ans + i * size + j));
printf("\n");
}
return 0;
}