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



    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 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


    #include<iostream>
    #include<cstdio>
    using namespace std;
    
    int qumulti(int a,int b,int m){
        int ans;
        if(a==0&&b==0) return 0;
        a=a%m;
        ans=1;
        while(b>0){
            if(b&1)///判断是否为奇数,相当于 if(b%2==1)
                ans=(ans*a)%m;
            a=(a*a)%m;
            b=b>>1;///二进制向右移一位,相当于 b=b/2;
        }
        return ans;
    }
    
    int main(){
    	int a,b, m, T , n , ans;
    	scanf("%d",&T);
    	while(T--){
            ans = 0;
            scanf("%d%d",&m,&n);
            for(int i=0;i<n;i++){
               scanf("%d%d",&a,&b);
               ans=(ans+qumulti(a,b,m))%m;
            }
    		printf("%d
    ",ans);
    	}
    	return 0;
    }


  • 相关阅读:
    DNS 壓力測試
    2008IT技术精英年会数据库分论坛热点扫描
    DOS command
    说说大型高并发高负载网站的系统架构
    DNS Server &Bind的配置与使用
    IoC 容器和Dependency Injection 模式
    Inversion of Control Containers and the Dependency Injection pattern
    Windows 2003网络负载均衡的实现
    UVA 10369 Arctic Network
    UVA 10397 Connect the Campus
  • 原文地址:https://www.cnblogs.com/zswbky/p/5432176.html
Copyright © 2011-2022 走看看