-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbenefit_UVA11889.cpp
70 lines (59 loc) · 1.29 KB
/
benefit_UVA11889.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
ifstream fin("benefit_UVA11889.in");
ofstream fout("benefit_UVA11889.out");
int main()
{
int T; fin >> T;
for (int t = 1; t <= T; ++t)
{
long long a, c; fin >> a >> c;
if (c % a != 0)
{
fout << "NO SOLUTION\n";
continue;
}
long long ans = 1;
for (int i = 2; i * i <= c; i += 2)
{
bool flag = false;
int _count = 0;
while (a % i == 0)
{
a /= i;
c /= i;
++_count;
}
while (c % i == 0)
{
c /= i;
ans *= i;
flag = true;
}
for (int c = 1; c <= _count && flag == true; ++c)
{
ans *= i;
}
if (i == 2)
{
i = 1;
}
}
if (c > 1 && a == 1)
{
ans *= c;
}
fout << ans << '\n';
}
return 0;
}