HDU 4371 Alice and Bob
2012-08-18 20:50
260 查看
队友出的
#include <iostream> #include <string> using namespace std; int main() { int T; cin>>T; for(int t=1;t<=T;t++) { int n,m; cin>>n>>m; string name; int min=999999999; for(int i=0;i<m;i++) { int tmp; cin>>tmp; if(min>tmp) min=tmp; } if((n/min)%2==0) name="Alice"; else name="Bob"; cout<<"Case #"<<t<<": "<<name<<endl; } return 0; }
相关文章推荐
- hdu 4371 Alice and Bob
- HDU 4371 Alice and Bob [简单博弈]
- HDU 4371 Alice and Bob
- HDU 4371 Alice and Bob
- HDU 4371 Alice and Bob
- HDU-4371-Alice and Bob
- [博弈] hdu 4371 alice and bob
- HDU 4371 Alice And Bob
- HDU 5054 Alice and Bob
- hdu 3660 Alice and Bob's Trip
- hdu 4268 Alice and Bob(贪心+multiset)
- Alice and Bob(贪心HDU 4268)
- HDU 4268 Alice and Bob 贪心STL O(nlogn)
- HDU 4268 Alice and Bob(贪心)
- 贪心,STL,multiset(Alice and Bob,HDU 4268)
- HDU 4268 Alice and Bob(贪心+Multiset的应用)
- HDU 4268 Alice and Bob(multiset的使用)
- [HDU] 3660 Alice and Bob's Trip -- 树形DP?
- HDU 4111 Alice and Bob (博弈+记忆化搜索)
- hdu 4268 Alice and Bob(贪心)