zoukankan      html  css  js  c++  java
  • Raising Modulo Numbers(POJ 1995 快速幂)

    Raising Modulo Numbers
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 5934   Accepted: 3461

    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  //Z
    16  //m
    4  //h
    2 3  h个a,b;
    3 4
    4 5
    5 6  //计算(A1B1+A2B2+ ... +AHBH)mod M.
    36123
    1
    2374859 3029382
    17
    1
    3 18132
    

    Sample Output

    2
    13195
    13
    快速幂模板题
     1 #include <iostream>
     2 #include <cstring>
     3 #include <algorithm>
     4 using namespace std;
     5 #define LL long long
     6 #define Max 45000+10
     7 LL a[Max],b[Max];
     8 int m,h;
     9 LL ans;
    10 int mod_pow(int num,int n)
    11 {
    12     num=num%m;
    13     LL res=1;
    14     while(n>0)
    15     {
    16         if(n&1)
    17             res=res*num%m;
    18         num=num*num%m;
    19         n>>=1;
    20     }
    21     return res;
    22 }
    23 int main()
    24 {
    25     int z;
    26     int i,j;
    27     freopen("in.txt","r",stdin);
    28     scanf("%d",&z);
    29     while(z--)
    30     {
    31         ans=0;
    32         scanf("%d%d",&m,&h);
    33     //    cout<<m<<" "<<h<<endl;
    34         for(i=0;i<h;i++)
    35             scanf("%lld%lld",&a[i],&b[i]);
    36         for(i=0;i<h;i++)
    37         {
    38             ans+=mod_pow(a[i],b[i]);
    39             ans=ans%m;
    40         }
    41         printf("%d
    ",ans%m);
    42     }
    43 }
  • 相关阅读:
    C语言预处理
    C语言结构体对齐
    C语言共用体、大小端、枚举
    C语言内存分配方法。
    C与指针(结构体指针,函数指针,数组指针,指针数组)定义与使用
    C语言中函数的传入值与传出值
    #define与typedef在重定义类型中的区别
    宏定义在位运算中的运用
    wait函数
    exit()与_exit()区别
  • 原文地址:https://www.cnblogs.com/a1225234/p/5193119.html
Copyright © 2011-2022 走看看