Cod sursa(job #668097)

Utilizator wink.itsgoneDragusanu Ana wink.itsgone Data 24 ianuarie 2012 13:19:52
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <cstdio>
using namespace std;
int n,cost[101][101];
int main()
{
 freopen("royfloyd.in","rt",stdin);
 freopen("royfloyd.out","wt",stdout);
 scanf("%d",&n);	 
 for(int i=1;i<=n;++i)
	{
	 for(int j=1;j<=n;++j)
		{
		 scanf("%d",&cost[i][j]); 
		}
	}
 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] && i!=j)
				{
				 if(cost[i][k]+cost[k][j]<=cost[i][j] || cost[i][j]==0)
					{
					 cost[i][j]=cost[i][k]+cost[k][j];
					}
				}
			}
		}
	}
 for(int i=1;i<=n;++i)
	{
	 for(int j=1;j<=n;++j)
		{
		 printf("%d ",cost[i][j]);
		}
		printf("\n");
	}
 return 0;
}