hdu1850 Being a Good Boy in Spring Festival nim博弈
来源:互联网 发布:java虚拟机最大内存 编辑:程序博客网 时间:2024/05/16 08:11
N堆牌,没堆Ai张,问先手必胜的前提下,第一次有多少种可行的取法。
每堆牌异或一下得到ans,如果是先取第i堆的话,其他堆异或的结果为B,那么(Ai-x) xor B==0时,说明从Ai中取走x可以留给对手一个必败态,所以对每一堆求出x后,判断一下x是否小于Ai,若小于则答案++。
#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;int n,m,k;int a[200];int main(){// freopen("in.txt","r",stdin); while(scanf("%d",&n) && n) { int ans=0; for (int i=1; i<=n; i++) scanf("%d",&a[i]),ans^=a[i]; int ct=0; for (int i=1; i<=n; i++) { ans^=a[i]; if (ans<a[i]) ct++; ans^=a[i]; } cout<<ct<<endl; } return 0;}
0 0
- hdu1850 Being a Good Boy in Spring Festival nim博弈
- HDU1850 Being a Good Boy in Spring Festival Nim博弈
- HDU1850:Being a Good Boy in Spring Festival(Nim)
- HDU1850 Being a Good Boy in Spring Festival 博弈
- hdu1850 Being a Good Boy in Spring Festival 博弈 nim-sum定理
- hdu1850-Being a Good Boy in Spring Festival (博弈论 Nim博弈)
- hdu1850 Being a Good Boy in Spring Festival(nim博弈)
- hdu1850 Being a Good Boy in Spring Festival(尼姆博弈Nim)
- hdu1850-Being a Good Boy in Spring Festival(Nim博弈)
- Being a Good Boy in Spring Festival(Nim博弈)
- hdu1850 Being a Good Boy in Spring Festival
- HDU1850-Being a Good Boy in Spring Festival
- hdu1850 Being a Good Boy in Spring Festival
- hdu1850 Being a Good Boy in Spring Festival
- HDU1850-Being a Good Boy in Spring Festival-博弈论
- HDU1850 Being a Good Boy in Spring Festival
- hdu1850 Being a Good Boy in Spring Festival
- HDU1850(博弈论,Being a Good Boy in Spring Festival)
- 移动应用开发之Java+Eclipse环境搭建
- ubuntu 12.04中搭建nfs服务器
- SPAN和DIV Class与ID的区别汇总
- hdu3900 Unblock Me
- 喵呜...
- hdu1850 Being a Good Boy in Spring Festival nim博弈
- mesademos loaddown
- CSS基础
- 通过调用qt的assistant来实现自定义文档(qhc格式)
- Maximum Depth of Binary Tree
- Tomcat 源码研究(1)环境搭建
- 移动开发之Xamarin+C#环境搭建
- 南阳理工acm- ASCII码排序 -题目4
- C++ 文件读写示例