POJ 题目2240 Arbitrage（最短路变形）_for each test case, print one line telling whether-优快云博客

本文深入探讨了AI音视频处理领域中的视频分割与语义识别技术，介绍了视频分割的基本概念、算法及其应用，并详细阐述了语义识别在智能视频分析中的重要作用，包括其在自动驾驶、AR增强现实等领域的实际应用案例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Arbitrage

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 16618		Accepted: 6983

Description

Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 British pound, 1 British pound buys 10.0 French francs, and 1 French franc buys 0.21 US dollar. Then, by converting currencies, a clever trader can start with 1 US dollar and buy 0.5 * 10.0 * 0.21 = 1.05 US dollars, making a profit of 5 percent.

Your job is to write a program that takes a list of currency exchange rates as input and then determines whether arbitrage is possible or not.

Input

The input will contain one or more test cases. Om the first line of each test case there is an integer n (1<=n<=30), representing the number of different currencies. The next n lines each contain the name of one currency. Within a name no spaces will appear. The next line contains one integer m, representing the length of the table to follow. The last m lines each contain the name ci of a source currency, a real number rij which represents the exchange rate from ci to cj and a name cj of the destination currency. Exchanges which do not appear in the table are impossible.
Test cases are separated from each other by a blank line. Input is terminated by a value of zero (0) for n.

Output

For each test case, print one line telling whether arbitrage is possible or not in the format "Case case: Yes" respectively "Case case: No".

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

Sample Output

Case 1: Yes
Case 2: No

Source

Ulm Local 1996

ac代码

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<string>
#include<map>
#include<iostream>
using namespace std;
int n;
double mp[1010][1010];
int main()
{
	int cot=0;
	while(scanf("%d",&n)!=EOF,n)
	{
		char s[110];
		int i,x,j,k;
		map<string,int>m;
		//getchar();
		for(i=1;i<=n;i++)
		{
			scanf("%s",s);
			m[s]=i;
			mp[i][i]=1.0;
		}
		scanf("%d",&x);
		//getchar();
		while(x--)
		{
			char a[110],b[110];
			double c;
			scanf("%s%lf%s",a,&c,b);
			mp[m[a]][m[b]]=c;
		}
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=n;j++)
			{
				for(k=1;k<=n;k++)
				{
					if(mp[i][j]<mp[i][k]*mp[k][j])
						mp[i][j]=mp[i][k]*mp[k][j];
				}
			}
		}
		int flag=0;
		for(i=1;i<=n;i++)
		{
			if(mp[i][i]>1)
			{
				flag=1;
				break;
			}
		}
		if(flag)
		{
			printf("Case %d: Yes\n",++cot);
		}
		else
			printf("Case %d: No\n",++cot);
	}
}