【POJ 1995】Raising Modulo Numbers
来源:互联网 发布:数据锁进行并发控制 编辑:程序博客网 时间:2024/05/03 00:42
Raising Modulo Numbers
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>__int64 quickpow(__int64 i,__int64 j,int k){ __int64 sum=1,base=i; while(j) { if(j&1) { sum=sum*base%k; } base=(base%k*base%k)%k; j>>=1; } return sum;}int main(){ int i,z,m,h; __int64 a,b,cot=0; scanf("%d",&z); while(z--) { cot=0; scanf("%d%d",&m,&h); for(i=0;i<h;i++) { scanf("%I64d%I64d",&a,&b); if(a) { cot+=quickpow(a,b,m); } } printf("%I64d\n",cot%m); } return 0;}
- POJ 1995 Raising Modulo Numbers
- poj 1995 Raising Modulo Numbers
- POJ-1995-Raising Modulo Numbers
- POJ - 1995 Raising Modulo Numbers
- poj 1995 Raising Modulo Numbers
- POJ 1995 Raising Modulo Numbers
- POJ--1995--Raising Modulo Numbers
- POJ-1995 Raising Modulo Numbers
- POJ 1995 Raising Modulo Numbers
- poj 1995Raising Modulo Numbers
- POJ 1995 Raising Modulo Numbers
- POJ 1995 Raising Modulo Numbers
- POJ -1995 Raising Modulo Numbers
- Raising Modulo Numbers poj 1995
- POJ-1995 Raising Modulo Numbers
- poj 1995 Raising Modulo Numbers
- POJ 1995 Raising Modulo Numbers
- POJ - 1995 Raising Modulo Numbers
- 【杭电2052】Picture
- 深入掌握java-敏捷开发
- shell写俄罗斯方块二
- N皇后问题
- ptrace的使用举例
- 【POJ 1995】Raising Modulo Numbers
- 两片STM32之间I2C通信
- 五大常用算法 ----DP 动态规划(Dynamic Programming)
- android之ImageView+Gallery组件的应用
- LeetCode--77_Combinations
- 7.26 JAVA关于工具类、重载重写以及抽象类接口的小记
- python 学习(三)变量类型
- 2016年全面前端面试题总结
- DFS及其应用 专题