-
Notifications
You must be signed in to change notification settings - Fork 0
/
107D.cpp
84 lines (79 loc) · 1.71 KB
/
107D.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
/* Ankit Srivastava */
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define FF first
#define SS second
#define s(n) scanf("%d",&n)
#define sl(n) scanf("%lld",&n)
#define sf(n) scanf("%lf",&n)
#define ss(n) scanf("%s",n)
#define sc(n) {char temp[4]; ss(temp); n=temp[0];}
#define INF (int)1e9
#define LINF (long long)1e18
#define EPS 1e-9
#define maX(a,b) ((a)>(b)?(a):(b))
#define miN(a,b) ((a)<(b)?(a):(b))
#define abS(x) ((x)<0?-(x):(x))
typedef long long ll;
typedef unsigned long long LL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<int,PII> TRI;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<ll> vl;
typedef vector<PII> VII;
typedef vector<TRI> VT;
ll n;
void precompute() {
}
void read() {
sl(n);
}
void preprocess() {
}
void solve() {
ll pr[50];
int cnt = 0;
ll ln = n;
for (int i = 2; i <= n / i; ++i) {
if(n % i == 0) {
int p = 0;
while(n % i == 0) {
n /= i;
p++;
}
if(p > 2) {
printf("1\n%d\n", i * i);
return;
}
else {
while(p > 0) {
pr[cnt++] = i;
p --;
}
}
}
if(cnt >= 3) {
printf("1\n%lld\n", pr[0] * pr[1]);
return;
}
}
if(ln == n) puts("1\n0");
else {
if(n > 1) {
if(cnt == 2) printf("1\n%lld\n", pr[0] * pr[1]);
else puts("2");
} else puts("2");
}
}
int main() {
precompute();
read();
preprocess();
solve();
return 0;
}