-
Notifications
You must be signed in to change notification settings - Fork 12
/
1220-Mysterious_Bacteria.cpp
82 lines (58 loc) · 1.03 KB
/
1220-Mysterious_Bacteria.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
#include <bits/stdc++.h>
#define ll long long
#define MAX 100100
using namespace std;
ll arr[100100];
vector <ll> primes;
ll big = pow(2, 33);
ll bigi = -big;
map <ll, ll> mp;
void sieve()
{
ll i, j;
for (i = 2; i < 100100; i++) {
if (arr[i] == 0) {
primes.push_back(i);
for (j = i ; j < 100100; j *= i) {
arr[j] = 1;
}
}
}
//cout << big << endl;
for (i = 0; i < primes.size(); i++) {
ll elem = primes[i];
ll base = elem;
ll pwr = 1;
while (elem <= big) {
mp[elem] = pwr;
if (pwr % 2)
mp[-elem] = pwr;
ll loc = pwr;
while (loc % 2 == 0) {
loc /= 2;
}
mp[-elem] = loc;
elem *= base;
pwr++;
}
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("/home/sameer/Documents/sameer/input.sam", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
ll i, j, k, n, m, t, cont, a, b;
sieve();
cin >> t;
ll cases = t;
while (t--) {
cin >> n ;
ll ans = 1;
if (mp.find(n) != mp.end())
ans = mp[n];
cout << "Case " << cases - t << ": " << ans << endl;
}
return 0;
}