POJ 1995 Raising Modulo Numbers (快速幂模板)

最新推荐文章于 2021-08-25 19:59:48 发布

原创最新推荐文章于 2021-08-25 19:59:48 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#POJ #快速幂

ACM 同时被 2 个专栏收录

635 篇文章

订阅专栏

数论

78 篇文章

订阅专栏

本文介绍了一个基于快速幂运算的游戏挑战，玩家需选择两个数并计算所有玩家选择的数的组合表达式除以给定数M的余数。文章提供了完整的C++实现代码，通过快速幂模板解决这一数学游戏。

Raising Modulo Numbers

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 4938		Accepted: 2864

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

Source

CTU Open 1999

题目链接：http://poj.org/problem?id=1995

题目大意：输入M和H组Ai，Bi，按公式求解

题目分析：快速幂模板

#include <cstdio>
#define ll long long
int modexp(ll a, ll b, ll m)
{
    ll ret = 1, tmp = a;
    while(b)
    {
        if(b & 1) 
          ret = ret * tmp % m;
        tmp = tmp * tmp % m;
        b >>= 1;
    }
    return ret;
}

int main()
{

    int T, m, h;
    ll a, b;
    scanf("%d", &T);
    while(T--)
    {
        ll ans = 0;
        scanf("%d %d", &m, &h);
        while(h--)
        {
            scanf("%I64d %I64d", &a, &b);
            ans = (ans + modexp(a, b, m)) % m;
        }
        printf("%I64d\n",ans);
    }
}