POJ1995
来源:互联网 发布:淘宝首页轮播图多大 编辑:程序博客网 时间:2024/06/05 07:08
Raising Modulo Numbers
Time Limit: 1000MS
Memory Limit: 30000KTotal Submissions: 6486
Accepted: 3827
Memory Limit: 30000KTotal Submissions: 6486
Accepted: 3827
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.
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
31642 33 44 55 63612312374859 30293821713 18132
Sample Output
21319513
快速幂,取模,注意取模规则。
#include<cmath>#include<iostream>#include<cstdio>#include<algorithm>#include<cstdlib>using namespace std;typedef long long LL;LL qp(LL n,LL k,LL mod){ if(!k) return 1; int tmp=qp(n,k/2,mod); if(k&1) return (tmp*tmp%mod)*n%mod; return tmp*tmp%mod;}int main(){ int T; int M,n; int i; scanf("%d",&T); //cout<<T<<endl; while(T--) { scanf("%d",&M); scanf("%d",&n); int a[n],b[n]; for(i=0;i<n;i++) scanf("%d%d",&a[i],&b[i]); long long ans=0; for(i=0;i<n;i++) ans+=qp(a[i],b[i],M); printf("%d\n",ans%M); }return 0;}
0 0
- POJ1995
- poj1995
- poj1995
- poj1995
- poj1995
- POJ1995
- poj1995
- POJ1995 Raising Modulo Numbers
- 快速幂-poj1995
- poj1995- 整数快速幂
- poj1995~快速幂水题
- POJ1995 快速幂模版
- poj1995 Raising Modulo Numbers
- POJ1995 快速幂取模
- POJ1995-Raising Modulo Numbers
- 【poj1995】Raising Modulo Numbers
- POJ1995 Raising Modulo Numbers
- poj1995简单快速幂
- 硬币找零(完全背包)
- FFmpeg应用程序的使用
- 冒泡排序
- dp整数划分问题——03:复杂的整数划分问题
- TIANKENG’s restaurant hd 4883
- POJ1995
- codrecorces B. Far Relative’s Problem
- jsp七大动作指令
- POJ-1328 Radar Installation
- hdu 5723(最小生成树)
- redis扩展
- 循环队列
- 定义一个员工类,自己分析出几个成员,
- ios 加急审核