poj 1995Raising Modulo Numbers
2016-04-19 10:23
309 查看
D - 快速幂
Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64u
Submit
Status
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
(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
注意==0的情况,,,wrong 了一次。。。。
代码:
Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64u
Submit
Status
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
(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
注意==0的情况,,,wrong 了一次。。。。
代码:
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; #define LL long long LL MON; LL n,t,k,s,tt; LL shu[20050]; LL pow2(LL xx,LL tt,LL k) { while (tt!=0) { if (tt%2) xx=(xx*k)%MON; k=(k*k)%MON; tt/=2; } return xx; } int main() { int T; scanf("%d",&T); while (T--) { scanf("%lld",&MON); memset(shu,0,sizeof(shu)); scanf("%lld",&n);s=0; for (int i=0;i<n;i++) { scanf("%lld%lld",&shu[i],&tt); if (shu[i]==0) shu[i]=0; else if (tt==0) shu[i]=1; else shu[i]=pow2(shu[i],tt-1,shu[i]); s=(s+shu[i])%MON; } //for (int i=0;i<n;i++) printf("%lld\n",s); } return 0; }
相关文章推荐
- 模拟器安装apk提示:INSTALL_FAILED_NO_MATCHING_ABIS
- MySQL实现批量检查表并进行repair与optimize的方法
- Linux 上使用 Gmail SMTP 服务器发送邮件通知
- FOJ 2216 The Longest Straight 第六届福建省大学生程序设计竞赛 E 尺取法乱搞
- 人工智能概述
- shrio 权限管理filterChainDefinitions过滤器配置
- 服务器中很多的CLOSE_WAIT
- 自定义控件三部曲之绘图篇(八)——Paint之ColorMatrix与滤镜效果
- URAL 2060 Subpalindrome Pairs Manacher
- 人工智能60年:纪念活动宣传什么?
- A failed job change
- MySQL实现批量检查表并进行repair与optimize的方法
- 对Run-Time Check Failure #3 - The variable 'a' is being used without being initialized.的处理以及理解
- CommandInvokationFailure: Failed to re-package resources. See the Console for details.
- Raid创建 LVM创建 扩展
- editor does not contain a main type的解决方案
- IBM Watson正致力于将AI和区…
- Smart Token Chain宣布…
- BlockChain:Internet问世以来最具…
- Blockai致力于使用区块链技术保护…