zoukankan      html  css  js  c++  java
  • POJ1995 Raising Modulo Numbers

    Raising Modulo Numbers
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 6373   Accepted: 3760

    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. 

    上面的可以不用看。算output里面的那个式子就行。
     

    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

    快速幂裸题,暴力算的话会TLE。

     1 //快速幂 
     2 #include<algorithm>
     3 #include<iostream>
     4 #include<cstdio>
     5 #include<cstring>
     6 #include<cmath>
     7 using namespace std;
     8 int Z,M;
     9 int n;
    10 int sum;
    11 int a,b;
    12 int ksm(int a,int b){
    13     int now=a%M;
    14     int res=1;
    15     while(b){
    16         if(b&1)res=res*now%M;
    17         now=now*now%M;
    18         b>>=1;
    19     }
    20     return res;
    21 }
    22 int main(){
    23     scanf("%d",&Z);
    24     while(Z--){
    25         sum=0;
    26         scanf("%d",&M);
    27         scanf("%d",&n);
    28         int i,j;
    29         for(i=1;i<=n;i++){
    30             scanf("%d%d",&a,&b);
    31             sum=(sum+ksm(a,b))%M;//累加 
    32         }
    33         printf("%d
    ",sum);
    34     }
    35     return 0;
    36 }
  • 相关阅读:
    基站选址(编程之美2015资格赛)
    2月29日(编程之美2015资格赛)
    跳马
    电子老鼠闯迷宫
    解决按钮重复提交 unbind+bind+setTimeout
    XMLHttpRequest 中 blob类型数据转text
    ExtJs之列表(grid)
    ExtJs之组件(window)
    ExtJs基础
    问题与成长
  • 原文地址:https://www.cnblogs.com/SilverNebula/p/5638779.html
Copyright © 2011-2022 走看看