poj2240最短路 floyd

标签：

Description

Input

Output

Sample Input

3
USDollar
BritishPound
FrenchFranc
3
USDollar 0.5 BritishPound
BritishPound 10.0 FrenchFranc
FrenchFranc 0.21 USDollar

3
USDollar
BritishPound
FrenchFranc
6
USDollar 0.5 BritishPound
USDollar 4.9 FrenchFranc
BritishPound 10.0 FrenchFranc
BritishPound 1.99 USDollar
FrenchFranc 0.09 BritishPound
FrenchFranc 0.19 USDollar

0

• Source Code

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
char str[40][40],str2[40],str1[40];
double book[40][40];
int main(){
    int t;
    int count=0;
    while(scanf("%d",&t)!=EOF){
        if(t==0)
        break;
        memset(str,0,sizeof(str));
        count++;

        memset(book,0,sizeof(book));
        getchar();
        for(int i=0;i<t;i++){
        scanf("%s",str[i]);
        book[i][i]=1.0;
        getchar();
        }
        int n;
        scanf("%d",&n);
        double d;
        for(int i=0;i<n;i++){
            memset(str1,0,sizeof(str1));
            memset(str2,0,sizeof(str2));
           scanf("%s %lf %s",str1,&d,str2);
           int temp1,temp2;
           for(int ii=0;ii<t;ii++){
              if(strcmp(str1,str[ii])==0)
              temp1=ii;
           }
           for(int ii=0;ii<t;ii++){
             if(strcmp(str2,str[ii])==0)
             temp2=ii;
           }
           book[temp1][temp2]=d;
           getchar();
        }

        for(int k=0;k<t;k++){
          for(int i=0;i<t;i++){
             for(int j=0;j<t;j++){
               if(book[i][j]<book[i][k]*book[k][j])
               book[i][j]=book[i][k]*book[k][j];
             }
          }
        }

        int flag=0;
        for(int i=0;i<t;i++){
            if(book[i][i]>1.0)
            flag=1;
        }
        if(flag==1)
        printf("Case %d: Yes\n",count);
        else
        printf("Case %d: No\n",count);


    }
    return 0;
}

poj2240最短路 floyd

标签：

原文地址：http://www.cnblogs.com/13224ACMer/p/4621137.html