zoj1092 Arbitrage

1. //zoj1092 Arbitrage
2. //Accepted 1092 C ++ 00:00.07 400K
3. #include <stdio.h>
4. #include <string.h>
5. #define MAXN 30
6. typedef double elem;
7. int n;
8. int find(char s[40], char c[][40], int n)
9. {
10.        for (int i=0; i<n; ++i)
11.               if (strcmp(s,c[i]) == 0)
12.                      return i;
13.        return -1;
14. }
15. void floyd(int n,elem a[][MAXN])
16. {
17.        for (int k=0; k<n; ++k)
18.               for (int i=0; i<n; ++i)
19.                      for (int j=0; j<n; ++j)
20.                             if (a[i][j]<a[i][k]*a[k][j] && a[i][k]*a[k][j]!=0.0)
21.                                    a[i][j] = a[i][k]*a[k][j];
22. }
23. void solve()
24. {
25.        int i,m;
26.        elem r[MAXN][MAXN],t;
27.        char left[40],right[40],c[MAXN][40];
28.        for (i=0; i<n; ++i)
29.               scanf ("%s",c[i]);
30.        scanf ("%d",&m);
31.        memset(r,0,sizeof(r));
32.        for (i=0; i<m; ++i) {
33.               scanf ("%s %lf %s",left,&t,right);
34.               r[find(left,c,n)][find(right,c,n)] = t;
35.        }
36.        floyd(n,r);
37.        for (i=0; i<n; ++i)
38.               if (r[i][i] > 1.0) {
39.                      printf ("Yes/n");
40.                      return;
41.               }
42.        printf ("No/n");
43. }
44. int main()
45. {
46. #ifndef ONLINE_JUDGE
47.        freopen("1092.txt","r",stdin);
48. #endif
49.        int cnt = 1;
50.        while (scanf ("%d",&n) != EOF && n) {
51.               printf ("Case %d: ",cnt++);
52.               solve();
53.        }
54. #ifndef ONLINE_JUDGE
55.        fclose(stdin);
56. #endif
57.        return 0;
58. }
59.