POJ
来源:互联网 发布:美视软件 编辑:程序博客网 时间:2024/06/06 00:56
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.
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.
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.
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.
31642 33 44 55 63612312374859 30293821713 18132
21319513
代码:
#include<iostream>#include<string>#include<cstdio>#include<algorithm>#include<cmath>#include<iomanip>#include<queue>#include<cstring>#include<map>using namespace std;typedef long long ll;ll pow_mod(ll n,ll k,ll m) //快速幂求(n^p)%m的值{ ll res=1; while(k>0) { if(k&1) res=res*n%m; n=n*n%m; k>>=1; } return res;}int main(){ int Z,M,H,A,B; scanf("%d",&Z); while(Z--) { scanf("%d",&M); scanf("%d",&H); int ans=0; while(H--) { scanf("%d%d",&A,&B); ans=(ans+pow_mod(A,B,M))%M; } printf("%d\n",ans); } return 0;}
阅读全文
0 0
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- POJ
- poj
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- ES6新的数据类型set
- Based on MT5 Gateway API Quotes and Trading Liquidity
- Pro C 7, 8th Edition.pdf 英文原版 免费下载
- 悼念512汶川大地震遇难同胞——珍惜现在,感恩生活
- DispatcherServlet
- POJ
- 2017-11-24
- Spring Boot热部署之springloader
- qt creator程序生成dump
- Zabbix Network Monitoring, Second Edition.pdf 英文原版 免费下载
- 网络加载
- hdu_2013 蟠桃记
- dubbo源码在Windows下编译打包dubbo-admin-xxx.war
- Linux下yum安装MySQL yum安装MySQL指定版本