1. input :N n m P
求ΣΣA[gcd(i, j)], 1 <= i <= n, 1 <= j <= m
A[1] =P
A[x]=(A[x-1]+153)%P
A数组的长度为N
在考试的时候AP:90%,代码如下:
#include <iostream>
#include <vector>
using std::cout;
using std::cin;
using std::endl;
long long gcd(long long a, long long b)
{
return b == 0 ? a : gcd(b, a%b);
}
int main()
{
long long N, n, m, P;
int input[4] = { 0 };
for (int i = 0; i < 4; i++)
{
cin >> input[i];
}
N = input[0];
n = input[1];
m = input[2];
P = input[3];