text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
const long long OO = (long long)1e9 + 7;
using namespace std;
long long inv(long long a, long long b) {
return 1 < a ? b - inv(b % a, a) * b / a : 1;
}
long long Pow(long long B, long long P) {
long long R = 1;
while (P > 0) {
if (P & 1) R = (R * B);
P /= 2;
B = (B * B);
}
return R;
}
long long GCD(long long a, long long b) {
while (b) {
b ^= a ^= b ^= a %= b;
}
return a;
}
long long LCM(long long a, long long b) { return (a / GCD(a, b) * b); }
long long BigMod(long long B, long long P, long long M) {
long long R = 1;
while (P > 0) {
if (P & 1) {
R = (R * B) % M;
}
P /= 2;
B = (B * B) % M;
}
return (long long)R;
}
vector<long long> primes;
void factorization(long long n) {
for (long long i = 2; i * i <= n; ++i)
while (n % i == 0) primes.push_back(i), n /= i;
if (n > 1) primes.push_back(n);
}
int main() {
ios::sync_with_stdio(0);
long long n;
cin >> n;
factorization(n);
if (primes.size() == 2) {
cout << 2;
} else {
if (n == 1 || primes.size() == 1) {
cout << "1\n0";
} else {
cout << 1 << endl;
cout << primes[0] * primes[1];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isprime(long long N) {
if (N == 1) return 1;
for (long long i = 2; i * i <= N; i++) {
if (N % i == 0) return 0;
}
return 1;
}
int main() {
long long N;
cin >> N;
if (isprime(N)) {
printf("1\n0\n");
return 0;
}
long long Nval = N;
long long cnt = 0;
long long myprime1 = -1;
long long myprime2 = -1;
for (long long i = 2; i * i <= N; i++) {
while (N != 1 && N % i == 0) {
N = N / i;
cnt++;
if (myprime1 == -1)
myprime1 = i;
else
myprime2 = i;
}
}
if (N != 1) {
cnt++;
myprime1 = N;
}
if (cnt >= 3) {
cout << 1 << endl << myprime1 * myprime2 << endl;
return 0;
} else {
cout << 2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long k, b[100009], x, n, i, l, a[100009], j;
int main() {
cin >> n;
for (i = 2; i * i <= n; i++)
if (n % i == 0) {
a[l] = i;
for (j = 0; n % i == 0; j++) n /= i;
b[l++] = j;
k += j;
}
if (n > 1) {
a[l] = n;
b[l++] = 1;
k++;
}
if (k == 1) {
cout << "1\n0";
return 0;
}
if (k == 2) {
cout << "2";
return 0;
}
cout << "1\n";
x = a[0];
b[0]--;
if (b[0] > 0)
x *= a[0];
else
x *= a[1];
cout << x;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > decomposition(long long int n) {
vector<pair<int, int> > factors;
for (long long int i = 2; i * i <= n; i++)
if (n % i == 0) {
int t = 0;
while (n % i == 0) {
n /= i;
t++;
}
factors.push_back(pair<int, int>(i, t));
}
if (n != 1) factors.push_back(pair<int, int>(n, 1));
return factors;
}
int main() {
long long int n;
cin >> n;
vector<pair<int, int> > factors = decomposition(n);
int s = factors.size();
if (s == 0 || (s == 1 && factors[0].second == 1))
cout << 1 << endl << 0 << endl;
else if ((s == 1 && factors[0].second == 2) ||
(s == 2 && factors[0].second == 1 && factors[1].second == 1))
cout << 2 << endl;
else
cout << 1 << endl
<< ((factors[0].second == 1) ? factors[0].first * factors[1].first
: factors[0].first * factors[0].first)
<< endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isComposite(long long num) {
for (long long i = 2; i * i <= num; i++)
if (num % i == 0) return true;
return false;
}
int main() {
long long prime1 = -1, prime2 = -1, q;
cin >> q;
if (q == 1 || !isComposite(q)) {
cout << "1\n0\n";
return 0;
}
long long cnt = 0;
for (long long i = 2; i * i <= q; i++) {
while (q != 1 && q % i == 0) {
cnt++;
q /= i;
if (prime1 == -1)
prime1 = i;
else if (prime2 == -1)
prime2 = i;
}
}
if (q != 1) {
cnt++;
if (prime2 == -1) prime2 = q;
}
if (cnt >= 3)
cout << "1\n" << prime1 * prime2 << "\n";
else
cout << "2\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long q;
int main() {
scanf("%lld", &q);
long long x = q;
int cnt = 0;
long long num = 1;
for (long long i = 2; q > 1;) {
while (q % i == 0) {
q /= i;
if (cnt < 2) num *= i;
cnt++;
}
i++;
if (i * i > q) i = q;
}
if (cnt == 0 || cnt == 1) {
printf("1\n0\n");
} else if (cnt > 2) {
printf("%d\n%lld\n", 1, num);
} else {
printf("2\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long q;
cin >> q;
long long temp = q;
long long count = 0;
long long ans = 1;
for (long long i = 2; i <= sqrt(q); i++) {
while (temp % i == 0 && count != 2) {
temp /= i;
count++;
ans *= i;
}
if (count == 2) break;
}
if (temp == q) {
cout << 1 << endl << 0;
return 0;
}
if (ans == q && count == 2) {
cout << 2 << endl;
return 0;
}
if (count == 2) {
cout << 1 << endl << ans;
return 0;
}
if (count == 1 && temp != q) {
cout << 2 << endl;
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
long long prime_factor(long long n) {
long long i, c;
c = 0;
while (n % 2 == 0) {
n = n / 2;
c++;
v.push_back(2);
}
for (i = 3; i <= sqrt(n); i += 2) {
while (n % i == 0) {
n = n / i;
c++;
v.push_back(i);
}
}
if (n > 2) c++;
return c;
}
int main() {
long long n, cnt;
cin >> n;
cnt = prime_factor(n);
if (cnt > 2) {
cout << "1" << endl;
cout << v[0] * v[1] << endl;
} else if (cnt == 2)
cout << "2" << endl;
else {
cout << "1" << endl;
cout << "0" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool prost(long long a) {
for (register int i = 2; i <= sqrt(a); ++i) {
if (!(a % i)) {
return false;
}
}
return true;
}
long long del(long long q) {
long long a = 1, max = -5, b;
for (register long long i = 2; i <= sqrt(q); ++i) {
if (!(q % i)) {
if (prost(i)) {
if (i != q / i && i * a != q) {
if (a == 1) {
a = i;
} else {
return a * i;
}
} else {
return -5;
}
} else if (sqrt(i) * sqrt(i) == i) {
return i;
}
b = sqrt(q / i);
if (b * b == q / i) {
if (max < 0) {
max = q / i;
} else {
if (max > q / i) {
max = q / i;
}
}
}
}
}
if (a == 1) {
return 0;
}
return max;
}
int main(int argc, char *argv[]) {
long long q;
cin >> q;
long long a = del(q);
if (a >= 0) {
cout << 1 << endl;
cout << a;
} else {
cout << 2;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
void CI(int &_x) { scanf("%d", &_x); }
void CO(int &_x) { cout << _x; }
template <typename T>
void getarray(T a[], int n) {
for (int i = 0; i < n; i++) cin >> a[i];
}
template <typename T>
void printarray(T a[], int n) {
for (int i = 0; i < n - 1; i++) cout << a[i] << " ";
cout << a[n - 1] << endl;
}
const double EPS = 1e-9;
const int INF = 0x7f7f7f7f;
int dr8[8] = {1, -1, 0, 0, 1, -1, -1, 1};
int dc8[8] = {0, 0, -1, 1, 1, 1, -1, -1};
int dr4[4] = {0, 0, 1, -1};
int dc4[4] = {-1, 1, 0, 0};
int kn8r[8] = {1, 2, 2, 1, -1, -2, -2, -1};
int kn8c[8] = {2, 1, -1, -2, -2, -1, 1, 2};
int main() {
long long int num, kount = 0, first = -1, second = -1;
cin >> num;
if (num == 1) {
cout << 1 << "\n" << 0 << "\n";
return 0;
}
for (long long int i = 2; i * i <= num; i++) {
while (num % i == 0) {
num = num / i;
kount++;
if (first == -1)
first = i;
else if (first != -1)
second = i;
}
}
if (num > 1) {
kount++;
if (first == -1)
first = num;
else if (first != -1)
second = num;
}
if (kount == 2) {
cout << 2 << "\n";
} else {
cout << 1 << "\n";
if (first * second < 0)
cout << "0\n";
else
cout << first * second << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long n, i, j, x = 0, y = 0, k;
i = 2;
cin >> n;
j = sqrt(n);
k = n;
for (i = 2; i <= j; i++) {
if (n % i == 0) {
x = i;
n = n / i;
break;
}
}
if (x == 0) {
printf("1\n0");
} else {
j = sqrt(n);
for (i = x; i <= j; i++) {
if (n % i == 0) {
y = i;
break;
}
}
if (y == 0) {
printf("2");
} else {
printf("1\n");
cout << x * y;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXP = 10000000;
int prime[MAXP];
bool is_prime[MAXP];
void prime_list() {
memset(is_prime, true, sizeof(is_prime));
for (int i = 2; i <= MAXP; i++) {
if (is_prime[i]) prime[++prime[0]] = i;
for (int j = 1, k; (j <= prime[0]) && (k = i * prime[j]) <= MAXP; j++) {
is_prime[k] = false;
if (i % prime[j] == 0) break;
}
}
}
int cnt[MAXP];
int main() {
prime_list();
long long n;
cin >> n;
if (n == 1) {
cout << 1 << endl << 0 << endl;
return 0;
}
for (int i = 1; i <= prime[0]; ++i) {
while (n % prime[i] == 0) {
++cnt[i];
n /= prime[i];
}
}
if (n > 1) cnt[0]++;
int sum = 0;
for (int i = 1; i <= prime[0]; ++i) {
sum += cnt[i];
}
sum += cnt[0];
long long ans = 1;
if (sum == 2)
cout << 2 << endl;
else {
cout << 1 << endl;
if (sum == 1)
cout << 0 << endl;
else {
int x = 0;
bool ok = 0;
for (int i = 1; i <= prime[0]; ++i) {
while (cnt[i] >= 1) {
x++;
cnt[i]--;
ans *= prime[i];
if (x >= 2) {
ok = 1;
break;
}
}
if (ok) break;
}
cout << ans << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long int, int> m;
bool isPrime(long long int a) {
for (long long int i = 2; i * i <= a; i++)
if (a % i == 0) return false;
return true;
}
int f(long long int a, long long int &move) {
auto it = m.find(a);
if (it == m.end()) {
if (isPrime(a)) return m[a] = 0;
for (long long int i = 2; i * i <= a; i++) {
if (a % i == 0) {
if (f(i, move) == 1) {
move = i;
return m[a] = 0;
}
if (f(a / i, move) == 1) {
move = a / i;
return m[a] = 0;
}
}
}
return m[a] = 1;
}
return it->second;
}
int main() {
long long int n, r = 0;
cin >> n;
if (f(n, r) == 0) {
cout << 1 << endl << r;
} else {
cout << 2;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> primes;
if (n == 1) {
cout << 1 << endl << 0;
return 0;
}
while (n % 2 == 0) {
primes.push_back(2);
n = n / 2;
}
for (int i = 3; i <= sqrt(n); i += 2) {
while (n % i == 0) {
primes.push_back(i);
n = n / i;
}
}
if (n > 2) primes.push_back(n);
if (primes.size() == 1) {
cout << 1 << endl << 0;
} else {
if (primes.size() == 2) {
cout << 2 << endl;
} else {
cout << 1 << endl << primes[0] * primes[1] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isprime(long long N) {
if (N == 1) return 1;
for (long long i = 2; i * i <= N; i++) {
if (N % i == 0) return 0;
}
return 1;
}
int main() {
long long N;
cin >> N;
if (isprime(N)) {
printf("1\n0\n");
return 0;
}
long long Nval = N;
long long cnt = 0;
long long myprime1 = -1;
long long myprime2 = -1;
for (long long i = 2; i * i <= N; i++) {
while (N != 1 && N % i == 0) {
N = N / i;
cnt++;
if (myprime1 == -1)
myprime1 = i;
else
myprime2 = i;
}
}
if (N != 1) {
cnt++;
if (myprime2 == -1) myprime2 = N;
}
if (cnt >= 3) {
cout << 1 << endl << myprime1 * myprime2 << endl;
return 0;
} else {
cout << 2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char f[3200001];
int p[1000000];
int main() {
int m, i, np = 0, k;
long long n, j;
for (i = 2; i <= 3200000; i++)
if (!f[i]) {
p[np++] = i;
for (j = i * (long long)i; j <= 3200000; j += i) f[j] = 1;
}
scanf("%I64d", &n);
vector<pair<long long, int> > fa;
int t = 0;
for (i = 0; (long long)p[i] * p[i] <= n; i++) {
int c = 0;
while (n % p[i] == 0) {
n /= p[i];
c++;
}
if (c) fa.push_back(make_pair(p[i], c));
t += c;
}
if (n > 1) {
fa.push_back(make_pair(n, 1));
t++;
}
if (t <= 1)
printf("1\n0\n");
else if (t == 2) {
printf("2\n");
} else if (fa.size() == 1) {
printf("1\n%d\n", fa[0].first * fa[0].first);
} else {
printf("1\n%I64d\n", fa[0].first * fa[1].first);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void RD(int &x) { scanf("%d", &x); }
void RD(long long &x) { scanf("%I64d", &x); }
void RD(double &x) { scanf("%lf", &x); }
void RD(int &x, int &y) { scanf("%d%d", &x, &y); }
void RD(long long &x, long long &y) { scanf("%I64d%I64d", &x, &y); }
void RD(double &x, double &y) { scanf("%lf%lf", &x, &y); }
void RD(char *s) { scanf("%s", s); }
void RD(char &s) { scanf("%c", &s); }
void RD(string &s) { cin >> s; }
void PR(int x) { printf("%d\n", x); }
void PR(int x, int y) { printf("%d %d\n", x, y); }
void PR(long long x) { printf("%I64d\n", x); }
void PR(char x) { printf("%c\n", x); }
void PR(char *x) { printf("%s\n", x); }
void PR(string x) { cout << x << endl; }
const long long inf = 1;
const long long mod = 1LL;
long long solve(long long n) {
long long i;
for (i = 2; i * i < n; i++) {
if (n % i == 0) {
return solve(i);
}
}
if (i * i == n) return solve(i);
return n;
}
int main() {
long long q, i;
vector<long long> v;
while (scanf("%I64d", &q) == 1) {
(v.clear());
for (i = 2; i * i < q; i++) {
if (q % i == 0) {
v.push_back(solve(i));
v.push_back(solve(q / i));
break;
}
}
if (i * i == q) {
v.push_back(solve(i));
v.push_back(solve(i));
}
if ((int)v.size() == 0)
printf("1\n0\n");
else if (v[0] * v[1] < q)
printf("1\n%I64d\n", v[0] * v[1]);
else
printf("2\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> v;
int main() {
cin >> n;
if (n == 1) {
cout << "1" << endl << "0";
return 0;
}
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
v.push_back(i);
n /= i;
}
if (v.size() > 2) break;
}
if (n > 1) v.push_back(n);
if (v.size() == 1)
cout << "1" << endl << "0";
else if (v.size() == 2)
cout << "2";
else {
cout << "1" << endl;
cout << v[0] * v[1];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long int> v;
int main() {
ios::sync_with_stdio(0), ios_base::sync_with_stdio(0), cin.tie(0),
cout.tie(0);
;
long long int n, val, x = 1;
cin >> n, val = n;
for (long long int i = 2; i * i <= n; ++i) {
while (n % i == 0) {
if (i != val) v.push_back(i);
n /= i;
}
if ((long long int)v.size() > 2) {
cout << 1 << "\n";
x = v.back();
v.pop_back();
cout << x * v.back() << "\n";
return 0;
}
}
if (n > 1 && n != val) v.push_back(n);
if (v.size() == 2)
return cout << 2 << "\n", 0;
else if (v.size() > 2) {
x = v.back();
v.pop_back();
return cout << 1 << "\n" << x * v.back() << "\n", 0;
} else
cout << "1\n0\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long int> mn;
void M(unsigned long long int n) {
unsigned long long int i = 2, q = sqrt((double)(n)), kol = 0;
while (i <= q) {
if (n % i == 0) {
n /= i;
kol++;
mn.push_back(i);
} else
i++;
}
}
int main() {
long long int n;
cin >> n;
M(n);
if (mn.size() == 0)
cout << "1" << endl << "0" << endl;
else if (mn.size() == 1)
cout << "2" << endl;
else if (mn[0] * mn[1] != n)
cout << "1" << endl << mn[0] * mn[1] << endl;
else
cout << "2" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool arr[10000005];
void sieve() {
for (int i = 3; i * i <= 10000000; i += 2) {
if (arr[i] == 0) {
for (int j = i * i; j <= 10000000; j += i) arr[j] = 1;
}
}
}
vector<long long> pr, vv;
long long q;
void DIV() {
long long p = q;
for (int i = 0; i < pr.size() && pr[i] <= p; i++) {
if (p % pr[i] == 0) {
while (p % pr[i] == 0) {
p /= pr[i];
}
vv.push_back(pr[i]);
}
}
if (p > 1) vv.push_back(p);
}
int main() {
sieve();
pr.push_back(2);
for (int i = 3; i <= 10000000; i += 2) {
if (arr[i] == 0) pr.push_back(i);
}
scanf("%I64d", &q);
if (q == 1) {
printf("1\n0\n");
return 0;
}
DIV();
if (vv.size() == 0) {
cout << "1" << endl << "0" << endl;
} else if (vv.size() == 1 && vv[0] == q) {
cout << "1" << endl << "0" << endl;
} else if (vv.size() == 1 && vv[0] * vv[0] == q) {
cout << "2" << endl;
} else if (vv.size() == 2 && vv[0] * vv[1] == q) {
cout << "2" << endl;
} else {
long long ans;
if (vv.size() == 1)
ans = vv[0] * vv[0];
else
ans = vv[0] * vv[1];
cout << "1" << endl << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool isprime(long long n) {
long long i;
for (i = 2; i <= sqrt(n); i++)
if (n % i == 0) return false;
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
if (fopen("inp.txt", "r")) {
freopen("inp.txt", "r", stdin);
freopen("outp.txt", "w", stdout);
}
long long n, i;
cin >> n;
if (n == 1 || isprime(n)) {
cout << 1 << endl << 0;
return 0;
} else {
long long g = 0, h = 0;
for (i = 2; i <= sqrt(n); i++)
if (n % i == 0 && isprime(i)) {
if (!g)
g = i;
else
h = i;
}
long long ans, x = g * g, y = h * h, z = g * h;
if (((ans = x) && n % x == 0 && n != x) ||
((ans = y) && n % y == 0 && n != y) || ((ans = z) && n != z))
cout << 1 << endl << ans;
else
cout << 2;
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
long long mod_exp(long long x, long long y, long long mm) {
if (y == 0)
return (1);
else if (y % 2 == 0)
return (mod_exp((x * x) % mm, y / 2, mm));
else
return ((x * mod_exp((x * x) % mm, (y - 1) / 2, mm)) % mm);
}
bool isPowerOfTwo(long long n) {
if (n == 0) return false;
return (ceil(log2(n)) == floor(log2(n)));
}
void solve() {
long long n;
cin >> n;
vector<long long> v;
for (long long i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
if (i == (n / i)) {
v.push_back(i);
} else {
v.push_back(i);
v.push_back(n / i);
}
}
}
sort(v.begin(), v.end());
if (v.size() == 1) {
cout << 2 << "\n";
} else if (v.size() == 0) {
cout << 1 << "\n";
cout << 0 << "\n";
} else {
long long res = 1;
if (v.size() == 2) {
long long a = *v.begin();
long long b = *(v.begin() + 1);
long long x = min(a, b);
long long y = max(a, b);
if (y % x == 0) {
cout << 1 << "\n";
cout << y << "\n";
} else
cout << 2 << "\n";
} else {
long long a = *v.begin();
vector<long long> p, q;
for (long long j = 2; j <= sqrt(a); j++) {
if (a % j == 0) {
p.push_back(j);
p.push_back(a / j);
}
}
if (p.size() > 1) {
cout << 1 << "\n";
cout << a << "\n";
} else {
long long b = *(v.begin() + 1);
for (long long j = 2; j <= sqrt(b); j++) {
if (b % j == 0) {
q.push_back(j);
q.push_back(a / j);
}
}
if (q.size() > 1) {
cout << 1 << "\n";
cout << b << "\n";
} else {
cout << 1 << "\n";
cout << a * b << "\n";
}
}
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void debug() {
cout << fixed << setprecision(0);
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
}
double const EPS = 1e-8, PI = acos(-1);
const int N = 1e8 + 9, OO = 1e9 + 9;
bool isPrime(long long x) {
if (x == 2) return 1;
if (x % 2 == 0) return 0;
for (long long i = 3; i * i <= x; i += 2) {
if (x % i == 0) return 0;
}
return 1;
}
vector<int> primVec;
int main() {
debug();
long long n;
cin >> n;
if (isPrime(n)) {
cout << 1 << endl;
cout << 0;
return 0;
}
for (long long i = 2; i * i <= n; ++i) {
while (n % i == 0) {
n /= i;
primVec.push_back(i);
}
}
if (n > 1) primVec.push_back(n);
if (primVec.size() == 2)
cout << 2;
else {
cout << 1 << endl;
cout << primVec[0] * primVec[1];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> pr;
int main() {
long long q;
cin >> q;
long long tp = q;
for (long long i = 2; i * i <= q; i++) {
while (tp % i == 0) {
pr.push_back(i);
tp = tp / i;
}
}
if (tp > 2) pr.push_back(tp);
if (pr.size() > 2)
cout << "1\n" << pr[0] * pr[1] << endl;
else if (pr.size() < 2)
cout << "1\n"
<< "0" << endl;
else
cout << "2" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = (long long)1e17 + 99999999;
const long long Mod = (long long)1e9 + 7;
const long long MaXN = (long long)1e18;
const int N = (int)1e6 + 7;
const int MaXI = (int)1e9;
const int Mass = (int)2e5;
long long prime(long long x) {
long long Pr = 2;
while (Pr * Pr <= x) {
if (x % Pr == 0) return Pr;
Pr++;
}
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
if (n == 1) {
cout << 1 << "\n" << 0;
return 0;
} else {
long long Res = prime(n);
if (Res == 0) {
cout << 1 << "\n" << 0;
return 0;
}
long long Cur = prime(n / Res);
if (Cur == 0) {
cout << 2;
} else {
cout << 1 << "\n" << Res * Cur;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int inf = (int)1e9;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
;
long long q;
cin >> q;
if (q == 1) {
cout << "1\n0";
return 0;
}
map<long long, int> fac;
vector<long long> ff;
long long mul = q;
for (long long i = 2; i * i <= q; ++i) {
if (q % i == 0) {
int c = 0;
while (q % i == 0) {
q /= i;
++c;
}
fac[i] = c;
ff.push_back(i);
}
}
if (q > 1) {
fac[q] = 1;
ff.push_back(q);
}
if (ff.size() > 2) {
cout << "1\n";
cout << (ff[0] * ff[1]);
} else if (ff.size() == 2) {
if (fac[ff[0]] > 1 || fac[ff[1]] > 1) {
cout << 1 << endl;
cout << (ff[0] * ff[1]);
} else
cout << 2;
} else if (ff.size() == 1) {
if (fac[ff[0]] > 2) {
cout << "1\n";
cout << ff[0] * ff[0];
} else if (fac[ff[0]] == 1) {
cout << "1\n";
cout << 0;
} else {
cout << 2;
}
} else {
cout << 2;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
long long n;
cin >> n;
long long div1 = -1, div2 = -1;
for (long long i = 2; i <= sqrt(n); ++i) {
if (n % i == 0) {
if (div1 == -1) {
div1 = i;
if (n / i % i == 0) {
div2 = i;
break;
}
} else {
div2 = i;
break;
}
}
}
if (div1 == -1)
cout << "1\n0";
else if (div2 == -1 || div1 * div2 == n) {
cout << "2\n";
} else {
cout << "1\n" << div1 * div2 << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<unsigned long long int> vec;
void factors(unsigned long long int n) {
if (n % 2LL == 0) {
while (n % 2LL == 0) {
n /= 2LL;
vec.push_back(2LL);
}
}
for (unsigned long long int i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
vec.push_back(i);
}
}
}
if (n > 1) vec.push_back(n);
}
void solve() {
unsigned long long int x;
cin >> x;
factors(x);
if (vec.size() > 1) {
if (vec.size() == 2)
cout << 2 << '\n';
else {
cout << 1 << '\n' << vec[0] * vec[1] << '\n';
}
} else
cout << 1 << '\n' << 0 << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(NULL);
;
unsigned long long int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e6 + 5;
const long long MAX = 1e7 + 5;
const double pi = 3.14159265359;
bitset<10000007> bs;
vector<long long> prims;
void sieve(long long n) {
bs.set();
bs[0] = 0;
bs[1] = 0;
for (long long i = 2; i < n; i++) {
if (bs[i]) {
prims.push_back(i);
for (long long j = i * i; j < n; j += i) bs[j] = 0;
}
}
}
bool isPrime(long long a) {
if (a < 10000000) return bs[a];
long long b = sqrt(a) + 2;
for (int i = 0; i < prims.size(); i++) {
if (prims[i] > b)
return true;
else if (a % prims[i] == 0)
return false;
}
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
long long n;
cin >> n;
sieve(10000000);
if (isPrime(n) || n == 1) {
return cout << 1 << "\n" << 0, 0;
}
vector<long long> pr;
int i = 0;
while (n > 1) {
long long div = prims[i++];
while (n > 1 && n % div == 0) {
n /= div;
pr.push_back(div);
}
if (i == (int)prims.size()) {
pr.push_back(n);
break;
}
}
if (pr.size() == 2) {
cout << 2;
} else {
cout << 1 << endl;
cout << pr[0] * pr[1];
}
}
|
#include <bits/stdc++.h>
using namespace std;
static const double EPS = 1e-5;
int main() {
long long q;
cin >> q;
int first = -1;
int second = -1;
int third = -1;
for (long long i = 2; i * i <= q; i++) {
if (q % i == 0) {
if (first < 0)
first = i;
else if (second < 0) {
if (i % first != 0) {
second = i;
} else {
}
} else if (third < 0) {
third = i;
break;
}
}
}
if (first < 0) {
cout << "1" << endl << "0" << endl;
} else if (second < 0) {
if (first * (long long)first < q && q % (first * (long long)first) == 0) {
cout << "1" << endl;
cout << first * (long long)first << endl;
} else {
cout << "2" << endl;
}
} else {
cout << "1" << endl;
long long a = (long long)first;
a *= second;
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<int> v;
long long nn = n;
for (int i = 2; 1ll * i * i <= nn; i++) {
while (n % i == 0) {
n /= i;
v.push_back(i);
}
}
if (n > 1) v.push_back(n);
if (v.size() == 1 || v.empty()) {
puts("1");
puts("0");
} else if (v.size() == 2)
puts("2");
else {
puts("1");
cout << 1ll * v[0] * v[1] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long infl = 1e18 + 5;
long long int m, n, p, q, x, y, cn, k, tmp1, tmp, mx = 0, mn, f, val, sz, sm,
cntt, ans, t = 1, i, j;
long long int cnt[4123456];
vector<int> v;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
if (fopen("inp.txt", "r")) {
freopen("myfile.txt", "w", stdout);
freopen("inp.txt", "r", stdin);
}
cin >> n;
val = sqrt(n);
for (i = 2; i < val + 1; i++) {
while (n % i == 0) {
n = n / i;
cnt[i]++;
v.push_back(i);
}
}
if (n > 1) {
if (n < 4123456) cnt[n]++;
v.push_back(n);
}
for (i = 0; i < 4123456; i++) {
sm += cnt[i];
}
if (v.size() <= 1) {
cout << "1 \n0";
return 0;
} else if (v.size() == 2) {
cout << "2 \n";
} else {
cout << "1 \n";
cout << v[0] * v[1];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
long long i, j, k;
long long pri[4];
while (cin >> n) {
long long m = n;
k = 0;
for (i = 2; i * i <= n; i++) {
if ((n % i) == 0) {
while ((n % i) == 0) {
n /= i;
k++;
pri[k] = i;
if (k > 2) break;
}
}
if (k > 2) break;
}
if (n > 1) {
k++;
pri[k] = n;
}
if (k <= 1) {
printf("1\n0\n");
} else if (k > 2) {
printf("1\n");
cout << (pri[1] * pri[2]) << endl;
} else
printf("2\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int OO = 0x3f3f3f3f;
const double eps = (1e-10);
bool isPrime(long long n) {
if (n < 2) return 0;
for (long long i = 2; i * i <= n; i++)
if (n % i == 0) return 0;
return 1;
}
vector<long long> getFactors(long long n) {
vector<long long> ret;
long long tmp = n, cnt = 1;
for (long long i = 2; i * i <= n; i++) {
long long x = 1;
while (tmp % i == 0) {
ret.push_back(i);
tmp /= i;
++x;
}
cnt *= x;
}
if (tmp != 1) {
ret.push_back(tmp);
cnt *= 2;
}
return ret;
}
int main() {
cout.precision(10);
long long x;
cin >> x;
if (x == 1) return puts("1\n0");
vector<long long> v = getFactors(x);
sort(v.begin(), v.end());
if (v.size() == 2) return puts("2");
if (v.size() == 1) return puts("1\n0");
puts("1");
cout << v[0] * v[1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool prime(long long n) {
for (long long d = 2; d * d <= n; d++)
if (n % d == 0) return false;
return true;
}
int main() {
long long n;
cin >> n;
if (prime(n)) {
cout << 1 << endl << 0;
return 0;
}
for (long long d = 2; d * d <= n; d++)
if (n % d == 0) {
for (long long j = 2; j * j <= d; j++)
if (d % j == 0 && prime(j) && prime(d / j)) {
cout << 1 << endl << d;
return 0;
}
for (long long j = 2; j * j <= n / d; j++)
if ((n / d) % j == 0 && prime(j) && prime((n / d) / j)) {
cout << 1 << endl << n / d;
return 0;
}
}
cout << 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 2.0 * acos(0.0);
const int MOD = 1e9 + 9;
const int oo = 2e9 + 1e8;
long long gcd(long long x, long long y) { return !y ? x : gcd(y, x % y); }
int main() {
long long n, cnt, ret;
scanf("%I64d", &n);
ret = 1, cnt = 0;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
n /= i, cnt++;
if (cnt <= 2) ret *= i;
}
if (cnt > 1) break;
}
if (n != 1) {
cnt++;
if (cnt <= 2) ret *= n;
}
if (cnt < 2)
puts("1\n0");
else if (cnt == 2)
puts("2");
else
printf("1\n%I64d\n", ret);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long isP(long long q) {
if (q <= 1) return 0;
for (long long i = 2; i * i <= q; i++)
if (q % i == 0) return i;
return 0;
}
pair<int, long long> comp(long long q) {
if (q == 1) return {1, 0};
for (long long i = 2; i * i <= q; i++) {
if (q % i == 0) {
long long temp = q / i;
long long div = isP(temp);
if (div == 0)
return {2, -1};
else
return {1, i * div};
}
}
return {1, 0};
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
long long q;
cin >> q;
auto p = comp(q);
if (p.first == 2)
cout << 2;
else
cout << p.first << "\n" << p.second;
return 0;
}
|
#include <bits/stdc++.h>
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
using namespace std;
int begtime = clock();
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngb(chrono::steady_clock::now().time_since_epoch().count());
vector<long long int> fact(long long int n) {
vector<long long int> res;
for (long long d = 1, i = 2; i * i <= n && res.size() <= 3; i += d, d = 2) {
while (n % i == 0) {
res.push_back(i);
n /= i;
}
}
if (n > 1) res.push_back(n);
return res;
}
void solve() {
long long int n;
cin >> n;
vector<long long int> res = fact(n);
if (((long long int)(res).size()) <= 1) {
cout << 1 << "\n" << 0 << "\n";
} else if (((long long int)(res).size()) == 2) {
cout << 2 << "\n";
} else {
cout << 1 << "\n" << res[0] * res[1] << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
int T = 1;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lli = long long int;
using ld = long double;
const int N = 1e5 + 5, inf = 2e9;
ll q, x;
vector<ll> v;
bool isPrime(ll n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
void primeFactors(ll n) {
while (n % 2 == 0) {
v.push_back(2);
n = n / 2;
}
for (int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
v.push_back(i);
n = n / i;
}
}
if (n > 2) v.push_back(n);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> q;
if (q == 1 || isPrime(q)) return cout << 1 << "\n" << 0 << "\n", 0;
primeFactors(q);
if (v.size() != 2)
cout << 1 << "\n" << v[0] * v[1] << "\n";
else
cout << 2 << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 3162280;
int comp[maxn];
int main() {
ios::sync_with_stdio(false);
long long q;
cin >> q;
long long cpy = q;
vector<long long> pr;
if (q % 2 == 0) {
pr.push_back(2);
while (q % 2 == 0) {
q /= 2;
}
}
if (q % 3 == 0) {
pr.push_back(3);
while (q % 3 == 0) {
q /= 3;
}
}
for (long long i = 6; (i - 1) * (i - 1) <= q; i += 6) {
if (q % (i - 1) == 0) {
pr.push_back(i - 1);
while (q % (i - 1) == 0) {
q /= i - 1;
}
}
if (q % (i + 1) == 0) {
pr.push_back(i + 1);
while (q % (i + 1) == 0) {
q /= i + 1;
}
}
if (pr.size() >= 2) {
break;
}
}
if (q != 1) {
pr.push_back(q);
}
if (pr.empty() or pr[0] == cpy) {
cout << 1 << endl << 0;
} else {
if (pr.size() > 2 or (pr.size() == 2 and pr[0] * pr[1] < cpy)) {
cout << 1 << endl << pr[0] * pr[1] << endl;
return 0;
} else if (pr.size() == 1 and pr[0] * pr[0] < cpy) {
cout << 1 << endl << pr[0] * pr[0] << endl;
return 0;
}
cout << 2;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
vector<long long> vi;
for (long long i = 2; i * i <= x; i++) {
while (x % i == 0 && i != x) {
x /= i;
vi.push_back(i);
}
}
if (!vi.size())
cout << 1 << endl << 0;
else if (vi.size() == 1)
cout << 2;
else
cout << 1 << endl << vi[0] * vi[1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const long long MOD = 1e9 + 7;
const long long mxN = 2e5 + 3;
void solve() {
long long n;
cin >> n;
long long cnt = 0;
long long q = n;
map<long long, long long> mp;
for (long long i = 2; i * i <= n; ++i) {
while (q % i == 0) {
cnt++;
mp[i]++;
q /= i;
}
}
if (q > 1) cnt++, mp[q]++;
if (cnt < 2) {
cout << 1 << "\n";
cout << 0 << "\n";
} else if (cnt == 2) {
cout << 2 << "\n";
} else {
cout << 1 << "\n";
long long ans = 1;
bool fir = true;
for (auto it : mp) {
if (fir) {
if (it.second > 1) {
ans = (it.first * it.first);
break;
} else {
ans = (it.first);
fir = false;
}
} else {
ans *= (it.first);
break;
}
}
cout << ans << "\n";
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long nT = 1;
for (long long i = 1; i <= nT; ++i) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool flag[3500000 + 5];
vector<long long> vec, divisor;
void seive() {
for (int i = 3; i * i <= 3500000; i += 2) {
if (!flag[i]) {
for (int j = i * i; j <= 3500000; j += 2 * i) {
flag[j] = 1;
}
}
}
vec.push_back(2);
for (long long i = 3; i <= 3500000; i += 2) {
if (!flag[i]) {
vec.push_back(i);
}
}
}
long long factorize(long long n) {
bool expo = 0;
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
expo = 1;
while (n % i == 0) {
n /= i;
divisor.push_back(i);
}
}
}
if (n > 1) {
divisor.push_back(n);
}
if (!expo)
return 0;
else
return 1;
}
int main() {
long long q, tmp, cnt = 0, f = 0;
cin >> q;
if (q <= 3) {
cout << "1" << endl << f << endl;
return 0;
}
tmp = q;
if (!factorize(q)) {
cout << "1" << endl << f << endl;
return 0;
} else if (divisor.size() > 2) {
cout << "1" << endl << divisor[0] * divisor[1] << endl;
return 0;
} else {
cout << "2" << endl;
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, u, i;
int main() {
cin >> n;
for (i = 2; i * i <= n; i++) {
if (n % i == 0 && u == 0) {
u = i, n /= i;
}
if (n % i == 0 && n > i) {
cout << 1 << endl << u * i << endl;
return 0;
}
}
if (u == 0) {
puts("1\n0");
} else {
puts("2");
}
}
|
#include <bits/stdc++.h>
using namespace std;
struct debugger {
vector<string> vars;
template <typename T>
debugger &operator,(const T v) {
stringstream ss;
ss << v, vars.push_back(ss.str());
return *this;
}
void printall() {
int j = 0, l = vars.size();
for (int i = 0; i < (l - 1); i++) {
if (i) cout << ", ";
for (j; j < vars[l - 1].size(); j++) {
if (vars[l - 1][j] == ',') {
j++;
break;
}
cout << vars[l - 1][j];
}
cout << " = " << vars[i];
}
vars.clear();
}
} Dbug;
int CI(int &_x) { return scanf("%d", &_x); }
int CI(int &_x, int &_y) { return scanf("%d %d", &_x, &_y); }
int CI(int &_x, int &_y, int &_z) { return scanf("%d %d %d", &_x, &_y, &_z); }
int CI(int &_a, int &_b, int &_c, int &_d) {
return scanf("%d %d %d %d", &_a, &_b, &_c, &_d);
}
template <typename T>
void getarray(T a[], int b, int e) {
for (int i = b; i < e + b; i++) cin >> a[i];
}
template <typename T>
void printarray(T a[], int b, int e) {
for (int i = b; i < e - 1 + b; i++) cout << a[i] << " ";
if (e - 1 + b >= 0) cout << a[e - 1 + b] << endl;
}
template <typename T>
void printV(vector<T> v) {
int sz = v.size();
if (sz) cout << v[0];
for (int i = 1; i < sz; i++) cout << " " << v[i];
puts("");
}
template <typename T>
T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
template <typename T>
T BigMod(T b, T p, T m) {
if (p == 0) return 1;
if (p % 2 == 0) {
T s = BigMod(b, p / 2, m);
return ((s % m) * (s % m)) % m;
}
return ((b % m) * (BigMod(b, p - 1, m) % m)) % m;
}
template <typename T>
T ModInv(T b, T m) {
return BigMod(b, m - 2, m);
}
template <class T>
inline void read(T &x) {
bool Minus = 0;
char c;
for (c = getchar(); c <= 32; c = getchar())
;
if (c == '-') Minus = 1, c = getchar();
for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
if (Minus) x = -x;
}
char getc() {
char c;
for (c = getchar(); c <= 32; c = getchar())
;
return c;
}
const double EPS = 1e-9;
const int INF = (1 << 30) - 1;
const long long int LINF = (1ll << 62) - 1;
int dr8[8] = {1, -1, 0, 0, 1, -1, -1, 1};
int dc8[8] = {0, 0, -1, 1, 1, 1, -1, -1};
int dr4[4] = {0, 0, 1, -1};
int dc4[4] = {-1, 1, 0, 0};
int kn8r[8] = {1, 2, 2, 1, -1, -2, -2, -1};
int kn8c[8] = {2, 1, -1, -2, -2, -1, 1, 2};
int main() {
int i, j, k, l, n, m, q, a, b, c;
long long int N;
cin >> N;
long long int ii, sqN = sqrt(N);
long long int total_factor = 0;
vector<long long int> prime_factors;
for (ii = 2; ii <= sqN; ii++) {
if (N % ii == 0) {
prime_factors.push_back(ii);
while (N % ii == 0) {
total_factor++;
N /= ii;
}
}
}
if (N != 1) {
total_factor++;
prime_factors.push_back(N);
}
if (total_factor <= 1) {
cout << 1 << "\n" << 0 << "\n";
return 0;
}
if (total_factor == 2) {
cout << 2 << "\n";
return 0;
}
cout << 1 << "\n";
if (prime_factors.size() >= 2)
cout << prime_factors[0] * prime_factors[1] << "\n";
else
cout << prime_factors[0] * prime_factors[0] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
const long long N = 2e5 + 10, MOD = 1e9 + 7;
using namespace std;
int dx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
long long n, t, ans;
long long div(long long n) {
long long tmp = n, res = 1, cnt = 0;
for (long long p = 2; p * p <= n; ++p) {
int e = 0;
while (tmp % p == 0) {
++e;
tmp /= p;
}
if (e && cnt < 2) e > 1 ? res = p * p, cnt = 2 : res *= p, cnt++;
}
if (tmp != n && cnt < 2) res *= tmp;
return res == 1 ? 0 : res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
long long ans = div(n);
if (!ans || (div(ans) && ans != n))
cout << 1 << '\n' << ans;
else
cout << 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long x) {
for (int i = 2; i * i <= x; i++)
if (x % i == 0) return false;
return true;
}
int main() {
long long n, N, cnt = 0, first = 0;
vector<long long> vec;
cin >> n;
N = n;
while (n % 2 == 0) vec.push_back(2), n /= 2;
for (int i = 3; i <= sqrt(n); i += 2)
while (n % i == 0) vec.push_back(i), n /= i;
if (!vec.size() || isPrime(N)) return cout << 1 << '\n' << (long long)0, 0;
if (n != 1) vec.push_back(n);
if (vec.size() == 2) return cout << 2, 0;
return cout << 1 << '\n' << vec[0] * vec[1] << '\n', 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, dive, multi = 1, times;
int main() {
scanf("%I64d", &n);
for (long long i = 2; i * 1ll * i <= n; i++) {
while (n % i == 0) {
dive++;
n /= i;
if (times < 2) {
multi *= i;
times++;
}
}
}
if (n > 1)
if (dive > 0) dive++;
if (dive < 2) {
printf("1\n0\n");
} else if (dive == 2) {
printf("2\n");
} else {
printf("1\n%I64d", multi);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a;
for (long long i = 2; i * i <= n; i++)
for (; !(n % i); a.push_back(i), n /= i)
;
if (n > 1) a.push_back(n);
if (((int)(a).size()) < 2) {
puts("1");
puts("0");
} else if (((int)(a).size()) == 2) {
puts("2");
} else {
puts("1");
cout << a[0] * a[1] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> primes;
const int mxN = 4e6 + 5;
bool vis[mxN];
long long q;
vector<long long> factorize(long long n) {
vector<long long> v;
for (long long d = 1, i = 2; i * i <= n && v.size() <= 3; i += d, d = 2) {
while (n % i == 0) {
n /= i;
v.push_back(i);
}
}
if (n > 1) v.push_back(n);
return v;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> q;
vector<long long> v = factorize(q);
if (v.size() <= 1) {
cout << "1\n0\n";
} else if (v.size() == 2) {
cout << "2\n";
} else {
cout << "1\n" << v[0] * v[1] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n) {
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
if (isPrime(n)) {
cout << 1 << endl << 0 << endl;
} else {
long long a = -1, b = -1;
long long temp = n;
for (long long i = 2; i <= n; i++) {
if (n % i == 0) {
if (isPrime(i) && isPrime(n / i) && (n == temp)) {
a = i;
b = n / i;
} else {
if (a == -1)
a = i;
else if (b == -1)
b = i;
n /= i;
while ((n % i) == 0) {
if (b == -1) b = i;
n /= i;
}
}
}
if (a != -1 && b != -1) break;
}
if ((a * b) == temp) {
cout << 2 << endl;
} else {
cout << 1 << endl;
cout << a * b << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, tot = 0, N;
cin >> n;
N = n;
vector<long long> v;
for (long long i = 2; i * i <= n; i++)
if (n % i == 0) {
v.push_back(i);
while (n % i == 0) n /= i, tot++;
}
if (n != 1) tot++, v.push_back(n);
if (tot <= 1)
cout << 1 << endl << 0 << endl;
else if (tot == 2)
cout << 2 << endl;
else {
long long div = 1;
cout << 1 << endl;
if (v.size() >= 2) {
div = v[0] * v[1];
cout << div << endl;
} else {
div = v[0] * v[0];
cout << div << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, a, p, b, p1, p2;
cin >> a;
b = a;
p = 0;
p1 = p2 = 1;
for (i = 2; i <= sqrt(b); i++) {
if (b % i == 0) {
b = b / i;
p++;
if (p == 1) p1 = i;
if (p == 2) p2 = i;
i--;
}
}
if (p == 0) cout << 1 << endl << 0 << endl;
if (p == 1) cout << 2 << endl;
if (p >= 2) cout << 1 << endl << p1 * p2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> prime_factors;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
n /= i;
prime_factors.push_back(i);
}
}
if (n > 1) prime_factors.push_back(n);
if (prime_factors.size() <= 1) {
cout << "1\n0";
return 0;
}
if (prime_factors.size() == 2) {
cout << 2;
return 0;
}
cout << "1\n" << prime_factors[0] * prime_factors[1];
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 500;
const long long mod = 1e9 + 7;
const long long INF = 1LL << 57;
const int M = 1e6 + 500;
long long int prime(long long int x) {
long long int i = 2;
while (i * i <= x) {
if (x % i == 0) return i;
i++;
}
return 0;
}
void solve() {
long long int n;
cin >> n;
long long int a = prime(n);
if (a == 0) {
cout << 1 << endl;
cout << 0;
return;
}
long long int b = prime(n / a);
if (b == 0) {
cout << 2;
} else {
cout << 1 << endl;
cout << a * b;
}
return;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int t;
t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long q;
cin >> q;
if (q == 1) {
cout << "1\n0\n";
return 0;
}
long long a = -1, b = -1;
for (long long d = 2; d * d <= q; d++) {
if (q % d) continue;
a = d;
b = q / d;
break;
}
if (a == -1) {
cout << "1\n0\n";
return 0;
}
for (long long d = 2; d * d <= b; d++) {
if (b % d) continue;
cout << "1\n" << a * d << '\n';
return 0;
}
cout << "2\n";
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> fact;
void f(long long n) {
while (n % 2 == 0) {
fact.push_back(2);
n /= 2;
}
for (long long i = 3; i * i <= n; i += 2) {
while (n % i == 0) {
fact.push_back(i);
n /= i;
}
}
if (n > 1) fact.push_back(n);
}
int32_t main() {
long long n;
cin >> n;
f(n);
if (fact.size() <= 1) {
cout << 1 << endl << 0 << endl;
return 0;
}
if (fact.size() == 2) {
cout << 2 << endl;
return 0;
}
cout << 1 << endl << fact[0] * fact[1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int sieve[10000007];
void computeSieve(int n) {
for (int i = 4; i <= n; i += 2) {
sieve[i] = 1;
}
for (int i = 3; i <= n; i += 2) {
if (sieve[i] == 1) continue;
for (int j = i + i; j <= n; j += i) {
sieve[j] = 1;
}
}
}
long long n;
long long N;
vector<int> factors;
int main() {
cin >> n;
N = n;
computeSieve(10000001);
long long root = sqrt(n);
for (int i = 2; i <= 10000000; i++) {
while (sieve[i] == 0 && n % i == 0) {
factors.push_back(i);
n /= i;
}
}
if (n > 1) factors.push_back(n);
if (factors.size() <= 1) {
cout << 1 << '\n';
cout << 0 << '\n';
} else if (factors.size() == 2) {
cout << 2 << '\n';
} else {
cout << 1 << '\n';
long long product = 1;
for (int i = 0; i < factors.size() - 2; i++) {
product *= (long long)factors[i];
}
N /= product;
cout << N << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long q;
char prime[4000000 + 1000];
int input() {
cin >> q;
return 0;
}
int sieve(long long n) {
for (long long i = 1; i < n; i++) prime[i] = 1;
prime[1] = 0;
for (long long i = 2; i * i <= n; i++) {
if (!prime[i]) continue;
for (long long j = i * 2; j < n; j += i) prime[j] = 0;
}
return 0;
}
bool isPrime(long long n) {
if (n == 1) return false;
if (n < 4000000) return prime[n];
for (long long i = 2; i * i <= n; i++) {
if (prime[i] && n % i == 0) return false;
}
return true;
}
int factor(long long n, long long &a, long long &b) {
a = 1;
b = n;
for (long long i = 2; i * i <= n; i++) {
if (prime[i] && n % i == 0) {
a = i;
b = n / i;
break;
}
}
return 0;
}
int solve() {
sieve(4000000);
if (q == 1 || isPrime(q)) {
cout << 1 << endl << 0 << endl;
} else {
long long p1, p2;
factor(q, p1, p2);
if (isPrime(p2)) {
cout << 2 << endl;
} else {
long long p3, p4;
factor(p2, p3, p4);
cout << 1 << endl << p1 * p3 << endl;
}
}
return 0;
}
int main() {
input();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
long long q, k = 0, fi = 1;
cin >> q;
long long l = q;
while (q % 2 == 0) {
if (k < 2) fi *= 2;
q /= 2;
++k;
}
for (long long i = 3; i * i <= q; i += 2) {
while (q % i == 0) {
if (k < 2) fi *= i;
q /= i;
++k;
}
}
if (q > 2) ++k;
if (k > 2) {
cout << "1"
<< "\n";
cout << fi << "\n";
} else if (l == 1 || k == 1) {
cout << "1"
<< "\n"
<< "0"
<< "\n";
;
} else
cout << "2"
<< "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, br = 0, n1;
long long check(long long n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) return 0;
}
return 1;
}
long long check1(long long n) {
for (int i = 2; i <= sqrt(n); i++)
if (n % i == 0) return i;
return 0;
}
int main() {
scanf("%lld", &n);
n1 = n;
if (check(n)) {
cout << 1 << endl;
cout << 0 << endl;
return 0;
}
long long sol1 = check1(n);
long long sol2 = check1(n / sol1);
if (sol2 == 0) {
cout << 2 << endl;
return 0;
}
cout << 1 << endl;
cout << sol1 * sol2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool ispr(long long a) {
int root = 1 + (int)sqrt((double)a);
for (int i = 2; i <= root; i++) {
if (a % i == 0) return false;
}
return true;
}
int main() {
long long q;
long long qq;
cin >> q;
qq = q;
if (q <= 3) {
cout << 1 << endl;
cout << 0;
return 0;
}
int n = 1 + (int)sqrt((double)q);
int cnt = 0;
long long chisla[2];
chisla[0] = 1;
chisla[1] = 1;
int idx = 0;
bool brk = false;
for (int i = 2; i <= n; i++) {
while (q % i == 0) {
q /= i;
cnt++;
if (idx == 2) {
brk = true;
break;
}
chisla[idx] = i;
idx++;
}
if (brk) break;
}
long long other = qq / ((long long)chisla[0] * (long long)chisla[1]);
if (cnt == 0) {
cout << 1 << endl;
cout << 0;
return 0;
}
if ((cnt == 2 && other == 1) || cnt == 1) {
cout << 2;
return 0;
}
long long hid = (chisla[0] * chisla[1]);
cout << 1 << endl;
cout << hid;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, m;
cin >> n;
m = n;
vector<pair<long long int, int> > p;
int sum = 0;
for (long long int i = 2; i * i <= n; i++) {
if (n % i == 0) {
int c = 0;
while (n % i == 0) {
c++;
sum++;
n /= i;
}
p.push_back({i, c});
if (sum > 2) {
long long int temp = 1;
int t = 0;
for (int j = 0; j < p.size() && t < 2; j++) {
if (p[j].second > 1) {
temp = (p[j].first * p[j].first);
break;
} else {
temp = (temp * p[j].first);
t++;
}
}
cout << 1 << endl << temp;
return 0;
}
}
}
if (n != 1) {
sum++;
p.push_back({n, 1});
if (sum > 2) {
long long int temp = 1;
int t = 0;
for (int i = 0; i < p.size() && t < 2; i++) {
if (p[i].second > 1) {
temp = (p[i].first * p[i].first);
break;
} else {
temp = (temp * p[i].first);
t++;
}
}
cout << 1 << endl << temp;
return 0;
} else if (sum == 1) {
cout << 1 << endl << 0;
return 0;
}
}
if (sum == 0) {
cout << 1 << endl << 0;
return 0;
}
cout << 2;
}
|
#include <bits/stdc++.h>
using namespace std;
int mark[3200000];
int prime[3200000];
int cnt = 0;
bool mm[3200000];
void Init() {
int i, j, q, n;
memset(mark, 0, sizeof(mark));
n = 3200000;
for (i = 2; i <= n; i++) {
if (mark[i] == 0) {
prime[cnt++] = i;
}
for (j = 0; j < cnt; j++) {
if (prime[j] * i > n) break;
mark[prime[j] * i] = prime[j];
if (mark[i] == prime[j]) break;
}
}
}
int main() {
Init();
long long n;
int i;
while (cin >> n) {
int ans = 0;
long long res = 1;
int n1 = n;
for (i = 0; i < cnt && prime[i] <= n; i++) {
while (n % prime[i] == 0) {
ans++;
if (ans <= 2) res *= prime[i];
n /= prime[i];
}
}
if (n != 1) {
ans++;
if (ans <= 2) res *= prime[i];
}
if (ans < 2) {
puts("1\n0");
} else if (ans >= 3) {
cout << "1\n" << res << endl;
} else
puts("2");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> d;
int main() {
cin >> n;
for (int i = 2; i < 10000000; i++) {
while (n % i == 0) {
d.push_back(i);
n /= i;
}
}
if (n != 1) {
d.push_back(n);
}
if (d.size() <= 1) {
cout << 1 << endl << 0;
} else if (d.size() == 2) {
cout << 2;
} else {
cout << 1 << endl << d[0] * d[1];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
map<int, int> m;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
m[i]++;
n /= i;
}
}
if (n > 1) m[n]++;
long long s = 0, ans = 1, p = 0;
if (m.size() == 0) {
cout << 1 << '\n' << 0;
return;
}
for (auto i : m) {
s += i.second;
if (p < 2) {
if (i.second > 1)
ans = i.first * i.first, p = 2;
else
ans *= i.first, p++;
}
}
if (s > 2) {
cout << 1 << '\n' << ans << '\n';
return;
}
if (s == 2) {
cout << 2 << '\n';
return;
}
if (s == 1) {
cout << 1 << '\n' << 0;
return;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool o[5000001];
int prim[5000001];
int que[100001];
int num;
int judge(long long n) {
int i;
for (i = 0; i < num; i++) {
if (n == prim[i]) return 1;
if (n % prim[i] == 0) {
return 0;
}
}
return 1;
}
int main() {
int i, j;
long long n, ans, temp;
num = 0;
for (i = 2; i <= 5000000; i++) {
if (o[i] == 0) {
prim[num++] = i;
for (j = i + i; j <= 5000000; j += i) {
o[j] = 1;
}
}
}
cin >> n;
if (n == 1 || judge(n)) {
cout << "1\n0\n";
return 0;
}
ans = 1;
j = 0;
for (i = 0; i < num; i++) {
if (n % prim[i] == 0 && judge(n / prim[i])) {
cout << "2\n";
return 0;
}
temp = n;
while (temp % prim[i] == 0) {
temp /= prim[i];
que[j++] = prim[i];
}
}
cout << "1\n" << que[0] * que[1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long div(long long a) {
int B = min((long long)sqrt(a) + 1, a - 1);
for (int i = 2; i <= B; ++i) {
if (a % i == 0) return i;
}
return -1;
}
int main() {
long long a;
cin >> a;
vector<long long> f;
while (true) {
long long x = div(a);
if (x == -1) break;
a /= x;
f.push_back(x);
}
f.push_back(a);
if (f.size() == 1) cout << "1\n0\n";
if (f.size() == 2) cout << "2\n";
if (f.size() > 2) cout << "1\n" << f[0] * f[1] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using pii = pair<int, int>;
using vi = vector<int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vlli = vector<long long int>;
using vpii = vector<pair<int, int>>;
lli num, n, ans;
vi fac;
void solve() {
n = num;
if (n != 2)
while (n % 2 == 0) {
fac.push_back(2);
n /= 2;
}
for (int i = 3; i <= sqrt(n); i += 2)
while (n % i == 0) {
fac.push_back(i);
n /= i;
}
if (n != num && n != 1) fac.push_back(n);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> num;
solve();
if (fac.size() >= 3) {
ans = 1;
for (int i = 0; i < 2; i++) ans *= fac[i];
cout << 1 << '\n' << ans;
} else if (fac.empty())
cout << 1 << '\n' << 0;
else
cout << 2;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> F;
int main() {
long long x, i;
cin >> x;
for (i = 2; i * i <= x; i++)
if (x % i == 0) {
x /= i;
F.push_back(i--);
if (F.size() > 2) break;
}
if (x > 1) F.push_back(x);
if (F.size() < 2)
cout << "1\n0";
else if (F.size() < 3)
cout << "2";
else
cout << "1\n" << F[0] * F[1];
}
|
#include <bits/stdc++.h>
using namespace std;
long long Hash(char* str) {
int p = 31;
long long P = 1;
long long res = 0;
for (size_t i = 0; i < strlen(str); i++) {
res += P * (str[i] - 'a');
P *= p;
}
return res;
}
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int main() {
long long n;
scanf("%I64d", &n);
int fm = 0;
long long tmp = 1;
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
fm++;
if (fm <= 2) tmp *= i;
if (fm == 3) break;
if ((n / i) % i == 0) {
fm++;
if (fm <= 2) tmp *= i;
if (fm == 3) break;
if (((n / i) / i) % i == 0) {
fm++;
if (fm == 3) break;
}
}
}
if (fm == 3) break;
}
if (fm == 3)
printf("1\n%I64d", tmp);
else {
if (fm == 0)
printf("1\n0");
else
printf("2");
}
return 0;
}
|
#include <bits/stdc++.h>
long long P, q;
long long a = -1, b = -1, c = -1;
int main() {
scanf("%I64d", &P);
q = sqrt(P);
for (long long i = 2; i <= q; i++) {
if (P % i == 0) {
a = i;
break;
}
}
if (a == -1) {
printf("1\n0\n");
return 0;
}
P /= a;
q = sqrt(P);
for (long long i = 2; i <= q; i++) {
if (P % i == 0) {
b = i;
break;
}
}
if (b == -1) {
printf("2\n");
return 0;
}
printf("1\n%I64d\n", a * b);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 1, -1, 0};
int dy[] = {1, 0, 0, -1};
long long pw(long long b, long long p) {
if (!p) return 1;
long long sq = pw(b, p / 2) % 98765431;
sq = (sq * sq) % 98765431;
if (p % 2) sq = (sq * b) % 98765431;
return sq;
}
const int N = 105, M = N * N;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
long long nn = n;
vector<long long> v;
if (n == 1) {
cout << 1 << "\n" << 0;
return 0;
}
for (int i = 2; i <= ceil(sqrt((long double)n)) && i != n; i++) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
v.push_back(i);
}
}
}
if (n > 1) v.push_back(n);
if ((int)v.size() == 1 || !(int)v.size())
cout << 1 << "\n" << 0;
else if ((int)v.size() == 2)
cout << 2;
else {
long long r = 1;
for (int i = 0; i < (int)v.size() - 2; i++) {
r *= v[i] * 1LL;
}
cout << 1 << "\n" << nn / r;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, q, ans, k = 0;
cin >> q;
ans = 1;
for (i = 2; i * i <= q; ++i) {
while (i < q && q % i == 0) {
q /= i;
ans *= i;
++k;
if (k == 2) {
cout << 1 << endl << ans << endl;
return 0;
}
}
}
if (ans == 1) {
cout << 1 << endl << 0 << endl;
return 0;
}
cout << 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long long n;
scanf("%I64d", &n);
if (n == 1) {
printf("1\n0");
return 0;
}
long long k = n;
int cnt = 0, t = 0;
long long move = 1;
for (long long i = 2; i * i <= n; ++i)
while (n % i == 0) {
cnt++;
n /= i;
if (t < 2) {
move *= i;
t++;
}
}
if (n > 1) ++cnt;
if ((t == 2) && cnt >= 3)
printf("1\n%I64d", move);
else if (t == 0)
printf("1\n0");
else
printf("2");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > do_it(long long n) {
vector<pair<long long, long long> > res;
if (n % 2 == 0) {
long long cnt = 0;
while (n % 2 == 0) n /= 2, cnt++;
res.push_back(make_pair(2, cnt));
}
for (long long i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
long long cnt = 0;
while (n % i == 0) {
n /= i, cnt++;
}
res.push_back(make_pair(i, cnt));
}
}
if (n != 1) {
res.push_back(make_pair(n, 1));
}
return res;
}
int main(void) {
long long q;
cin >> q;
vector<pair<long long, long long> > res = do_it(q);
long long sum = 0;
if (q == 1) {
cout << 1 << endl;
cout << 0 << endl;
return 0;
}
for (long long i = 0; i < res.size(); i++) sum += res[i].second;
if (sum == 1) {
cout << 1 << endl;
cout << 0 << endl;
} else if (sum == 2) {
cout << 2 << endl;
} else {
cout << 1 << endl;
long long tot = 1, cnt = 0;
long long k = 0;
while (k < res.size() && cnt <= sum - 2) {
if (cnt + res[k].second < sum - 2) {
for (long long z = 0; z < res[k].second; z++) tot *= res[k].first;
cnt += res[k].second;
k++;
} else if (cnt + res[k].second == sum - 2) {
for (long long z = 0; z < res[k].second; z++) tot *= res[k].first;
cnt += res[k].second;
k++;
break;
} else if (cnt + res[k].second > sum - 2) {
for (long long z = 0; z < sum - 2 - cnt; z++) tot *= res[k].first;
break;
}
}
cout << q / tot << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
long long x;
cin >> x;
vector<long long> primes;
for (long long i = 2; i * i <= x; i++) {
if (x % i == 0) {
while (x % i == 0) {
x /= i;
primes.push_back(i);
}
}
}
if (x != 1) primes.push_back(x);
if ((long long)primes.size() <= 1) {
cout << "1\n0\n";
return 0;
}
if ((long long)primes.size() == 2) {
cout << "2\n";
return 0;
}
cout << "1\n";
long long ans = primes[0] * primes[1];
;
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> v;
for (long long int i = 2; i * i <= n; i++) {
while (n % i == 0) {
v.push_back(i);
n /= i;
}
}
if (n > 2) v.push_back(n);
if (v.size() <= 1) {
cout << "1" << endl;
cout << "0" << endl;
} else if (v.size() == 2)
cout << "2" << endl;
else {
cout << "1" << endl;
cout << v[0] * v[1] << endl;
}
}
|
#include <bits/stdc++.h>
int rr[] = {0, 0, 1, -1};
using namespace std;
int main() {
long long int q, q1, i, cnt, f;
while (cin >> q) {
if (q == 1) {
cout << "1" << endl << "0" << endl;
continue;
}
q1 = q;
for (i = 2, cnt = 0, f = 0; i * i <= q; i++) {
if (q % i == 0) {
cnt++;
q = q / i;
f = 1;
if (cnt == 2) break;
i = 1;
}
}
if (cnt == 0 || cnt == 2) {
cout << "1" << endl;
if (f == 0)
cout << "0" << endl;
else
cout << q1 / q << endl;
} else
cout << "2" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long q;
cin >> q;
vector<long long> v1;
for (long long i = 2; i <= sqrt(q);) {
if (q % i == 0) {
v1.push_back(i);
q = q / i;
} else
i++;
}
if (q > 1) v1.push_back(q);
if (v1.size() <= 1)
cout << 1 << "\n" << 0;
else if (v1.size() == 2)
cout << 2;
else {
cout << 1 << "\n" << v1[0] * v1[1];
}
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); }
vector<long long> G;
int main() {
long long N;
while (cin >> N) {
G.clear();
for (long long i = 2; i * i <= N; i++)
while (N % i == 0) {
G.push_back(i);
N /= i;
}
if (N > 1) G.push_back(N);
if (G.size() < 2)
cout << 1 << endl << 0 << endl;
else if (G.size() == 2)
cout << 2 << endl;
else
cout << 1 << endl << G[0] * G[1] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> primeFactors(long long n) {
vector<long long> res;
while (n % 2 == 0) {
res.push_back(2);
n = n / 2;
}
for (int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
res.push_back(i);
n = n / i;
}
}
if (n > 2) res.push_back(n);
return res;
}
int main() {
long long n;
cin >> n;
vector<long long> res = primeFactors(n);
if (res.size() <= 1) {
cout << "1\n0\n";
return 0;
}
if (res.size() == 2) {
cout << "2\n";
return 0;
}
long long ans = 1;
for (long long i = 0; i < 2; ++i) {
ans *= res[i];
}
cout << "1\n";
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long q, p1 = -1, p2 = -1;
cin >> q;
long long r = q;
for (long long i = 2; i <= sqrt(q); i++) {
while (q % i == 0) {
q /= i;
if (p1 == -1)
p1 = i;
else if (p2 == -1)
p2 = i;
if (p2 != -1 and p1 * p2 != r) {
cout << 1 << endl;
cout << p1 * p2;
return;
}
}
}
if (p1 != -1)
cout << 2;
else {
cout << 1 << endl;
cout << 0;
}
}
int main() {
long long t = 1;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mx = 200009;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
long long n;
cin >> n;
vector<pair<long long, long long> > v;
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
long long cnt = 0;
while (n % i == 0) cnt++, n /= i;
v.push_back(make_pair(cnt, i));
}
}
if (n > 1) v.push_back(make_pair(1, n));
long long sum = 0;
for (auto x : v) sum += x.first;
if (sum <= 1) {
cout << 1 << '\n';
cout << 0 << '\n';
} else if (sum == 2)
cout << 2 << '\n';
else {
cout << 1 << '\n';
long long val = 1;
if (v[0].first == 1) {
val = v[0].second * v[1].second;
} else
val = powl(v[0].second, 2);
cout << val << '\n';
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int N = 1e5 + 5, M = 1e4 + 5, OO = 0x3f3f3f3f, MOD = 1e9 + 7;
long long n;
vector<long long> factorize(long long x) {
int d = 1;
vector<long long> ret;
for (long long i = 2; i * i <= x && (int)(ret).size() <= 3; i += d, d = 2) {
while (x % i == 0) ret.push_back(i), x /= i;
}
if (x != 1) ret.push_back(x);
return ret;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
vector<long long> v = factorize(n);
if ((int)(v).size() <= 1)
cout << "1\n0";
else if ((int)(v).size() == 2)
cout << 2;
else
cout << 1 << endl << v[0] * v[1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
map<long long, long long> m;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
m[i]++;
n /= i;
}
}
if (n > 1) m[n]++;
long long s = 0, ans = 1, p = 0;
if (m.size() == 0) {
cout << 1 << '\n' << 0;
return;
}
for (auto i : m) {
s += i.second;
if (p < 2) {
if (i.second > 1)
ans = i.first * i.first, p = 2;
else
ans *= i.first, p++;
}
}
if (s > 2) {
cout << 1 << '\n' << ans << '\n';
return;
}
if (s == 2) {
cout << 2 << '\n';
return;
}
if (s == 1) {
cout << 1 << '\n' << 0;
return;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long i, n;
cin >> n;
vector<long long> v;
for (i = 2; i <= sqrt(n); i++) {
while (n % i == 0) {
n /= i;
v.push_back(i);
}
}
if (n > 1) v.push_back(n);
if (v.size() > 2) {
cout << 1 << "\n";
cout << v[0] * v[1];
return 0;
}
if (v.size() <= 1) {
cout << 1 << "\n" << 0;
return 0;
}
cout << 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int prim(long long x) {
long long r = sqrt(x);
for (long long i = 2; i <= r; ++i)
if (x % i == 0) return 0;
return 1;
}
int main() {
long long q;
long long i = 2;
int nr = 0;
cin >> q;
if (q == 1) {
cout << 1 << "\n" << 0 << '\n';
return 0;
}
int fst = 2;
if (prim(q)) {
cout << 1 << "\n" << 0 << '\n';
return 0;
}
vector<long long> sol;
long long x = q;
long long last = q;
while (q > 1 && nr < 2) {
while (q % i == 0 && nr < 2) {
++nr;
sol.push_back(i);
q /= i;
}
if (last != q && nr < 2 && prim(q)) {
++nr;
sol.push_back(q);
q = 1;
}
last = q;
++i;
}
long long p = sol[0] * sol[1];
if (q == 1)
cout << 2 << "\n";
else
cout << 1 << '\n' << p << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
string tostr(const T& t) {
ostringstream os;
os << t;
return os.str();
}
long long N;
vector<long long> getfactors(long long n) {
set<long long> s;
for (long long i = 1; i * i <= n; ++i) {
if ((n % i) == 0) {
if (i != 1 && i != n) s.insert(i);
long long x = n / i;
if (x != 1 && x != n) s.insert(x);
}
}
return vector<long long>((s).begin(), (s).end());
}
map<long long, bool> memo;
bool go(int x) {
vector<long long> f = getfactors(x);
if ((int)f.size() == 0) {
return true;
}
bool& ref = memo[x];
bool allWin = true;
for (int i = (int)(0); i <= (int)((int)f.size() - 1); ++i) {
bool win = go(f[i]);
if (!win) {
allWin = false;
}
}
if (allWin)
ref = false;
else
ref = true;
return ref;
}
int main() {
cin >> N;
vector<long long> f = getfactors(N);
if ((int)f.size() == 0) {
cout << "1" << endl;
cout << "0" << endl;
} else {
bool found = false;
for (int i = (int)(0); i <= (int)((int)f.size() - 1); ++i) {
memo.clear();
bool lose = !go(f[i]);
if (lose) {
found = true;
cout << "1" << endl;
cout << f[i] << endl;
break;
}
}
if (!found) cout << "2" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[300] = {0};
struct player {
int index;
int skill;
};
bool compare(player a, player b) { return a.skill < b.skill; }
int main() {
vector<long long int> rs;
long long int q;
cin >> q;
if (q == 1) {
cout << 1 << endl;
cout << 0 << endl;
} else {
for (long long int i = 2; i * i <= q; ++i) {
while (q % i == 0) {
rs.push_back(i);
q /= i;
}
}
if (q > 1) rs.push_back(q);
if (rs.size() == 1) {
cout << 1 << endl;
cout << 0 << endl;
} else if (rs.size() == 2) {
cout << 2 << endl;
} else {
cout << 1 << endl;
cout << rs[0] * rs[1] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long least_prime_factor(long long x) {
long long lim = sqrt(x);
for (int i = int(2); i <= int(lim); i++) {
if (x % i == 0) return i;
}
return x;
}
vector<long long> prime_factorise(long long x) {
vector<long long> ans;
while (x > 1) {
ans.push_back(least_prime_factor(x));
x /= ans.back();
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long q;
cin >> q;
vector<long long> factors = prime_factorise(q);
if (factors.size() <= 1) {
cout << 1 << '\n';
cout << 0 << '\n';
} else if (factors.size() == 2) {
cout << 2 << '\n';
} else {
cout << 1 << '\n';
cout << factors[0] * factors[1] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long long q;
scanf("%I64d", &q);
long long i, p1 = 0, p2 = 0;
for (i = 2; i * i <= q; i++)
if (q % i == 0) {
q /= i;
p1 = i;
break;
}
for (i = 2; i * i <= q; i++)
if (q % i == 0) {
q /= i;
p2 = i;
break;
}
if (p1 == 0)
puts("1\n0");
else if (p2 == 0)
puts("2");
else
printf("1\n%I64d\n", p1 * p2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MX = 100000;
const long long MOD = 1000000007;
const int inf = 222222222;
long long fast_exp(long long base, long long exp, long long mod) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1) res = (res * base) % mod;
base = (base * base) % mod;
exp /= 2;
}
return res;
}
long long temp;
bool isprime(long long q) {
for (long long i = 2; i * i <= q; i++) {
if (!(q % i)) {
temp = i;
return false;
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long q;
cin >> q;
if (isprime(q)) {
cout << 1 << "\n" << 0;
return 0;
} else {
long long t = temp;
if (isprime(q / temp))
cout << 2 << "\n";
else
cout << 1 << "\n" << (t * temp) << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long q, c, i;
cin >> q;
if (q == 1) {
cout << "1" << endl;
cout << "0";
return 0;
}
vector<pair<long long, long long>> a;
for (i = 2; i * i <= q; i++) {
if (q % i == 0) {
c = 0;
while (q % i == 0) {
c++;
q = q / i;
}
a.push_back({i, c});
}
}
if (q > 1) {
a.push_back({q, 1});
}
if (a.size() == 1) {
if (a[0].second == 2) {
cout << "2" << endl;
} else {
cout << "1" << endl;
if (a[0].second == 1) {
cout << "0";
} else {
cout << (a[0].first) * (a[0].first);
}
}
} else if (a.size() == 2) {
if (a[0].second == 1 && a[1].second == 1) {
cout << "2" << endl;
} else {
cout << "1" << endl;
cout << (a[0].first) * (a[1].first);
}
} else {
cout << "1" << endl;
cout << (a[0].first) * (a[1].first);
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
const int OO = (int)1e9 + 7;
const long long OOO = (long long)1e18 + 7;
const int MAX = 3009;
char c1, c2, c3;
string s, s1, s2, s3;
long long n, m, k, t, a, b, c, d, e, f, x, y, z, sol, ans = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
vector<int> v;
for (long long i = 2; i * i <= n; i++) {
if ((int)v.size() > 2) break;
while (n % i == 0) {
v.push_back(i);
n /= i;
}
}
if (n != 1) v.push_back(n);
if ((int)v.size() < 2)
cout << "1\n0";
else if ((int)v.size() < 3)
cout << "2";
else
cout << "1\n" << v[0] * v[1];
cout << "\n\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
constexpr int INF = 1e9 + 1;
constexpr long long LLINF = 1e18 + 1;
template <typename T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
template <typename T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
map<long long, pair<int, long long> > dp;
pair<int, long long> rec(long long n) {
if (dp.find(n) != dp.end()) return dp[n];
long long sq = ceil(sqrt(n));
int cnt = 0;
pair<int, long long> ret;
for (int i = 2; i < n && i <= sq; i++)
if (n % i == 0) {
;
ret = rec(i);
cnt++;
if (ret.first == 0) return dp[n] = pair<int, long long>(1, i);
ret = rec(n / i);
cnt++;
if (ret.first == 0) return dp[n] = pair<int, long long>(1, n / i);
}
return dp[n] =
(cnt ? pair<int, long long>(0, -1) : pair<int, long long>(1, 0));
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
long long n;
while (cin >> n) {
pair<int, long long> ans = rec(n);
ans.first ? printf("1\n") : printf("2\n");
if (ans.first) printf("%lld\n", ans.second);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long Q, q;
cin >> Q;
q = Q;
bool isPrime = true;
int primeNumber = 2;
int sNo = sqrtl(q);
long long pOne = -1, pTwo = -1;
int countOne = 0, countTwo = 0;
while (primeNumber <= sNo && q > 1) {
while (q > 1 && q % primeNumber == 0) {
if (pOne == -1)
pOne = primeNumber;
else if (pOne != primeNumber)
pTwo = primeNumber;
if (primeNumber == pOne)
countOne++;
else
countTwo++;
q /= primeNumber;
}
primeNumber++;
}
if (pOne == -1 && pTwo == -1)
cout << "1\n0";
else if (pOne != -1 && pTwo == -1) {
if (countOne > 2) {
cout << "1\n";
cout << pOne * pOne;
} else if (countOne < 2)
cout << '2';
else {
if (pOne * pOne == Q)
cout << '2';
else {
cout << "1\n";
cout << pOne * pOne;
}
}
} else {
cout << "1\n";
cout << pOne * pTwo;
}
cout << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long q, p[2], t = 0;
cin >> q;
for (long long i = 2; i * i <= q; ++i) {
if (t == 2) break;
if (!(q % i) && t < 2 && q > i) {
p[t++] = i;
q /= i;
i--;
}
}
if (t == 2)
cout << 1 << "\n" << p[0] * p[1];
else if (t == 1)
cout << 2;
else
cout << 1 << "\n" << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, realn, j;
vector<long long> v;
cin >> n;
j = sqrt(n);
realn = n;
if (n == 1) {
cout << 1 << "\n" << 0;
return 0;
}
for (long long i = 2; i <= j; i++) {
while ((n / i) * i == n) {
v.push_back(i);
n /= i;
}
}
if (n > 1) v.push_back(n);
if (v.size() == 1)
cout << 1 << "\n" << 0;
else if (v.size() == 2)
cout << 2;
else {
cout << 1 << "\n" << v[0] * v[1];
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.