poj--3970 party
2016-08-03 11:45
218 查看
http://poj.org/problem?id=3970
题目很水,但是要强调的是:要保证N个数据能够完全输入否则会RE
View Code
题目很水,但是要强调的是:要保证N个数据能够完全输入否则会RE
#include <iostream> #include<cstdio> #define ll long long using namespace std; ll a,ans,d; ll gcd(ll a,ll b) { if(b==0) return a; gcd(b,a%b); } int main() { int n,flag; while(~scanf("%d",&n)) { if(n==0) break; ans=1; flag=1; for(int i=0;i<n;i++) { scanf("%lld",&a); d=gcd(ans,a); ans=ans/d*a; if(ans>=1000000) { flag=0; continue;//注意是continue而不能是break } } if(!flag) printf("Too much money to pay!\n"); else printf("The CEO must bring %d pounds.\n",ans); } return 0; }
View Code
相关文章推荐
- POJ 3970 Party 已被翻译 再想想
- poj 3970 Party 最小公倍数
- POJ 3970 Party
- POJ 3970:Party
- POJ 3970:Party
- poj 3970 Party
- POJ3342——Party at Hali-Bula
- poj 2342 Anniversary party(树形dp)
- POJ 3268 Silver Cow Party (Dijkstra~)
- POJ-2342 Anniversary party(Tree dp)
- poj 3268 Silver Cow Party
- POJ-3268-Silver Cow Party(SPFA 反向建图)
- POJ 3268-Silver Cow Party【正向+反向最短路】
- poj 3342 Party at Hali-Bula 树形dp
- POJ 3663 Costume Party (快速排序)
- poj 2342 Anniversary party 树形DP
- poj 3268 Silver Cow Party(bellman-Ford+spfa)
- poj 2342 Anniversary party (树形DP)
- POJ 3268 Silver Cow Party Dijkstra 单源最短路
- F - Silver Cow Party POJ - 3268