Uva-10404-Bachet's Game
2013-06-29 19:59
921 查看
这个题咋一看是博弈,后来网上参考了下别人的报告才知道居然可以用背包做~
代码:
代码:
#include<cstdio> #include<cstring> #include<iostream> using namespace std; const int maxn=11; int n,m,a[maxn],dp[1000001]; int main() { while(scanf("%d%d",&n,&m)!=EOF) { memset(dp,0,sizeof(dp)); for(int i=0;i<m;i++) scanf("%d",&a[i]); dp[0]=0; for(int i=1;i<=n;i++) for(int j=0;j<m;j++) if(i>=a[j]&&!dp[i-a[j]]) { dp[i]=1; break; } if(dp ) printf("Stan wins\n"); else printf("Ollie wins\n"); } return 0; }
相关文章推荐
- 经典的Nim游戏 博弈经典模型 UVa 10404 - Bachet's Game
- UVa 10404 Bachet's Game(DP)
- UVa 10404. Bachet's Game
- UVA 10404 Bachet's Game
- uva10404 - Bachet's Game(博弈,递推)
- uva 10404 - Bachet's Game
- UVA10404- Bachet's Game
- Uva 10404-Bachet's Game(博弈)
- uva 10404 Bachet's Game (完全背包+博弈)
- UVA 10404 - Bachet's Game 组合博弈
- UVA - 10404 Bachet's Game
- UVA 题目10404 - Bachet's Game(DP+博弈)
- UVA - 10404 Bachet's Game
- UVA 10404 Bachet's Game
- UVA - 10404 Bachet's Game 博弈
- UVA 10404 Bachet's Game
- uva 10404 Bachet's Game
- dp+博弈 uva-10404-Bachet's Game
- UVa 10404 Bachet's Game (DP&博弈)
- uva 10404 Bachet's Game