zoukankan      html  css  js  c++  java
  • poj Raising Modulo Numbers 快速幂模板(取膜)

    Raising Modulo Numbers
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 8606   Accepted: 5253

    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 AiBi 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
    

    Source

    ----------------------------------------------------------------------------------------------------------
    题目大意:有n组数据,每组数据中有一个M和H个(Ai,Bi),求这H个AB的和 mod  M。
    快速幂裸题
     
     1 #include<stdio.h> 
     2 int read();
     3 int poww(int,int,int);
     4 int n;
     5 int main(){
     6     n=read();
     7     for(int i=1;i<=n;i++){
     8         int M=read(),H=read();
     9         int an=0;
    10         for(int j=1;j<=H;j++){
    11             int a=read(),b=read();
    12             an+=poww(a,b,M);
    13             an%=M;
    14         }
    15         printf("%d
    ",an);
    16     }
    17     return 0;
    18 }
    19 int poww(int a,int b,int M){
    20     int base=a%M,an=1;
    21     while(b){
    22         if(b&1) an=an%M*(base%=M);
    23         base=base%M*(base%M);
    24         b>>=1;
    25     }
    26     return an%M;
    27 }
    28 int read(){
    29     int ans=0,f=1;char c=getchar();
    30     while('0'>c||c>'9'){if(c=='-')f=-1;c=getchar();}
    31     while('0'<=c&&c<='9')ans=ans*10+c-48,c=getchar();return ans*f;
    32 }
    快速幂 取膜
  • 相关阅读:
    AOP面向切面编程
    java中与运算,或运算,异或运算,取反运算
    Java中replace和replaceall的区别
    Satisfying memory ordering requirements between partial reads and non-snoop accesses
    JS判断字符串中是否存在某个字符
    PHP 简介
    PHP 是什么
    mysql substr() 函数
    MySQL 数学函数
    MySQL 字符串截取SUBSTRING()函数
  • 原文地址:https://www.cnblogs.com/lpl-bys/p/7616527.html
Copyright © 2011-2022 走看看