Pagini recente » Cod sursa (job #2843362) | Cod sursa (job #393677) | Cod sursa (job #76376) | Cod sursa (job #807509) | Cod sursa (job #2425748)
#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
#define f(i) for(i = 0; i < n; i++ )
using namespace std;
int G[101][101];
int minim ( int a, int b){
return (a > b ? b : a);
}
int main(){
int i, j, k, n;
string nume1 = "date.in";
string nume2 = "date.out";
string nume3 = "royfloyd.in";
string nume4 = "royfloyd.out";
ifstream in (nume3);
in >> n;
f(i)
f(j)
in >> G[i][j];
in.close();
f(k)
f(j)
f(i)
if ( G[i][k] && G[k][j] && i != j && ( G[i][j] < G[i][k] + G[k][j] || !G[i][j]))
G[i][j] = ( G[i][k] + G[k][j]);
ofstream out ( nume4);
f(i){
f(j)
out << G[i][j] << " ";
out << "\n";
}
out.close();
return 0;
}