• POJ 1995 Raising Modulo Numbers 【快速幂+同余定理】


    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 6579   Accepted: 3901

    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

    应用同余定理和快速幂求(A1B1+A2B2+ ... +AHBH)mod M.

     

    #include <stdio.h>
    __int64 pow(__int64 x, __int64 y, __int64 mod) {
        __int64 res = 1;
        __int64 base = x;
        while (y) {
            if (y&1) res = base*res%mod;
            base = base*base%mod;
            y >>= 1;
        }
        return res;
    }
    int main() {
        __int64 n, m, p;
        int t, s;
        scanf("%d", &t);
        while (t--) {
            scanf("%I64d", &p);
            scanf("%d", &s);
            int ans = 0;
            for (int i = 0; i < s; i++) {
                scanf("%I64d%I64d", &n, &m);
                ans += pow(n, m, p);
                ans %= p;
            }
            printf("%d
    ", ans);
        }
        return 0;
    }

     

     

    
    

     

  • 相关阅读:
    [转]Splay算法
    [转]模拟退火算法
    [转]九种背包问题
    [转]C++实现平衡二叉树
    关于set
    __builtin_popcount
    为什么调用线程的join方法,等待的是执行join方法的线程
    volatile and 指令重排序 (单例模式用volatile来声明单例对象)
    线程池
    sts 转用 IDEA随记
  • 原文地址:https://www.cnblogs.com/cniwoq/p/6770898.html
Copyright © 2020-2023  润新知