zoukankan      html  css  js  c++  java
  • BZOJ 1228: [SDOI2009]E&D(SG定理)

    这道嘛,很容易就看出是个nim和,然后问题就是怎么算子问题的sg函数了

    先暴力个表看下规律,很容易就找出来了~~~(百度空间又渣了,图贴不出来= =)

    32

    0 1 0 2 0 1 0 3 0 1 0 2 0 1 0 4 0 1 0 2 0 1 0 3 0 1 0 2 0 1 0 5

    1 1 2 2 1 1 3 3 1 1 2 2 1 1 4 4 1 1 2 2 1 1 3 3 1 1 2 2 1 1 5 5

    0 2 0 2 0 3 0 3 0 2 0 2 0 4 0 4 0 2 0 2 0 3 0 3 0 2 0 2 0 5 0 5

    2 2 2 2 3 3 3 3 2 2 2 2 4 4 4 4 2 2 2 2 3 3 3 3 2 2 2 2 5 5 5 5

    0 1 0 3 0 1 0 3 0 1 0 4 0 1 0 4 0 1 0 3 0 1 0 3 0 1 0 5 0 1 0 5

    1 1 3 3 1 1 3 3 1 1 4 4 1 1 4 4 1 1 3 3 1 1 3 3 1 1 5 5 1 1 5 5

    0 3 0 3 0 3 0 3 0 4 0 4 0 4 0 4 0 3 0 3 0 3 0 3 0 5 0 5 0 5 0 5

    3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5

    0 1 0 2 0 1 0 4 0 1 0 2 0 1 0 4 0 1 0 2 0 1 0 5 0 1 0 2 0 1 0 5

    1 1 2 2 1 1 4 4 1 1 2 2 1 1 4 4 1 1 2 2 1 1 5 5 1 1 2 2 1 1 5 5

    0 2 0 2 0 4 0 4 0 2 0 2 0 4 0 4 0 2 0 2 0 5 0 5 0 2 0 2 0 5 0 5

    2 2 2 2 4 4 4 4 2 2 2 2 4 4 4 4 2 2 2 2 5 5 5 5 2 2 2 2 5 5 5 5

    0 1 0 4 0 1 0 4 0 1 0 4 0 1 0 4 0 1 0 5 0 1 0 5 0 1 0 5 0 1 0 5

    1 1 4 4 1 1 4 4 1 1 4 4 1 1 4 4 1 1 5 5 1 1 5 5 1 1 5 5 1 1 5 5

    0 4 0 4 0 4 0 4 0 4 0 4 0 4 0 4 0 5 0 5 0 5 0 5 0 5 0 5 0 5 0 5

    4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5

    0 1 0 2 0 1 0 3 0 1 0 2 0 1 0 5 0 1 0 2 0 1 0 3 0 1 0 2 0 1 0 5

    1 1 2 2 1 1 3 3 1 1 2 2 1 1 5 5 1 1 2 2 1 1 3 3 1 1 2 2 1 1 5 5

    0 2 0 2 0 3 0 3 0 2 0 2 0 5 0 5 0 2 0 2 0 3 0 3 0 2 0 2 0 5 0 5

    2 2 2 2 3 3 3 3 2 2 2 2 5 5 5 5 2 2 2 2 3 3 3 3 2 2 2 2 5 5 5 5

    0 1 0 3 0 1 0 3 0 1 0 5 0 1 0 5 0 1 0 3 0 1 0 3 0 1 0 5 0 1 0 5

    1 1 3 3 1 1 3 3 1 1 5 5 1 1 5 5 1 1 3 3 1 1 3 3 1 1 5 5 1 1 5 5

    0 3 0 3 0 3 0 3 0 5 0 5 0 5 0 5 0 3 0 3 0 3 0 3 0 5 0 5 0 5 0 5

    3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5 3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5

    0 1 0 2 0 1 0 5 0 1 0 2 0 1 0 5 0 1 0 2 0 1 0 5 0 1 0 2 0 1 0 5

    1 1 2 2 1 1 5 5 1 1 2 2 1 1 5 5 1 1 2 2 1 1 5 5 1 1 2 2 1 1 5 5

    0 2 0 2 0 5 0 5 0 2 0 2 0 5 0 5 0 2 0 2 0 5 0 5 0 2 0 2 0 5 0 5

    2 2 2 2 5 5 5 5 2 2 2 2 5 5 5 5 2 2 2 2 5 5 5 5 2 2 2 2 5 5 5 5

    0 1 0 5 0 1 0 5 0 1 0 5 0 1 0 5 0 1 0 5 0 1 0 5 0 1 0 5 0 1 0 5

    1 1 5 5 1 1 5 5 1 1 5 5 1 1 5 5 1 1 5 5 1 1 5 5 1 1 5 5 1 1 5 5

    0 5 0 5 0 5 0 5 0 5 0 5 0 5 0 5 0 5 0 5 0 5 0 5 0 5 0 5 0 5 0 5

    5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5

    只能这样了= =

    很容易就能写出来了= =

    CODE:

    #include<cstdio>

    #include<iostream>

    #include<algorithm>

    #include<cstring>

    using namespace std;

    int solve(int x,int y) {

    int n=31;

    for (int m=30;m;m--) {

    int t=1<<m;

    if (x<=t&&y<=t) n=m;

    if (x>t) x-=t;

    if (y>t) y-=t;

    }

    return (x==1&&y==1)?0:n;

    }

    int main(){

    int T;

    scanf("%d",&T);

    while (T--) {

    int n,ans=0;

    scanf("%d",&n);

    for (int i=1;i<=n;i+=2){

    int x,y;

    scanf("%d%d",&x,&y);

    ans^=solve(x,y);

    }

    printf("%s ",ans?"YES":"NO");

    }

    return 0;

    }


  • 相关阅读:
    微信公众号开发之用户地理位置坐标转百度坐标
    PHP变量入门教程(1)基础
    【很变态】PHP类实例化对象竟然可以访问类的“静态(static)方法”!!!
    【转】记录PHP、MySQL在高并发场景下产生的一次事故
    PHP返回32位与16位的md5加密值
    PhpStorm 8.x/9.x 快捷键设置/个性化设置,如何多项目共存?如何更换主题?
    Linux设置Memcached开机启动
    【荐】MongoDB基本命令大全
    【荐】PHP操作MongoDB GridFS 存储文件,如图片文件
    Shell入门教程:流程控制(7)break和continue
  • 原文地址:https://www.cnblogs.com/New-Godess/p/4348908.html
Copyright © 2011-2022 走看看