Pagini recente » Cod sursa (job #1777952) | Cod sursa (job #590803) | Cod sursa (job #815854) | Cod sursa (job #1745089) | Cod sursa (job #1777868)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("pinex.in");
ofstream fout("pinex.out");
ll M, A, B, fact[30];
void solve() {
ll t = 0, d = 2;
while (B > 1) {
if (B % d == 0) {
fact[++t] = d;
while (B % d == 0)
B /= d;
}
if (d > sqrt(B) && B > 1) {
fact[++t] = B;
B = 1;
}
if (d == 2) d++;
else d += 2;
}
ll sol = A;
for (int i = 1; i < (1 << t); i++) {
ll nr = 0, prod = 1;
for (int j = 0; j < t; j++)
if ((1 << j) & i) {
prod = 1LL * prod * fact[j + 1];
nr++;
}
if (nr % 2) nr = -1;
else nr = 1;
sol = sol + 1LL * nr * A / prod;
}
fout<<sol<<'\n';
}
int main() {
fin>>M;
for (int i = 1; i <= M; i++) {
fin>>A>>B;
solve();
}
return 0;
}