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 A[i] and B[i] 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 A[i]*B[i] 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.

输入格式

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 assignments follow. Each assignment begins with line containing an integer M (1≤M≤45000). The sum will be divided by this number. Next line contains the 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.

输出格式

For each assignment, there is only one line of output. On this line, there is a number, the result of the expression (A1B1+A2B2+...+AH*BH)modM.

输入样例:

3
16
4
2 3
3 4
4 5
5 6
36123
1
2374859 3029382
17
1
3 18132

输出样例:

2
13195
13

代码实现

#include <iostream>
using namespace std;

int z;
int qmi(int a, int b, int M) {
    int ans = 1
    while(b) {
        if(b & 1) ans = ans * 1ll * t
        t = t * 1ll * t
        b >>= 1;
    }
    return ans;
}
void solve() {
    int n, m, a, b, ans = 0;
    cin >> m >> n;
    while(n--) {
        cin >> a >> b;
        ans = (ans + qmi(a, b, m))
    }
    cout << ans << '\n';
}
int main () {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> z;
    while(z--) solve();
    return 0;
}

0 条评论

发表回复

Avatar placeholder

您的电子邮箱地址不会被公开。 必填项已用*标注

友情链接:Ctips' blog, Colza’s blog

站点状态:Status