zoukankan      html  css  js  c++  java
  • poj1995 Raising Modulo Numbers【高速幂】

    Raising Modulo Numbers
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 5500   Accepted: 3185

    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 AiBi 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<stdio.h>
    #include<string.h>
    int ksm(long long a,long long b,long long n)
    {
    	long long ans=1;
    	while(b)
    	{
    		if(b&1)
    			ans=ans*a%n;
    			//写成ans*=a%n不行...输出错误 
    		a=a*a%n;
    		b>>=1;
    	}
    	return ans;
    }
    int main()
    {
    	int z,h,m,u,i;
    	scanf("%d",&z);
    	while(z--)
    	{
    		int sum = 0;
    		scanf("%d",&m);
    		scanf("%d",&h);
    		while(h--)
    		{
    			scanf("%d%d",&u,&i);
    			sum += ksm(u,i,m);
    			sum %= m;
    		}
    		printf("%d
    ",sum);
    	}
    	return 0;
    }
    
    /*************************************************************/
    
    #include<stdio.h>
    #include<string.h>
    int main()
    {
    	long long z,h,m,a,b,ans;
    	scanf("%lld",&z);
    	while(z--)
    	{
    		int sum = 0;
    		scanf("%lld",&m);
    		scanf("%lld",&h);
    		while(h--)
    		{
    			scanf("%lld%lld",&a,&b);
    			ans = 1;
    			while(b)
    			{
    				if(b&1)
    				ans=ans*a%m;
    				a=a*a%m;
    				b>>=1;
    			}
    			sum += ans;
    			sum %= m;
    		}
    		printf("%d
    ",sum%m);
    	}
    	return 0;
    }
    




  • 相关阅读:
    Android之TCP服务器编程
    太阳能锂电池充电电路
    android之WIFI小车编程详述
    java 之UDP编程
    liunx目录/etc下相关配置
    五:ZooKeeper的集群命令客户端的链接和命令操作的使用
    四:ZooKeeper的集群,伪集群,单机的搭建
    三:ZooKeeper的ZAB协议
    二:ZooKeeper术语概念
    一:ZooKeeper简介
  • 原文地址:https://www.cnblogs.com/zhchoutai/p/7258992.html
Copyright © 2011-2022 走看看