zoukankan      html  css  js  c++  java
  • B

    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
    
    题目大意:给一个M, 再给一个n表示接下来有n组数据(a,b) 计算a的b次幂,在将这n组数据加在一起。 然后对M求余。
    快速幂求余,a^b%m=[(a%m)^b]%m
    同余定理 (a+b+c...)%m=(a%m+b%m+c%m...)%m
    AC代码:
    #include<iostream>
    #include<cstdio>
    using namespace std;
    typedef long long ll;
    ll m;//
    int pow(ll x,ll y)
    {
        ll res=1;
        while(y)
        {
            if(y&1)
                res=res*x%m;
            x=x*x%m;
            y>>=1;
        }
        return res%m;//(a+b+c...)%m=(a%m+b%m+c%m..)%m
     } 
    
    
    int main()
    {
        int t;
        scanf("%d",&t);
        while(t--)
        {
            ll c;
            scanf("%lld %lld",&m,&c);
            ll a,b,sum=0;
            for(int i=0;i<c;i++)
            {
                scanf("%lld %lld",&a,&b);
                sum+=pow(a,b);
            }
            printf("%lld
    ",sum%m);
            
         }
        return 0;
     } 








  • 相关阅读:
    目前阻碍大数据成功的常见问题有哪些
    YII2 的授权(Authorization)
    CCBPM工作流引擎的消息机制与设计
    日志框架实现实时改动,实时生效,详细框架思路(2)
    manacher hihoCoder1032 最长回文子串
    C#.NEt-GDI+中的Pen測试
    Unity3D游戏开发最佳实践20技巧(一)
    Android init.rc文件浅析
    OBIEE开发手冊
    Android Jni层 创建 linux socket 出错问题解决
  • 原文地址:https://www.cnblogs.com/Accepting/p/11215988.html
Copyright © 2011-2022 走看看