HPUOJ---2017寒假作业--专题-1/L-Raising Modulo Numbers(提高模数)
2017-02-21 21:03
316 查看
L - Raising Modulo Numbers
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 playersincluding 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. InputThe 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 thesame time.OutputFor each assingnement there is the only one line of output. On this line, there is a number, the result of expression (A1B1+A2<4000/sub>B2+ ... +AHBH)mod M.Sample Input3 16 4 2 3 3 4 4 5 5 6 36123 1 2374859 3029382 17 1 3 18132Sample Output
2 13195 13
思路:本题本质即为题目最后的式子,所以要用到快速幂和同余定理。
#include<cstdio>typedef long long LL;LL Quick_MI(LL a,LL b,LL c){int s=1;a=a%c;while(b){if(b&1){s=(s*a)%c;}a=(a*a)%c;b=b/2;}return s;//快速幂}int main(){int Z,H;long long M,A,B,c,sum,k;scanf("%d",&Z);while(Z--){sum=0;scanf("%lld%d",&M,&H);while(H--){scanf("%lld%lld",&A,&B);c=Quick_MI(A,B,M);sum=sum+c;}k=sum%M;printf("%lld\n",k);}return 0;}
相关文章推荐
- HPUOJ---2017寒假作业--专题-1/N-Rightmost Digit
- HPUOJ---2017寒假作业--专题0/J-悼念512汶川大地震遇难同胞——老人是真饿了
- HPUOJ---2017寒假训练--专题3/A-Til the Cows Come Home(最短路-dijkstra)
- HPUOJ--2017寒假作业-专题0/P-贪心
- HPUOJ---2017寒假作业--专题0/B-Bear and Three Balls
- HPUOJ--2017寒假作业专题0/I-SDOI
- HPUOJ--2017寒假作业-专题0/Q-Radar Installation
- HPUOJ---2017寒假作业--专题1/B-Wireless Network(并查集)
- HPUOJ---2017寒假作业--专题0/C-开门人和关门人
- HPUOJ---2017寒假作业--专题0/D-EXCEL排序
- HPUOJ---2017寒假作业--专题0/F-The MAX
- HPUOJ---2017寒假作业--专题0/G-Milk
- HPUOJ---2017寒假作业--专题0/H-What Is Your Grade(switch语句)
- HPUOJ---2017寒假作业--专题1/F-食物链
- HPUOJ---2017寒假作业--专题-1/M-人见人爱A^B
- HPUOJ---2017寒假作业--专题0/I-SDOI
- HPUOJ---2017寒假作业--专题-1/I-the Sum of Cube
- HPUOJ---2017寒假作业--专题-1/J-Key Set
- HPUOJ---2017寒假作业--专题-1/G-美素数
- HPUOJ---2017寒假作业--专题0/E-稳定排序