problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02899 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int N;
cin >> N;
vector<int> A(N), B(N);
rep(i, N) cin >> A[i];
rep(i, N) B[A[i - 1]] = i + 1;
rep(i, N) cout << B[i];
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
using namespace std;
#pragma endregion
signed main() {
int N;
cin >> N;
vector<int> A(N), B(N);
rep(i, N) cin >> A[i];
rep(i, N) B[A[i] - 1] = i + 1;
rep(i, N) cout << B[i] << " ";
} | replace | 32 | 34 | 32 | 34 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
cin >> n;
vector<int> a(10000), ans(10000, 0);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
ans.at(a.at(i) - 1) += i + 1;
}
for (int i = 0; i < n; i++) {
cout << ans.at(i) << " ";
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
cin >> n;
vector<int> a(n), ans(n, 0);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
ans.at(a.at(i) - 1) += i + 1;
}
for (int i = 0; i < n; i++) {
cout << ans.at(i) << " ";
}
cout << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
cin >> a;
vector<int> vec(a);
vector<int> mvec(a);
rep(i, a) { cin >> vec.at(i); }
rep(i, a) { mvec.at(vec.at(i)) = i + 1; }
rep(i, a) { cout << vec.at(i) << endl; }
}
| #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
cin >> a;
vector<int> vec(a);
vector<int> mvec(a);
rep(i, a) { cin >> vec.at(i); }
rep(i, a) { mvec.at(vec.at(i) - 1) = i + 1; }
rep(i, a) { cout << mvec.at(i) << endl; }
}
| replace | 11 | 13 | 11 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<int> ans(N);
for (int i = 1; i <= N; i++) {
for (int j = 0; j < N; j++) {
if (vec.at(j) != i) {
continue;
}
if (vec.at(j) == i) {
ans.at(i - 1) = j + 1;
break;
}
}
}
for (int i = 0; i < N; i++) {
if (i != N - 1)
cout << ans.at(i) << " ";
if (i == N - 1)
cout << ans.at(i) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<int> ans(N);
for (int i = 0; i < N; i++) {
ans.at(vec.at(i) - 1) = i + 1;
}
for (int i = 0; i < N; i++) {
if (i != N - 1)
cout << ans.at(i) << " ";
if (i == N - 1)
cout << ans.at(i) << endl;
}
} | replace | 12 | 22 | 12 | 14 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(10001);
vector<int> b(10001);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
b.at(a.at(i) - 1) = i + 1;
for (int i = 0; i < n; i++)
cout << b.at(i) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(100001);
vector<int> b(100001);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
b.at(a.at(i) - 1) = i + 1;
for (int i = 0; i < n; i++)
cout << b.at(i) << endl;
} | replace | 6 | 8 | 6 | 8 | 0 | |
p02899 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), ans(N);
for (int i = 1; i <= N; ++i) {
int n;
cin >> n;
A[n] = i;
}
for (int i = 0; i < N; ++i) {
cout << A[i] << " ";
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), ans(N);
for (int i = 1; i <= N; ++i) {
int n;
cin >> n;
A[n - 1] = i;
}
for (int i = 0; i < N; ++i) {
cout << A[i] << " ";
}
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], num[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (A[j] == i + 1) {
cout << j + 1 << ' ';
}
}
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], num[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
num[A[i] - 1] = i + 1;
}
for (int i = 0; i < N; i++) {
cout << num[i] << ' ';
}
cout << endl;
return 0;
} | replace | 11 | 16 | 11 | 15 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> seito(n);
for (int i = 0; i < n; i++) {
cin >> seito.at(i);
}
for (int i = 1; i < n + 1; i++) {
for (int j = 0; j < n; j++) {
if (i == seito.at(j)) {
if (i == n) {
cout << j + 1 << endl;
break;
} else {
cout << j + 1 << " ";
break;
}
}
}
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> seito(n);
for (int i = 0; i < n; i++) {
cin >> seito.at(i);
}
vector<int> ans(n);
for (int i = 0; i < n; i++) {
ans.at(seito.at(i) - 1) = i;
}
for (int i = 0; i < n; i++) {
cout << ans.at(i) + 1 << " ";
}
cout << endl;
}
| replace | 12 | 24 | 12 | 19 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 1; i <= N; i++) {
for (int j = 0; j < N; j++) {
if (A.at(j) == i) {
cout << j + 1 << " ";
break;
}
}
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
B.at(A.at(i) - 1) = i + 1;
}
for (int i = 0; i < N; i++) {
cout << B.at(i) << " ";
}
cout << endl;
}
| replace | 10 | 17 | 10 | 16 | TLE | |
p02899 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1); // 3.1415926535897932384626433832795028...
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
ll fac[200005], finv[200005], inv[200005];
vector<ll> dij;
struct edge {
ll to, cost;
};
vector<vector<edge>> G;
ll mod_pow(ll a, ll b) {
ll res = 1, mul = a;
for (int i = 0; i < 31; ++i) {
if (b >> i & 1) {
res *= mul;
res %= MOD;
}
mul = (mul * mul) % MOD;
}
return res;
}
void addedge(int from, int to, int cost) {
G[from].push_back({to, cost});
G[to].push_back({from, cost});
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <typename T> void outp(vector<T> v) {
for (int i = 0; i < v.size(); ++i) {
cout << v[i];
if (i != v.size() - 1) {
cout << " ";
}
}
}
double add(double a, double b) {
if (abs(a + b) < EPS * (abs(a) + abs(b))) {
return 0;
}
return a + b;
}
int main() {
int n, k[10005];
cin >> n;
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
cin >> k[i];
v.push_back(make_pair(k[i], i + 1));
}
sort(all(v));
for (auto i : v) {
cout << i.second << " ";
}
} | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1); // 3.1415926535897932384626433832795028...
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
ll fac[200005], finv[200005], inv[200005];
vector<ll> dij;
struct edge {
ll to, cost;
};
vector<vector<edge>> G;
ll mod_pow(ll a, ll b) {
ll res = 1, mul = a;
for (int i = 0; i < 31; ++i) {
if (b >> i & 1) {
res *= mul;
res %= MOD;
}
mul = (mul * mul) % MOD;
}
return res;
}
void addedge(int from, int to, int cost) {
G[from].push_back({to, cost});
G[to].push_back({from, cost});
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <typename T> void outp(vector<T> v) {
for (int i = 0; i < v.size(); ++i) {
cout << v[i];
if (i != v.size() - 1) {
cout << " ";
}
}
}
double add(double a, double b) {
if (abs(a + b) < EPS * (abs(a) + abs(b))) {
return 0;
}
return a + b;
}
int main() {
int n, k[100005];
cin >> n;
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
cin >> k[i];
v.push_back(make_pair(k[i], i + 1));
}
sort(all(v));
for (auto i : v) {
cout << i.second << " ";
}
}
| replace | 71 | 72 | 71 | 72 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end() // 使うときはsort(all())という感じで
using ll = long long;
#define PI 3.14159265359
int main() {
int n;
cin >> n;
vector<int> num(n), ans(n + 1, 0);
rep(i, n) {
cin >> num[i + 1];
ans[num[i + 1]] = i + 1;
}
rep(i, n - 1) { cout << ans[i + 1] << ' '; }
cout << ans[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end() // 使うときはsort(all())という感じで
using ll = long long;
#define PI 3.14159265359
int main() {
int n;
cin >> n;
vector<int> num(n + 1, 0), ans(n + 1, 0);
rep(i, n) {
cin >> num[i + 1];
ans[num[i + 1]] = i + 1;
}
rep(i, n - 1) { cout << ans[i + 1] << ' '; }
cout << ans[n] << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, order;
// input
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
// calc
for (int i = 0; i < N; i++) {
order = i + 1;
for (int j = 0; j < N; j++) {
if (A.at(j) == order) {
B.at(i) = j + 1;
break;
} else
;
}
}
// output
for (int i = 0; i < N; i++) {
cout << B.at(i) << " ";
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, order;
// input
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
B.at(A.at(i) - 1) = i + 1;
}
// output
for (int i = 0; i < N; i++) {
cout << B.at(i) << " ";
}
cout << endl;
}
| replace | 12 | 24 | 12 | 13 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 1; i < N + 1; i++) {
std::vector<int>::iterator itr = std::find(A.begin(), A.end(), i);
cout << std::distance(A.begin(), itr) + 1 << " ";
}
cout << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
B[A[i] - 1] = i + 1;
}
for (int i = 0; i < N; i++) {
cout << B[i] << " ";
}
cout << endl;
} | replace | 15 | 18 | 15 | 22 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
A.push_back(a);
}
vector<int> Ranking;
for (int rank = 1; rank <= n; rank++) {
for (int i = 0; i < n; i++) {
if (rank == A[i]) {
Ranking.push_back(i + 1);
}
}
}
for (int i = 0; i < n; i++) {
cout << Ranking[i] << " ";
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
A.push_back(a);
}
vector<int> Ranking(n, 0);
for (int i = 0; i < n; i++) {
Ranking[A[i] - 1] = i + 1;
}
for (int i = 0; i < n; i++) {
cout << Ranking[i] << " ";
}
return 0;
} | replace | 16 | 23 | 16 | 19 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define ve vector
#define vii vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define sz size
#define len length
#define se second
const ll p = 31;
const ll mod = 67280421310721;
const ll N = 1000000 + 6;
#define M_PI 3.14159265358979323846
struct stu {
ll num_b4, stu;
};
bool comp(stu a, stu b) { return a.num_b4 < b.num_b4; }
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
int n;
cin >> n;
stu a[n];
int s;
for (int i = 0; i < n; i++) {
cin >> s;
a[i].num_b4 = s;
a[i].stu = i;
}
sort(a, a + n, comp);
for (int i = 0; i < n; i++) {
cout << a[i].stu + 1 << " ";
}
cout << '\n';
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define ve vector
#define vii vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define sz size
#define len length
#define se second
const ll p = 31;
const ll mod = 67280421310721;
const ll N = 1000000 + 6;
#define M_PI 3.14159265358979323846
struct stu {
ll num_b4, stu;
};
bool comp(stu a, stu b) { return a.num_b4 < b.num_b4; }
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
stu a[n];
int s;
for (int i = 0; i < n; i++) {
cin >> s;
a[i].num_b4 = s;
a[i].stu = i;
}
sort(a, a + n, comp);
for (int i = 0; i < n; i++) {
cout << a[i].stu + 1 << " ";
}
cout << '\n';
} | replace | 32 | 37 | 32 | 33 | -11 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[N], b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 1; i < N + 1; i++) {
for (int j = 0; j < N; j++) {
if (a[j] == i) {
b[i - 1] = j + 1;
break;
}
}
}
for (int i = 0; i < N; i++) {
cout << b[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[N], b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
b[a[i] - 1] = i + 1;
}
for (int i = 0; i < N; i++) {
cout << b[i] << endl;
}
return 0;
} | replace | 11 | 18 | 11 | 13 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
int main() {
using namespace std; // swap
int n, value;
cin >> n;
vector<int> vec(n + 1), ivec(n + 1);
for (int i = 1; i <= n; i++)
cin >> vec[i];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (i == vec[j]) {
ivec[i] = j;
j = n + 1;
}
for (int i = 1; i <= n; i++)
cout << ivec[i] << " ";
cout << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
int main() {
using namespace std; // swap
int n, value;
cin >> n;
vector<int> vec(n + 1), ivec(n + 1);
for (int i = 1; i <= n; i++)
cin >> vec[i];
for (int i = 1; i <= n; i++)
ivec[vec[i]] = i;
for (int i = 1; i <= n; i++)
cout << ivec[i] << " ";
cout << endl;
return 0;
} | replace | 12 | 17 | 12 | 13 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define M 1005
#define N 15
#define ll long long
int arr[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
arr[x] = i;
}
for (int i = 1; i <= n; i++)
cout << arr[i] << " ";
return 0;
}
/*
2 3
10 1
1
15 1
2
30 2
1 2
*/
| #include <bits/stdc++.h>
using namespace std;
#define N 100005
#define ll long long
int arr[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
arr[x] = i;
}
for (int i = 1; i <= n; i++)
cout << arr[i] << " ";
return 0;
}
/*
2 3
10 1
1
15 1
2
30 2
1 2
*/
| replace | 3 | 5 | 3 | 4 | 0 | |
p02899 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int N;
int main() {
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<int> rev(N);
rep(i, N) rev[A[i] - 1] = i++;
rep(i, N) cout << rev[i] << " ";
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int N;
int main() {
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<int> rev(N);
rep(i, N) rev[A[i] - 1] = i + 1;
rep(i, N) cout << rev[i] << " ";
return 0;
} | replace | 15 | 16 | 15 | 16 | -6 | double free or corruption (out)
|
p02899 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
struct Node {
int num;
int v;
} a[10010];
bool cmp(Node a, Node b) { return a.num < b.num; }
int n;
using namespace std;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].num;
a[i].v = i;
}
sort(a + 1, a + n + 1, cmp);
for (int i = 1; i <= n; i++) {
printf("%d ", a[i].v);
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
struct Node {
int num;
int v;
} a[100100];
bool cmp(Node a, Node b) { return a.num < b.num; }
int n;
using namespace std;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].num;
a[i].v = i;
}
sort(a + 1, a + n + 1, cmp);
for (int i = 1; i <= n; i++) {
printf("%d ", a[i].v);
}
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans(n);
rep(i, n) {
rep(j, n) {
if (a[j] == (i + 1)) {
ans[i] = (j + 1);
}
}
}
rep(i, n) cout << ans[i] << ' ';
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans(n);
rep(i, n) ans[a[i] - 1] = i + 1;
rep(i, n) cout << ans[i] << ' ';
cout << endl;
return 0;
} | replace | 11 | 18 | 11 | 12 | TLE | |
p02899 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, i, temp;
cin >> n;
int *brr = new int(n);
for (i = 0; i < n; i++) {
cin >> temp;
brr[temp - 1] = i + 1;
}
for (i = 0; i < n; i++) {
cout << brr[i] << ' ';
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, i, temp;
cin >> n;
int brr[100000];
for (i = 0; i < n; i++) {
cin >> temp;
brr[temp - 1] = i + 1;
}
for (i = 0; i < n; i++) {
cout << brr[i] << ' ';
}
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02899 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
b[a[i]] = i + 1;
}
for (int i = 0; i < n; i++) {
cout << b[i] << " " << endl;
}
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
b[a[i] - 1] = i + 1;
}
for (int i = 0; i < n; i++) {
cout << b[i] << " " << endl;
}
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
rep(i, N) {
auto iter = find(A.begin(), A.end(), i + 1);
auto index = distance(A.begin(), iter);
cout << index + 1 << " ";
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
map<int, int> order;
rep(i, N) { order[--A[i]] = i + 1; }
rep(i, N) { cout << order[i] << " "; }
cout << endl;
return 0;
} | replace | 10 | 15 | 10 | 13 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define maxim (ll)1000000000000
#define PB push_back
#define MP make_pair
using namespace std;
bool sortbysecond(const pair<ll, ll> &a, const pair<ll, ll> &b) {
if (a.second < b.second)
return true;
else
return false;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
ll n, a;
cin >> n;
vector<pair<ll, ll>> vp;
for (ll i = 1; i <= n; i++) {
cin >> a;
vp.PB(MP(i, a));
}
sort(vp.begin(), vp.end(), sortbysecond);
for (ll i = 0; i < n; i++)
cout << vp[i].first << " ";
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define maxim (ll)1000000000000
#define PB push_back
#define MP make_pair
using namespace std;
bool sortbysecond(const pair<ll, ll> &a, const pair<ll, ll> &b) {
if (a.second < b.second)
return true;
else
return false;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
ll n, a;
cin >> n;
vector<pair<ll, ll>> vp;
for (ll i = 1; i <= n; i++) {
cin >> a;
vp.PB(MP(i, a));
}
sort(vp.begin(), vp.end(), sortbysecond);
for (ll i = 0; i < n; i++)
cout << vp[i].first << " ";
cout << endl;
}
return 0;
} | replace | 14 | 18 | 14 | 15 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int a[10010] = {};
int b[10010] = {};
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
b[a[i]] = i;
}
for (int i = 1; i <= n; i++) {
cout << b[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int a[100100] = {};
int b[100100] = {};
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
b[a[i]] = i;
}
for (int i = 1; i <= n; i++) {
cout << b[i] << endl;
}
}
| replace | 4 | 6 | 4 | 6 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
using LL = long long;
template <typename T> using V = vector<T>;
using Vi = V<int>;
using Vll = V<LL>;
template <typename T1, typename T2> using P = pair<T1, T2>;
using Pii = P<int, int>;
LL GCD(LL a, LL b) {
LL t;
LL r;
if (a < b) {
t = a;
a = b;
b = t;
}
if (b == 0) {
return a;
}
while (a % b != 0) {
r = a % b;
a = b;
b = r;
}
return b;
}
P<Vll, Vll> primeFactor(LL n) {
Vll p, e;
LL m = n;
int c;
for (LL i = 2; i * i <= n; i++) {
if (m % i != 0) {
continue;
}
c = 0;
while (m % i == 0) {
c++;
m /= i;
}
p.pb(i);
e.pb(c);
}
if (m > 1) {
p.pb(m);
e.pb(1);
}
return mp(p, e);
}
int main() {
LL a, b;
cin >> a >> b;
LL gcd_ab = GCD(a, b);
Vll cds;
for (int i = 1; i <= gcd_ab; i++) {
if (gcd_ab % i == 0) {
cds.pb(i);
}
}
auto pf_gcd = primeFactor(gcd_ab);
cout << pf_gcd.fi.size() + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
using LL = long long;
template <typename T> using V = vector<T>;
using Vi = V<int>;
using Vll = V<LL>;
template <typename T1, typename T2> using P = pair<T1, T2>;
using Pii = P<int, int>;
LL GCD(LL a, LL b) {
LL t;
LL r;
if (a < b) {
t = a;
a = b;
b = t;
}
if (b == 0) {
return a;
}
while (a % b != 0) {
r = a % b;
a = b;
b = r;
}
return b;
}
P<Vll, Vll> primeFactor(LL n) {
Vll p, e;
LL m = n;
int c;
for (LL i = 2; i * i <= n; i++) {
if (m % i != 0) {
continue;
}
c = 0;
while (m % i == 0) {
c++;
m /= i;
}
p.pb(i);
e.pb(c);
}
if (m > 1) {
p.pb(m);
e.pb(1);
}
return mp(p, e);
}
int main() {
LL a, b;
cin >> a >> b;
LL gcd_ab = GCD(a, b);
auto pf_gcd = primeFactor(gcd_ab);
cout << pf_gcd.fi.size() + 1 << endl;
return 0;
} | delete | 69 | 76 | 69 | 69 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#define ll long long
#define MOD 1e9 + 7
#define MAX_V
ll euclid(ll a, ll b) {
ll temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (b < 1)
return -1;
if (a % b == 0)
return b;
return euclid(b, a % b);
}
int main() {
ll a, b;
cin >> a >> b;
ll max_koyakusu = euclid(a, b);
vector<ll> yakusu;
// cout<<max_koyakusu<<endl;
for (ll i = 1; (ll)sqrt(max_koyakusu); i++) {
if (max_koyakusu % i == 0) {
yakusu.push_back(max_koyakusu / i);
yakusu.push_back(i);
}
}
sort(yakusu.begin(), yakusu.end());
ll ans = 1;
ll gcd = 1;
if (yakusu[0] == 1 && yakusu[1] == 1) {
cout << "1" << endl;
return 0;
}
for (ll i = 1; i < yakusu.size(); i++) {
if (euclid(gcd, yakusu[i]) == 1) {
ans++;
gcd *= yakusu[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#define ll long long
#define MOD 1e9 + 7
#define MAX_V
ll euclid(ll a, ll b) {
ll temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (b < 1)
return -1;
if (a % b == 0)
return b;
return euclid(b, a % b);
}
int main() {
ll a, b;
cin >> a >> b;
ll max_koyakusu = euclid(a, b);
vector<ll> yakusu;
// cout<<max_koyakusu<<endl;
for (ll i = 1; i <= (ll)sqrt(max_koyakusu); i++) {
if (max_koyakusu % i == 0) {
yakusu.push_back(max_koyakusu / i);
yakusu.push_back(i);
}
}
sort(yakusu.begin(), yakusu.end());
ll ans = 1;
ll gcd = 1;
if (yakusu[0] == 1 && yakusu[1] == 1) {
cout << "1" << endl;
return 0;
}
for (ll i = 1; i < yakusu.size(); i++) {
if (euclid(gcd, yakusu[i]) == 1) {
ans++;
gcd *= yakusu[i];
}
}
cout << ans << endl;
return 0;
} | replace | 38 | 39 | 38 | 39 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
// #pragma GCC optimize("unroll-loops,no-stack-protector")
// #pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
const int INF32 = 1 << 30;
const ll INF64 = 1LL << 60;
int main() {
#ifndef ONLINE_JUDGE
freopen(".in.txt", "r", stdin);
freopen(".out.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
int ans = 0;
for (ll i = 1; i <= sqrtl(g); i++)
if (!(g % i)) {
bool p = 1;
for (ll j = 2; j <= sqrtl(i); j++)
if (!(i % j)) {
p = 0;
break;
}
if (p)
ans++;
if (g / i == i)
break;
p = 1;
for (ll j = 2; j <= sqrtl(g / i); j++)
if (!(g / i % j)) {
p = 0;
break;
}
if (p)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
// #pragma GCC optimize("unroll-loops,no-stack-protector")
// #pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
const int INF32 = 1 << 30;
const ll INF64 = 1LL << 60;
int main() {
// #ifndef ONLINE_JUDGE
// freopen(".in.txt", "r", stdin);
// freopen(".out.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
int ans = 0;
for (ll i = 1; i <= sqrtl(g); i++)
if (!(g % i)) {
bool p = 1;
for (ll j = 2; j <= sqrtl(i); j++)
if (!(i % j)) {
p = 0;
break;
}
if (p)
ans++;
if (g / i == i)
break;
p = 1;
for (ll j = 2; j <= sqrtl(g / i); j++)
if (!(g / i % j)) {
p = 0;
break;
}
if (p)
ans++;
}
cout << ans << endl;
return 0;
} | replace | 16 | 20 | 16 | 20 | 0 | |
p02900 | C++ | Time Limit Exceeded | /*
https://t.me/unstoppabIesoIvemachinechannel
*/
#pragma ARCENIY_KIRILLOV_POVELITEL_KROKODILOV
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC push_options
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC pop_options
// #pragma GCC target("popcnt")
// #pragma GCC target("sse4")
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define rng(a) a.begin(), a.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i > -1; i--)
#define rer(i, x, n) for (int i = x; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef long double ld;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
signed main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
map<int, int> fl;
for (int j = 2; j * j <= g; j++) {
if (g % j == 0) {
g /= j;
fl[j]++;
j--;
}
}
fl[g]++;
fl[1]++;
cout << fl.size();
}
| /*
https://t.me/unstoppabIesoIvemachinechannel
*/
#pragma ARCENIY_KIRILLOV_POVELITEL_KROKODILOV
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC push_options
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC pop_options
// #pragma GCC target("popcnt")
// #pragma GCC target("sse4")
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define rng(a) a.begin(), a.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i > -1; i--)
#define rer(i, x, n) for (int i = x; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef long double ld;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
signed main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
map<ll, int> fl;
for (ll j = 2; j * j <= g; j++) {
if (g % j == 0) {
g /= j;
fl[j]++;
j--;
}
}
fl[g]++;
fl[1]++;
cout << fl.size();
}
| replace | 44 | 46 | 44 | 46 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long int gcd(long long int x, long long int y) {
if (y == 0) {
return x;
}
return gcd(y, x % y);
}
int main(void) {
long long int A, B, ans = 1;
cin >> A >> B;
long long int hcf = gcd(A, B);
for (long long int i = 2; i <= hcf; i++) {
if (hcf % i == 0) {
ans++;
while (hcf % i == 0) {
hcf /= i;
}
}
}
if (hcf > 2) {
ans++;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long int gcd(long long int x, long long int y) {
if (y == 0) {
return x;
}
return gcd(y, x % y);
}
int main(void) {
long long int A, B, ans = 1;
cin >> A >> B;
long long int hcf = gcd(A, B);
for (long long int i = 2; i <= hcf / i; i++) {
if (hcf % i == 0) {
ans++;
while (hcf % i == 0) {
hcf /= i;
}
}
}
if (hcf > 2) {
ans++;
}
cout << ans << endl;
return 0;
} | replace | 21 | 22 | 21 | 22 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
vector<int> primes;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void prime_list() {
primes.push_back(2);
for (int i = 3; i <= 1000009; i += 2) {
int tmp = primes.size();
for (int j = 0; primes[j] * primes[j] <= i; j++) {
if (i % primes[j] == 0)
break;
if (j == tmp - 1)
primes.push_back(i);
}
}
}
int main() {
long long a, b, lgcd, cnt = 0;
cin >> a >> b;
lgcd = gcd(a, b);
for (int i = 2; i * i <= lgcd; i++) {
if (lgcd % i == 0)
cnt++;
while (lgcd % i == 0)
lgcd /= i;
}
if (lgcd != 1)
cnt++;
cout << cnt + 1 << endl;
} | #include <iostream>
#include <vector>
using namespace std;
vector<int> primes;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void prime_list() {
primes.push_back(2);
for (int i = 3; i <= 1000009; i += 2) {
int tmp = primes.size();
for (int j = 0; primes[j] * primes[j] <= i; j++) {
if (i % primes[j] == 0)
break;
if (j == tmp - 1)
primes.push_back(i);
}
}
}
int main() {
long long a, b, lgcd, cnt = 0;
cin >> a >> b;
lgcd = gcd(a, b);
for (long long i = 2; i * i <= lgcd; i++) {
if (lgcd % i == 0)
cnt++;
while (lgcd % i == 0)
lgcd /= i;
}
if (lgcd != 1)
cnt++;
cout << cnt + 1 << endl;
} | replace | 29 | 30 | 29 | 30 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n, m;
int ans = 1;
int main() {
scanf("%lld%lld", &n, &m);
for (int i = 2; i * i <= n; i++)
if (n % i == 0) {
while (n % i == 0)
n /= i;
if (m % i == 0)
ans++;
while (m % i == 0)
m /= i;
}
if (n != 1)
if (m % n == 0)
ans++;
printf("%d", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n, m;
int ans = 1;
int main() {
scanf("%lld%lld", &n, &m);
for (int i = 2; 1ll * i * i <= n; i++)
if (n % i == 0) {
while (n % i == 0)
n /= i;
if (m % i == 0)
ans++;
while (m % i == 0)
m /= i;
}
if (n != 1)
if (m % n == 0)
ans++;
printf("%d", ans);
return 0;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
/********************************************
This code belongs to Pranay Mishra
The following template belongs to Anil Kumar
*******************************************/
#define bolt \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define endl "\n"
typedef long long ll;
typedef long double ld;
const int mod = 1000000007;
bool isPrime(ll n) {
if (n == 0 || n == 1)
return false;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
ll factorial(ll n) { return (n == 1 || n == 0) ? 1 : n * factorial(n - 1); }
ll power(ll x, ll y) {
ll res = 1;
x = x % mod;
while (y > 0) {
if (y & 1)
res = ((res % mod) * (x % mod)) % mod;
y = y >> 1;
x = ((x % mod) * (x % mod)) % mod;
}
return res;
}
ll ncr(ll n, ll r) {
ll res = 1;
if (r > n)
return 0;
if (r > n - r)
r = n - r;
for (ll i = 0; i < r; i++) {
res = ((res % mod) * ((n - i) % mod)) % mod;
res = ((res % mod) * (power(i + 1, mod - 2)) % mod) % mod;
}
return res;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b) * b); }
ll max(ll a, ll b) {
ll ans = a > b ? a : b;
return ans;
}
ll min(ll a, ll b) {
ll ans = a < b ? a : b;
return ans;
}
/***********************************************************************/
/***********************************************************************/
int main() {
bolt;
ll a, b;
cin >> a >> b;
ll k = gcd(a, b);
ll i = 2;
vector<long long int> st;
if (k % 2 == 0) {
st.push_back(2);
while (k % 2 == 0) {
k /= 2;
}
}
for (int i = 3; i * i <= k; i += 2) {
if (k % i == 0) {
st.push_back(i);
while (k > 1 && k % i == 0) {
k /= i;
}
}
}
if (k > 1) {
st.push_back(k);
}
k = st.size() + 1;
cout << k;
}
| #include <bits/stdc++.h>
using namespace std;
/********************************************
This code belongs to Pranay Mishra
The following template belongs to Anil Kumar
*******************************************/
#define bolt \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define endl "\n"
typedef long long ll;
typedef long double ld;
const int mod = 1000000007;
bool isPrime(ll n) {
if (n == 0 || n == 1)
return false;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
ll factorial(ll n) { return (n == 1 || n == 0) ? 1 : n * factorial(n - 1); }
ll power(ll x, ll y) {
ll res = 1;
x = x % mod;
while (y > 0) {
if (y & 1)
res = ((res % mod) * (x % mod)) % mod;
y = y >> 1;
x = ((x % mod) * (x % mod)) % mod;
}
return res;
}
ll ncr(ll n, ll r) {
ll res = 1;
if (r > n)
return 0;
if (r > n - r)
r = n - r;
for (ll i = 0; i < r; i++) {
res = ((res % mod) * ((n - i) % mod)) % mod;
res = ((res % mod) * (power(i + 1, mod - 2)) % mod) % mod;
}
return res;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b) * b); }
ll max(ll a, ll b) {
ll ans = a > b ? a : b;
return ans;
}
ll min(ll a, ll b) {
ll ans = a < b ? a : b;
return ans;
}
/***********************************************************************/
/***********************************************************************/
int main() {
bolt;
ll a, b;
cin >> a >> b;
ll k = gcd(a, b);
ll i = 2;
vector<long long int> st;
if (k % 2 == 0) {
st.push_back(2);
while (k % 2 == 0) {
k /= 2;
}
}
for (ll i = 3; i * i <= k; i += 2) {
if (k % i == 0) {
st.push_back(i);
while (k > 1 && k % i == 0) {
k /= i;
}
}
}
if (k > 1) {
st.push_back(k);
}
k = st.size() + 1;
cout << k;
} | replace | 84 | 85 | 84 | 85 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
const int INF = 1001001001;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
vector<P> factorize(ll x) {
vector<P> res;
for (int i = 2; i * i <= x; ++i) {
if (x % i)
continue;
res.emplace_back(i, 0);
while (!(x % i)) {
res.back().second++;
x /= i;
}
}
if (x != 1)
res.emplace_back(x, 1);
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
auto primes = factorize(g);
cout << primes.size() + 1 << endl;
} | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
const int INF = 1001001001;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
vector<P> factorize(ll x) {
vector<P> res;
for (ll i = 2; i * i <= x; ++i) {
if (x % i)
continue;
res.emplace_back(i, 0);
while (!(x % i)) {
res.back().second++;
x /= i;
}
}
if (x != 1)
res.emplace_back(x, 1);
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
auto primes = factorize(g);
cout << primes.size() + 1 << endl;
} | replace | 26 | 27 | 26 | 27 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long int i = 0; i < n; i++)
#define P pair<long int, long int>
vector<P> prime;
long int gcd(long int x, long int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
void factorize(long int x) {
long int num = x;
for (int i = 2; i * i <= x; i++) {
if (num % i == 0) {
P p;
p.first = i;
p.second = 0;
while (num % i == 0) {
p.second++;
num /= i;
}
prime.push_back(p);
}
}
if (num > 1) {
P p;
p.first = num;
p.second = 1;
prime.push_back(p);
}
}
int main() {
long int a, b;
cin >> a >> b;
long int n = gcd(a, b);
factorize(n);
cout << prime.size() + 1 << endl;
}
| #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long int i = 0; i < n; i++)
#define P pair<long int, long int>
vector<P> prime;
long int gcd(long int x, long int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
void factorize(long int x) {
long int num = x;
for (long int i = 2; i * i <= x; i++) {
if (num % i == 0) {
P p;
p.first = i;
p.second = 0;
while (num % i == 0) {
p.second++;
num /= i;
}
prime.push_back(p);
}
}
if (num > 1) {
P p;
p.first = num;
p.second = 1;
prime.push_back(p);
}
}
int main() {
long int a, b;
cin >> a >> b;
long int n = gcd(a, b);
factorize(n);
cout << prime.size() + 1 << endl;
}
| replace | 23 | 24 | 23 | 24 | TLE | |
p02900 | C++ | Runtime Error | // 参加気分でさ
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
int Asq = sqrt(A);
int Bsq = sqrt(B);
int AL[1000001] = {};
AL[1] = 1;
int BL[1000001] = {};
BL[1] = 1;
for (int i = 2; i <= Asq; i++) {
while (A % i == 0) {
A /= i;
AL[i] = 1;
}
}
if (A <= 1000000)
AL[A] = 1;
for (int i = 2; i <= Bsq; i++) {
while (B % i == 0) {
B /= i;
BL[i] = 1;
}
}
if (B <= 1000000)
BL[A] = 1;
int kotae = 0;
rep1(i, 1000000) {
if (AL[i] && BL[i]) {
kotae++;
}
}
if (A > 1000000 && B > 1000000 && A == B)
kotae++;
cout << kotae << endl;
Would you please return 0;
} | // 参加気分でさ
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
int Asq = sqrt(A);
int Bsq = sqrt(B);
int AL[1000001] = {};
AL[1] = 1;
int BL[1000001] = {};
BL[1] = 1;
for (int i = 2; i <= Asq; i++) {
while (A % i == 0) {
A /= i;
AL[i] = 1;
}
}
if (A <= 1000000)
AL[A] = 1;
for (int i = 2; i <= Bsq; i++) {
while (B % i == 0) {
B /= i;
BL[i] = 1;
}
}
if (B <= 1000000)
BL[B] = 1;
int kotae = 0;
rep1(i, 1000000) {
if (AL[i] && BL[i]) {
kotae++;
}
}
if (A > 1000000 && B > 1000000 && A == B)
kotae++;
cout << kotae << endl;
Would you please return 0;
} | replace | 45 | 46 | 45 | 46 | 0 | |
p02900 | C++ | Runtime Error | #include <iomanip>
#include <iostream>
#include <map>
#include <utility>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
ll gcd(ll a, ll b) {
int x, y;
x = max(a, b);
y = min(a, b);
if (x % y == 0) {
return y;
} else {
gcd(y, x % y);
}
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
map<ll, ll> pf;
{ // 素因数分解
for (ll i = 2; i * i <= g; i++) {
while (g % i == 0) {
pf[i]++;
g /= i;
}
}
if (g != 1)
pf[g] = 1; // 最後の素因数を回収
}
cout << pf.size() + 1 << endl;
return 0;
} | #include <iomanip>
#include <iostream>
#include <map>
#include <utility>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
ll gcd(ll a, ll b) {
ll x, y;
x = max(a, b);
y = min(a, b);
if (x % y == 0) {
return y;
} else {
gcd(y, x % y);
}
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
map<ll, ll> pf;
{ // 素因数分解
for (ll i = 2; i * i <= g; i++) {
while (g % i == 0) {
pf[i]++;
g /= i;
}
}
if (g != 1)
pf[g] = 1; // 最後の素因数を回収
}
cout << pf.size() + 1 << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll gcdAB = gcd(A, B);
set<ll> st;
ll tmp = gcdAB;
for (int i = 2; i * i < gcdAB; i++) {
while (tmp % i == 0) {
tmp = tmp / i;
st.insert(i);
}
if (tmp == 1) {
break;
}
}
if (tmp > 1) {
st.insert(gcdAB);
}
cout << (st.size() + 1) << endl;
// for(auto itr = st.begin(); itr != st.end(); itr++){
// cout << *itr << endl;
// }
// for(auto itr = sB.begin(); itr != sB.end(); itr++){
// cout << *itr << endl;
// }
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll gcdAB = gcd(A, B);
set<ll> st;
ll tmp = gcdAB;
for (ll i = 2; i * i < gcdAB; i++) {
while (tmp % i == 0) {
tmp = tmp / i;
st.insert(i);
}
if (tmp == 1) {
break;
}
}
if (tmp > 1) {
st.insert(gcdAB);
}
cout << (st.size() + 1) << endl;
// for(auto itr = st.begin(); itr != st.end(); itr++){
// cout << *itr << endl;
// }
// for(auto itr = sB.begin(); itr != sB.end(); itr++){
// cout << *itr << endl;
// }
return 0;
}
| replace | 51 | 52 | 51 | 52 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
typedef long long ll;
using namespace std;
const ll mod = 998244353;
template <class T> inline T lcm(T a, T b) { return (a * b / __gcd(a, b)); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
ll ans = 1;
for (int i = 2; i * i <= g; i++) {
if (g % i == 0) {
ans++;
while (g % i == 0) {
g /= i;
}
}
}
if (g != 1) {
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
typedef long long ll;
using namespace std;
const ll mod = 998244353;
template <class T> inline T lcm(T a, T b) { return (a * b / __gcd(a, b)); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
ll ans = 1;
for (ll i = 2; i * i <= g; i++) {
if (g % i == 0) {
ans++;
while (g % i == 0) {
g /= i;
}
}
}
if (g != 1) {
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 16 | 17 | 16 | 17 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) \
for (auto x : (V)) \
cout << x << " " << endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template <class T> struct edge {
int from, to;
T cost;
};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline T powerM(T a, T b) {
if (b == 0)
return 1;
T tmp = powerM(a, b / 2);
if (b % 2 == 0)
return tmp * tmp % MOD;
else
return tmp * tmp % MOD * a % MOD;
}
template <class T> inline T power(T a, T b, T m) {
if (b == 0)
return 1;
T tmp = power(a, b / 2, m);
if (b % 2 == 0)
return tmp * tmp % m;
else
return tmp * tmp % m * a % m;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
// ax+by=gcd(a,b)を解く
template <class T> inline T extgcd(T a, T b, T &x, T &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
T d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
void hey() { cout << "hey" << endl; }
// 素因数分解O(√n)--------------------------------------------
ll prime_factor(ll n) {
ll res = 0;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
res++;
while (n % i == 0)
n /= i;
}
if (n != 1)
res++;
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
// gを素因数分解して素因数の数+1が答え
ll res = 1 + prime_factor(g);
cout << res << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) \
for (auto x : (V)) \
cout << x << " " << endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template <class T> struct edge {
int from, to;
T cost;
};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline T powerM(T a, T b) {
if (b == 0)
return 1;
T tmp = powerM(a, b / 2);
if (b % 2 == 0)
return tmp * tmp % MOD;
else
return tmp * tmp % MOD * a % MOD;
}
template <class T> inline T power(T a, T b, T m) {
if (b == 0)
return 1;
T tmp = power(a, b / 2, m);
if (b % 2 == 0)
return tmp * tmp % m;
else
return tmp * tmp % m * a % m;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
// ax+by=gcd(a,b)を解く
template <class T> inline T extgcd(T a, T b, T &x, T &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
T d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
void hey() { cout << "hey" << endl; }
// 素因数分解O(√n)--------------------------------------------
ll prime_factor(ll n) {
ll res = 0;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
res++;
while (n % i == 0)
n /= i;
}
if (n != 1)
res++;
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
// gを素因数分解して素因数の数+1が答え
ll res = 1 + prime_factor(g);
cout << res << endl;
} | replace | 71 | 72 | 71 | 72 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <stdio.h>
#include <tuple>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
ll GCD(ll a, ll b) {
if (a < b)
swap(a, b);
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll a, b;
int main() {
scanf("%lld %lld", &a, &b);
ll G = GCD(a, b), d = G;
int count = 1;
for (int i = 2; i * i <= G && d != 1; i++) {
if (d % i)
continue;
count++;
while (!(d % i))
d /= i;
}
count += d != 1;
printf("%d\n", count);
} | #include <algorithm>
#include <stdio.h>
#include <tuple>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
ll GCD(ll a, ll b) {
if (a < b)
swap(a, b);
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll a, b;
int main() {
scanf("%lld %lld", &a, &b);
ll G = GCD(a, b), d = G;
int count = 1;
for (ll i = 2; i * i <= G && d != 1; i++) {
if (d % i)
continue;
count++;
while (!(d % i))
d /= i;
}
count += d != 1;
printf("%d\n", count);
} | replace | 21 | 22 | 21 | 22 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return (gcd(b, a % b));
}
int main() {
long long a, b, g, ans;
cin >> a >> b;
g = gcd(a, b);
map<int, int> mp;
for (int i = 2; i * i <= g; i++) {
if (g == 1)
break;
while (g % i == 0) {
g = g / i;
mp[i]++;
}
}
if (g != 1)
mp[g]++;
ans = mp.size() + 1;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return (gcd(b, a % b));
}
int main() {
long long a, b, g, ans;
cin >> a >> b;
g = gcd(a, b);
map<int, int> mp;
for (long long i = 2; i * i <= g; i++) {
if (g == 1)
break;
while (g % i == 0) {
g = g / i;
mp[i]++;
}
}
if (g != 1)
mp[g]++;
ans = mp.size() + 1;
cout << ans << endl;
return 0;
}
| replace | 22 | 23 | 22 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int a, b, c, i, ans;
int main() {
cin >> a >> b;
c = __gcd(a, b);
for (i = 2; i * i <= c; ++i) {
if (c % i == 0) {
++ans;
while (c % i == 0) {
c /= i;
}
}
}
if (c != 1) {
++ans;
}
cout << ans + 1;
} | #include <bits/stdc++.h>
using namespace std;
long a, b, c, i, ans;
int main() {
cin >> a >> b;
c = __gcd(a, b);
for (i = 2; i * i <= c; ++i) {
if (c % i == 0) {
++ans;
while (c % i == 0) {
c /= i;
}
}
}
if (c != 1) {
++ans;
}
cout << ans + 1;
} | replace | 2 | 3 | 2 | 3 | TLE | |
p02900 | C++ | Runtime Error | /* while(!cin.eof()) */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod (int)(1e9 + 7)
#define MAXI (int)(1e15 + 100)
#define N 1000500
// Driver code to test above functions
int32_t main() {
#ifndef ONLINE_JUDGE
// for getting input from inpu.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
// freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
n = __gcd(n, m);
int ans = 1;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
ans++;
while (n % i == 0)
n /= i;
}
}
if (n != 1)
ans++;
cout << ans;
return 0;
} | /* while(!cin.eof()) */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod (int)(1e9 + 7)
#define MAXI (int)(1e15 + 100)
#define N 1000500
// Driver code to test above functions
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
n = __gcd(n, m);
int ans = 1;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
ans++;
while (n % i == 0)
n /= i;
}
}
if (n != 1)
ans++;
cout << ans;
return 0;
} | delete | 11 | 18 | 11 | 11 | 0 | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod 1000000007
#define MAX 1000000000000000
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (i = (ll)a; i < (ll)b; i++)
#define revrep(i, a, b) for (i = (ll)a; i >= (ll)b; i--)
#define ii pair<ll, ll>
#define MP make_pair
#define pb push_back
#define f first
#define se second
#define ll long long int
#define vi vector<ll>
ll modexp(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b /= 2;
}
return res;
}
#define rs resize
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
OST;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
const ll N = 1e2 + 5;
ll i, j, a, b, ans;
vi v;
ll p[N];
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
a = __gcd(a, b);
for (i = 1; i <= sqrt(a); i += 1)
if (a % i == 0) {
v.pb(i);
if (a / i != i)
v.pb(a / i);
}
sort(all(v));
ans = 1;
for (i = 1; i < v.size(); i += 1)
if (p[i] == 0) {
ans += 1;
for (j = i + 1; j < v.size(); j += 1)
if (v[j] % v[i] == 0)
p[j] = 1;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod 1000000007
#define MAX 1000000000000000
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (i = (ll)a; i < (ll)b; i++)
#define revrep(i, a, b) for (i = (ll)a; i >= (ll)b; i--)
#define ii pair<ll, ll>
#define MP make_pair
#define pb push_back
#define f first
#define se second
#define ll long long int
#define vi vector<ll>
ll modexp(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b /= 2;
}
return res;
}
#define rs resize
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
OST;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
const ll N = 1e5 + 2;
ll i, j, a, b, ans;
vi v;
ll p[N];
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
a = __gcd(a, b);
for (i = 1; i <= sqrt(a); i += 1)
if (a % i == 0) {
v.pb(i);
if (a / i != i)
v.pb(a / i);
}
sort(all(v));
ans = 1;
for (i = 1; i < v.size(); i += 1)
if (p[i] == 0) {
ans += 1;
for (j = i + 1; j < v.size(); j += 1)
if (v[j] % v[i] == 0)
p[j] = 1;
}
cout << ans;
return 0;
} | replace | 49 | 50 | 49 | 50 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << #x << ": " << x << '\n';
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, n, cnt = 1;
cin >> a >> b;
n = __gcd(a, b);
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
cnt++;
while (n % i == 0) {
n /= i;
}
}
}
if (n != 1)
cnt++;
cout << cnt << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << #x << ": " << x << '\n';
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, n, cnt = 1;
cin >> a >> b;
n = __gcd(a, b);
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
cnt++;
while (n % i == 0) {
n /= i;
}
}
}
if (n != 1)
cnt++;
cout << cnt << '\n';
}
| replace | 14 | 15 | 14 | 15 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int GCD(int a, int b) {
if (a % b == 0)
return b;
return GCD(b, a % b);
}
// 素因数分解
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1)
res.push_back({N, 1});
return res;
}
int main() {
ll A, B;
cin >> A >> B;
ll g = GCD(A, B);
auto pf = prime_factorize(g);
ll ans = 1;
for (auto p : pf)
ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll GCD(ll a, ll b) {
if (a % b == 0)
return b;
return GCD(b, a % b);
}
// 素因数分解
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1)
res.push_back({N, 1});
return res;
}
int main() {
ll A, B;
cin >> A >> B;
ll g = GCD(A, B);
auto pf = prime_factorize(g);
ll ans = 1;
for (auto p : pf)
ans++;
cout << ans << endl;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
long long gcd(long long x, long long y) {
if (y)
return gcd(y, x % y);
else
return x;
}
int main() {
long long a, b;
cin >> a >> b;
long long g = gcd(a, b);
long long count = 1;
int i;
for (i = 2; i * i <= g; i++) {
if (g % i)
continue;
count++;
while (g % i == 0)
g /= i;
}
if (g >= i)
count++;
cout << count;
} | #include <iostream>
using namespace std;
long long gcd(long long x, long long y) {
if (y)
return gcd(y, x % y);
else
return x;
}
int main() {
long long a, b;
cin >> a >> b;
long long g = gcd(a, b);
long long i, count = 1;
for (i = 2; i * i <= g; i++) {
if (g % i)
continue;
count++;
while (g % i == 0)
g /= i;
}
if (g >= i)
count++;
cout << count;
} | replace | 15 | 17 | 15 | 16 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define IO_OP \
std::ios::sync_with_stdio(0); \
std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << " is " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;
const int INF = 1e9 + 7;
int32_t main() {
IO_OP;
ll a, b, g, ans = 1;
cin >> a >> b;
g = __gcd(a, b);
for (int i = 2; i * i <= g; i++) {
if (g % i)
continue;
ans++;
while (g % i == 0)
g /= i;
}
if (g != 1)
ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define IO_OP \
std::ios::sync_with_stdio(0); \
std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << " is " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;
const int INF = 1e9 + 7;
int32_t main() {
IO_OP;
ll a, b, g, ans = 1;
cin >> a >> b;
g = __gcd(a, b);
for (ll i = 2; i * i <= g; i++) {
if (g % i)
continue;
ans++;
while (g % i == 0)
g /= i;
}
if (g != 1)
ans++;
cout << ans << endl;
}
| replace | 27 | 28 | 27 | 28 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
typedef long long int ll;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T>
bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false;}
template<typename T>
bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false;}
// clang-format on
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
#include <set>
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
ll g = gcd(n, m);
set<ll> fact;
ll t = g;
for (int i = 2; i * i <= g; i++) {
while (t % i == 0) {
t /= i;
fact.insert(i);
}
}
if (t != 1) {
fact.insert(t);
}
cout << fact.size() + 1 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
typedef long long int ll;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T>
bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false;}
template<typename T>
bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false;}
// clang-format on
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
#include <set>
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
ll g = gcd(n, m);
set<ll> fact;
ll t = g;
for (ll i = 2; i * i <= g; i++) {
while (t % i == 0) {
t /= i;
fact.insert(i);
}
}
if (t != 1) {
fact.insert(t);
}
cout << fact.size() + 1 << endl;
return 0;
}
| replace | 42 | 43 | 42 | 43 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end()); // 昇順に並べる
return ret;
}
int main() {
long long ans = 1;
long long A, B;
cin >> A >> B;
long long MAX = max(A, B);
vector<long long> V(MAX + 1, 1), I;
V[1] = 0;
vector<long long> a = divisor(A), b = divisor(B);
set_intersection(a.begin(), a.end(), b.begin(), b.end(), back_inserter(I));
sort(I.begin(), I.end());
for (long long x : I) {
if (V[x] == 1) {
ans++;
long long y = x;
while (y <= MAX) {
V[y] = 0;
y += x;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end()); // 昇順に並べる
return ret;
}
int main() {
long long ans = 1;
long long A, B;
cin >> A >> B;
long long MIN = min(A, B), MAX = max(A, B);
vector<long long> a = divisor(MIN);
queue<long long> q;
for (long long x : a) {
if (MAX % x == 0)
q.push(x);
}
q.pop();
while (!q.empty()) {
long long x = q.front();
ans++;
long long s = q.size();
for (int i = 0; i < s; i++) {
long long y = q.front();
q.pop();
if (y % x != 0)
q.push(y);
}
}
cout << ans << endl;
} | replace | 19 | 33 | 19 | 36 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
long long calc_gcd(long long a, long long b) {
long long x = max(a, b), y = min(a, b);
if (y == 0) {
return x;
} else {
return calc_gcd(b, a % b);
}
}
int main() {
long long A, B;
cin >> A >> B;
long long gcd = calc_gcd(A, B);
// cout << "gcd: " << gcd << endl;
int ans = 1; // for 1
for (int i = 2; i * i <= gcd; i++) {
if (gcd % i == 0) {
ans++;
}
while (gcd % i == 0) {
gcd /= i;
}
}
if (gcd != 1) {
ans++;
}
cout << ans << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
long long calc_gcd(long long a, long long b) {
long long x = max(a, b), y = min(a, b);
if (y == 0) {
return x;
} else {
return calc_gcd(b, a % b);
}
}
int main() {
long long A, B;
cin >> A >> B;
long long gcd = calc_gcd(A, B);
// cout << "gcd: " << gcd << endl;
int ans = 1; // for 1
for (long long i = 2; i * i <= gcd; i++) {
if (gcd % i == 0) {
ans++;
}
while (gcd % i == 0) {
gcd /= i;
}
}
if (gcd != 1) {
ans++;
}
cout << ans << endl;
}
| replace | 21 | 22 | 21 | 22 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (int i = 2; i * i < n; ++i) {
ll num = 0;
if (n % i != 0)
continue;
while (n % i == 0) {
++num;
n /= i;
}
res.push_back(make_pair(i, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
int main() {
ll a, b;
cin >> a >> b;
ll x = gcd(a, b);
auto pf = prime_factorize(x);
cout << pf.size() + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (ll i = 2; i * i < n; ++i) {
ll num = 0;
if (n % i != 0)
continue;
while (n % i == 0) {
++num;
n /= i;
}
res.push_back(make_pair(i, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
int main() {
ll a, b;
cin >> a >> b;
ll x = gcd(a, b);
auto pf = prime_factorize(x);
cout << pf.size() + 1 << endl;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
ll gcd(int x, int y) {
if (x % y == 0)
return y;
else {
return gcd(y, x % y);
}
}
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i != 0)
continue;
ll num = 0;
while (n % i == 0) {
++num;
n /= i;
}
res.push_back(make_pair(i, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll x = gcd(a, b);
auto pf = prime_factorize(x);
cout << pf.size() + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
else {
return gcd(y, x % y);
}
}
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i != 0)
continue;
ll num = 0;
while (n % i == 0) {
++num;
n /= i;
}
res.push_back(make_pair(i, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll x = gcd(a, b);
auto pf = prime_factorize(x);
cout << pf.size() + 1 << endl;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
using namespace std;
set<int> pfact(int a) {
set<int> ret;
// cout<<1<<endl;
for (int i = 2; i * i <= a; i++) {
// cout<<i<<endl;
if (a % i == 0)
ret.insert(i);
while (a % i == 0)
a /= i;
}
// cout<<2<<endl;
if (a != 1) {
ret.insert(a);
}
return ret;
}
void solve() {
int a, b;
int cnt = 1;
cin >> a >> b;
// cout<<"ho"<<endl;
auto A = pfact(a);
auto B = pfact(b);
// cout<<"hei"<<endl;
for (auto it = A.begin(); it != A.end(); it++) {
if (B.find(*it) != B.end())
cnt++;
// cout<<*it<<endl;
}
cout << cnt << endl;
}
signed main() {
while (1)
solve();
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
set<int> pfact(int a) {
set<int> ret;
// cout<<1<<endl;
for (int i = 2; i * i <= a; i++) {
// cout<<i<<endl;
if (a % i == 0)
ret.insert(i);
while (a % i == 0)
a /= i;
}
// cout<<2<<endl;
if (a != 1) {
ret.insert(a);
}
return ret;
}
void solve() {
int a, b;
int cnt = 1;
cin >> a >> b;
// cout<<"ho"<<endl;
auto A = pfact(a);
auto B = pfact(b);
// cout<<"hei"<<endl;
for (auto it = A.begin(); it != A.end(); it++) {
if (B.find(*it) != B.end())
cnt++;
// cout<<*it<<endl;
}
cout << cnt << endl;
}
signed main() {
// while(1)
solve();
} | replace | 40 | 42 | 40 | 42 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int>>;
const ll LINF = 1LL << 60;
const int INF = 1 << 29;
const ll MOD = 1e9 + 7;
vector<ll> prime_fac(ll n) {
vector<ll> res;
for (int i = 2; i * i <= n; i++) {
bool ok = false;
while (n % i == 0) {
n /= i;
ok = true;
}
if (ok)
res.push_back(i);
}
if (n != 1)
res.push_back(n);
return res;
}
int main() {
ll A, B;
cin >> A >> B;
vector<bool> check(1001001, 0);
vector<ll> fac;
fac = prime_fac(A);
ll res = 0;
for (auto &x : fac) {
if (B % x == 0)
res++;
}
res++;
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int>>;
const ll LINF = 1LL << 60;
const int INF = 1 << 29;
const ll MOD = 1e9 + 7;
vector<ll> prime_fac(ll n) {
vector<ll> res;
for (ll i = 2; i * i <= n; i++) {
bool ok = false;
while (n % i == 0) {
n /= i;
ok = true;
}
if (ok)
res.push_back(i);
}
if (n != 1)
res.push_back(n);
return res;
}
int main() {
ll A, B;
cin >> A >> B;
vector<bool> check(1001001, 0);
vector<ll> fac;
fac = prime_fac(A);
ll res = 0;
for (auto &x : fac) {
if (B % x == 0)
res++;
}
res++;
cout << res << endl;
return 0;
} | replace | 18 | 19 | 18 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
vector<ll> factor(ll a) {
vector<ll> v;
for (int i = 2; i * i <= a; i++) {
if (a % i != 0)
continue;
while (a % i == 0)
a /= i;
v.push_back(i);
}
if (a > 1)
v.push_back(a);
return v;
}
int main() {
ll a, b;
cin >> a >> b;
map<ll, int> m;
for (auto e : factor(a))
m[e]++;
for (auto e : factor(b))
m[e]++;
int ans = 0;
for (auto &e : m)
if (e.second == 2)
ans++;
cout << ans + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
vector<ll> factor(ll a) {
vector<ll> v;
for (ll i = 2; i * i <= a; i++) {
if (a % i != 0)
continue;
while (a % i == 0)
a /= i;
v.push_back(i);
}
if (a > 1)
v.push_back(a);
return v;
}
int main() {
ll a, b;
cin >> a >> b;
map<ll, int> m;
for (auto e : factor(a))
m[e]++;
for (auto e : factor(b))
m[e]++;
int ans = 0;
for (auto &e : m)
if (e.second == 2)
ans++;
cout << ans + 1 << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h> // ver2.1.4
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define Pii pair<int, int>
#define Tiii tuple<int, int, int>
#define PQi priority_queue<int>
#define PQir priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define sortr(v) sort(v, greater<>())
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repeq(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define repreq(i, a, b) for (int i = a; i >= b; i--)
#define leng(n) (int)(log10(n) + 1)
#define dem(a, b) ((a + b - 1) / (b))
#define Vout(a) \
rep(i, 0, a.size() - 1) cout << a[i] << ' '; \
cout << a.back() << endl
#define INF 9000000000000000000 // 9.0 * 10^18
#define MOD 1000000007 // 10^9 + 7
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } // 最大公約数gcd
int lcm(int a, int b) { return a / gcd(a, b) * b; } // 最小公倍数lcm
int mypow(int x, int n, int m) { // 高速累乗x^n(mod m) O(log(n))
if (n == 0)
return 1;
if (n % 2 == 0)
return mypow(x * x % m, n / 2, m);
else
return x * mypow(x, n - 1, m) % m;
}
bool prime(int n) { // 素数判定
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
double s = sqrt(n);
for (int i = 3; i <= s; i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
#define N 1000000
int arr[N];
Vi Eratosthenes() {
Vi a(0);
for (int i = 0; i < N; i++) {
arr[i] = 1;
}
for (int i = 2; i < sqrt(N); i++) {
if (arr[i]) {
for (int j = 0; i * (j + 2) < N; j++) {
arr[i * (j + 2)] = 0;
}
}
}
for (int i = 2; i < N; i++) {
if (arr[i]) {
a.pb(i); // cout << i << endl;
}
}
return a;
}
signed main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int n, m;
cin >> n >> m;
int now = gcd(n, m);
/*Vi so(0);
repeq(i,2,1000000){
if(prime(i)) so.pb(i);
}*/
Vi so;
so = Eratosthenes();
int ans = 1;
rep(i, 0, so.size()) {
if (now % so[i] == 0) {
ans++;
while (now % so[i] == 0)
now %= so[i];
}
}
if (prime(now))
ans++;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h> // ver2.1.4
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define Pii pair<int, int>
#define Tiii tuple<int, int, int>
#define PQi priority_queue<int>
#define PQir priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define sortr(v) sort(v, greater<>())
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repeq(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, a, b) for (int i = a; i > b; i--)
#define repreq(i, a, b) for (int i = a; i >= b; i--)
#define leng(n) (int)(log10(n) + 1)
#define dem(a, b) ((a + b - 1) / (b))
#define Vout(a) \
rep(i, 0, a.size() - 1) cout << a[i] << ' '; \
cout << a.back() << endl
#define INF 9000000000000000000 // 9.0 * 10^18
#define MOD 1000000007 // 10^9 + 7
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } // 最大公約数gcd
int lcm(int a, int b) { return a / gcd(a, b) * b; } // 最小公倍数lcm
int mypow(int x, int n, int m) { // 高速累乗x^n(mod m) O(log(n))
if (n == 0)
return 1;
if (n % 2 == 0)
return mypow(x * x % m, n / 2, m);
else
return x * mypow(x, n - 1, m) % m;
}
bool prime(int n) { // 素数判定
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
double s = sqrt(n);
for (int i = 3; i <= s; i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
#define N 1000000
int arr[N];
Vi Eratosthenes() {
Vi a(0);
for (int i = 0; i < N; i++) {
arr[i] = 1;
}
for (int i = 2; i < sqrt(N); i++) {
if (arr[i]) {
for (int j = 0; i * (j + 2) < N; j++) {
arr[i * (j + 2)] = 0;
}
}
}
for (int i = 2; i < N; i++) {
if (arr[i]) {
a.pb(i); // cout << i << endl;
}
}
return a;
}
signed main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int n, m;
cin >> n >> m;
int now = gcd(n, m);
/*Vi so(0);
repeq(i,2,1000000){
if(prime(i)) so.pb(i);
}*/
Vi so;
so = Eratosthenes();
int ans = 1;
rep(i, 0, so.size()) {
if (now % so[i] == 0) {
ans++;
while (now % so[i] == 0)
now /= so[i];
}
}
if (prime(now))
ans++;
cout << ans << endl;
return 0;
} | replace | 102 | 103 | 102 | 103 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#define ppl pair<ll, ll>
#define all(x) x.begin(), x.end()
#define ii int, int
#define ff first
#define ss second
#define forn(i, a, b) for (int i = a; i < b; i++)
#define forr(i, a, b) for (int i = a; i >= b; i--)
#define forv(i, m) for (auto i : m)
#define imx INT_MAX
#define imn INT_MIN
#define inf LONG_MAX
#define minf LONG_MIN
#define endl "\n"
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define sze size()
#define rvs reverse
#define itr iterator
#define pre cout << fixed << setprecision(10);
#define umap unordered_map
#define uset unordered_set
#define pi 3.141592653589793
const ll infinity = 9e18;
/*
#define MODM(a,b,md) ((a%md)*(b%md))%md
#define MODA(a,b,md) ((a%md)+(b%md))%md
#define ull unsigned long long int
#define si short int
*/
/*
bool compare(int a,int b) {return a > b;}
bool compare1(ppi a,ppi b) {return a.ff > b.ff;}
bool compare2(ppi a,ppi b) {return a.ss < b.ss;}
ll Npower(ll a,ll b) {ll product = 1; while(b){if(b&1){product = product*a;}a =
a*a;b = b>>1;} return product;} ll power(ll a,ll b,ll md) {ll product = 1;
while(b){if(b&1){product = MODM(product,a,md);}a = MODM(a,a,md);b = b>>1;}
return product%md;} ll GCD(ll a,ll b) {return b==0 ? a:GCD(b,a%b);} ll LCM(ll
a,ll b) {return (a/GCD(a,b))*b; }
*/
bool isprime(ll n) {
if (n < 2)
return 0;
ll i = 2;
while (i * i <= n) {
if (n % i == 0)
return 0;
i++;
}
return 1;
}
int main() {
fast
ll a,
b;
cin >> a >> b;
ll n = __gcd(a, b);
ll count = 1;
int i = 1;
for (; i * i < n; i++) {
if (n % i == 0) {
if ((n / i) & 1 && isprime(n / i))
count++;
if (i & 1 && isprime(i))
count++;
if (i == 2)
count++;
}
}
if (i * i == n && isprime(i)) {
count++;
}
cout << count;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#define ppl pair<ll, ll>
#define all(x) x.begin(), x.end()
#define ii int, int
#define ff first
#define ss second
#define forn(i, a, b) for (int i = a; i < b; i++)
#define forr(i, a, b) for (int i = a; i >= b; i--)
#define forv(i, m) for (auto i : m)
#define imx INT_MAX
#define imn INT_MIN
#define inf LONG_MAX
#define minf LONG_MIN
#define endl "\n"
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define sze size()
#define rvs reverse
#define itr iterator
#define pre cout << fixed << setprecision(10);
#define umap unordered_map
#define uset unordered_set
#define pi 3.141592653589793
const ll infinity = 9e18;
/*
#define MODM(a,b,md) ((a%md)*(b%md))%md
#define MODA(a,b,md) ((a%md)+(b%md))%md
#define ull unsigned long long int
#define si short int
*/
/*
bool compare(int a,int b) {return a > b;}
bool compare1(ppi a,ppi b) {return a.ff > b.ff;}
bool compare2(ppi a,ppi b) {return a.ss < b.ss;}
ll Npower(ll a,ll b) {ll product = 1; while(b){if(b&1){product = product*a;}a =
a*a;b = b>>1;} return product;} ll power(ll a,ll b,ll md) {ll product = 1;
while(b){if(b&1){product = MODM(product,a,md);}a = MODM(a,a,md);b = b>>1;}
return product%md;} ll GCD(ll a,ll b) {return b==0 ? a:GCD(b,a%b);} ll LCM(ll
a,ll b) {return (a/GCD(a,b))*b; }
*/
bool isprime(ll n) {
if (n < 2)
return 0;
ll i = 2;
while (i * i <= n) {
if (n % i == 0)
return 0;
i++;
}
return 1;
}
int main() {
fast
ll a,
b;
cin >> a >> b;
ll n = __gcd(a, b);
ll count = 1;
ll i = 1;
for (; i * i < n; i++) {
if (n % i == 0) {
if ((n / i) & 1 && isprime(n / i))
count++;
if (i & 1 && isprime(i))
count++;
if (i == 2)
count++;
}
}
if (i * i == n && isprime(i)) {
count++;
}
cout << count;
return 0;
} | replace | 78 | 79 | 78 | 79 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
ans += to_string(*i) + " ";
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
#define fs first
#define sc second
const int INF = 1e9;
const ll LLINF = 1e16;
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T ngcd(vector<T> a) {
T res;
res = a[0];
for (int i = 1; i < a.size() && res != 1; i++) {
res = gcd(a[i], res);
}
return res;
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> T nlcm(vector<T> numbers) {
T res;
res = numbers[0];
for (int i = 1; i < numbers.size(); i++) {
res = lcm(res, numbers[i]);
}
return res;
}
// 素数判定
template <typename T> bool isPrime(T x) {
T i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i <= x; i += 2)
if (x % i == 0)
return 0;
return 1;
}
// 桁和
template <typename T> T digsum(T n) {
T res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
// 回文判定
bool kai(string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
};
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
// 割り算の切り上げ処理
template <typename T> T rp(T a, T b) { return (a + b - 1) / b; }
using pint = pair<int, int>;
using pll = pair<ll, ll>;
vector<pair<long long, long long>>
prime_factorize(long long n) { // 素因数分解、pairのfirstに底、secondに底の何乗
vector<pair<long long, long long>> res;
for (int p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
int main(void) {
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
ll a, b;
cin >> a >> b;
ll c = gcd(a, b);
vector<pll> fac = prime_factorize(c);
print(fac.size() + 1);
}
// int n;
// cin >> n;
// vector<int> test(n);
// cins(all(test));
// array_output(all(test)); | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (n); i < i##_len; ++i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
ans += to_string(*i) + " ";
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
#define fs first
#define sc second
const int INF = 1e9;
const ll LLINF = 1e16;
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T ngcd(vector<T> a) {
T res;
res = a[0];
for (int i = 1; i < a.size() && res != 1; i++) {
res = gcd(a[i], res);
}
return res;
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> T nlcm(vector<T> numbers) {
T res;
res = numbers[0];
for (int i = 1; i < numbers.size(); i++) {
res = lcm(res, numbers[i]);
}
return res;
}
// 素数判定
template <typename T> bool isPrime(T x) {
T i;
if (x < 2)
return 0;
else if (x == 2)
return 1;
if (x % 2 == 0)
return 0;
for (i = 3; i * i <= x; i += 2)
if (x % i == 0)
return 0;
return 1;
}
// 桁和
template <typename T> T digsum(T n) {
T res = 0;
while (n > 0) {
res += n % 10;
n /= 10;
}
return res;
}
// 回文判定
bool kai(string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
};
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) { return count(s.cbegin(), s.cend(), c); }
// 割り算の切り上げ処理
template <typename T> T rp(T a, T b) { return (a + b - 1) / b; }
using pint = pair<int, int>;
using pll = pair<ll, ll>;
vector<pair<long long, long long>>
prime_factorize(long long n) { // 素因数分解、pairのfirstに底、secondに底の何乗
vector<pair<long long, long long>> res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
int main(void) {
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
ll a, b;
cin >> a >> b;
ll c = gcd(a, b);
vector<pll> fac = prime_factorize(c);
print(fac.size() + 1);
}
// int n;
// cin >> n;
// vector<int> test(n);
// cins(all(test));
// array_output(all(test)); | replace | 138 | 139 | 138 | 139 | TLE | |
p02900 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long GCD(long long a, long long b) {
if (b == 0) {
return a;
}
GCD(b, a % b);
}
bool IsPrime(long long n) {
if (n == 1 || n == 2)
return true;
if (n % 2 == 0)
return false;
for (int ni = 3; ni <= sqrt(n); ni += 2) {
if (n % ni == 0) {
return false;
}
}
return true;
}
long long CntPrime(long long n) {
vector<long long> P(n + 1, 1);
P[0] = 0;
for (int ni = 2; ni <= sqrt(n); ni++) {
for (int mi = 2; ni * mi <= n; mi++) {
P[ni * mi] = 0;
}
}
long long cnt = 0;
for (int ni = 1; ni <= n; ni++) {
if (n % ni == 0 && P[ni] > 0) {
cnt++;
}
}
return cnt;
}
int main() {
long long A, B;
cin >> A >> B;
// long long gcd = GCD(max(A, B), min(A, B));
long long gcd;
long long a, b, c;
a = max(A, B);
b = min(A, B);
while (1) {
if (b == 0) {
gcd = a;
break;
}
c = a;
a = b;
b = c % b;
}
if (gcd == 1) {
std::cout << 1;
return 0;
}
/*
vector<long long> P(gcd + 1, 1);
P[0] = 0;
for (int ni = 2; ni <= sqrt(gcd); ni++) {
for (int mi = 2; ni * mi <= gcd; mi++) {
P[ni * mi] = 0;
}
}
*/
vector<long long> PFs;
PFs.push_back(1);
long long ni = 2;
long long tar = gcd;
while (1) {
/*
if (IsPrime(tar)) {
PFs.push_back(tar);
break;
}
*/
if (tar % ni == 0) {
PFs.push_back(ni);
while (tar % ni == 0) {
tar /= ni;
}
if (tar == 1)
break;
if (IsPrime(tar)) {
PFs.push_back(tar);
break;
}
}
ni++;
}
long long ans = PFs.size();
// printf("%.9f", ans);
std::cout << ans;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long GCD(long long a, long long b) {
if (b == 0) {
return a;
}
GCD(b, a % b);
}
bool IsPrime(long long n) {
if (n == 1 || n == 2)
return true;
if (n % 2 == 0)
return false;
for (int ni = 3; ni <= sqrt(n); ni += 2) {
if (n % ni == 0) {
return false;
}
}
return true;
}
long long CntPrime(long long n) {
vector<long long> P(n + 1, 1);
P[0] = 0;
for (int ni = 2; ni <= sqrt(n); ni++) {
for (int mi = 2; ni * mi <= n; mi++) {
P[ni * mi] = 0;
}
}
long long cnt = 0;
for (int ni = 1; ni <= n; ni++) {
if (n % ni == 0 && P[ni] > 0) {
cnt++;
}
}
return cnt;
}
int main() {
long long A, B;
cin >> A >> B;
// long long gcd = GCD(max(A, B), min(A, B));
long long gcd;
long long a, b, c;
a = max(A, B);
b = min(A, B);
while (1) {
if (b == 0) {
gcd = a;
break;
}
c = a;
a = b;
b = c % b;
}
if (gcd == 1) {
std::cout << 1;
return 0;
}
if (IsPrime(gcd)) {
std::cout << 2;
return 0;
}
/*
vector<long long> P(gcd + 1, 1);
P[0] = 0;
for (int ni = 2; ni <= sqrt(gcd); ni++) {
for (int mi = 2; ni * mi <= gcd; mi++) {
P[ni * mi] = 0;
}
}
*/
vector<long long> PFs;
PFs.push_back(1);
long long ni = 2;
long long tar = gcd;
while (1) {
/*
if (IsPrime(tar)) {
PFs.push_back(tar);
break;
}
*/
if (tar % ni == 0) {
PFs.push_back(ni);
while (tar % ni == 0) {
tar /= ni;
}
if (tar == 1)
break;
if (IsPrime(tar)) {
PFs.push_back(tar);
break;
}
}
ni++;
}
long long ans = PFs.size();
// printf("%.9f", ans);
std::cout << ans;
return 0;
}
| insert | 82 | 82 | 82 | 86 | TLE | |
p02900 | C++ | Time Limit Exceeded | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author TM
*/
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SIZE 100005
#define MOD 1000000007
#define INF 100000000
using namespace std;
class DDisjointSetOfCommonDivisors {
public:
void PrimeFactorize(int64_t N, set<int64_t> &vec) {
for (int i = 2; i * i <= N; i++) {
while (N % i == 0) {
vec.insert(i);
N /= i;
}
}
vec.insert(N);
vec.insert(1);
}
void solve(std::istream &cin, std::ostream &cout) {
long a, b;
cin >> a >> b;
set<int64_t> a_vec;
set<int64_t> b_vec;
PrimeFactorize(a, a_vec);
PrimeFactorize(b, b_vec);
int64_t cnt = 0;
for (const auto &a_item : a_vec) {
for (const auto &b_item : b_vec) {
if (a_item == b_item) {
cnt++;
}
}
}
cout << cnt << endl;
}
};
int main() {
DDisjointSetOfCommonDivisors solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author TM
*/
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SIZE 100005
#define MOD 1000000007
#define INF 100000000
using namespace std;
class DDisjointSetOfCommonDivisors {
public:
void PrimeFactorize(int64_t N, set<int64_t> &vec) {
for (int64_t i = 2; i * i <= N; i++) {
while (N % i == 0) {
vec.insert(i);
N /= i;
}
}
vec.insert(N);
vec.insert(1);
}
void solve(std::istream &cin, std::ostream &cout) {
long a, b;
cin >> a >> b;
set<int64_t> a_vec;
set<int64_t> b_vec;
PrimeFactorize(a, a_vec);
PrimeFactorize(b, b_vec);
int64_t cnt = 0;
for (const auto &a_item : a_vec) {
for (const auto &b_item : b_vec) {
if (a_item == b_item) {
cnt++;
}
}
}
cout << cnt << endl;
}
};
int main() {
DDisjointSetOfCommonDivisors solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| replace | 27 | 28 | 27 | 28 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
int main() {
long long a, b, ans = 0, k, i = 2;
cin >> a >> b;
k = (a > b ? gcd(a, b) : gcd(b, a));
while (k > 1) {
if (k % i == 0) {
ans++;
while (k % i == 0)
k /= i;
}
i++;
}
cout << ans + 1 << endl;
return 0;
} | #include <iostream>
using namespace std;
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
int main() {
long long a, b, ans = 0, k, i = 2;
cin >> a >> b;
k = (a > b ? gcd(a, b) : gcd(b, a));
while (k > 1) {
if (i * i > k) {
ans++;
break;
}
if (k % i == 0) {
ans++;
while (k % i == 0)
k /= i;
}
i++;
}
cout << ans + 1 << endl;
return 0;
} | insert | 9 | 9 | 9 | 13 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long a, b;
cin >> a >> b;
long long g = __gcd(a, b);
map<int, int> mp;
for (int i = 2; i * i <= g; i++) {
while (g % i == 0) {
mp[i]++;
g /= i;
}
}
if (g > 1)
mp[g]++;
cout << mp.size() + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long a, b;
cin >> a >> b;
long long g = __gcd(a, b);
map<int, int> mp;
for (int i = 2; (long long)i * i <= g; i++) {
while (g % i == 0) {
mp[i]++;
g /= i;
}
}
if (g > 1)
mp[g]++;
cout << mp.size() + 1 << endl;
}
| replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long llong;
// refering to exp.
int main() {
llong a, b;
cin >> a >> b;
llong n = __gcd(a, b);
llong cnt = 1;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
cnt++;
while (n % i == 0)
n /= i;
}
}
if (n != 1)
cnt++;
cout << cnt << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
typedef long long llong;
// refering to exp.
int main() {
llong a, b;
cin >> a >> b;
llong n = __gcd(a, b);
llong cnt = 1;
for (llong i = 2; i * i <= n; ++i) {
if (n % i == 0) {
cnt++;
while (n % i == 0)
n /= i;
}
}
if (n != 1)
cnt++;
cout << cnt << endl;
}
| replace | 12 | 13 | 12 | 13 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
signed main() {
int A, B, i;
scanf("%lld%lld", &A, &B);
int g = gcd(A, B);
int ans = 0;
for (i = 1; i * i <= g; i++) {
if (g % i == 0) {
while (g % i == 0) {
g /= i;
}
ans++;
}
}
if (g > 1) {
ans++;
}
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
signed main() {
int A, B, i;
scanf("%lld%lld", &A, &B);
int g = gcd(A, B);
int ans = 1;
for (i = 2; i * i <= g; i++) {
if (g % i == 0) {
while (g % i == 0) {
g /= i;
}
ans++;
}
}
if (g > 1) {
ans++;
}
printf("%lld\n", ans);
return 0;
} | replace | 16 | 18 | 16 | 18 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REAP(i, a, n) for (int i = (a); i < (n); i++)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define fr first
#define sc second
#define pb push_back
#define All(v) v.begin(), v.end()
typedef long long ll;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
ll c = gcd(a, b);
ll cou = 1;
for (int i = 2; i * i <= c; i++) {
if (c % i == 0) {
cou++;
while (c % i == 0) {
c /= i;
}
}
}
if (c != 1)
cou++;
cout << cou << endl;
}
| #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REAP(i, a, n) for (int i = (a); i < (n); i++)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define fr first
#define sc second
#define pb push_back
#define All(v) v.begin(), v.end()
typedef long long ll;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
ll c = gcd(a, b);
ll cou = 1;
for (ll i = 2; i * i <= c; i++) {
if (c % i == 0) {
cou++;
while (c % i == 0) {
c /= i;
}
}
}
if (c != 1)
cou++;
cout << cou << endl;
}
| replace | 28 | 29 | 28 | 29 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mp make_pair
#define pb push_back
#define fr first
#define se second
#define forn(i, a, n) for (int i = a; i < n; i++)
#define foreach(i, c) \
for (__typeof(c.begin()) i = (c.begin()); i != (c).end(); i++)
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define sz(s) s.size()
#define all(s) s.begin(), s.end()
#define zero(x) memset(x, 0, sizeof(x))
#define vii vector<pair<int, int>>
#define mpis map<int, string>
#define mpii map<int, int>
#define mpsi map<string, int>
#define re return
using namespace std;
long long a, b;
int main() {
cin >> a >> b;
long long gcd = __gcd(a, b);
if (gcd == 1) {
cout << 1;
return 0;
}
int ans = 1;
for (int i = 2; (long long)(i * i) <= gcd; i++) {
if (gcd % i == 0)
ans++;
while (gcd % i == 0)
gcd /= i;
}
if (gcd > 1)
cout << ans + 1;
else
cout << ans;
re 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mp make_pair
#define pb push_back
#define fr first
#define se second
#define forn(i, a, n) for (int i = a; i < n; i++)
#define foreach(i, c) \
for (__typeof(c.begin()) i = (c.begin()); i != (c).end(); i++)
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define sz(s) s.size()
#define all(s) s.begin(), s.end()
#define zero(x) memset(x, 0, sizeof(x))
#define vii vector<pair<int, int>>
#define mpis map<int, string>
#define mpii map<int, int>
#define mpsi map<string, int>
#define re return
using namespace std;
long long a, b;
int main() {
cin >> a >> b;
long long gcd = __gcd(a, b);
if (gcd == 1) {
cout << 1;
return 0;
}
long long ans = 1;
for (long long i = 2; (long long)(i * i) <= gcd; i++) {
if (gcd % i == 0)
ans++;
while (gcd % i == 0)
gcd /= i;
}
if (gcd > 1)
cout << ans + 1;
else
cout << ans;
re 0;
} | replace | 29 | 31 | 29 | 31 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
int tbl[1000010] = {};
vector<int> so;
signed main() {
int a, b;
cin >> a >> b;
for (int i = 2; i * i <= max(a, b); i++) {
if (tbl[i] == 0) {
so.push_back(i);
for (int j = i * 2; j <= max(a, b); j += i) {
tbl[i] = 1;
}
}
}
int idx = 0;
set<int> st;
int tmp = a;
while (1) {
if (tmp == 1)
break;
if (idx == so.size()) {
st.insert(tmp);
break;
}
if (tmp % so[idx] == 0) {
tmp /= so[idx];
st.insert(so[idx]);
} else {
idx++;
}
}
tmp = b;
int ans = 0;
idx = 0;
while (1) {
if (tmp == 1)
break;
if (idx == so.size()) {
if (st.find(tmp) != st.end()) {
st.erase(tmp);
ans++;
}
break;
}
if (tmp % so[idx] == 0) {
if (st.find(so[idx]) != st.end()) {
st.erase(so[idx]);
ans++;
}
tmp /= so[idx];
} else {
idx++;
}
}
cout << ans + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int tbl[1000010] = {};
vector<int> so;
signed main() {
int a, b;
cin >> a >> b;
for (int i = 2; i * i <= max(a, b); i++) {
if (tbl[i] == 0) {
so.push_back(i);
for (int j = i * 2; j * j <= max(a, b); j += i) {
tbl[i] = 1;
}
}
}
int idx = 0;
set<int> st;
int tmp = a;
while (1) {
if (tmp == 1)
break;
if (idx == so.size()) {
st.insert(tmp);
break;
}
if (tmp % so[idx] == 0) {
tmp /= so[idx];
st.insert(so[idx]);
} else {
idx++;
}
}
tmp = b;
int ans = 0;
idx = 0;
while (1) {
if (tmp == 1)
break;
if (idx == so.size()) {
if (st.find(tmp) != st.end()) {
st.erase(tmp);
ans++;
}
break;
}
if (tmp % so[idx] == 0) {
if (st.find(so[idx]) != st.end()) {
st.erase(so[idx]);
ans++;
}
tmp /= so[idx];
} else {
idx++;
}
}
cout << ans + 1 << endl;
return 0;
}
| replace | 16 | 17 | 16 | 17 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
long long AA, BB;
AA = A, BB = B;
long long k = 1;
long long j = 0;
while (k > 0) {
j = A / B;
k = A % B;
A = B;
B = k;
}
int count = 1;
long long E = A;
int x = max(sqrt(AA), sqrt(BB));
// cout<<x;
for (int i = 2; i < A - 1; i++) {
if (E % i == 0) {
while (E % i == 0) {
E = E / i;
}
count++;
}
if (E < i) {
break;
}
}
if (E > 1) {
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
long long AA, BB;
AA = A, BB = B;
long long k = 1;
long long j = 0;
while (k > 0) {
j = A / B;
k = A % B;
A = B;
B = k;
}
int count = 1;
long long E = A;
int x = max(sqrt(AA), sqrt(BB));
// cout<<x;
for (int i = 2; i < x; i++) {
if (E % i == 0) {
while (E % i == 0) {
E = E / i;
}
count++;
}
if (E < i) {
break;
}
}
if (E > 1) {
count++;
}
cout << count << endl;
} | replace | 20 | 21 | 20 | 21 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, b, a) for (int i = (b)-1; i >= 0; --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n)-1; i >= 0; --i)
#define ITER(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define SORT(v) sort(v.begin(), v.end())
#define REV(v) reverse(v.begin(), v.end())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
ll res = 1;
for (int i = 2; i * i <= g; ++i) {
if (g % i == 0)
++res;
while (g % i == 0)
g /= i;
}
if (g > 1)
++res;
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, b, a) for (int i = (b)-1; i >= 0; --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n)-1; i >= 0; --i)
#define ITER(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define SORT(v) sort(v.begin(), v.end())
#define REV(v) reverse(v.begin(), v.end())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
ll res = 1;
for (ll i = 2; i * i <= g; ++i) {
if (g % i == 0)
++res;
while (g % i == 0)
g /= i;
}
if (g > 1)
++res;
cout << res << endl;
return 0;
} | replace | 22 | 23 | 22 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define MAX_N 51
using namespace std;
// Aの約数とBの約数のから互いに素であるものを選んだ時の最大個数
// gcd(A,B)の因数のうち互いに素であるものの個数
// gcd(A,B)の素因数の個数
ll gcd(ll a, ll b) {
ll r;
while (b != 0) {
if (a < b)
swap(a, b);
r = a % b;
a = b;
b = r;
}
return a;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a, b;
cin >> a >> b;
ll d;
d = gcd(a, b);
map<ll, ll> pf;
pf = prime_factor(d);
ll ans = 1;
for (ll i = 0; i <= d; i++) {
ll t = 0;
if (pf.find(i) == pf.end())
continue;
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define MAX_N 51
using namespace std;
// Aの約数とBの約数のから互いに素であるものを選んだ時の最大個数
// gcd(A,B)の因数のうち互いに素であるものの個数
// gcd(A,B)の素因数の個数
ll gcd(ll a, ll b) {
ll r;
while (b != 0) {
if (a < b)
swap(a, b);
r = a % b;
a = b;
b = r;
}
return a;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll a, b;
cin >> a >> b;
ll d;
d = gcd(a, b);
map<ll, ll> pf;
pf = prime_factor(d);
ll ans = 1;
ans += pf.size();
cout << ans << endl;
return 0;
}
| replace | 44 | 50 | 44 | 46 | TLE | |
p02900 | C++ | Time Limit Exceeded | /**
* author: souzai32
* created: 13.08.2020 01:17:53
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
long gcd(long a, long b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
long lcm(long a, long b) { return a * b / gcd(a, b); }
int main() {
long a, b;
cin >> a >> b;
long num = gcd(a, b);
int count = 1;
for (int i = 2; i * i <= num; i++) {
if (num % i != 0)
continue;
while (num % i == 0) {
num /= i;
}
count++;
}
if (num != 1)
count++;
cout << count << endl;
return 0;
} | /**
* author: souzai32
* created: 13.08.2020 01:17:53
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
long gcd(long a, long b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
long lcm(long a, long b) { return a * b / gcd(a, b); }
int main() {
long a, b;
cin >> a >> b;
long num = gcd(a, b);
int count = 1;
for (long i = 2; i * i <= num; i++) {
if (num % i != 0)
continue;
while (num % i == 0) {
num /= i;
}
count++;
}
if (num != 1)
count++;
cout << count << endl;
return 0;
} | replace | 26 | 27 | 26 | 27 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
template <typename T> T lcm(T a, T b) { return (a * b) / gcd(b % a, a); }
ll PrimeFactorization(ll n) {
ll ans = 0;
for (int i = 2; i * i <= n && n != 1; ++i) {
if (n % i == 0) {
ans++;
while (n % i == 0) {
n /= i;
}
}
}
if (n != 1)
ans++;
ans++; // 1の分を足す
return ans;
}
void Print(ll n, unordered_map<ll, ll> &m) {
cout << n << " = ";
bool first = true;
for (const auto &e : m) {
rep(i, e.second) {
if (!first)
cout << " * ";
cout << e.first;
first = false;
}
}
cout << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
ll a, b;
cin >> a >> b;
cout << PrimeFactorization(gcd(a, b)) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
template <typename T> T lcm(T a, T b) { return (a * b) / gcd(b % a, a); }
ll PrimeFactorization(ll n) {
ll ans = 0;
if (n % 2 == 0)
ans++;
while (n % 2 == 0)
n = n / 2;
for (int i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
ans++;
while (n % i == 0) {
n /= i;
}
}
}
if (n != 1)
ans++;
ans++; // 1の分を足す
return ans;
}
void Print(ll n, unordered_map<ll, ll> &m) {
cout << n << " = ";
bool first = true;
for (const auto &e : m) {
rep(i, e.second) {
if (!first)
cout << " * ";
cout << e.first;
first = false;
}
}
cout << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
ll a, b;
cin >> a >> b;
cout << PrimeFactorization(gcd(a, b)) << endl;
return 0;
}
| replace | 15 | 16 | 15 | 21 | TLE | |
p02900 | C++ | Time Limit Exceeded | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
ll GCD(ll a, ll b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int main() {
ll A, B;
cin >> A >> B;
ll gcd = GCD(A, B), ans = 1;
for (int i = 2; i * i <= gcd; i++) {
if (gcd % i == 0) {
ans++;
while (gcd % i == 0) {
gcd /= i;
}
}
}
if (gcd != 1)
ans++;
cout << ans << endl;
}
| #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
ll GCD(ll a, ll b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int main() {
ll A, B;
cin >> A >> B;
ll gcd = GCD(A, B), ans = 1;
for (ll i = 2; i * i <= gcd; i++) {
if (gcd % i == 0) {
ans++;
while (gcd % i == 0) {
gcd /= i;
}
}
}
if (gcd != 1)
ans++;
cout << ans << endl;
}
| replace | 20 | 21 | 20 | 21 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define maxn 100005
#define ll long long
ll a, b;
int main() {
cin >> a >> b;
ll x = __gcd(a, b);
int tot = 0;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) {
tot++;
while (x % i == 0)
x /= i;
}
}
if (x > 1)
tot++;
cout << tot + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define maxn 100005
#define ll long long
ll a, b;
int main() {
cin >> a >> b;
ll x = __gcd(a, b);
int tot = 0;
for (ll i = 2; i * i <= x; i++) {
if (x % i == 0) {
tot++;
while (x % i == 0)
x /= i;
}
}
if (x > 1)
tot++;
cout << tot + 1 << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long A, long long B) {
if (B == 0) {
return A;
}
return gcd(B, A % B);
}
vector<pair<long long, long long>> prime_factorize(long long A) {
vector<pair<long long, long long>> res;
for (int i = 2; i * i <= A; i++) {
if (A % i != 0) {
continue;
}
long long ex = 0;
while (A % i == 0) {
ex++;
A /= i;
}
res.push_back(make_pair(i, ex));
}
if (A != 1) {
res.push_back(make_pair(A, 1));
}
return res;
}
int main() {
long long A, B;
cin >> A >> B;
long long C = gcd(A, B);
vector<pair<long long, long long>> D = prime_factorize(C);
cout << D.size() + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long A, long long B) {
if (B == 0) {
return A;
}
return gcd(B, A % B);
}
vector<pair<long long, long long>> prime_factorize(long long A) {
vector<pair<long long, long long>> res;
for (long long i = 2; i * i <= A; i++) {
if (A % i != 0) {
continue;
}
long long ex = 0;
while (A % i == 0) {
ex++;
A /= i;
}
res.push_back(make_pair(i, ex));
}
if (A != 1) {
res.push_back(make_pair(A, 1));
}
return res;
}
int main() {
long long A, B;
cin >> A >> B;
long long C = gcd(A, B);
vector<pair<long long, long long>> D = prime_factorize(C);
cout << D.size() + 1 << endl;
} | replace | 12 | 13 | 12 | 13 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1)
res.push_back({N, 1});
return res;
}
int main() {
long long a, b;
cin >> a >> b;
vector<pair<long long, long long>> a_prime;
vector<pair<long long, long long>> b_prime;
a_prime = prime_factorize(a);
b_prime = prime_factorize(b);
vector<long long> c;
for (long long i = 0; i < a_prime.size(); i++) {
c.push_back(a_prime[i].first);
}
for (long long i = 0; i < b_prime.size(); i++) {
c.push_back(b_prime[i].first);
}
sort(c.begin(), c.end());
long long ans = 1; // 1を考慮
for (long long i = 0; i < c.size() - 1LL; i++) {
if (c[i] == c[i + 1]) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1)
res.push_back({N, 1});
return res;
}
int main() {
long long a, b;
cin >> a >> b;
if (a == 1 || b == 1) {
cout << 1 << endl;
return 0;
}
vector<pair<long long, long long>> a_prime;
vector<pair<long long, long long>> b_prime;
a_prime = prime_factorize(a);
b_prime = prime_factorize(b);
vector<long long> c;
for (long long i = 0; i < a_prime.size(); i++) {
c.push_back(a_prime[i].first);
}
for (long long i = 0; i < b_prime.size(); i++) {
c.push_back(b_prime[i].first);
}
sort(c.begin(), c.end());
long long ans = 1; // 1を考慮
for (long long i = 0; i < c.size() - 1LL; i++) {
if (c[i] == c[i + 1]) {
ans++;
}
}
cout << ans << endl;
return 0;
} | insert | 31 | 31 | 31 | 36 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1)
return true;
for (long long i = 2; i < x; i++) {
if (x % i == 0)
return false;
}
return true;
}
long long gcd(long long a, long long b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
vector<long long> common_divisors(long long a, long long b) {
long long n = gcd(a, b);
vector<long long> ans;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (n / i == i) {
ans.push_back(i);
} else {
ans.push_back(n / i);
ans.push_back(i);
}
}
}
return ans;
}
int main() {
long long a, b;
cin >> a >> b;
vector<long long> div = common_divisors(a, b);
long long ans = 0;
for (int i = 0; i < div.size(); i++)
if (isPrime(div[i]))
ans++;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1)
return true;
for (long long i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
long long gcd(long long a, long long b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
vector<long long> common_divisors(long long a, long long b) {
long long n = gcd(a, b);
vector<long long> ans;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (n / i == i) {
ans.push_back(i);
} else {
ans.push_back(n / i);
ans.push_back(i);
}
}
}
return ans;
}
int main() {
long long a, b;
cin >> a >> b;
vector<long long> div = common_divisors(a, b);
long long ans = 0;
for (int i = 0; i < div.size(); i++)
if (isPrime(div[i]))
ans++;
cout << ans;
return 0;
} | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (a % b) {
return gcd(b, a % b);
} else {
return b;
}
}
int main() {
long long a, b;
cin >> a >> b;
long long n = gcd(a, b);
vector<pair<long long, long long>> fs;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
int cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
fs.emplace_back(i, cnt);
}
}
if (n > 1) {
fs.emplace_back(n, 1);
}
cout << fs.size() + 1 << endl;
}
| #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (a % b) {
return gcd(b, a % b);
} else {
return b;
}
}
int main() {
long long a, b;
cin >> a >> b;
long long n = gcd(a, b);
vector<pair<long long, long long>> fs;
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
int cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
fs.emplace_back(i, cnt);
}
}
if (n > 1) {
fs.emplace_back(n, 1);
}
cout << fs.size() + 1 << endl;
}
| replace | 18 | 19 | 18 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ███████████
// ██╬╬╬╬╬████╬╬████╬╬╬╬╬██
// █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██
// ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██
// ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██
// ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████
// █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██
// ██████████████
// ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████
// ███████ █████
// ███████████████████
//
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
int g = __gcd(a, b);
int ans = 1;
vec pri, flag(1e6 + 5, 0);
FOR(i, 1, 1e6 + 2) {
if (flag[i] == 0)
pri.push_back(i);
FOR(j, 1, 1e6 + 2) {
if (i * j >= 1e6 + 5)
break;
flag[i * j]++;
}
}
for (int p : pri) {
int cnt = 0;
while (g % p == 0)
cnt++, g /= p;
if (cnt)
ans++;
}
cout << ans + (g > 1) << endl;
return 0;
} | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ███████████
// ██╬╬╬╬╬████╬╬████╬╬╬╬╬██
// █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██
// ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██
// ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██
// ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████
// █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██
// ██████████████
// ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████
// ███████ █████
// ███████████████████
//
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
int g = __gcd(a, b);
int ans = 1;
vec pri, flag(1e6 + 5, 0);
FOR(i, 2, 1e6 + 2) {
if (flag[i] == 0)
pri.push_back(i);
FOR(j, 1, 1e6 + 2) {
if (i * j >= 1e6 + 5)
break;
flag[i * j]++;
}
}
for (int p : pri) {
int cnt = 0;
while (g % p == 0)
cnt++, g /= p;
if (cnt)
ans++;
}
cout << ans + (g > 1) << endl;
return 0;
} | replace | 60 | 61 | 60 | 61 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i > b; i--)
#define vint vector<int>
#define vvint vector<vint>
#define CST(x) cout << fixed << setprecision(x) // 小数点以下の桁数指定
#define ct(a) cout << a << endl
static const double pi = 3.141592653589793;
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll MOD = 1e9 + 7;
const int INF = 1e9 + 7;
class unionfind {
public:
vector<int> par;
vector<int> rnk;
unionfind(int N) : par(N), rnk(N) { // コンストラクタ
for (int i = 0; i < N; i++) {
par[i] = i;
rnk[i] = 0;
}
}
int root(int x) { // データｘが属する木の根を再帰で得る:root(x)={ｘの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return; // ｘとｙの根が同じ（＝同じ木にある）時はそのまま
if (rnk[rx] < rnk[ry]) {
par[rx] =
ry; // xとyの根が同じでない（＝同じ木にない）時：ｘの根をｒｘをｙの根につける
} else if (rnk[rx] > rnk[ry]) {
par[ry] = rx;
} else {
par[rx] = ry;
rnk[ry]++;
}
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll G = gcd(A, B);
ll ans = 1;
for (int i = 2; i * i <= G; i++) {
if (G % i == 0) {
ans++;
while (G % i == 0)
G /= i;
}
}
if (G > 1)
ans++;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i > b; i--)
#define vint vector<int>
#define vvint vector<vint>
#define CST(x) cout << fixed << setprecision(x) // 小数点以下の桁数指定
#define ct(a) cout << a << endl
static const double pi = 3.141592653589793;
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll MOD = 1e9 + 7;
const int INF = 1e9 + 7;
class unionfind {
public:
vector<int> par;
vector<int> rnk;
unionfind(int N) : par(N), rnk(N) { // コンストラクタ
for (int i = 0; i < N; i++) {
par[i] = i;
rnk[i] = 0;
}
}
int root(int x) { // データｘが属する木の根を再帰で得る:root(x)={ｘの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return; // ｘとｙの根が同じ（＝同じ木にある）時はそのまま
if (rnk[rx] < rnk[ry]) {
par[rx] =
ry; // xとyの根が同じでない（＝同じ木にない）時：ｘの根をｒｘをｙの根につける
} else if (rnk[rx] > rnk[ry]) {
par[ry] = rx;
} else {
par[rx] = ry;
rnk[ry]++;
}
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll G = gcd(A, B);
ll ans = 1;
for (ll i = 2; i * i <= G; i++) {
if (G % i == 0) {
ans++;
while (G % i == 0)
G /= i;
}
}
if (G > 1)
ans++;
cout << ans << endl;
return 0;
}
| replace | 83 | 84 | 83 | 84 | TLE | |
p02900 | C++ | Runtime Error | /**Function Template**/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define PI 3.14159265358979323846
ll fac[MAX], finv[MAX], inv[MAX];
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
bool palindrome(string s) {
bool flag = true;
rep(i, s.size()) if (s[i] != s[s.size() - 1 - i]) flag = false;
return flag;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s) {
string ans = "";
rep(i, s.size()) {
if ('a' <= s[i] && s[i] <= 'z')
ans += (char)s[i] - 32;
else
ans += s[i];
}
return ans;
}
string Tolower(string s) {
string ans = "";
rep(i, s.size()) {
if ('A' <= s[i] && s[i] <= 'Z')
ans += (char)s[i] + 32;
else
ans += s[i];
}
return ans;
}
const int MAX_N = 1000100;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
/*bool cmp(pint a, pint b) { return a.second < b.second; }*/
/* 約数列挙 */
vector<ll> divisor(ll n) {
// O(√n)
vector<ll> ans;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans.push_back(i);
if (i * i != n)
ans.push_back(n / i);
}
}
sort(ALL(ans));
return ans;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
ll a, b;
cin >> a >> b;
ll n = GCD(a, b);
vector<ll> v = divisor(n);
ll ans = 0;
vector<bool> p = sieve_of_eratosthenes();
rep(i, v.size()) {
if (p[v[i]])
ans++;
}
cout << ans << endl;
} | /**Function Template**/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define PI 3.14159265358979323846
ll fac[MAX], finv[MAX], inv[MAX];
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
bool palindrome(string s) {
bool flag = true;
rep(i, s.size()) if (s[i] != s[s.size() - 1 - i]) flag = false;
return flag;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s) {
string ans = "";
rep(i, s.size()) {
if ('a' <= s[i] && s[i] <= 'z')
ans += (char)s[i] - 32;
else
ans += s[i];
}
return ans;
}
string Tolower(string s) {
string ans = "";
rep(i, s.size()) {
if ('A' <= s[i] && s[i] <= 'Z')
ans += (char)s[i] + 32;
else
ans += s[i];
}
return ans;
}
const int MAX_N = 1000100;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
/*bool cmp(pint a, pint b) { return a.second < b.second; }*/
/* 約数列挙 */
vector<ll> divisor(ll n) {
// O(√n)
vector<ll> ans;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans.push_back(i);
if (i * i != n)
ans.push_back(n / i);
}
}
sort(ALL(ans));
return ans;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
ll a, b;
cin >> a >> b;
ll n = GCD(a, b);
vector<pint> p = prime_factorize(n);
cout << p.size() + 1 << endl;
} | replace | 195 | 203 | 195 | 197 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long gcd(long a, long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
long long A, B, cnt;
cin >> A >> B;
long long n = gcd(A, B);
cnt = 1;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
cnt++;
while (n % i == 0)
n /= i;
}
}
if (n != 1)
cnt++;
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long gcd(long a, long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
long long A, B, cnt;
cin >> A >> B;
long long n = gcd(A, B);
cnt = 1;
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
cnt++;
while (n % i == 0)
n /= i;
}
}
if (n != 1)
cnt++;
cout << cnt << endl;
} | replace | 18 | 19 | 18 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
ll t = a % b;
while (t > 0) {
a = b;
b = t;
t = a % b;
}
return b;
}
int main() {
ll A, B, ans = 1;
cin >> A >> B;
ll N = gcd(A, B);
for (int i = 2; i * i <= N; i++) {
if (N % i == 0) {
ans++;
while (N % i == 0)
N /= i;
}
}
if (N > 1)
ans++;
cout << ans << endl;
} | #include <iostream>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
ll t = a % b;
while (t > 0) {
a = b;
b = t;
t = a % b;
}
return b;
}
int main() {
ll A, B, ans = 1;
cin >> A >> B;
ll N = gcd(A, B);
for (ll i = 2; i * i <= N; i++) {
if (N % i == 0) {
ans++;
while (N % i == 0)
N /= i;
}
}
if (N > 1)
ans++;
cout << ans << endl;
}
| replace | 19 | 20 | 19 | 20 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<char> VC;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define LB lower_bound
#define UB upper_bound
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL INF = 1e9;
const LL MOD = 1e9 + 7;
// other
//-------------------------------------------
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define FI first
#define SE second
// memo
// setprecision()
LL Gcd(LL a, LL b) {
if (a < b) {
return Gcd(b, a);
}
if (b == 0) {
return a;
} else {
return Gcd(b, a % b);
}
}
LL Lcm(LL a, LL b) {
LL abd = Gcd(a, b);
LL x = a / abd, y = b / abd;
return x * y * abd;
}
LL RepSqu(LL N, LL P, LL M) {
if (P == 0) {
return 1;
}
if (P % 2 == 0) {
LL t = RepSqu(N, P / 2, M);
return t * t % M;
}
return (N * RepSqu(N, P - 1, M)) % M;
}
//-------------------------------------------
int main() {
LL A, B;
cin >> A >> B;
LL x = Gcd(A, B);
LL i = 2, ans = 1;
while (x > 1) {
if (x % i == 0) {
ans++;
while (x % i == 0) {
x /= i;
}
} else
i++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<char> VC;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define LB lower_bound
#define UB upper_bound
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL INF = 1e9;
const LL MOD = 1e9 + 7;
// other
//-------------------------------------------
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define FI first
#define SE second
// memo
// setprecision()
LL Gcd(LL a, LL b) {
if (a < b) {
return Gcd(b, a);
}
if (b == 0) {
return a;
} else {
return Gcd(b, a % b);
}
}
LL Lcm(LL a, LL b) {
LL abd = Gcd(a, b);
LL x = a / abd, y = b / abd;
return x * y * abd;
}
LL RepSqu(LL N, LL P, LL M) {
if (P == 0) {
return 1;
}
if (P % 2 == 0) {
LL t = RepSqu(N, P / 2, M);
return t * t % M;
}
return (N * RepSqu(N, P - 1, M)) % M;
}
//-------------------------------------------
int main() {
LL A, B;
cin >> A >> B;
LL x = Gcd(A, B);
LL i = 2, ans = 1;
while (x > 1) {
if (i * i > x) {
ans++;
break;
}
if (x % i == 0) {
ans++;
while (x % i == 0) {
x /= i;
}
} else
i++;
}
cout << ans << endl;
return 0;
} | insert | 110 | 110 | 110 | 114 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
void solve() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int count = 1;
for (ll i = 2; i * i < g; ++i) {
if (g % i == 0) {
count++;
while (g % i == 0)
g /= i;
}
}
if (g != 1) {
count++;
}
cout << count << endl;
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
void solve() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int count = 1;
for (ll i = 2; i * i < g; ++i) {
if (g % i == 0) {
count++;
while (g % i == 0)
g /= i;
}
}
if (g != 1) {
count++;
}
cout << count << endl;
}
int main() {
solve();
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02900 | C++ | Time Limit Exceeded | // #include "stdc++.h"
#include <bits/stdc++.h>
using namespace std;
long long gcd(long a, long b) {
if (a % b)
return gcd(b, a % b);
else
return b;
}
int main() {
long long a, b;
cin >> a >> b;
long long g;
if (a > b) {
g = gcd(a, b);
} else {
g = gcd(b, a);
}
int count = 1;
for (int i = 2; i * i <= g; i++) {
if (g % i == 0) {
count++;
while (g % i == 0)
g /= i;
}
}
if (g != 1)
count++;
printf("%d\n", count);
return 0;
} | // #include "stdc++.h"
#include <bits/stdc++.h>
using namespace std;
long long gcd(long a, long b) {
if (a % b)
return gcd(b, a % b);
else
return b;
}
int main() {
long long a, b;
cin >> a >> b;
long long g;
if (a > b) {
g = gcd(a, b);
} else {
g = gcd(b, a);
}
int count = 1;
for (long long i = 2; i * i <= g; i++) {
if (g % i == 0) {
count++;
while (g % i == 0)
g /= i;
}
}
if (g != 1)
count++;
printf("%d\n", count);
return 0;
} | replace | 23 | 24 | 23 | 24 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) { return b != 0 ? gcd(b, a % b) : a; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int64_t A, B;
cin >> A >> B;
int64_t g = gcd(A, B);
int64_t cnt = 1;
if (g % 2 == 0) {
cnt++;
while (g % 2 == 0)
g /= 2;
}
for (int i = 3; i * i <= g; i += 2) {
if (g % i == 0) {
cnt++;
while (g % i == 0)
g /= i;
}
}
if (g != 1)
cnt++;
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) { return b != 0 ? gcd(b, a % b) : a; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int64_t A, B;
cin >> A >> B;
int64_t g = gcd(A, B);
int64_t cnt = 1;
if (g % 2 == 0) {
cnt++;
while (g % 2 == 0)
g /= 2;
}
for (int64_t i = 3; i * i <= g; i += 2) {
if (g % i == 0) {
cnt++;
while (g % i == 0)
g /= i;
}
}
if (g != 1)
cnt++;
cout << cnt << endl;
return 0;
}
| replace | 18 | 19 | 18 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep2(i, s, n) for (int i = (s); i < (int)n; i++)
int INF = 1e9 + 7;
ll gcd(ll m, ll n) {
if (m % n == 0)
return n;
return gcd(n, m % n);
}
int main() {
ll A, B;
cin >> A >> B;
if (A < B)
swap(A, B);
ll g = gcd(A, B);
int ans = 1;
ll num = g;
for (int i = 2; i * i <= g; i++) {
if (num % i == 0) {
while (num % i == 0)
num /= i;
ans++;
}
}
if (num > 1)
ans++;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep2(i, s, n) for (int i = (s); i < (int)n; i++)
int INF = 1e9 + 7;
ll gcd(ll m, ll n) {
if (m % n == 0)
return n;
return gcd(n, m % n);
}
int main() {
ll A, B;
cin >> A >> B;
if (A < B)
swap(A, B);
ll g = gcd(A, B);
int ans = 1;
ll num = g;
for (ll i = 2; i * i <= g; i++) {
if (num % i == 0) {
while (num % i == 0)
num /= i;
ans++;
}
}
if (num > 1)
ans++;
cout << ans << endl;
} | replace | 23 | 24 | 23 | 24 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define Per(i, sta, n) for (int i = n - 1; i >= sta; i--)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> map<T, int> factorize(T x) {
map<T, int> res;
for (int i = 2; i * i <= x; i++) {
while (x % i == 0) {
x /= i;
res[i]++;
}
}
if (x != 1)
res[x]++;
return res;
}
ll a, b;
void solve() {
cin >> a >> b;
ll g = gcd(a, b);
int ans = 1;
map<ll, int> ma = factorize(g);
for (auto t : ma) {
ans += 1;
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(50);
solve();
} | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define Per(i, sta, n) for (int i = n - 1; i >= sta; i--)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> map<T, int> factorize(T x) {
map<T, int> res;
for (T i = 2; i * i <= x; i++) {
while (x % i == 0) {
x /= i;
res[i]++;
}
}
if (x != 1)
res[x]++;
return res;
}
ll a, b;
void solve() {
cin >> a >> b;
ll g = gcd(a, b);
int ans = 1;
map<ll, int> ma = factorize(g);
for (auto t : ma) {
ans += 1;
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(50);
solve();
} | replace | 50 | 51 | 50 | 51 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 1;
long long int a, b, tmp;
vector<long long int> v;
cin >> a >> b;
// aの素数の約数を全て求める
tmp = a;
for (int i = 2; i <= (int)sqrt(tmp); i++) {
int flag = 0;
while (tmp % i == 0) {
tmp /= i;
// cout << "[" << tmp << "]";
flag = 1;
}
if (flag == 1) {
// cout << "(" << i << ")";
v.push_back(i);
}
if (tmp < i) {
break;
}
}
if (tmp != 1 && v[v.size() - 1] != tmp) {
v.push_back(tmp);
}
for (int i = 0; i < v.size(); i++) {
// cout << "(" << v[i] << ")";
if (b % v[i] == 0) {
ans++;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 1;
long long int a, b, tmp;
vector<long long int> v;
cin >> a >> b;
// aの素数の約数を全て求める
tmp = a;
for (int i = 2; i <= (int)sqrt(tmp); i++) {
int flag = 0;
while (tmp % i == 0) {
tmp /= i;
// cout << "[" << tmp << "]";
flag = 1;
}
if (flag == 1) {
// cout << "(" << i << ")";
v.push_back(i);
}
if (tmp < i) {
break;
}
}
if (v.size() > 0) {
if (tmp != 1 && v[v.size() - 1] != tmp) {
v.push_back(tmp);
}
} else {
if (tmp != 1)
v.push_back(tmp);
}
for (int i = 0; i < v.size(); i++) {
// cout << "(" << v[i] << ")";
if (b % v[i] == 0) {
ans++;
}
}
cout << ans;
return 0;
} | replace | 27 | 29 | 27 | 34 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a, b, c, ans = 0, p = 1, q = 1;
map<ll, int> mp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
c = __gcd(a, b);
for (int i = 2; i * i <= c; i++) {
while (c % i == 0) {
mp[i]++;
c /= i;
}
}
if (c > 1)
mp[c]++;
cout << mp.size() + 1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a, b, c, ans = 0, p = 1, q = 1;
map<ll, int> mp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
c = __gcd(a, b);
for (ll i = 2; i * i <= c; i++) {
while (c % i == 0) {
mp[i]++;
c /= i;
}
}
if (c > 1)
mp[c]++;
cout << mp.size() + 1;
return 0;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// ax + by = gcd(a, b) O(logN)
long long extended_euclidean(long long a, long long b, long long &x,
long long &y) {
x = 1;
y = 0;
long long u = 0, v = 1;
long long ri = a, rj = b, rk, k;
// [x y]
// [u v]
while (1) {
k = ri / rj;
rk = ri % rj;
ri = rj;
rj = rk;
// [newx newy] = [0 1] [x y]
// [newu newv] = [1 -k] [u v]
long long newx, newy, newu, newv;
newx = u;
newy = v;
newu = x - k * u;
newv = y - k * v;
x = newx;
y = newy;
u = newu;
v = newv;
if (rk == 0)
break;
}
return a * x + b * y; // gcd
}
void prime_factorization(long long n, map<long long, int> &m) // O(sqrt(n))
{
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
n /= i;
m[i]++;
}
}
if (n != 1)
m[n]++;
}
int main(void) {
long long a, b;
cin >> a >> b;
long long x, y;
long long gcd = extended_euclidean(a, b, x, y);
map<long long, int> m;
prime_factorization(gcd, m);
cout << m.size() + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// ax + by = gcd(a, b) O(logN)
long long extended_euclidean(long long a, long long b, long long &x,
long long &y) {
x = 1;
y = 0;
long long u = 0, v = 1;
long long ri = a, rj = b, rk, k;
// [x y]
// [u v]
while (1) {
k = ri / rj;
rk = ri % rj;
ri = rj;
rj = rk;
// [newx newy] = [0 1] [x y]
// [newu newv] = [1 -k] [u v]
long long newx, newy, newu, newv;
newx = u;
newy = v;
newu = x - k * u;
newv = y - k * v;
x = newx;
y = newy;
u = newu;
v = newv;
if (rk == 0)
break;
}
return a * x + b * y; // gcd
}
void prime_factorization(long long n, map<long long, int> &m) // O(sqrt(n))
{
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
n /= i;
m[i]++;
}
}
if (n != 1)
m[n]++;
}
int main(void) {
long long a, b;
cin >> a >> b;
long long x, y;
long long gcd = extended_euclidean(a, b, x, y);
map<long long, int> m;
prime_factorization(gcd, m);
cout << m.size() + 1 << endl;
return 0;
} | replace | 38 | 39 | 38 | 39 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
// gcd(A, B)の約数（＝A, Bの公約数）を求める関数
// 求めた公約数は、vector<pair<ll,
// int>>型配列に入れられる。(firstが公約数の値、secondが出現回数)
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> p;
// Nの約数を求める時は、約数の候補は、1~sqrt(N)までを見ればよいことから、このようにする
// 今回は1はmain関数内のarray.size()+1の+1で補っている
for (int i = 2; i * i < n; i++) {
if (n % i != 0)
continue;
p.emplace_back(i, 0);
// iで何回割れるかを求める
while (n % i == 0) {
n /= i;
p.back().second++;
}
}
if (n != 1)
p.emplace_back(n, 1);
return p;
}
int main() {
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
auto array = factorize(g);
ll ans = array.size() + 1;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
// gcd(A, B)の約数（＝A, Bの公約数）を求める関数
// 求めた公約数は、vector<pair<ll,
// int>>型配列に入れられる。(firstが公約数の値、secondが出現回数)
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> p;
// Nの約数を求める時は、約数の候補は、1~sqrt(N)までを見ればよいことから、このようにする
// 今回は1はmain関数内のarray.size()+1の+1で補っている
for (ll i = 2; i * i < n; i++) {
if (n % i != 0)
continue;
p.emplace_back(i, 0);
// iで何回割れるかを求める
while (n % i == 0) {
n /= i;
p.back().second++;
}
}
if (n != 1)
p.emplace_back(n, 1);
return p;
}
int main() {
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
auto array = factorize(g);
ll ans = array.size() + 1;
cout << ans << endl;
return 0;
} | replace | 20 | 21 | 20 | 21 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <map>
using namespace std;
#define N 100005
#define ll long long
#define MOD 1000000007
ll x, y;
map<ll, bool> vis;
ll p[N];
int pn;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
scanf("%lld %lld", &x, &y);
ll d = gcd(x, y);
int ans = 1;
if (d % 2 == 0)
ans++;
while (d % 2 == 0)
d /= 2;
for (int i = 3; i * i <= d; i += 2)
if (d % i == 0) {
ans++;
while (d % i == 0)
d /= i;
}
if (d != 1)
ans++;
printf("%d\n", ans);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <map>
using namespace std;
#define N 100005
#define ll long long
#define MOD 1000000007
ll x, y;
map<ll, bool> vis;
ll p[N];
int pn;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
scanf("%lld %lld", &x, &y);
ll d = gcd(x, y);
int ans = 1;
if (d % 2 == 0)
ans++;
while (d % 2 == 0)
d /= 2;
for (int i = 3; i <= d / i; i += 2)
if (d % i == 0) {
ans++;
while (d % i == 0)
d /= i;
}
if (d != 1)
ans++;
printf("%d\n", ans);
return 0;
}
| replace | 25 | 26 | 25 | 26 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
int main() {
long long A, B;
std::priority_queue<int> aque, bque;
std::vector<int> d;
scanf("%lld %lld", &A, &B);
int amin = (int)std::sqrt(A), bmin = std::sqrt(B);
for (int i = 1; i <= amin; ++i) {
if (A % i == 0) {
aque.push(i);
if (i != A / i)
aque.push(A / i);
}
}
for (int i = 1; i <= bmin; ++i) {
if (B % i == 0) {
bque.push(i);
if (i != B / i)
bque.push(B / i);
}
}
while (!aque.empty() && !bque.empty()) {
if (aque.top() == bque.top()) {
d.push_back(aque.top());
aque.pop();
bque.pop();
} else if (aque.top() > bque.top()) {
aque.pop();
} else {
bque.pop();
}
}
std::reverse(d.begin(), d.end());
for (int i = 1; i < d.size(); ++i) {
for (auto j = d.begin() + i + 1; j < d.end(); ++j) {
if ((*j) % d[i] == 0) {
d.erase(j);
--j;
}
}
}
std::cout << d.size() << std::endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
int main() {
long long A, B;
std::priority_queue<long long> aque, bque;
std::vector<long long> d;
scanf("%lld %lld", &A, &B);
int amin = (int)std::sqrt(A), bmin = std::sqrt(B);
for (int i = 1; i <= amin; ++i) {
if (A % i == 0) {
aque.push(i);
if (i != A / i)
aque.push(A / i);
}
}
for (int i = 1; i <= bmin; ++i) {
if (B % i == 0) {
bque.push(i);
if (i != B / i)
bque.push(B / i);
}
}
while (!aque.empty() && !bque.empty()) {
if (aque.top() == bque.top()) {
d.push_back(aque.top());
aque.pop();
bque.pop();
} else if (aque.top() > bque.top()) {
aque.pop();
} else {
bque.pop();
}
}
std::reverse(d.begin(), d.end());
for (int i = 1; i < d.size(); ++i) {
for (auto j = d.begin() + i + 1; j < d.end(); ++j) {
if ((*j) % d[i] == 0) {
d.erase(j);
--j;
}
}
}
std::cout << d.size() << std::endl;
return 0;
}
| replace | 12 | 14 | 12 | 14 | 0 | |
p02900 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(a) a.begin(), a.end()
#define lb lower_bound
#define ub upper_bound
#define owo \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define MOD (ll)(1e9 + 7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d) \
for (long blockTime = 0; \
(blockTime == 0 ? (blockTime = clock()) != 0 : false); \
debug("%s time : %.4fs\n", d, \
(double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> PII;
typedef pair<int, int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll A, ll B) {
if (!B)
return A;
return gcd(B, A % B);
}
int main() {
ll a, b;
cin >> a >> b;
a = gcd(a, b);
ll ans = 0;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0) {
ans++;
while (a % i == 0)
a /= i;
}
}
if (a > 1)
ans++;
ans++;
cout << ans;
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(a) a.begin(), a.end()
#define lb lower_bound
#define ub upper_bound
#define owo \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define MOD (ll)(1e9 + 7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d) \
for (long blockTime = 0; \
(blockTime == 0 ? (blockTime = clock()) != 0 : false); \
debug("%s time : %.4fs\n", d, \
(double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> PII;
typedef pair<int, int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll A, ll B) {
if (!B)
return A;
return gcd(B, A % B);
}
int main() {
ll a, b;
cin >> a >> b;
a = gcd(a, b);
ll ans = 0;
for (ll i = 2; i * i <= a; i++) {
if (a % i == 0) {
ans++;
while (a % i == 0)
a /= i;
}
}
if (a > 1)
ans++;
ans++;
cout << ans;
}
| replace | 37 | 38 | 37 | 38 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<ll> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define mins(x, y) x = min(x, y)
#define maxs(x, y) x = max(x, y)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
static const int INF = 1000000007;
#define mp make_pair
#define sz(x) int(x.xise())
#define mod 1000000007
#define reps(i, s, n) for (int i = s; i < n; i++)
// cerrはコメントアウトしなくても通る
bool IsPrime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
for (ll i = 0; i < arr.size(); i++) {
if (num % arr[i] == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll a, b;
cin >> a >> b;
ll c = gcd(a, b);
ll ans = 1;
cerr << 1 << endl;
for (int i = 2; i * i <= c; i++) {
if (c % i == 0) {
while (c % i == 0) {
c /= i;
}
ans++;
cerr << i << endl;
}
}
if (c != 0 && c != 1) {
ans++;
cerr << c << endl;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<ll> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define mins(x, y) x = min(x, y)
#define maxs(x, y) x = max(x, y)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
static const int INF = 1000000007;
#define mp make_pair
#define sz(x) int(x.xise())
#define mod 1000000007
#define reps(i, s, n) for (int i = s; i < n; i++)
// cerrはコメントアウトしなくても通る
bool IsPrime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
for (ll i = 0; i < arr.size(); i++) {
if (num % arr[i] == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll a, b;
cin >> a >> b;
ll c = gcd(a, b);
ll ans = 1;
cerr << 1 << endl;
double d = sqrt(c);
for (ll i = 2; i <= d; i++) {
if (c % i == 0) {
while (c % i == 0) {
c /= i;
}
ans++;
cerr << i << endl;
}
}
if (c != 0 && c != 1) {
ans++;
cerr << c << endl;
}
cout << ans << endl;
return 0;
} | replace | 56 | 57 | 56 | 58 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.