-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprimeLand_UVA516OJ.cpp
113 lines (98 loc) · 2.16 KB
/
primeLand_UVA516OJ.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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#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;
struct prime
{
long long a;
long long k;
};
long long _pow(long long a, long long k)
{
long long ans = 1;
for (long long c = 1; c <= k; ++c)
{
ans *= a;
}
return ans;
}
int main()
{
ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
while (true)
{
string in = "";
getline(cin, in);
if (in == "0" || in == "") break;
if (in == "2 3")
{
cout << "";
}
long long size0 = in.size(), last = -1, n = 1;
string temp0 = "";
for (long long i = 0; i <= size0 - 1; ++i)
{
if (in[i] == ' ')
{
if (last == -1)
{
last = stoi(temp0);
}
else
{
n *= _pow(last, stoi(temp0));
last = -1;
}
temp0 = "";
}
else
{
temp0 += in[i];
}
}
n *= _pow(last, stoi(temp0));
--n;
vector<prime> ans;
for (long long i = 2; i * i <= n; i += 2)
{
long long c = 0;
while (n % i == 0)
{
++c;
n /= i;
}
if (c > 0)
{
prime temp1{i, c};
ans.push_back(temp1);
}
if (i == 2)
{
i = 1;
}
}
if (n > 1)
{
prime temp1{n, 1};
ans.push_back(temp1);
}
long long size1 = ans.size();
for (long long i = size1 - 1; i >= 0; --i)
{
if (i < size1 - 1) cout << ' ';
cout << ans[i].a << ' ' << ans[i].k;
}
cout << '\n';
}
cout.flush();
return 0;
}