Pagini recente » Cod sursa (job #213828) | Cod sursa (job #183247) | Cod sursa (job #2252492) | Cod sursa (job #2354536) | Cod sursa (job #1716252)
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>
#define BUF_SIZE 16384
char buf[BUF_SIZE];
int pbuf=BUF_SIZE;
FILE*fi,*fo;
inline char nextch(){
if(pbuf==BUF_SIZE){
fread(buf, BUF_SIZE, 1, fi);
pbuf=0;
}
return buf[pbuf++];
}
inline int nextnum(){
int a=0;
char c=nextch();
while(c<'0' || c>'9')
c=nextch();
while('0'<=c && c<='9'){
a=a*10+c-'0';
c=nextch();
}
return a;
}
int v[100][100];
int main(){
int n;
fi=fopen("royfloyd.in","r");
fo=fopen("royfloyd.out","w");
n=nextnum();
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
v[i][j]=nextnum();
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++){
if(v[i][k] && v[j][k] && i!=j &&(!v[i][j] || v[i][j]>v[i][k]+v[k][j]))
v[i][j]=v[i][k]+v[k][j];
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)
fprintf(fo,"%d ", v[i][j]);
fprintf(fo,"\n");
}
fclose(fi);
fclose(fo);
return 0;
}