UVA 10404 - Bachet's Game
2015-03-16 14:03
399 查看
动规的题,还是尽量转化成动规的形式,用一个数组f[i]表示当还有i个石子该Stan取的时候,Stan是否能够获胜。
代码:
代码:
#include<stdio.h> #include<string.h> #define MAXD 1000010 #define MAXM 15 int N, M, f[MAXD], r[MAXM]; void init() { int i; scanf("%d", &M); for(i = 0; i < M; i ++) scanf("%d", &r[i]); } void solve() { int i, j; f[0] = 0; for(i = 1; i <= N; i ++) { f[i] = 0; for(j = 0; j < M; j ++) if(i - r[j] >= 0 && f[i - r[j]] == 0) { f[i] = 1; break; } } if(f ) printf("Stan wins\n"); else printf("Ollie wins\n"); } int main() { while(scanf("%d", &N) == 1) { init(); solve(); } return 0; }
相关文章推荐
- 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
- UVA 10404 Bachet's Game
- UVa 10404 - Bachet's Game
- Uva-10404-Bachet's Game
- UVa 10404 Bachet's Game (DP&博弈)
- UVA10404- Bachet's Game
- UVa 10404 - Bachet's Game
- UVa 10404 - Bachet's Game
- UVA 10404 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(DP)
- Uva 10404-Bachet's Game(博弈)
- UVA 10404 - Bachet's Game 组合博弈