Pagini recente » Cod sursa (job #3175432) | Cod sursa (job #282103) | Cod sursa (job #1136650) | Cod sursa (job #2327065) | Cod sursa (job #2536370)
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define int long long
using namespace std;
const int mod=666013;
ll i,j,t;
struct matrice{
ll rows,cols;
ll arr[105][105];
};
matrice operator*(matrice a,matrice b){
matrice c;
c.rows=a.rows;
c.cols=b.cols;
for(i=1;i<=c.rows;i++){
for(j=1;j<=c.cols;j++){
c.arr[i][j]=0;
}
}
for(i=1;i<=c.rows;i++){
for(j=1;j<=c.cols;j++){
for(t=1;t<=a.cols;t++) c.arr[i][j]=(c.arr[i][j]+(a.arr[i][t]*b.arr[t][j])%mod)%mod;
}
}
return c;
}
int n;
ll a[200][200];
int32_t main() {
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
cin>>n;
//a.rows=n;
//a.cols=n;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++) cin>>a[i][j];
}
for(j=1;j<=n;j++){
for(i=1;i<=n;i++){
for(ll k=1;k<=n;k++){
if((a[i][k]>a[i][j]+a[j][k] || a[i][k]==0) && a[i][j]!=0 && a[j][k]!=0 && i!=k) a[i][k]=a[i][j]+a[j][k];
}
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++) cout<<a[i][j]<<" ";
cout<<"\n";
}
}