Pagini recente » Borderou de evaluare (job #2600044) | Cod sursa (job #329273) | Rezultatele filtrării | Borderou de evaluare (job #1493440) | Cod sursa (job #792184)
Cod sursa(job #792184)
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector< vector<unsigned int> > Cost;
int n;
ifstream f ("royfloyd.in");
f >> n;
Cost.resize(n+1, vector<unsigned int>(n+1));
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
f >> Cost[i][j];
f.close();
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(Cost[i][k] && Cost[k][j] && (Cost[i][j] > Cost[i][k] + Cost[k][j] || !Cost[i][j]) && i!=j) Cost[i][j] = Cost[i][k] + Cost[k][j];
ofstream g ("royfloyd.out");
for(int i = 1; i <= n; ++i, g << "\n")
for(int j = 1; j <= n; ++j)
g << Cost[i][j] << " ";
g.close();
}