Raising Modulo Numbers 解题报告
来源:互联网 发布:平板软件市场hd 编辑:程序博客网 时间:2024/05/01 14:15
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>int fun(int a,int b,int n) //快速取模模版,幂取模。{int t=1,y=a;while(b!=0){y%=n;if(b%2==1)t=t%n*y%n;y=y*y%n;b=b>>1;}return t;}int main(){int T,M,H,a,b;scanf("%d",&T);while(T--){scanf("%d%d",&M,&H);int test=0,i;for(i=0;i<H;i++){scanf("%d %d",&a,&b); test=(test+fun(a,b,M))%M;}printf("%d\n",test);}return 0;}
点击打开链接http://poj.org/problem?id=1995
- Raising Modulo Numbers 解题报告
- POJ-1995-Raising Modulo Numbers 解题报告
- POJ1995 Raising Modulo Numbers
- Raising Modulo Numbers
- Raising Modulo Numbers
- Raising Modulo Numbers
- Raising Modulo Numbers
- Raising Modulo Numbers
- Raising Modulo Numbers(数论)
- poj1995 Raising Modulo Numbers
- E - Raising Modulo Numbers
- 二分法-Raising Modulo Numbers
- POJ1995-Raising Modulo Numbers
- 【poj1995】Raising Modulo Numbers
- Raising Modulo Numbers
- Raising Modulo Numbers
- POJ1995 Raising Modulo Numbers
- Raising Modulo Numbers
- CronJob简介
- c++笔记17之句柄类
- ubuntu12.04虚拟机硬盘扩容
- 关于网站防SQL注入使用关键字过滤和SQL注入
- 根据浏览器的版本为网页应用不同的 CSS 样式表文件
- Raising Modulo Numbers 解题报告
- c#使用post,get请求网页
- poj 3126Prime Path
- 电商创新模式-食品类-LoveWithFood:每月送来一份惊喜的另类电商
- GridSplitter的使用
- Qt实现窗口自动隐藏
- Winfrom c# 两个ComboBox互相联动
- struts2 访问静态常量,静态方法
- linux下vim命令详解