zoukankan      html  css  js  c++  java
  • Day7

    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 Ai Bi 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
    思路:题目一大串,有用的就是output(, 裸的欧拉降幂,直接打表求欧拉函数直接算即可(扩展欧拉)
    typedef long long LL;
    typedef pair<LL, LL> PLL;
    
    const int maxm = 45005;
    
    int phi[maxm];
    
    void getEuler() {
        phi[1] = 1;
        for(int i = 2; i < maxm; ++i) {
            if(!phi[i]) {
                for(int j = i; j < maxm; j += i) {
                    if(!phi[j]) phi[j] = j;
                    phi[j] = phi[j] / i * (i - 1);
                }
            }
        }
    }
    
    LL quick_pow(LL a, LL b, LL p) {  //a^b(modp)
        LL ret = 1;
        while(b) {
            if(b&1) ret = (ret * a) % p;
            a = (a * a) % p;
            b >>= 1;
        }
        return ret;
    }
    
    int main() {
        int T, H;
        getEuler();
        LL MOD, A, B;
        scanf("%d", &T);
        while(T--) {
            scanf("%lld", &MOD);
            LL ans = 0;
            scanf("%d", &H);
            for(int i = 0; i < H; ++i) {
                scanf("%lld%lld", &A, &B);
                if(B < phi[MOD])
                    ans =  (ans + quick_pow(A, B, MOD)) % MOD;
                else
                    ans = (ans + quick_pow(A, B%phi[MOD]+phi[MOD], MOD)) % MOD;
            }
            printf("%lld
    ", ans);
        }
        return 0;
    }
    View Code
  • 相关阅读:
    mysqllimit优化
    PLSQL Developer设置及快捷键设置
    Oracle建库、建表空间,建用户
    oracle分页语句
    oracle110个常用函数
    用二进制进行权限管理
    Tomcat6优化
    Silverlight 动态创建Xaml
    使用asp.net 2.0中的SqlBulkCopy类批量复制数据
    Jquery 插件开发
  • 原文地址:https://www.cnblogs.com/GRedComeT/p/12222526.html
Copyright © 2011-2022 走看看