99 lines
1.5 KiB
Plaintext
99 lines
1.5 KiB
Plaintext
int a[250][250];
|
|
int b[250][250];
|
|
int c[250][250];
|
|
const int MAX = 2147483647;
|
|
|
|
int main(){
|
|
int n;
|
|
int i;
|
|
int j;
|
|
int k;
|
|
int sum = 0;
|
|
|
|
i = 0;
|
|
while(i<250)
|
|
{
|
|
n = getarray(a[i]);
|
|
if(n!=250){
|
|
return n;
|
|
}
|
|
i = i + 1;
|
|
}
|
|
|
|
starttime();
|
|
|
|
i = 0;
|
|
while(i<250){
|
|
j = 0;
|
|
while(j<250){
|
|
b[i][j] = a[j][i];
|
|
j = j+1;
|
|
}
|
|
i = i+1;
|
|
}
|
|
|
|
i = 0;
|
|
while(i<250){
|
|
j = 0;
|
|
while(j<250){
|
|
k = 0;
|
|
int temp = 0;
|
|
while(k<250){
|
|
if(a[i][k]*b[k][j] % 2 == 0)
|
|
temp = temp + a[i][k]*b[k][j];
|
|
k = k+1;
|
|
}
|
|
c[i][j] = temp;
|
|
j = j+1;
|
|
}
|
|
i = i+1;
|
|
}
|
|
|
|
i = 0;
|
|
while(i<250){
|
|
j = 0;
|
|
int temp = MAX;
|
|
while(j<250){
|
|
if(c[i][j]<temp)
|
|
{
|
|
temp = c[i][j];
|
|
}
|
|
j = j+1;
|
|
}
|
|
j = 0;
|
|
while(j<250){
|
|
c[i][j] = temp;
|
|
j = j+1;
|
|
}
|
|
i = i+1;
|
|
}
|
|
|
|
i = 0;
|
|
while(i<250){
|
|
j = 0;
|
|
int temp = MAX;
|
|
while(j<250){
|
|
c[i][j] = -c[j][i];
|
|
j = j+1;
|
|
}
|
|
i = i+1;
|
|
}
|
|
|
|
i = 0;
|
|
while(i<250){
|
|
j = 0;
|
|
int temp = MAX;
|
|
while(j<250){
|
|
sum = sum + c[i][j];
|
|
j = j+1;
|
|
}
|
|
i = i+1;
|
|
}
|
|
|
|
stoptime();
|
|
|
|
putint(sum);
|
|
return 0;
|
|
}
|
|
|