Pagini recente » Borderou de evaluare (job #158203) | Borderou de evaluare (job #1565756) | Borderou de evaluare (job #1575290) | Cod sursa (job #3347992) | Cod sursa (job #3344481)
#include <fstream>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <stack>
using namespace std;
ifstream fin("test.in");
ofstream fout("test.out");
int a[105][105];
int main() {
int n;
fin>>n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++) {
fin>>a[i][j];
if (!a[i][j])
a[i][j]=1e9;
}
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
if (i!=j and a[i][k] and a[k][j] and a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
for (int i=1; i<=n; i++,fout<<"\n")
for (int j=1; j<=n; j++)
if (a[i][j]!=1e9)
fout<<a[i][j]<<" ";
else
fout<<0<<' ';
return 0;
}
// 2 0 3 -1 7 -4