POJ 题目1995 Raising Modulo Numbers（快速幂）

来源：互联网发布：腾讯云域名实名认证编辑：程序博客网时间：2024/05/22 12:33

Current Contest
Past Contests
Scheduled Contests
Award Contestkxh1995 Log Out
Mail:10(7)
Login Log Archive

Language:

Raising Modulo Numbers

Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4849 Accepted: 2814

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

(A₁^B₁+A₂^B₂+ ... +A_H^B_H)mod M.

Sample Input

31642 33 44 55 63612312374859 30293821713 18132

Sample Output

21319513

Source

CTU Open 1999

无聊刷水题

ac代码

#include<stdio.h>#include<string.h>__int64 qpow(__int64 a,__int64 b,__int64 mod){__int64 ans=1;while(b){if(b&1)ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}int main(){int t;scanf("%d",&t);while(t--){__int64 mod,n;__int64 ans=0;scanf("%I64d%I64d",&mod,&n);while(n--){__int64 a,b;scanf("%I64d%I64d",&a,&b);ans=(ans+qpow(a,b,mod))%mod;}printf("%I64d\n",ans);}}