zoukankan      html  css  js  c++  java
  • HDU 4861 Couple doubi(找规律|费马定理)

    Couple doubi
    Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

    Description

    DouBiXp has a girlfriend named DouBiNan.One day they felt very boring and decided to play some games. The rule of this game is as following. There are k balls on the desk. Every ball has a value and the value of ith (i=1,2,...,k) ball is 1^i+2^i+...+(p-1)^i (mod p). Number p is a prime number that is chosen by DouBiXp and his girlfriend. And then they take balls in turn and DouBiNan first. After all the balls are token, they compare the sum of values with the other ,and the person who get larger sum will win the game. You should print “YES” if DouBiNan will win the game. Otherwise you should print “NO”.
     

    Input

    Multiply Test Cases. 
    In the first line there are two Integers k and p(1<k,p<2^31). 
     

    Output

    For each line, output an integer, as described above.
     

    Sample Input

    2 3 20 3
     

    Sample Output

    YES NO
    //打表找规律的代码
    #include<stdio.h>
    #include<math.h>
    #include<string.h>
    int main(void)
    {
        int i,j,k,p;
        int value[100];
        while(scanf("%d%d",&k,&p)!=EOF)
        {
            memset(value,0,sizeof(value));
            for(int i=1;i<=k;i++)
            {
                for(int j=1;j<p;j++){
                    value[i]=(int)(value[i]+pow(j,i))%p;
                }
                printf("%d ",value[i]);
            }
            printf("
    ");
        }
        return 0;
    }
    /*
    打表找了下规律,发现2的时候所有球都是1,
    3的时候是0 2 0 2 0 2 0 2···交替,
    5的时候是0 0 0 4 0 0 0 4 0 0 0 4···, 
    7 的时候是0 0 0 0 0 6 0 0 0 0 0 6·····,这样规律就出来了。
    */
    //ac
    #include<stdio.h>
    int main()
    {
        int k, p;
        while(~scanf("%d%d", &k, &p))
        {
            if((k/(p-1))%2==1)
                printf("YES
    ");
            else
                printf("NO
    ");
        }
        return 0;
    }
    //费马定理神马看这里吧!
    http://blog.csdn.net/u011439796/article/details/38048963
  • 相关阅读:
    css代码中position的定位,baidu+总结
    ibatis_HelloWorld
    v7系统,任务栏的开始图标和其他图标重合问题
    递归方法:输入一个多位整数,计算出从0到该数1出现的个数。
    解决JS:window.close()在Firefox下的不能关闭的问题
    Programming in the MidFuture(转)
    修改blog问题
    面向数据库的高级语言
    F#试用感受
    基于.net的数学编程语言
  • 原文地址:https://www.cnblogs.com/woshijishu3/p/3868864.html
Copyright © 2011-2022 走看看