HDU-1847-Good Luck in CET-4 Everybody!
来源:互联网 发布:公路车骑行姿势 知乎 编辑:程序博客网 时间:2024/06/05 17:23
ACM模版
描述
题解
这里用
代码
#include <iostream>#include <cstring>using namespace std;const int MAXN = 1010;const int MAXM = 32;int n;int f[MAXM];int SG[MAXN];int _hash[MAXN];void get_SG(int n){ memset(SG, 0, sizeof(SG)); for (int i = 1; i <= n; i++) { memset(_hash, 0, sizeof(_hash)); for (int j = 1; f[j] <= i; j++) { _hash[SG[i - f[j]]] = 1; } for (int j = 0; j <= n; j++) { if (_hash[j] == 0) { SG[i] = j; break; } } }}int main(int argc, const char * argv[]){ f[1] = 1; for (int i = 2; i < MAXM; i++) { f[i] = f[i - 1] << 1; } get_SG(MAXN - 1); while (cin >> n) { if (SG[n]) { puts("Kiki"); } else { puts("Cici"); } } return 0;}
阅读全文
0 0
- Good Luck in CET-4 Everybody! HDU
- hdu 1847Good Luck in CET-4 Everybody!
- HDU 1847 Good Luck in CET-4 Everybody!
- HDU 1847--Good Luck in CET-4 Everybody!
- hdu 1847 Good Luck in CET-4 Everybody!
- HDU 1847 - Good Luck in CET-4 Everybody!
- HDU 1847 Good Luck in CET-4 Everybody!
- hdu 1847 Good Luck in CET-4 Everybody!
- hdu 1847 Good Luck in CET-4 Everybody! SG定理
- hdu 1847 - Good Luck in CET-4 Everybody!(简单博弈)
- HDU 1847 Good Luck in CET-4 Everybody!
- HDU(1847)Good Luck in CET-4 Everybody!
- HDU 1847 Good Luck in CET-4 Everybody!
- [sg函数] hdu 1847 Good Luck in CET-4 Everybody!
- hdu 1847 Good Luck in CET-4 Everybody!
- HDU-1847-Good Luck in CET-4 Everybody!
- HDU 1847 -Good Luck in CET-4 Everybody! 博弈论
- hdu 1847 Good Luck in CET-4 Everybody!
- 使用IntelliJ IDEA 配置Maven(入门)
- 在idea中用git导入的maven项目,启动Tomcat报错,求大神!
- 关于应用的Splash启动页
- EasyNVR接入EasyDSS云视频平台快照上传实现
- 监听器和过滤器
- HDU-1847-Good Luck in CET-4 Everybody!
- Kendo UI常用示例汇总(二十一)
- [Thinking in Java]
- 写一个函数求出一个字符串中所有字母的出现次数,不区分大小写
- 总结前端面试过程中最容易出现的问题
- Mac安装office2016以及破解
- oracle listagg函数、lag函数、lead函数 实例
- 移动端总结和手机兼容问题
- 673. Number of Longest Increasing Subsequence 最长递增子序列的个数