POJ 1995 Raising Modulo Numbers 整数快速幂

最新推荐文章于 2023-11-11 11:25:23 发布

ACBOY、

最新推荐文章于 2023-11-11 11:25:23 发布

阅读量798

点赞数

CC 4.0 BY-SA版权

分类专栏：数学

本文链接：https://blog.youkuaiyun.com/crescent__moon/article/details/19245509

数学专栏收录该内容

153 篇文章

订阅专栏

本文探讨了一种复杂的数学游戏编程解决方案，包括输入解析、快速幂运算和模运算等核心算法，旨在帮助玩家理解并实现游戏逻辑。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

点击打开链接

Raising Modulo Numbers

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 4233		Accepted: 2411

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

给你A,B,M，让你求A^B%M的值。

#include<stdio.h>
long long quick_mod(long long a,long long b,long long m)
{
    long long ans=1;
    while(b)
    {
        if(b&1){ans=(ans*a)%m;b--;}
        b/=2;
        a=a*a%m;
    }
    return ans;
}
int main()
{
    int t,cas;
    long long a,b,c,ans;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lld%d",&c,&cas);
        ans=0;
        for(int i=0;i<cas;i++)
        {
            scanf("%lld%lld",&a,&b);
            ans=(ans+quick_mod(a,b,c))%c;
        }
        printf("%lld\n",ans%c);
    }
    return 0;
}