http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=61
floyd的题,稍微有点变化,直接上代码:
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
int map[35][35];
int N, m = 0;
int caseid = 0;
while(cin>>N)
{
m = 0;
memset(map, 0, sizeof(map));
int c1, c2;
for(int i = 0; i < N; ++i)
{
cin>>c1>>c2;
map[c1][c2] = 1;
m = max(m, c1);
m = max(m, c2);
}
for(int i = 0; i <= m; ++i)
for(int j = 0; j <= m; ++j)
for(int k = 0; k <= m; ++k)
{
if(map[j][k] != 0 && map[k][j] != 0)
map[j][k] = map[k][j] = -1;
else if((map[j][i] == -1 && map[i][k] != 0) || (map[j][i] != 0 && map[i][k] == -1))
map[j][k] = -1;
else
map[j][k] += map[j][i] * map[i][k];
}
cout<<"matrix for city "<<caseid<<endl;
for(int i = 0; i <= m; ++i)
{
int j;
for(j = 0; j <= m-1; ++j)
cout<<map[i][j]<<" ";
cout<<map[i][j]<<endl;
}
caseid++;
}
return 0;
}
测试case:
7 0 1 0 2 0 4 2 4 2 3 3 1 4 3 5 0 2 0 1 1 5 2 5 2 1 9 0 1 0 2 0 3 0 4 1 4 2 1 2 0 3 0 3 1输出结果:
matrix for city 0 0 4 1 3 2 0 0 0 0 0 0 2 0 2 1 0 1 0 0 0 0 1 0 1 0 matrix for city 1 0 2 1 0 0 3 0 0 0 0 0 1 0 1 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 matrix for city 2 -1 -1 -1 -1 -1 0 0 0 0 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 0 0 0