zoukankan      html  css  js  c++  java
  • POJ 1995

    Raising Modulo Numbers
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 4271   Accepted: 2433

    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

     
    快速幂
     
     1 #include <cstdio>
     2 #include <cstring>
     3 #include <algorithm>
     4 #include <iostream>
     5 
     6 using namespace std;
     7 
     8 typedef long long ll;
     9 
    10 int m;
    11 
    12 ll mod_pow(ll x,ll n) {
    13         ll res = 1;
    14         while(n) {
    15                 if(n & 1) res = res * x % m;
    16                 x = x * x % m;
    17                 n >>= 1;
    18         }
    19 
    20         return res;
    21 }
    22 int main() {
    23        // freopen("sw.in","r",stdin);
    24         int z;
    25         scanf("%d",&z);
    26 
    27         while(z--) {
    28                 int h;
    29                 scanf("%d%d",&m,&h);
    30 
    31                 ll ans = 0;
    32                 for(int i = 1; i <= h; i++) {
    33                         ll a,b;
    34                         scanf("%I64d%I64d",&a,&b);
    35                         ans = (ans + mod_pow(a,b)) % m;
    36                 }
    37 
    38                 printf("%I64d
    ",ans);
    39         }
    40 
    41         return 0;
    42 
    43 }
    View Code
  • 相关阅读:
    hash算法
    2020/9/30计算机硬件组成day3
    NIO与IO区别
    Collection.toArray()方法使用的坑&如何反转数组
    Arrays.asList()使用指南
    JDK8的LocalDateTime用法
    Linux 删除文件夹和文件的命令
    list集合为空或为null的区别
    easyExcel使用
    java Object 转换为 Long
  • 原文地址:https://www.cnblogs.com/hyxsolitude/p/3595723.html
Copyright © 2011-2022 走看看