zoukankan      html  css  js  c++  java
  • 快速幂+同余定理

    Description

    People are different. Some secretly read magazines full of interesting girls' pictures, others create an A-bomb in their cellar, others like using Windows, and some like difficult mathematical games. Latest marketing research shows, that this market segment was so far underestimated and that there is lack of such games. This kind of game was thus included into the KOKODáKH. The rules follow: 

    Each player chooses two numbers Ai and Bi and writes them on a slip of paper. Others cannot see the numbers. In a given moment all players show their numbers to the others. The goal is to determine the sum of all expressions Ai Bi from all players including oneself and determine the remainder after division by a given number M. The winner is the one who first determines the correct result. According to the players' experience it is possible to increase the difficulty by choosing higher numbers. 

    You should write a program that calculates the result and is able to find out who won the game. 

    Input

    The input consists of Z assignments. The number of them is given by the single positive integer Z appearing on the first line of input. Then the assignements follow. Each assignement begins with line containing an integer M (1 <= M <= 45000). The sum will be divided by this number. Next line contains number of players H (1 <= H <= 45000). Next exactly H lines follow. On each line, there are exactly two numbers Ai and Bi separated by space. Both numbers cannot be equal zero at the same time.

    Output

    For each assingnement there is the only one line of output. On this line, there is a number, the result of expression 

    (A1B1+A2B2+ ... +AHBH)mod M.

    Sample Input

    3
    16
    4
    2 3
    3 4
    4 5
    5 6
    36123
    1
    2374859 3029382
    17
    1
    3 18132
    

    Sample Output

    2
    13195
    13
    #include<cstdio>
    __int64 quickpow(__int64 n,__int64 m,__int64 mod)
    {
    	__int64 ans=1,base=n;
    	while(m)
    	{
    		if(m&1)
    		{
    			ans=(base*ans)%mod;
    		}
    		base=(base*base)%mod;
    		m>>=1;
    	}
    	return ans;
    }
    
    int main()
    {
    	__int64 t,n,a,q,mod; 
    	
    	scanf("%I64d",&t);
    	while(t--)
    	{ 
    	       __int64  sum=0;
    		scanf("%I64d%I64d",&mod,&n);
    			while(n--)
    	   {
    	    scanf("%I64d%I64d",&a,&q);
    		 sum=(sum+quickpow(a,q,mod))%mod;
    	   }
    	    printf("%I64d
    ",sum);
    	}
    	return 0;
    }

  • 相关阅读:
    Asp.net(c#)导出有表格线的Excel
    精妙SQL语句收集
    SQL定时自动备份,并将备份文件加密压缩并自动下载的实现
    如何跨服务器复制表中数据
    两台Sql server的数据同步
    asp.net response.ContentType 下载文件的四种方法
    屏保显示页面控制
    开博白
    新年有感:如何能真正做好项目
    【转】OpenCV图像处理 图像的点运算 ( 灰度直方图 )
  • 原文地址:https://www.cnblogs.com/kingjordan/p/12027147.html
Copyright © 2011-2022 走看看