poj1995- 整数快速幂

2024-08-27 23:32

文章标签 快速整数 poj1995

本文主要是介绍poj1995- 整数快速幂，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

B - 整数快速幂

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

(A₁^B₁+A₂^B₂+ ... +A_H^B_H)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>
#include<iostream>
#include<math.h>
using namespace std;
long long quick_mod(long long a,long long b,long long m)//a^b%m
{long long ans=1;a%=m;while(b){if(b&1){ans=(ans*a)%m;b--;}b>>=1;a=(a*a)%m;}return ans;
}
int main()
{int k,n;long long a,b,m,count;scanf("%d",&n);while(n--){count=0;scanf("%lld",&m);scanf("%d",&k);for(int i=0;i<k;i++){scanf("%lld%lld",&a,&b);count+=quick_mod(a,b,m);}printf("%lld\n",count%m);}return 0;
}

快速幂模板：

long long multi(long long a,long long b,long long m)//a*b%m
{long long ret=0;while(b>0){if(b&1)ret=(ret+a)%m;b>>=1;a=(a<<1)%m;}return ret;
}
long long quick_mod(long long a,long long b,long long m)//a^b%m
{long long ans=1;a%=m;while(b){if(b&1){ans=multi(ans,a,m);//或者写成ans=(ans*a)%mb--;}b>>=1;a=multi(a,a,m);//或者写成a=(a*a)%m}return ans;
}

这篇关于poj1995- 整数快速幂的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！