zoukankan      html  css  js  c++  java
  • POJ 1995 (快速幂) 求(A1B1+A2B2+ ... +AHBH)mod M

    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 

    (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

    结合律

    ((a+b) mod p + c)mod p = (a + (b+c) mod p) mod p

    ((a*b) mod p * c)mod p = (a * (b*c) mod p) mod p

    交换律

    (a + b) mod p = (b+a) mod p

    (a × b) mod p = (b × a) mod p

    分配律

    ((a +b)mod p × c) mod p = ((a × c) mod p + (b × c) mod p) mod p

    (a×b) mod c=(a mod c * b mod c) mod c

    (a+b) mod c=(a mod c+ b mod c) mod c

    (a-b) mod c=(a mod c- b mod c) mod c

     1 #include<cstdio>
     2 __int64 f(__int64 a,__int64 b,__int64 m)
     3 {
     4     __int64 sun=1;
     5     while(b)
     6     {
     7         if(b % 2 != 0)
     8         {
     9             sun=sun*a%m;
    10         }
    11         a=a*a%m;
    12         b/=2;
    13     }
    14         return sun%m;
    15 }
    16 int main()
    17 {
    18     int t,i;
    19     __int64 n,m,sum,a,b;
    20     scanf("%d",&t);
    21     while(t--)
    22     {
    23         sum=0;
    24         scanf("%I64d",&m);
    25         scanf("%I64d",&n);
    26         for(i = 0 ; i < n; i++)
    27         {
    28             scanf("%I64d %I64d",&a,&b);
    29             sum+=f(a,b,m);
    30     //        printf("---%d--
    ",f(a,b,m));
    31         }
    32         printf("%I64d
    ",sum%m);
    33     }
    34 }
    ——将来的你会感谢现在努力的自己。
  • 相关阅读:
    两元素交换(不借用第三个元素)
    魔兽系统
    员工打卡
    NET框架
    jQuery测试
    Android屏幕适配终结者
    android-auto-scroll-view-pager (无限广告轮播图)
    AndroidImageSlider(图片轮播控件)
    PagerSlidingTabStrip(viewPage滑动菜单)
    怎样把淘宝的数据转到拍拍上
  • 原文地址:https://www.cnblogs.com/yexiaozi/p/5698426.html
Copyright © 2011-2022 走看看