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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repn(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define EQ(a, b) (abs((a) - (b)) < eps)
#define dmp(x) cerr << __LINE__ << " " << #x << " " << x << endl;
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> &p) {
os << p.fi << ',' << p.sec;
return os;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.fi >> p.sec;
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 < vec.size())
os << ' ';
}
return os;
}
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++)
is >> vec[i];
return is;
}
void fastio() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
}
const ll MOD = 1000000007ll; // if inv is needed, this shold be prime.
struct ModInt {
ll val;
ModInt() : val(0ll) {}
ModInt(const ll &v) : val(((v % MOD) + MOD) % MOD) {}
ModInt exp(ll y) const {
if (!y)
return ModInt(1ll);
ModInt a = exp(y / 2ll);
a *= a;
if (y & 1)
a *= (*this);
return a;
}
bool operator==(const ModInt &x) const { return val == x.val; }
inline bool operator!=(const ModInt &x) const { return !(*this == x); }
bool operator<(const ModInt &x) const { return val < x.val; }
bool operator>(const ModInt &x) const { return val > x.val; }
inline bool operator>=(const ModInt &x) const { return !(*this < x); }
inline bool operator<=(const ModInt &x) const { return !(*this > x); }
ModInt &operator+=(const ModInt &x) {
if ((val += x.val) >= MOD)
val -= MOD;
return *this;
}
ModInt &operator-=(const ModInt &x) {
if ((val += MOD - x.val) >= MOD)
val -= MOD;
return *this;
}
ModInt &operator*=(const ModInt &x) {
(val *= x.val) %= MOD;
return *this;
}
ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
friend istream &operator>>(istream &i, ModInt &x) {
ll v;
i >> v;
x = v;
return i;
}
friend ostream &operator<<(ostream &o, ModInt &x) {
o << x.val;
return o;
}
ModInt pow(ModInt a, ll x) const {
ModInt res = ModInt(1ll);
while (x) {
if (x & 1)
res *= a;
x >>= 1;
a = a * a;
}
return res;
}
};
vector<ModInt> inv, fac, facinv;
// notice: 0C0 = 1
ModInt nCr(int n, int r) {
assert(!(n < r));
assert(!(n < 0 || r < 0));
return fac[n] * facinv[r] * facinv[n - r];
}
void init(int SIZE) {
fac.resize(SIZE + 10);
inv.resize(SIZE + 10);
facinv.resize(SIZE + 10);
fac[0] = ModInt(1ll);
for (int i = 1; i <= SIZE; i++)
fac[i] = fac[i - 1] * ModInt(i);
inv[1] = ModInt(1ll);
for (int i = 2; i <= SIZE; i++)
inv[i] = ModInt(0ll) - ModInt(MOD / i) * inv[MOD % i];
facinv[0] = ModInt(1ll);
for (int i = 1; i <= SIZE; i++)
facinv[i] = facinv[i - 1] * inv[i];
return;
}
ll A, B;
ll mygcd(ll a, ll b) {
if (b == 0ll)
return a;
else
return mygcd(b, a % b);
}
int main() {
fastio();
cin >> A >> B;
ll g = mygcd(A, B);
int ans = 1;
for (int i = 2; i * i <= g; i++) {
if (g % i == 0ll) {
while (g % i == 0ll)
g /= i;
ans++;
}
}
if (g != 1ll)
ans++;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repn(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define EQ(a, b) (abs((a) - (b)) < eps)
#define dmp(x) cerr << __LINE__ << " " << #x << " " << x << endl;
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> &p) {
os << p.fi << ',' << p.sec;
return os;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.fi >> p.sec;
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 < vec.size())
os << ' ';
}
return os;
}
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++)
is >> vec[i];
return is;
}
void fastio() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
}
const ll MOD = 1000000007ll; // if inv is needed, this shold be prime.
struct ModInt {
ll val;
ModInt() : val(0ll) {}
ModInt(const ll &v) : val(((v % MOD) + MOD) % MOD) {}
ModInt exp(ll y) const {
if (!y)
return ModInt(1ll);
ModInt a = exp(y / 2ll);
a *= a;
if (y & 1)
a *= (*this);
return a;
}
bool operator==(const ModInt &x) const { return val == x.val; }
inline bool operator!=(const ModInt &x) const { return !(*this == x); }
bool operator<(const ModInt &x) const { return val < x.val; }
bool operator>(const ModInt &x) const { return val > x.val; }
inline bool operator>=(const ModInt &x) const { return !(*this < x); }
inline bool operator<=(const ModInt &x) const { return !(*this > x); }
ModInt &operator+=(const ModInt &x) {
if ((val += x.val) >= MOD)
val -= MOD;
return *this;
}
ModInt &operator-=(const ModInt &x) {
if ((val += MOD - x.val) >= MOD)
val -= MOD;
return *this;
}
ModInt &operator*=(const ModInt &x) {
(val *= x.val) %= MOD;
return *this;
}
ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
friend istream &operator>>(istream &i, ModInt &x) {
ll v;
i >> v;
x = v;
return i;
}
friend ostream &operator<<(ostream &o, ModInt &x) {
o << x.val;
return o;
}
ModInt pow(ModInt a, ll x) const {
ModInt res = ModInt(1ll);
while (x) {
if (x & 1)
res *= a;
x >>= 1;
a = a * a;
}
return res;
}
};
vector<ModInt> inv, fac, facinv;
// notice: 0C0 = 1
ModInt nCr(int n, int r) {
assert(!(n < r));
assert(!(n < 0 || r < 0));
return fac[n] * facinv[r] * facinv[n - r];
}
void init(int SIZE) {
fac.resize(SIZE + 10);
inv.resize(SIZE + 10);
facinv.resize(SIZE + 10);
fac[0] = ModInt(1ll);
for (int i = 1; i <= SIZE; i++)
fac[i] = fac[i - 1] * ModInt(i);
inv[1] = ModInt(1ll);
for (int i = 2; i <= SIZE; i++)
inv[i] = ModInt(0ll) - ModInt(MOD / i) * inv[MOD % i];
facinv[0] = ModInt(1ll);
for (int i = 1; i <= SIZE; i++)
facinv[i] = facinv[i - 1] * inv[i];
return;
}
ll A, B;
ll mygcd(ll a, ll b) {
if (b == 0ll)
return a;
else
return mygcd(b, a % b);
}
int main() {
fastio();
cin >> A >> B;
ll g = mygcd(A, B);
int ans = 1;
for (ll i = 2ll; i * i <= g; i++) {
if (g % i == 0ll) {
while (g % i == 0ll)
g /= i;
ans++;
}
}
if (g != 1ll)
ans++;
cout << ans << endl;
return 0;
}
| replace | 148 | 149 | 148 | 149 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
int64_t g = max(a, b), l = min(a, b), n = l;
while (g % l != 0) {
n = l;
l = g % l;
g = n;
}
return l;
}
int main() {
int64_t a, b;
cin >> a >> b;
int64_t n = gcd(a, b), 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 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
int64_t g = max(a, b), l = min(a, b), n = l;
while (g % l != 0) {
n = l;
l = g % l;
g = n;
}
return l;
}
int main() {
int64_t a, b;
cin >> a >> b;
int64_t n = gcd(a, b);
int ans = 1;
for (int64_t i = 2; i * i <= n; i++) {
if (n % i == 0) {
ans++;
while (n % i == 0)
n /= i;
}
}
if (n != 1)
ans++;
cout << ans << endl;
return 0;
} | replace | 16 | 18 | 16 | 19 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define popb pop_back()
#define sz size()
#define int long long
#define y1 dfsdsfsdfsd
#define next fdsfsdfjkl
#define endl "\n"
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
double pi = acos(-1.0);
int mod = 1e9 + 7;
const double eps = (double)1e-9;
const ll INF = 1e18 + 7;
/////////////////////////////////////////
int a, b;
vector<int> find_dividers(int x) {
vector<int> dividers;
for (int i = 1; i <= sqrt(x); i++) {
if (x % i == 0) {
dividers.push_back(i);
// для корня из x не существует парного делителя
if (i * i != x) {
dividers.push_back(x / i);
}
}
}
return dividers;
}
bool is_prime(int x) {
for (int i = 2; i <= sqrt(x); i++) {
if (x % i == 0) {
return false;
}
}
return true;
}
int used[20000100];
signed main() {
speed;
cin >> a >> b;
vector<int> A = find_dividers(a);
vector<int> B = find_dividers(b);
int cnt = 0;
for (int i = 0; i < A.size(); i++) {
if (is_prime(A[i]) && used[A[i]] == 0 && a % A[i] == 0 && b % A[i] == 0) {
used[A[i]] = 1;
cnt++;
// cout<<A[i]<<" ";
}
}
for (int i = 0; i < B.size(); i++) {
if (is_prime(B[i]) && used[B[i]] == 0 && b % B[i] == 0 && a % B[i] == 0) {
used[B[i]] = 1;
cnt++;
// cout<<B[i]<<" ";
}
}
cout << cnt << endl;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define popb pop_back()
#define sz size()
#define int long long
#define y1 dfsdsfsdfsd
#define next fdsfsdfjkl
#define endl "\n"
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
double pi = acos(-1.0);
int mod = 1e9 + 7;
const double eps = (double)1e-9;
const ll INF = 1e18 + 7;
/////////////////////////////////////////
int a, b;
vector<int> find_dividers(int x) {
vector<int> dividers;
for (int i = 1; i <= sqrt(x); i++) {
if (x % i == 0) {
dividers.push_back(i);
// для корня из x не существует парного делителя
if (i * i != x) {
dividers.push_back(x / i);
}
}
}
return dividers;
}
bool is_prime(int x) {
for (int i = 2; i <= sqrt(x); i++) {
if (x % i == 0) {
return false;
}
}
return true;
}
map<int, int> used;
signed main() {
speed;
cin >> a >> b;
vector<int> A = find_dividers(a);
vector<int> B = find_dividers(b);
int cnt = 0;
for (int i = 0; i < A.size(); i++) {
if (is_prime(A[i]) && used[A[i]] == 0 && a % A[i] == 0 && b % A[i] == 0) {
used[A[i]] = 1;
cnt++;
// cout<<A[i]<<" ";
}
}
for (int i = 0; i < B.size(); i++) {
if (is_prime(B[i]) && used[B[i]] == 0 && b % B[i] == 0 && a % B[i] == 0) {
used[B[i]] = 1;
cnt++;
// cout<<B[i]<<" ";
}
}
cout << cnt << endl;
}
| replace | 68 | 69 | 68 | 69 | -11 | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace ::std;
int main() {
long long int a, b;
cin >> a >> b;
long long int g = __gcd(a, b), ans = 1;
bool is = 1;
for (long long int i = 2; i <= g; i++) {
if (is) {
bool chc = 0;
for (long long int j = 2; j <= sqrt(g); j++)
if (!(g % j))
chc = 1;
if (!chc) {
cout << ans + 1 << '\n';
return 0;
}
}
if (!(g % i) && (is = 1, ans++))
while (!(g % i))
g /= i;
}
cout << ans << '\n';
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace ::std;
int main() {
long long int a, b;
cin >> a >> b;
long long int g = __gcd(a, b), ans = 1;
bool is = 1;
for (long long int i = 2; i <= g; i++) {
if (is) {
bool chc = 0;
for (long long int j = 2; j <= sqrt(g); j++)
if (!(g % j))
chc = 1;
if (!chc) {
cout << ans + 1 << '\n';
return 0;
}
is = 0;
}
if (!(g % i) && (is = 1, ans++))
while (!(g % i))
g /= i;
}
cout << ans << '\n';
} | insert | 20 | 20 | 20 | 21 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define llu unsigned long long int
#define Endl endl
#define mod 998244353
#define mkp make_pair
#define pb push_back
#define cin(n) scanf("%d", &n)
#define cout(n) printf("%d ", n)
#define sf(n) scanf("%d", &n)
#define pf(n) printf("%d ", n)
#define bitget(n) __builtin_popcountll(n)
ll dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
ll dy[] = {0, -1, -1, -1, 0, 1, 1, 1};
ll dxx[] = {1, -1, 0, 0};
ll dyy[] = {0, 0, -1, 1};
ll modexpo(ll x, ll y) {
if (y == 0)
return 1;
if (y % 2) {
ll viky = modexpo(x, y / 2);
return (((x * viky) % mod) * viky) % mod;
} else {
ll viky = modexpo(x, y / 2);
return (viky * viky) % mod;
}
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
bool isvalid(ll x, ll y, ll n, ll m) {
return (x >= 0 && x < n && y >= 0 && y < m);
}
ll prime[1000011];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for (ll i = 0; i <= 1000000; i++) {
if (prime[i] == 0) {
for (ll j = i; j * i <= 1000000; j++) {
prime[i * j] = 1;
}
}
}
ll a, b;
cin >> a >> b;
ll p = gcd(a, b);
ll ans = 1;
for (int i = 2; i <= 1000000; i++) {
if (prime[i] == 0 && (p % i == 0)) {
ans++;
while ((p % i) == 0) {
p = p / i;
}
}
}
if (p != 1) {
ans++;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define llu unsigned long long int
#define Endl endl
#define mod 998244353
#define mkp make_pair
#define pb push_back
#define cin(n) scanf("%d", &n)
#define cout(n) printf("%d ", n)
#define sf(n) scanf("%d", &n)
#define pf(n) printf("%d ", n)
#define bitget(n) __builtin_popcountll(n)
ll dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
ll dy[] = {0, -1, -1, -1, 0, 1, 1, 1};
ll dxx[] = {1, -1, 0, 0};
ll dyy[] = {0, 0, -1, 1};
ll modexpo(ll x, ll y) {
if (y == 0)
return 1;
if (y % 2) {
ll viky = modexpo(x, y / 2);
return (((x * viky) % mod) * viky) % mod;
} else {
ll viky = modexpo(x, y / 2);
return (viky * viky) % mod;
}
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
bool isvalid(ll x, ll y, ll n, ll m) {
return (x >= 0 && x < n && y >= 0 && y < m);
}
ll prime[1000011];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for (ll i = 2; i <= 1000000; i++) {
if (prime[i] == 0) {
for (ll j = i; j * i <= 1000000; j++) {
prime[i * j] = 1;
}
}
}
ll a, b;
cin >> a >> b;
ll p = gcd(a, b);
ll ans = 1;
for (int i = 2; i <= 1000000; i++) {
if (prime[i] == 0 && (p % i == 0)) {
ans++;
while ((p % i) == 0) {
p = p / i;
}
}
}
if (p != 1) {
ans++;
}
cout << ans;
return 0;
}
| replace | 44 | 45 | 44 | 45 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
#define db double
#define ui unsigned int
#define ll long long
#define ull unsiged ll
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define per(i, r, l) for (int i = r; i >= l; i--)
#define pb push_back
#define pp pop_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mod 1e9 + 7
#define vii vector<int>
#define vll vector<ll>
#define vpp vector<pii>
#define inf INT_MAX
#define lnf LLONG_MAX
#define mii map<int, int>
#define mll map<ll, ll>
#define mil map<int, ll>
#define umii unordered_map<int, int>
#define umll unordered_map<ll, ll>
#define si(n) scanf("%d", &n)
#define sl(n) scanf("%lld", &n)
#define boots \
ios::sync_with_stdio(0); \
cin.tie(0);
#define endl '\n'
using namespace std;
const int MX = 1e6 + 7;
ll modulo(ll num, ll MOD = mod) { return ((num % MOD) + MOD) % MOD; }
ll power(ll b, ll e, ll MOD = mod) {
ll ans = 1;
while (e) {
if (e % 2)
ans = (ans * b) % MOD;
b = (b * b) % MOD;
e /= 2;
}
return ans;
}
ll inv(ll num, ll MOD = mod) { return power(modulo(num), MOD - 2, MOD); }
ll gcd(ll a, ll b) { return ((b == 0) ? a : gcd(b, a % b)); }
int top;
ll pri[MX];
int ji[MX];
void prime() {
for (int i = 2; i < MX; i++) {
if (!ji[i])
pri[++top] = i;
for (int j = 2; j * i < MX; j++) {
ji[j * i] = 1;
}
}
}
int main() {
boots;
prime();
ll a, b;
cin >> a >> b;
ll sum = 1;
ll ans = max(a, b);
ll ant = sqrt(ans);
for (int i = 1; pri[i] <= a && pri[i] <= b; i++) {
if (a % pri[i] == 0 && b % pri[i] == 0) {
sum++;
}
if (a % pri[i] == 0) {
while (a % pri[i] == 0) {
a /= pri[i];
}
}
if (b % pri[i] == 0) {
while (b % pri[i] == 0) {
b /= pri[i];
}
}
}
if (a > 1 && b > 1 && a == b)
sum++;
cout << sum << endl;
}
| #include <bits/stdc++.h>
typedef long long ll;
#define db double
#define ui unsigned int
#define ll long long
#define ull unsiged ll
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define per(i, r, l) for (int i = r; i >= l; i--)
#define pb push_back
#define pp pop_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mod 1e9 + 7
#define vii vector<int>
#define vll vector<ll>
#define vpp vector<pii>
#define inf INT_MAX
#define lnf LLONG_MAX
#define mii map<int, int>
#define mll map<ll, ll>
#define mil map<int, ll>
#define umii unordered_map<int, int>
#define umll unordered_map<ll, ll>
#define si(n) scanf("%d", &n)
#define sl(n) scanf("%lld", &n)
#define boots \
ios::sync_with_stdio(0); \
cin.tie(0);
#define endl '\n'
using namespace std;
const int MX = 1e6 + 7;
ll modulo(ll num, ll MOD = mod) { return ((num % MOD) + MOD) % MOD; }
ll power(ll b, ll e, ll MOD = mod) {
ll ans = 1;
while (e) {
if (e % 2)
ans = (ans * b) % MOD;
b = (b * b) % MOD;
e /= 2;
}
return ans;
}
ll inv(ll num, ll MOD = mod) { return power(modulo(num), MOD - 2, MOD); }
ll gcd(ll a, ll b) { return ((b == 0) ? a : gcd(b, a % b)); }
int top;
ll pri[MX];
int ji[MX];
void prime() {
for (int i = 2; i < MX; i++) {
if (!ji[i])
pri[++top] = i;
for (int j = 2; j * i < MX; j++) {
ji[j * i] = 1;
}
}
}
int main() {
boots;
prime();
ll a, b;
cin >> a >> b;
ll sum = 1;
ll ans = max(a, b);
ll ant = sqrt(ans);
for (int i = 1; pri[i] <= ant; i++) {
if (!a || !b)
break;
if (a % pri[i] == 0 && b % pri[i] == 0) {
sum++;
}
if (a % pri[i] == 0) {
while (a % pri[i] == 0) {
a /= pri[i];
}
}
if (b % pri[i] == 0) {
while (b % pri[i] == 0) {
b /= pri[i];
}
}
}
if (a > 1 && b > 1 && a == b)
sum++;
cout << sum << endl;
}
| replace | 64 | 65 | 64 | 67 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include <math.h>
#include <regex>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int MGN = 10;
const int ARY_SZ_MAX = 10000000;
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using psi = pair<string, int>;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int prime_factors_num(ll n) {
int res = 0;
for (int p = 2; p * p <= n; p++) {
// if (is_prime(p)) {
if (n % p != 0)
continue; // p is not n's devisor
else {
while (n % p == 0) {
// fac[p]++;
n /= p;
}
res++;
}
}
if (n > 1)
res++; // fac[n]++;
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll C = gcd(A, B);
int ans = prime_factors_num(C) + 1;
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
#include <math.h>
#include <regex>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int MGN = 10;
const int ARY_SZ_MAX = 10000000;
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using psi = pair<string, int>;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int prime_factors_num(ll n) {
int res = 0;
for (ll p = 2; p * p <= n; p++) {
// if (is_prime(p)) {
if (n % p != 0)
continue; // p is not n's devisor
else {
while (n % p == 0) {
// fac[p]++;
n /= p;
}
res++;
}
}
if (n > 1)
res++; // fac[n]++;
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll C = gcd(A, B);
int ans = prime_factors_num(C) + 1;
cout << ans << endl;
return 0;
}
| replace | 35 | 36 | 35 | 36 | TLE | |
p02900 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <chrono>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define forr(i, start, count) for (int i = (start); i < (start) + (count); ++i)
#define set_map_includes(set, elt) (set.find((elt)) != set.end())
#define readint(i) \
int i; \
cin >> i
#define readll(i) \
ll i; \
cin >> i
#define readdouble(i) \
double i; \
cin >> i
#define readstring(s) \
string s; \
cin >> s
typedef long long ll;
using namespace std;
ll modd = 1000 * 1000 * 1000 + 7;
ll binary_search(function<bool(ll)> func, ll start, ll end) {
/* func:int ->bool
returns smallest int x where func(x) evaluates to true, searches in
[start,end), it is assumed the values are false, .. , false, true ...
*/
if (end <= start) {
return end;
} // has to be here, otherwise func(end-1) in next line could be a problem
if (!func(end - 1)) {
return end;
}
while (end - start > 1) {
ll mid = (start + end) / 2;
if (func(mid)) {
end = mid;
} else {
start = mid;
}
}
if (func(start)) {
return start;
} else {
return end;
}
};
long long gcd(long long a, long long b) {
if (a == 0) {
return b;
}
return gcd(b % a, a);
};
int main() {
ios_base::sync_with_stdio(false);
cout.precision(17);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<int> rand_gen(
0, modd); // rand_gen(rng) gets the rand no
// auto start = chrono::steady_clock::now();
// readint(test_cases);
int test_cases = 1;
forr(t, 1, test_cases) {
readll(n);
readll(m);
n = gcd(n, m);
int d = 2;
set<int> primes;
primes.insert(1);
while (d * d <= n) {
if (n % d == 0) {
n /= d;
primes.insert(d);
} else {
d++;
}
}
primes.insert(n);
cout << primes.size() << endl;
}
// auto end = chrono::steady_clock::now();
// cout << chrono::duration_cast<chrono::milliseconds>(end - start).count()
// << endl;
return 0;
} |
#include <algorithm>
#include <chrono>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define forr(i, start, count) for (int i = (start); i < (start) + (count); ++i)
#define set_map_includes(set, elt) (set.find((elt)) != set.end())
#define readint(i) \
int i; \
cin >> i
#define readll(i) \
ll i; \
cin >> i
#define readdouble(i) \
double i; \
cin >> i
#define readstring(s) \
string s; \
cin >> s
typedef long long ll;
using namespace std;
ll modd = 1000 * 1000 * 1000 + 7;
ll binary_search(function<bool(ll)> func, ll start, ll end) {
/* func:int ->bool
returns smallest int x where func(x) evaluates to true, searches in
[start,end), it is assumed the values are false, .. , false, true ...
*/
if (end <= start) {
return end;
} // has to be here, otherwise func(end-1) in next line could be a problem
if (!func(end - 1)) {
return end;
}
while (end - start > 1) {
ll mid = (start + end) / 2;
if (func(mid)) {
end = mid;
} else {
start = mid;
}
}
if (func(start)) {
return start;
} else {
return end;
}
};
long long gcd(long long a, long long b) {
if (a == 0) {
return b;
}
return gcd(b % a, a);
};
int main() {
ios_base::sync_with_stdio(false);
cout.precision(17);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<int> rand_gen(
0, modd); // rand_gen(rng) gets the rand no
// auto start = chrono::steady_clock::now();
// readint(test_cases);
int test_cases = 1;
forr(t, 1, test_cases) {
readll(n);
readll(m);
n = gcd(n, m);
ll d = 2;
set<ll> primes;
primes.insert(1);
while (d * d <= n) {
if (n % d == 0) {
n /= d;
primes.insert(d);
} else {
d++;
}
}
primes.insert(n);
cout << primes.size() << endl;
}
// auto end = chrono::steady_clock::now();
// cout << chrono::duration_cast<chrono::milliseconds>(end - start).count()
// << endl;
return 0;
} | replace | 93 | 95 | 93 | 95 | TLE | |
p02900 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
const int inf = INT_MAX / 2;
const ll INF = LLONG_MAX / 2;
// template end
int main() {
ll a, b;
scanf("%lld%lld", &a, &b);
ll g = __gcd(a, b);
int cnt = 0;
for (int i = 2; i * i <= g; i++) {
if (g % i == 0) {
cnt++;
while (g % i == 0)
g /= i;
}
}
if (g != 1)
cnt++;
printf("%d\n", cnt + 1);
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
const int inf = INT_MAX / 2;
const ll INF = LLONG_MAX / 2;
// template end
int main() {
ll a, b;
scanf("%lld%lld", &a, &b);
ll g = __gcd(a, b);
int cnt = 0;
for (ll i = 2; i * i <= g; i++) {
if (g % i == 0) {
cnt++;
while (g % i == 0)
g /= i;
}
}
if (g != 1)
cnt++;
printf("%d\n", cnt + 1);
return 0;
} | replace | 37 | 38 | 37 | 38 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod = 1000000007;
/*"itob" int to "N"base */ template <typename TypeInt>
string itob(const TypeInt v, int base) {
static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string ret;
static numeric_limits<TypeInt> t;
TypeInt n = v;
if (t.is_signed) {
if (v < 0)
n *= -1;
}
while (n >= base) {
ret += table[n % base];
n /= base;
}
ret += table[n];
if (t.is_signed) {
if (v < 0 && base == 10)
ret += '-';
}
reverse(ret.begin(), ret.end());
return ret;
}
/*"chmin" a = MAX*/ template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/*"chmax" a = MIN*/ template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/*"ctoi" char to int*/ int ctoi(char c) { return c - '0'; }
/*"gcd" MAX Euclidean */ ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
/*"lcm" MIN*/ ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
/*"primecheck"If prime,return true.*/ bool primecheck(ll n) {
if (n < 2)
return false;
else {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
}
string reverserange(string s, ll a, ll b) {
reverse(s.begin() + a - 1, s.begin() + b);
return s;
}
int main() {
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)
continue;
ans++;
while (g % i == 0) {
g /= i;
}
}
if (g != 1)
ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod = 1000000007;
/*"itob" int to "N"base */ template <typename TypeInt>
string itob(const TypeInt v, int base) {
static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string ret;
static numeric_limits<TypeInt> t;
TypeInt n = v;
if (t.is_signed) {
if (v < 0)
n *= -1;
}
while (n >= base) {
ret += table[n % base];
n /= base;
}
ret += table[n];
if (t.is_signed) {
if (v < 0 && base == 10)
ret += '-';
}
reverse(ret.begin(), ret.end());
return ret;
}
/*"chmin" a = MAX*/ template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/*"chmax" a = MIN*/ template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/*"ctoi" char to int*/ int ctoi(char c) { return c - '0'; }
/*"gcd" MAX Euclidean */ ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
/*"lcm" MIN*/ ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
/*"primecheck"If prime,return true.*/ bool primecheck(ll n) {
if (n < 2)
return false;
else {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
}
string reverserange(string s, ll a, ll b) {
reverse(s.begin() + a - 1, s.begin() + b);
return s;
}
int main() {
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)
continue;
ans++;
while (g % i == 0) {
g /= i;
}
}
if (g != 1)
ans++;
cout << ans << endl;
}
| replace | 72 | 73 | 72 | 73 | TLE | |
p02900 | C++ | Time Limit Exceeded | // #include <tourist>
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
const int MOD = 1000000007;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
// setprecision(15)有効数字15桁
//-std=c++14
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
struct edge {
int to, cost;
};
ll a, b;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b;
ll ans = 0;
ll g = gcd(a, b);
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 + 1 << "\n";
}
| // #include <tourist>
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
const int MOD = 1000000007;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
// setprecision(15)有効数字15桁
//-std=c++14
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
struct edge {
int to, cost;
};
ll a, b;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b;
ll ans = 0;
ll g = gcd(a, b);
for (ll i = 2; i <= sqrt(g); i++) {
if (g % i == 0)
ans++;
while (g % i == 0) {
g /= i;
}
}
if (g != 1) {
ans++;
}
cout << ans + 1 << "\n";
}
| replace | 54 | 55 | 54 | 55 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
ll intpow(ll N, ll P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = intpow(N, P / 2);
return t * t;
}
return N * intpow(N, P - 1);
}
ll modpow(ll N, ll P, ll k) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = modpow(N, P / 2, k) % k;
return t * t % k;
}
return N * modpow(N, P - 1, k) % k;
}
ll modkai(ll n, ll m, ll k) { // n*(n-1)*(n-2)*...(m+1)%k
if (n == m)
return 1;
return modkai(n - 1, m, k) * n % k;
}
ll mod_cnb(ll n, ll m, ll k) { // nCm%k,kは十分大きい素数
int m_ = modkai(m, 0, k);
return modkai(n, n - m, k) * modpow(m_, k - 2, k) % k;
}
ll gcd(ll n, ll m) {
int n_ = max(n, m);
int m_ = min(n, m);
if (n_ % m_ == 0)
return m_;
return gcd(m_, n_ % m_);
}
ll lcm(ll n, ll m) { return n * m / gcd(n, m); }
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll G = g;
vector<ll> v;
for (ll i = 2; i * i <= G; i++) {
if (g % i == 0) {
v.push_back(1);
g /= i;
}
while (g % i == 0) {
v[v.size() - 1]++;
g /= i;
}
}
if (g > 1)
v.push_back(1);
cout << v.size() + 1 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
ll intpow(ll N, ll P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = intpow(N, P / 2);
return t * t;
}
return N * intpow(N, P - 1);
}
ll modpow(ll N, ll P, ll k) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = modpow(N, P / 2, k) % k;
return t * t % k;
}
return N * modpow(N, P - 1, k) % k;
}
ll modkai(ll n, ll m, ll k) { // n*(n-1)*(n-2)*...(m+1)%k
if (n == m)
return 1;
return modkai(n - 1, m, k) * n % k;
}
ll mod_cnb(ll n, ll m, ll k) { // nCm%k,kは十分大きい素数
int m_ = modkai(m, 0, k);
return modkai(n, n - m, k) * modpow(m_, k - 2, k) % k;
}
ll gcd(ll n, ll m) {
ll n_ = max(n, m);
ll m_ = min(n, m);
if (n_ % m_ == 0)
return m_;
return gcd(m_, n_ % m_);
}
ll lcm(ll n, ll m) { return n * m / gcd(n, m); }
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll G = g;
vector<ll> v;
for (ll i = 2; i * i <= G; i++) {
if (g % i == 0) {
v.push_back(1);
g /= i;
}
while (g % i == 0) {
v[v.size() - 1]++;
g /= i;
}
}
if (g > 1)
v.push_back(1);
cout << v.size() + 1 << endl;
return 0;
} | replace | 43 | 45 | 43 | 45 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <set>
using namespace std;
int main() {
int64_t a, b;
cin >> a >> b;
int ans = 1;
set<int64_t> set;
auto n = min(a, b);
auto m = max(a, b);
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
if (set.find(i) == set.end()) {
if (m % i == 0)
ans++;
set.insert(i);
}
n /= i;
}
}
if (n != 1 && m % n == 0)
++ans;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdint>
#include <iostream>
#include <set>
using namespace std;
int main() {
int64_t a, b;
cin >> a >> b;
int ans = 1;
set<int64_t> set;
auto n = min(a, b);
auto m = max(a, b);
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
if (set.find(i) == set.end()) {
if (m % i == 0)
ans++;
set.insert(i);
}
n /= i;
}
}
if (n != 1 && m % n == 0)
++ans;
cout << ans << endl;
return 0;
}
| replace | 14 | 15 | 14 | 15 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using LL = int64_t;
using VL = vector<LL>;
using PLL = pair<LL, LL>;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> std::map<T, int> factorize(T n) {
std::map<T, int> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n > 1)
res[n]++;
return res;
}
// main code
int main(int argc, char *argv[]) {
LL a, b;
cin >> a >> b;
LL g = gcd(a, b);
auto mp = factorize(g);
cout << mp.size() + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using LL = int64_t;
using VL = vector<LL>;
using PLL = pair<LL, LL>;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> std::map<T, int> factorize(T n) {
std::map<T, int> res;
for (LL i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n > 1)
res[n]++;
return res;
}
// main code
int main(int argc, char *argv[]) {
LL a, b;
cin >> a >> b;
LL g = gcd(a, b);
auto mp = factorize(g);
cout << mp.size() + 1 << endl;
return 0;
}
| replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
int ans = 1;
if (g % 2 == 0) {
ans++;
while (g % 2 == 0)
g >> 1;
}
for (ll p = 3; p <= sqrt(g); p += 2) {
if (g % p == 0) {
ans++;
while (g % p == 0)
g /= p;
}
}
if (g > 2)
ans++;
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
int ans = 1;
if (g % 2 == 0) {
ans++;
while (g % 2 == 0)
g >>= 1;
}
for (ll p = 3; p <= sqrt(g); p += 2) {
if (g % p == 0) {
ans++;
while (g % p == 0)
g /= p;
}
}
if (g > 2)
ans++;
cout << ans << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, db> pdb;
typedef pair<ldb, ldb> pldb;
template <typename T> void Debug(T begin, T end);
int si();
ll sl();
string ss(int);
db sf();
ldb slf();
void pi(int, char = '\n');
void pl(ll, char = '\n');
void pf(db, char = '\n');
void plf(ldb, char = '\n');
void ps(string, char = '\n');
ll russian(ll, ll, ll);
ll fast_power(ll, ll, ll);
ll slow_power(ll, ll, ll);
ll _gcd(ll, ll);
ll _lcm(ll, ll);
const int INF = 1e9;
const ll LINF = 1e18;
int main() {
ll a = sl(), b = sl();
ll gcd = _gcd(a, b);
int result = 1;
for (int i = 2; i * i <= gcd; ++i) {
if (gcd % i == 0) {
++result;
while (gcd % i == 0)
gcd /= i;
}
}
pi(result + (gcd == 1 ? 0 : 1));
return 0;
}
template <typename T> void Debug(T begin, T end) {
printf("\nDEBUG:\n");
while (begin != end)
printf("%d ", *begin), begin++;
printf("\n\n");
}
template <typename T> T scanf_t(string s) {
T a;
scanf(s.c_str(), &a);
return a;
}
template <typename T> void printf_t(T a, string s, char end_l) {
s.push_back(end_l);
printf(s.c_str(), a);
}
int si() { return scanf_t<int>("%d"); }
ll sl() { return scanf_t<ll>("%lld"); }
db sf() { return scanf_t<db>("%f"); }
ldb slf() { return scanf_t<ldb>("%Lf"); }
void pi(int a, char end_l) { printf_t<int>(a, "%d", end_l); }
void pl(ll a, char end_l) { printf_t<ll>(a, "%lld", end_l); }
void pf(db a, char end_l) { printf_t<db>(a, "%lf", end_l); }
void plf(ldb a, char end_l) { printf_t<ldb>(a, "%Lf", end_l); }
void ps(string a, char end_l) {
string s = "%s";
s.push_back(end_l);
printf(s.c_str(), a.c_str());
}
string ss(int NN) {
char T[NN];
scanf("%s", T);
return (string)T;
}
ll fast_power(ll a, ll k, ll m) {
ll r = 1LL;
while (k) {
if (k & 1LL)
r = (r * a) % m;
a = (a * a) % m;
k >>= 1LL;
}
return r;
}
ll slow_power(ll a, ll k, ll m) {
ll r = 1LL;
while (k) {
if (k & 1LL)
r = russian(r, a, m);
a = russian(a, a, m);
k >>= 1LL;
}
return r;
}
ll russian(ll a, ll k, ll m) {
ll r = 0LL;
while (k) {
if (k & 1LL)
r = (r + a) % m;
a = (a + a) % m;
k >>= 1LL;
}
return r;
}
ll _gcd(ll a, ll b) {
while (b)
swap(a %= b, b);
return a;
}
ll _lcm(ll a, ll b) { return a / _gcd(a, b) * b; }
| #include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, db> pdb;
typedef pair<ldb, ldb> pldb;
template <typename T> void Debug(T begin, T end);
int si();
ll sl();
string ss(int);
db sf();
ldb slf();
void pi(int, char = '\n');
void pl(ll, char = '\n');
void pf(db, char = '\n');
void plf(ldb, char = '\n');
void ps(string, char = '\n');
ll russian(ll, ll, ll);
ll fast_power(ll, ll, ll);
ll slow_power(ll, ll, ll);
ll _gcd(ll, ll);
ll _lcm(ll, ll);
const int INF = 1e9;
const ll LINF = 1e18;
int main() {
ll a = sl(), b = sl();
ll gcd = _gcd(a, b);
int result = 1;
for (ll i = 2; i * i <= gcd; ++i) {
if (gcd % i == 0) {
++result;
while (gcd % i == 0)
gcd /= i;
}
}
pi(result + (gcd == 1 ? 0 : 1));
return 0;
}
template <typename T> void Debug(T begin, T end) {
printf("\nDEBUG:\n");
while (begin != end)
printf("%d ", *begin), begin++;
printf("\n\n");
}
template <typename T> T scanf_t(string s) {
T a;
scanf(s.c_str(), &a);
return a;
}
template <typename T> void printf_t(T a, string s, char end_l) {
s.push_back(end_l);
printf(s.c_str(), a);
}
int si() { return scanf_t<int>("%d"); }
ll sl() { return scanf_t<ll>("%lld"); }
db sf() { return scanf_t<db>("%f"); }
ldb slf() { return scanf_t<ldb>("%Lf"); }
void pi(int a, char end_l) { printf_t<int>(a, "%d", end_l); }
void pl(ll a, char end_l) { printf_t<ll>(a, "%lld", end_l); }
void pf(db a, char end_l) { printf_t<db>(a, "%lf", end_l); }
void plf(ldb a, char end_l) { printf_t<ldb>(a, "%Lf", end_l); }
void ps(string a, char end_l) {
string s = "%s";
s.push_back(end_l);
printf(s.c_str(), a.c_str());
}
string ss(int NN) {
char T[NN];
scanf("%s", T);
return (string)T;
}
ll fast_power(ll a, ll k, ll m) {
ll r = 1LL;
while (k) {
if (k & 1LL)
r = (r * a) % m;
a = (a * a) % m;
k >>= 1LL;
}
return r;
}
ll slow_power(ll a, ll k, ll m) {
ll r = 1LL;
while (k) {
if (k & 1LL)
r = russian(r, a, m);
a = russian(a, a, m);
k >>= 1LL;
}
return r;
}
ll russian(ll a, ll k, ll m) {
ll r = 0LL;
while (k) {
if (k & 1LL)
r = (r + a) % m;
a = (a + a) % m;
k >>= 1LL;
}
return r;
}
ll _gcd(ll a, ll b) {
while (b)
swap(a %= b, b);
return a;
}
ll _lcm(ll a, ll b) { return a / _gcd(a, b) * b; }
| replace | 42 | 43 | 42 | 43 | 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 <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T, class U> bool cmin(T &a, U b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
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;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T, class U> bool cmin(T &a, U b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
int 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;
}
| replace | 31 | 33 | 31 | 33 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T, class U> bool cmin(T &a, U b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
cerr << g << endl;
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;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T, class U> bool cmin(T &a, U b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
cerr << g << endl;
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;
}
| replace | 33 | 34 | 33 | 34 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t A, int64_t B) {
if (B == 0) {
return A;
}
return gcd(B, A % B);
}
map<int64_t, int> prime_list(int64_t n) {
map<int64_t, int> ans;
for (int i = 2; i * i <= n; ++i) {
while (n % i == 0) {
++ans[i];
n = n / i;
}
}
if (n != 1) {
++ans[n];
}
return ans;
}
int main() {
int64_t A, B;
cin >> A >> B;
int64_t G = gcd(A, B);
cout << prime_list(G).size() + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t A, int64_t B) {
if (B == 0) {
return A;
}
return gcd(B, A % B);
}
map<int64_t, int> prime_list(int64_t n) {
map<int64_t, int> ans;
for (int64_t i = 2; i * i <= n; ++i) {
while (n % i == 0) {
++ans[i];
n = n / i;
}
}
if (n != 1) {
++ans[n];
}
return ans;
}
int main() {
int64_t A, B;
cin >> A >> B;
int64_t G = gcd(A, B);
cout << prime_list(G).size() + 1 << endl;
} | replace | 12 | 13 | 12 | 13 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, r, tmp;
cin >> a >> b;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
int ans = 1;
for (int i = 2; i * i <= b; i++) {
if (b % i == 0) {
ans++;
while (b % i == 0) {
b /= i;
}
}
}
if (b != 1) {
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, r, tmp;
cin >> a >> b;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
long long ans = 1;
for (long long i = 2; i * i <= b; i++) {
if (b % i == 0) {
ans++;
while (b % i == 0) {
b /= i;
}
}
}
if (b != 1) {
ans++;
}
cout << ans << endl;
} | replace | 17 | 19 | 17 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// ABC142D - Disjoint Set of Common Divisors
// 最大公約数を求めて素因数分解を行い、素因数が何種類あるか求める
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
ll ans = 1;
if (g % 2 == 0)
ans++;
while (g % 2 == 0) { // 素数2だけで分解する
g /= 2;
}
for (int i = 3; i * i <= g; i = i + 2) {
if (g % i == 0)
ans++;
while (g % i == 0) {
g /= i;
}
}
if (g > 2)
ans++; // 割り切れなかった素数
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// ABC142D - Disjoint Set of Common Divisors
// 最大公約数を求めて素因数分解を行い、素因数が何種類あるか求める
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
ll ans = 1;
if (g % 2 == 0)
ans++;
while (g % 2 == 0) { // 素数2だけで分解する
g /= 2;
}
for (ll i = 3; i * i <= g; i += 2) { // long long
if (g % i == 0)
ans++;
while (g % i == 0) {
g /= i;
}
}
if (g > 2)
ans++; // 割り切れなかった素数
cout << ans << endl;
} | replace | 33 | 34 | 33 | 34 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class U> U lcm(U m, U n) {
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n);
}
template <typename T> auto divisors(T n) {
vector<T> v;
for (int i = 1; i * i <= n; i++) {
if (n % i)
continue;
v.push_back(i);
if (i != 1 and i * i != n)
v.push_back(n / i);
}
// input : 6 -> 1 2 3 6
// input : 1 -> 1
// input : 2 -> 2
if (n != 1)
v.push_back(n);
sort(v.begin(), v.end());
return v;
}
template <typename T> auto isPrime(const T num) {
if (num == 1)
return true;
for (T i = 2; i * i <= num; ++i)
if (num % i == 0)
return false;
return true;
}
int main() {
long long A, B;
cin >> A >> B;
long long gd = gcd(A, B);
auto v = divisors(gd);
long long ans = 0;
for (auto e : v)
ans += isPrime(e);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class U> U lcm(U m, U n) {
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n);
}
template <typename T> auto divisors(T n) {
vector<T> v;
for (T i = 1; i * i <= n; i++) {
if (n % i)
continue;
v.push_back(i);
if (i != 1 and i * i != n)
v.push_back(n / i);
}
// input : 6 -> 1 2 3 6
// input : 1 -> 1
// input : 2 -> 2
if (n != 1)
v.push_back(n);
sort(v.begin(), v.end());
return v;
}
template <typename T> auto isPrime(const T num) {
if (num == 1)
return true;
for (T i = 2; i * i <= num; ++i)
if (num % i == 0)
return false;
return true;
}
int main() {
long long A, B;
cin >> A >> B;
long long gd = gcd(A, B);
auto v = divisors(gd);
long long ans = 0;
for (auto e : v)
ans += isPrime(e);
cout << ans << endl;
}
| replace | 10 | 11 | 10 | 11 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
const int Maxn = 1e6;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
return GCD(y, x % y);
}
int main() {
#ifdef LOACL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ll x, y;
scanf("%lld %lld", &x, &y);
int cnt = 1;
ll g = GCD(x, y);
for (int i = 2; i * i <= g; i++) {
if (g % i == 0)
cnt++;
while (g % i == 0)
g /= i;
}
if (g > 1)
cnt++;
printf("%d\n", cnt);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
const int Maxn = 1e6;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
return GCD(y, x % y);
}
int main() {
#ifdef LOACL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ll x, y;
scanf("%lld %lld", &x, &y);
int cnt = 1;
ll g = GCD(x, y);
for (ll i = 2; i * i <= g; i++) {
if (g % i == 0)
cnt++;
while (g % i == 0)
g /= i;
}
if (g > 1)
cnt++;
printf("%d\n", cnt);
return 0;
} | replace | 23 | 24 | 23 | 24 | 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);
}
long long prime_factor(long long N) {
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++;
return ans;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long A, B;
cin >> A >> B;
long long d = gcd(A, B);
if (d == 1) {
cout << 1 << endl;
return 0;
}
long long num = prime_factor(d);
cout << num << endl;
return 0;
}
| #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);
}
long long prime_factor(long long N) {
long long ans = 1;
for (long long i = 2; i * i <= N; i++) {
if (N % i != 0)
continue;
if (N % i == 0)
ans++;
while (N % i == 0) {
N /= i;
}
}
if (N != 1)
ans++;
return ans;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long A, B;
cin >> A >> B;
long long d = gcd(A, B);
if (d == 1) {
cout << 1 << endl;
return 0;
}
long long num = prime_factor(d);
cout << num << endl;
return 0;
}
| replace | 10 | 12 | 10 | 14 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(s.size()) - 1)
cout << endl;
else
cout << " ";
}
}
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
int main() {
cin.tie(0);
cout << fixed << setprecision(10);
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int cnt = 0;
for (int i = 2; i * i <= g; ++i) {
if (g % i == 0) {
cnt++;
while (g % i == 0)
g /= i;
}
}
if (g != 1)
cnt++;
cout << cnt + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(s.size()) - 1)
cout << endl;
else
cout << " ";
}
}
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
int main() {
cin.tie(0);
cout << fixed << setprecision(10);
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int cnt = 0;
for (ll i = 2; i * i <= g; ++i) {
if (g % i == 0) {
cnt++;
while (g % i == 0)
g /= i;
}
}
if (g != 1)
cnt++;
cout << cnt + 1 << endl;
}
| replace | 29 | 30 | 29 | 30 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ll Pow_mod(ll a, ll b, ll p) {
ll ans = 1;
a %= p;
while (b) {
if (b & 1)
ans = (ans * a) % p;
a = (a * a) % p;
b >>= 1;
}
return (ans % p);
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll gcd__(ll a, ll b) {
while (b) {
ll c = a;
a = b;
b = c % b;
}
return a;
}
ll a, b, gcd_, ans;
int main() {
scanf("%lld%lld", &a, &b);
ans = 1;
gcd_ = gcd__(a, b);
for (int i = 2; i * i <= gcd_; i++) {
if (gcd_ % i == 0) {
while (gcd_ % i == 0)
gcd_ /= i;
ans++;
}
}
if (gcd_ > 1)
ans++;
printf("%lld\n", ans);
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ll Pow_mod(ll a, ll b, ll p) {
ll ans = 1;
a %= p;
while (b) {
if (b & 1)
ans = (ans * a) % p;
a = (a * a) % p;
b >>= 1;
}
return (ans % p);
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll gcd__(ll a, ll b) {
while (b) {
ll c = a;
a = b;
b = c % b;
}
return a;
}
ll a, b, gcd_, ans;
int main() {
scanf("%lld%lld", &a, &b);
ans = 1;
gcd_ = gcd__(a, b);
for (ll i = 2; i * i <= gcd_; i++) {
if (gcd_ % i == 0) {
while (gcd_ % i == 0)
gcd_ /= i;
ans++;
}
}
if (gcd_ > 1)
ans++;
printf("%lld\n", ans);
return 0;
} | replace | 46 | 47 | 46 | 47 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
const ll mod = 1e9 + 7;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int get_prime_cnts(ll a) {
int cnt = 0;
for (int i = 2; i * i <= a; ++i) {
if (a % i == 0) {
++cnt;
while (a % i == 0)
a /= i;
}
}
if (a != 1)
++cnt;
return cnt;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int cnt = get_prime_cnts(g) + 1;
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
const ll mod = 1e9 + 7;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int get_prime_cnts(ll a) {
int cnt = 0;
for (ll i = 2; i * i <= a; ++i) {
if (a % i == 0) {
++cnt;
while (a % i == 0)
a /= i;
}
}
if (a != 1)
++cnt;
return cnt;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int cnt = get_prime_cnts(g) + 1;
cout << cnt << endl;
return 0;
} | replace | 26 | 27 | 26 | 27 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); 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;
}
const ll INF = 1LL << 60;
template <class T> struct Sieve {
T n;
vector<T> f, primes;
Sieve(T n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
// 素数かどうかのboolを返す
bool isPrime(T x) { return f[x] == x; }
// 昇順の素因数リストを返す
vector<T> factorList(T x) {
vector<T> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
// 昇順の(素因数、その数)のpairを返す
vector<pair<T, T>> factor(T x) {
vector<T> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<pair<T, T>> res(1, make_pair(fl[0], 0));
for (T p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll a, b;
cin >> a >> b;
ll gcdab = gcd(max(a, b), min(a, b));
Sieve<ll> s(gcdab);
vector<pair<ll, ll>> fac = s.factor(gcdab);
int ans = fac.size() + 1;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); 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;
}
const ll INF = 1LL << 60;
template <class T> struct Sieve {
T n;
vector<T> f, primes;
Sieve(T n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
// 素数かどうかのboolを返す
bool isPrime(T x) { return f[x] == x; }
// 昇順の素因数リストを返す
vector<T> factorList(T x) {
vector<T> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
// 昇順の(素因数、その数)のpairを返す
vector<pair<T, T>> factor(T x) {
vector<T> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<pair<T, T>> res(1, make_pair(fl[0], 0));
for (T p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll a, b;
cin >> a >> b;
ll gcdab = gcd(max(a, b), min(a, b));
int mx = sqrt(gcdab) + 1;
int ans = 1;
for (int i = 2; i <= mx; i++) {
if (gcdab % i == 0)
ans++;
while (gcdab % i == 0)
gcdab /= i;
if (gcdab == 1)
break;
}
if (gcdab != 1)
ans++;
cout << ans << endl;
return 0;
} | replace | 68 | 71 | 68 | 80 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repk(i, k, n) for (int i = k; i < (int)(n); ++i)
#define MAX 500010
typedef long long int ll;
using namespace std;
// 最大公約数のll版
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
int main() {
ll A, B;
cin >> A >> B;
ll cnt = 0;
ll 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 + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repk(i, k, n) for (int i = k; i < (int)(n); ++i)
#define MAX 500010
typedef long long int ll;
using namespace std;
// 最大公約数のll版
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
int main() {
ll A, B;
cin >> A >> B;
ll cnt = 0;
ll 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 + 1 << endl;
return 0;
} | replace | 22 | 23 | 22 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define all(a) (a).begin(), (a).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
const ll INF = 1LL << 60;
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int 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++;
std::cout << ans << '\n';
}
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define all(a) (a).begin(), (a).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
const ll INF = 1LL << 60;
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int 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++;
std::cout << ans << '\n';
}
| replace | 43 | 44 | 43 | 44 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i, s, t) for (ll i = s; i < t; i++)
typedef long long ll;
typedef pair<ll, ll> P;
const int max_n = 1e5;
const ll mod = 1e9 + 7;
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ma;
rep(i, 2, n + 1) {
while (n % i == 0) {
ma[i]++;
n /= i;
}
}
if (n != 1)
ma[n] = 1;
return ma;
}
int main() {
ll a, b;
cin >> a >> b;
map<ll, ll> ma1 = prime_factor(a);
map<ll, ll> ma2 = prime_factor(b);
ll cnt = 1;
for (auto ite = begin(ma1); ite != end(ma1); ite++) {
if (ma2.count(ite->fi))
cnt++;
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i, s, t) for (ll i = s; i * i <= t; i++)
typedef long long ll;
typedef pair<ll, ll> P;
const int max_n = 1e5;
const ll mod = 1e9 + 7;
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ma;
rep(i, 2, n + 1) {
while (n % i == 0) {
ma[i]++;
n /= i;
}
}
if (n != 1)
ma[n] = 1;
return ma;
}
int main() {
ll a, b;
cin >> a >> b;
map<ll, ll> ma1 = prime_factor(a);
map<ll, ll> ma2 = prime_factor(b);
ll cnt = 1;
for (auto ite = begin(ma1); ite != end(ma1); ite++) {
if (ma2.count(ite->fi))
cnt++;
}
cout << cnt << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, (a % b));
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll mpower(ll a, ll b, ll c) {
int z;
if (b == 0) {
z = 1;
z %= c;
return z;
}
if (b == 1) {
z = a;
z %= c;
return z;
} else {
return (((mpower(a, b / 2, c)) * (mpower(a, b / 2, c)) % c) *
mpower(a, b % 2, c) % c);
}
}
bool IsPrime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (ll i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
int main() {
ll a, b;
cin >> a >> b;
ll c = gcd(a, b);
if (c == 1) {
cout << 1 << endl;
return 0;
}
int ans = 1;
if (c % 2 == 0) {
ans++;
while (c % 2 == 0) {
c /= 2;
}
}
for (int i = 0; i < 200; i++) {
for (ll j = 3; j * j <= c; j += 2) {
if (IsPrime(j) == true && c % j == 0) {
ans++;
while (c % j == 0) {
c /= j;
}
}
}
}
if (c > 1) {
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, (a % b));
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll mpower(ll a, ll b, ll c) {
int z;
if (b == 0) {
z = 1;
z %= c;
return z;
}
if (b == 1) {
z = a;
z %= c;
return z;
} else {
return (((mpower(a, b / 2, c)) * (mpower(a, b / 2, c)) % c) *
mpower(a, b % 2, c) % c);
}
}
bool IsPrime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (ll i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
int main() {
ll a, b;
cin >> a >> b;
ll c = gcd(a, b);
if (c == 1) {
cout << 1 << endl;
return 0;
}
int ans = 1;
if (c % 2 == 0) {
ans++;
while (c % 2 == 0) {
c /= 2;
}
}
for (int i = 0; i < 20; i++) {
for (ll j = 3; j * j <= c; j += 2) {
if (IsPrime(j) == true && c % j == 0) {
ans++;
while (c % j == 0) {
c /= j;
}
}
}
}
if (c > 1) {
ans++;
}
cout << ans << endl;
} | replace | 59 | 60 | 59 | 60 | TLE | |
p02900 | C++ | Runtime Error | /* ꧁༒☬महाकाल☬༒꧂ ꧁༒ঔमहाकालঔ༒꧂
ঔৣमहाकालᴳᵒᵈঔৣ
*/
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define mod 1000000007
#define inf 100000000000000000
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define _it iterator
#define all(_x) _x.begin(), _x.end()
#define f first
#define s second
#define pb push_back
void mahakal() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
}
map<ll, ll> mp;
void factor(ll n) {
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
mp[i]++;
n = n / i;
}
}
if (n != 1)
mp[n] = 1;
}
int main() {
mahakal(), fast;
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
factor(g);
ll ans = mp.size();
cout << ans + 1 << endl;
return 0;
} | /* ꧁༒☬महाकाल☬༒꧂ ꧁༒ঔमहाकालঔ༒꧂
ঔৣमहाकालᴳᵒᵈঔৣ
*/
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define mod 1000000007
#define inf 100000000000000000
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define _it iterator
#define all(_x) _x.begin(), _x.end()
#define f first
#define s second
#define pb push_back
void mahakal() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
}
map<ll, ll> mp;
void factor(ll n) {
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
mp[i]++;
n = n / i;
}
}
if (n != 1)
mp[n] = 1;
}
int main() {
// mahakal(),fast;
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
factor(g);
ll ans = mp.size();
cout << ans + 1 << endl;
return 0;
} | replace | 45 | 46 | 45 | 46 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T, class U> bool cmin(T &a, U b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
cerr << g << endl;
ll ans = 1;
for (unsigned 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;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T, class U> bool cmin(T &a, U b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
cerr << g << endl;
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;
}
| replace | 33 | 34 | 33 | 34 | TLE | |
p02900 | C++ | Time Limit Exceeded | //
// Created by Hideaki Imamura on 2020-03-18.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
ll A, B;
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
int main() {
cin >> A >> B;
ll C = gcd(A, B);
ll res = 1;
for (int i = 2; i * i <= C; ++i) {
if (C % i == 0)
res++;
while (C % i == 0)
C /= i;
}
if (C != 1)
res++;
cout << res << endl;
return 0;
} | //
// Created by Hideaki Imamura on 2020-03-18.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
ll A, B;
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
int main() {
cin >> A >> B;
ll C = gcd(A, B);
ll res = 1;
for (ll i = 2; i * i <= C; ++i) {
if (C % i == 0)
res++;
while (C % i == 0)
C /= i;
}
if (C != 1)
res++;
cout << res << endl;
return 0;
} | replace | 48 | 49 | 48 | 49 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll a, b, GCD, c = 1;
cin >> a >> b;
while (a && b) {
if (a >= b)
a %= b;
else
b %= a;
}
GCD = a + b;
for (int i = 2; i * i <= GCD; i++) {
if (GCD % i == 0)
c++;
while (GCD % i == 0)
GCD /= i;
}
if (GCD != 1)
c++;
cout << c << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll a, b, GCD, c = 1;
cin >> a >> b;
while (a && b) {
if (a >= b)
a %= b;
else
b %= a;
}
GCD = a + b;
for (ll i = 2; i * i <= GCD; i++) {
if (GCD % i == 0)
c++;
while (GCD % i == 0)
GCD /= i;
}
if (GCD != 1)
c++;
cout << c << endl;
return 0;
}
| replace | 13 | 14 | 13 | 14 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll gcd(ll A, ll B) {
ll R = A % B;
if (R == 0) {
return B;
} else {
return gcd(B, R);
}
}
int main() {
ll A, B;
cin >> A >> B;
ll tar = gcd(A, B);
ll ans = 1, num = 2;
while (tar != 1) {
bool div = false;
while (tar % num == 0) {
tar /= num;
div = true;
}
if (div == true) {
ans++;
}
num++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll gcd(ll A, ll B) {
ll R = A % B;
if (R == 0) {
return B;
} else {
return gcd(B, R);
}
}
int main() {
ll A, B;
cin >> A >> B;
ll tar = gcd(A, B);
ll ans = 1, num = 2;
while (tar != 1) {
bool div = false;
if (num > 1000000) {
ans++;
break;
}
while (tar % num == 0) {
tar /= num;
div = true;
}
if (div == true) {
ans++;
}
num++;
}
cout << ans << endl;
}
| insert | 23 | 23 | 23 | 28 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define FIND(x, target) find(x.begin(), x.end(), target)
#define pb(x) push_back(x)
#define pob(x) pop_back(x)
#define output(x) cout << x << endl
#define ERASE(x, n) x.erase(x.begin() + n)
// #define int long long
// #define P pair<int, int>
typedef long long ll;
const long long int MOD = 1e9 + 7;
const int INF = -1;
ll dp[100005][13];
signed main(void) {
ll A, B;
cin >> A >> B;
if (A < B) {
ll tmp = A;
A = B;
B = tmp;
}
ll r = A % B;
while (r != 0) {
A = B;
B = r;
r = A % B;
}
ll ans = 1;
if (B % 2 == 0) {
B = B / 2;
ans++;
while (B % 2 == 0) {
B = B / 2;
}
}
ll now = 3;
while (now <= B) {
bool isDivided = false;
while (B % now == 0) {
isDivided = true;
B = B / now;
}
if (isDivided) {
ans++;
}
now += 2;
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define FIND(x, target) find(x.begin(), x.end(), target)
#define pb(x) push_back(x)
#define pob(x) pop_back(x)
#define output(x) cout << x << endl
#define ERASE(x, n) x.erase(x.begin() + n)
// #define int long long
// #define P pair<int, int>
typedef long long ll;
const long long int MOD = 1e9 + 7;
const int INF = -1;
ll dp[100005][13];
signed main(void) {
ll A, B;
cin >> A >> B;
if (A < B) {
ll tmp = A;
A = B;
B = tmp;
}
ll r = A % B;
while (r != 0) {
A = B;
B = r;
r = A % B;
}
ll ans = 1;
if (B % 2 == 0) {
B = B / 2;
ans++;
while (B % 2 == 0) {
B = B / 2;
}
}
ll now = 3;
while (now <= B) {
bool isDivided = false;
while (B % now == 0) {
isDivided = true;
B = B / now;
}
if (isDivided) {
ans++;
}
now += 2;
if (now <= B && now >= sqrt(B)) {
ans++;
break;
}
}
cout << ans << endl;
}
| insert | 62 | 62 | 62 | 66 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> p;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define srep(i, from, to) for (int i = from; i < (int)(to); i++)
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
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;
}
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 g = gcd(a, b);
int ans = 1;
for (int x = 2; x * x <= g; x++) {
if (g == 1)
break;
bool counted = false;
while (g % x == 0) {
g /= x;
if (!counted) {
ans++;
counted = true;
}
}
}
if (g > 1)
ans++;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> p;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define srep(i, from, to) for (int i = from; i < (int)(to); i++)
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
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;
}
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 g = gcd(a, b);
int ans = 1;
for (ll x = 2; x * x <= g; x++) {
if (g == 1)
break;
bool counted = false;
while (g % x == 0) {
g /= x;
if (!counted) {
ans++;
counted = true;
}
}
}
if (g > 1)
ans++;
cout << ans << endl;
return 0;
}
| replace | 48 | 49 | 48 | 49 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
if (r == 0)
return b;
else
return gcd(b, r);
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll count = 1;
ll h = g;
for (int i = 2; i * i <= h; i++) {
if (g % i != 0)
continue;
count++;
while (g % i == 0) {
g /= i;
}
if (g == 1)
break;
}
if (g != 1)
count++;
cout << count << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
if (r == 0)
return b;
else
return gcd(b, r);
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll count = 1;
ll h = g;
for (ll i = 2; i * i <= h; i++) {
if (g % i != 0)
continue;
count++;
while (g % i == 0) {
g /= i;
}
if (g == 1)
break;
}
if (g != 1)
count++;
cout << count << '\n';
return 0;
} | replace | 25 | 26 | 25 | 26 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
ll a, b;
cin >> a >> b;
ll p = __gcd(a, b);
int ans = 1;
for (int i = 2; i * i <= p; i++) {
if (p % i == 0) {
ans++;
while (p % i == 0) {
p /= i;
}
}
}
if (p > 1)
ans++;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
ll a, b;
cin >> a >> b;
ll p = __gcd(a, b);
int ans = 1;
for (int i = 2; (ll)i * i <= p; i++) {
if (p % i == 0) {
ans++;
while (p % i == 0) {
p /= i;
}
}
}
if (p > 1)
ans++;
cout << ans << endl;
return 0;
}
| replace | 26 | 27 | 26 | 27 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll gcd(ll a, ll b) {
while (b != 0) {
ll t = a % b;
a = b;
b = t;
}
return (a);
}
int main() {
ll a, b, GCD;
cin >> a >> b;
GCD = __gcd(a, b);
vector<ll> num;
for (int i = 1; i * i <= GCD; i++) {
if (GCD % i == 0)
if (GCD / i == i)
num.push_back(i);
else
num.push_back(GCD / i), num.push_back(i);
}
sort(num.begin(), num.end(), greater<ll>());
ll i = 0, pd = 0;
while (i < num.size()) {
ll j = i + 1;
while (j < num.size()) {
if (gcd(num[i], num[j]) != 1) {
num.erase(num.begin() + i);
pd = 1;
}
j++;
}
i++;
if (pd == 1) {
pd = 0;
i--;
}
}
cout << num.size();
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll gcd(ll a, ll b) {
while (b != 0) {
ll t = a % b;
a = b;
b = t;
}
return (a);
}
int main() {
ll a, b, GCD;
cin >> a >> b;
GCD = __gcd(a, b);
vector<ll> num;
for (int i = 1; i <= sqrt(GCD); i++) {
if (GCD % i == 0)
if (GCD / i == i)
num.push_back(i);
else
num.push_back(GCD / i), num.push_back(i);
}
sort(num.begin(), num.end(), greater<ll>());
ll i = 0, pd = 0;
while (i < num.size()) {
ll j = i + 1;
while (j < num.size()) {
if (gcd(num[i], num[j]) != 1) {
num.erase(num.begin() + i);
pd = 1;
}
j++;
}
i++;
if (pd == 1) {
pd = 0;
i--;
}
}
cout << num.size();
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, c = 1ll;
scanf("%lld %lld", &a, &b);
if (a > b)
swap(a, b);
long long d = b;
for (int i = 2; i * i <= b; i += (i == 2 ? 1 : 2)) {
if (d % i == 0) {
while (d % i == 0) {
d /= i;
}
if (a % i == 0)
c++;
}
}
if (d != 1 && a % d == 0)
c++;
printf("%lld\n", c);
}
/*
128+4+1 -> 10000101
10110110
0.25+0.0625 = 0.3125
11.001001 (0.125)
128+32+8+4 -> 10101100
*/ | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c = 1ll;
scanf("%lld %lld", &a, &b);
if (a > b)
swap(a, b);
long long d = b;
for (long long i = 2; i * i <= b; i += (i == 2 ? 1 : 2)) {
if (d % i == 0) {
while (d % i == 0) {
d /= i;
}
if (a % i == 0)
c++;
}
}
if (d != 1 && a % d == 0)
c++;
printf("%lld\n", c);
}
/*
128+4+1 -> 10000101
10110110
0.25+0.0625 = 0.3125
11.001001 (0.125)
128+32+8+4 -> 10101100
*/ | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
const int INF = 1001001000;
const int mINF = -1001001000;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll common(ll x) {
ll res = 1;
for (int i = 2; i * i <= x; i++) {
if (x % i)
continue;
while (x % i == 0) {
x /= i;
}
res++;
}
if (x != 1)
res++;
return res;
}
int main() {
ll A, B;
cin >> A >> B;
ll ab = gcd(A, B);
ll ans = common(ab);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
const int INF = 1001001000;
const int mINF = -1001001000;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll common(ll x) {
ll res = 1;
for (ll i = 2; i * i <= x; i++) {
if (x % i)
continue;
while (x % i == 0) {
x /= i;
}
res++;
}
if (x != 1)
res++;
return res;
}
int main() {
ll A, B;
cin >> A >> B;
ll ab = gcd(A, B);
ll ans = common(ab);
cout << ans << endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
// require: a > b
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll a, b;
cin >> a >> b;
ll gc = gcd(a, b);
if (gc == 1) {
cout << 1 << endl;
return 0;
}
vector<int> cd;
for (int i = 1; i <= sqrt(gc); i++) {
if (gc % i == 0) {
cd.push_back(i);
cd.push_back(gc / i);
}
}
sort(cd.begin(), cd.end());
int ans = 0;
for (int i = 0; i < cd.size(); i++) {
bool f = true;
for (int j = 1; j < i; j++) {
if (cd[i] % cd[j] == 0)
f = false;
}
ans += (f ? 1 : 0);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
// require: a > b
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll a, b;
cin >> a >> b;
ll gc = gcd(a, b);
if (gc == 1) {
cout << 1 << endl;
return 0;
}
vector<ll> cd;
for (int i = 1; i <= sqrt(gc); i++) {
if (gc % i == 0) {
cd.push_back(i);
cd.push_back(gc / i);
}
}
sort(cd.begin(), cd.end());
int ans = 0;
for (int i = 0; i < cd.size(); i++) {
bool f = true;
for (int j = 1; j < i; j++) {
if (cd[i] % cd[j] == 0)
f = false;
}
ans += (f ? 1 : 0);
}
cout << ans << endl;
} | replace | 20 | 21 | 20 | 22 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 30
#define endl '\n'
#define maxn 100005
#define tc printf("Case %d: ", cs)
#define tcn printf("Case %d:\n", cs);
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
#define dbg1(x) cerr << #x << " = " << x << endl;
#define dbg2(x, y) cerr << #x << " = " << x << ", " << #y << " = " << y << endl;
#define dbg3(x, y, z) \
cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << endl;
#define dbg4(w, x, y, z) \
cerr << #w << " = " << w << ", " << #x << " = " << x << ", " << #y << " = " \
<< y << ", " << #z << " = " << z << endl;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "}";
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
#define dbg(args...) \
do { \
cerr << #args << " : "; \
faltu(args); \
} while (0)
clock_t tStart = clock();
#define timeStamp \
dbg("Execution Time: ", (double)(clock() - tStart) / CLOCKS_PER_SEC)
void faltu() { cerr << endl; }
template <typename T> void faltu(T a[], int n) {
for (int i = 0; i < n; ++i)
cerr << a[i] << ' ';
cerr << endl;
}
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
cerr << arg << ' ';
faltu(rest...);
}
// Program showing a policy-based data structure.
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#include <iostream>
using namespace __gnu_pbds;
using namespace std;
// GNU link : https://goo.gl/WVDL6g
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
/**___________________________________________________**/
vector<ll> D;
void CommonDiv(ll n) {
for (ll x = 1; x * x <= n; x++) {
if (n % x == 0) {
D.push_back(x);
if (n / x != x)
D.push_back(n / x);
}
}
}
int main() {
FASTIO
// ///*
// #ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
// freopen("error.txt", "w", stderr);
// #endif
//*/
int T;
// scanf("%d", &T);
T = 1;
for (int cs = 1; cs <= T; cs++) {
ll a, b;
cin >> a >> b;
ll gcd = __gcd(a, b);
// dbg(gcd);
CommonDiv(gcd);
int ans = 0;
// for (auto x : D) cerr << x << " ";
// cerr << endl;
map<ll, bool> mp;
for (int i = 0; i < (int)D.size(); i++) {
for (int j = i + 1; j < (int)D.size(); j++) {
if (__gcd(D[i], D[j]) > 1) {
ll x = max(D[i], D[j]);
mp[x] = true;
}
}
}
for (auto x : D) {
if (!mp[x])
ans++;
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 30
#define endl '\n'
#define maxn 100005
#define tc printf("Case %d: ", cs)
#define tcn printf("Case %d:\n", cs);
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
#define dbg1(x) cerr << #x << " = " << x << endl;
#define dbg2(x, y) cerr << #x << " = " << x << ", " << #y << " = " << y << endl;
#define dbg3(x, y, z) \
cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << endl;
#define dbg4(w, x, y, z) \
cerr << #w << " = " << w << ", " << #x << " = " << x << ", " << #y << " = " \
<< y << ", " << #z << " = " << z << endl;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "}";
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
#define dbg(args...) \
do { \
cerr << #args << " : "; \
faltu(args); \
} while (0)
clock_t tStart = clock();
#define timeStamp \
dbg("Execution Time: ", (double)(clock() - tStart) / CLOCKS_PER_SEC)
void faltu() { cerr << endl; }
template <typename T> void faltu(T a[], int n) {
for (int i = 0; i < n; ++i)
cerr << a[i] << ' ';
cerr << endl;
}
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
cerr << arg << ' ';
faltu(rest...);
}
// Program showing a policy-based data structure.
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#include <iostream>
using namespace __gnu_pbds;
using namespace std;
// GNU link : https://goo.gl/WVDL6g
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
/**___________________________________________________**/
vector<ll> D;
void CommonDiv(ll n) {
for (ll x = 1; x * x <= n; x++) {
if (n % x == 0) {
D.push_back(x);
if (n / x != x)
D.push_back(n / x);
}
}
}
int main() {
FASTIO
// ///*
// #ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
// freopen("error.txt", "w", stderr);
// #endif
//*/
int T;
// scanf("%d", &T);
T = 1;
for (int cs = 1; cs <= T; cs++) {
ll a, b;
cin >> a >> b;
ll gcd = __gcd(a, b);
// dbg(gcd);
CommonDiv(gcd);
int ans = 0;
// for (auto x : D) cerr << x << " ";
// cerr << endl;
map<ll, bool> mp;
for (int i = 0; i < (int)D.size(); i++) {
if (mp[D[i]])
continue;
for (int j = i + 1; j < (int)D.size(); j++) {
if (__gcd(D[i], D[j]) > 1) {
ll x = max(D[i], D[j]);
mp[x] = true;
}
}
}
for (auto x : D) {
if (!mp[x])
ans++;
}
cout << ans << endl;
}
return 0;
} | insert | 129 | 129 | 129 | 131 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((ll)x.size())
#define MOD (ll)(1e9 + 7)
#define INF (9e18)
#define EPS (1e-6)
#ifdef LOCAL_TEST
#define debug(...) \
do { \
cerr << __PRETTY_FUNCTION__ << " - " << __LINE__ << " : (" #__VA_ARGS__ \
<< ") = "; \
_OUT(__VA_ARGS__); \
} while (0)
template <typename T> void _OUT(T x) { cerr << x << endl; }
template <typename T, typename... I> void _OUT(T x, I... tail) {
cerr << x << ", ";
_OUT(tail...);
}
#else
#define debug(...)
#endif
void INIT() {
#ifdef LOCAL_TEST
freopen("D:\\input.in", "r", stdin);
freopen("D:\\output.out", "w", stdout);
freopen("D:\\error.out", "w", stderr);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
}
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; }
ll fpow(ll b, ll p) {
b %= MOD;
ll ans = 1;
while (p > 0) {
if (p & 1)
ans = (ans * b) % MOD;
p /= 2;
b = (b * b) % MOD;
}
return ans;
}
int32_t main() {
INIT();
// code...
ll a, b;
cin >> a >> b;
ll n = gcd(a, b);
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 << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((ll)x.size())
#define MOD (ll)(1e9 + 7)
#define INF (9e18)
#define EPS (1e-6)
#ifdef LOCAL_TEST
#define debug(...) \
do { \
cerr << __PRETTY_FUNCTION__ << " - " << __LINE__ << " : (" #__VA_ARGS__ \
<< ") = "; \
_OUT(__VA_ARGS__); \
} while (0)
template <typename T> void _OUT(T x) { cerr << x << endl; }
template <typename T, typename... I> void _OUT(T x, I... tail) {
cerr << x << ", ";
_OUT(tail...);
}
#else
#define debug(...)
#endif
void INIT() {
#ifdef LOCAL_TEST
freopen("D:\\input.in", "r", stdin);
freopen("D:\\output.out", "w", stdout);
freopen("D:\\error.out", "w", stderr);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
}
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; }
ll fpow(ll b, ll p) {
b %= MOD;
ll ans = 1;
while (p > 0) {
if (p & 1)
ans = (ans * b) % MOD;
p /= 2;
b = (b * b) % MOD;
}
return ans;
}
int32_t main() {
INIT();
// code...
ll a, b;
cin >> a >> b;
ll n = gcd(a, b);
int ans = 1;
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 << "\n";
return 0;
}
| replace | 59 | 60 | 59 | 60 | TLE | |
p02900 | C++ | Time Limit Exceeded | //----------BHAVIK DIWANI(PICT_COMP)---------------
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#define test \
ll t; \
cin >> t; \
while (t--)
#define FOR(p, n) for (ll i = p; i < (ll)n; i++)
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 1000005
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int, int>
#define endl '\n'
#define vs vector<string>
#define mii map<int, int>
#define msi map<string, int>
#define vpii vector<pair<int, int>>
#define vpsi vector<pair<string, int>>
#define forci(p, q) for (int i = p; i < q; i++)
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b) * b); }
ull power(ull a, ull b) {
a %= mod;
ull res = 1;
while (b > 0) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res % mod;
}
ll modmul(ll x, ll y) { return (x * y) % mod; }
ll modadd(ll x, ll y) { return (x + y) % mod; }
ll modsub(ll x, ll y) { return (x - y + mod) % mod; }
ll fact[1000007] = {0};
void facto() {
fact[0] = 1;
fact[1] = 1;
for (int i = 2; i < 100007; i++)
fact[i] = (fact[i - 1] * i) % mod;
}
ll ncr(ll n, ll r) {
ll res = 1;
res = fact[n];
res = (res * (power(fact[r], mod - 2))) % mod;
res = (res * (power(fact[n - r], mod - 2))) % mod;
return res;
}
ll npr(ll n, ll r) {
ll res = 1;
res = fact[n];
res = (res * (power(fact[n - r], mod - 2))) % mod;
return res;
}
inline long long toint(const std::string &s) {
std::stringstream ss;
ss << s;
long long x;
ss >> x;
return x;
}
inline std::string tostring(long long number) {
std::stringstream ss;
ss << number;
return ss.str();
}
inline std::string tobin(long long x) { return std::bitset<63>(x).to_string(); }
bool prime[MAX];
ull sieve() {
memset(prime, true, sizeof(prime));
for (ull p = 2; p * p < MAX; p++) {
if (prime[p] == true) {
for (ull i = 2 * p; i < MAX; i += p) {
prime[i] = false;
}
}
}
prime[0] = 0;
prime[1] = 0;
}
/*int inv[1000001]={0};
void findinverse(){inv[1] = 1;for(int i = 2; i <=1e6 ; ++i) inv[i] = (mod -
(mod/i) * inv[mod%i] % mod) % mod;}
*/
using namespace std;
set<int> g;
void primeFactors(int n) {
while (n % 2 == 0) {
g.insert(2);
n = n / 2;
}
for (int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
g.insert(i);
n = n / i;
}
}
if (n > 2)
g.insert(n);
}
int solve() {
int a, b;
cin >> a >> b;
int x = gcd(a, b);
primeFactors(x);
cout << g.size() + 1 << endl;
}
signed main() {
fastio;
// test
solve();
} | //----------BHAVIK DIWANI(PICT_COMP)---------------
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#define test \
ll t; \
cin >> t; \
while (t--)
#define FOR(p, n) for (ll i = p; i < (ll)n; i++)
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 1000005
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int, int>
#define endl '\n'
#define vs vector<string>
#define mii map<int, int>
#define msi map<string, int>
#define vpii vector<pair<int, int>>
#define vpsi vector<pair<string, int>>
#define forci(p, q) for (int i = p; i < q; i++)
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b) * b); }
ull power(ull a, ull b) {
a %= mod;
ull res = 1;
while (b > 0) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res % mod;
}
ll modmul(ll x, ll y) { return (x * y) % mod; }
ll modadd(ll x, ll y) { return (x + y) % mod; }
ll modsub(ll x, ll y) { return (x - y + mod) % mod; }
ll fact[1000007] = {0};
void facto() {
fact[0] = 1;
fact[1] = 1;
for (int i = 2; i < 100007; i++)
fact[i] = (fact[i - 1] * i) % mod;
}
ll ncr(ll n, ll r) {
ll res = 1;
res = fact[n];
res = (res * (power(fact[r], mod - 2))) % mod;
res = (res * (power(fact[n - r], mod - 2))) % mod;
return res;
}
ll npr(ll n, ll r) {
ll res = 1;
res = fact[n];
res = (res * (power(fact[n - r], mod - 2))) % mod;
return res;
}
inline long long toint(const std::string &s) {
std::stringstream ss;
ss << s;
long long x;
ss >> x;
return x;
}
inline std::string tostring(long long number) {
std::stringstream ss;
ss << number;
return ss.str();
}
inline std::string tobin(long long x) { return std::bitset<63>(x).to_string(); }
bool prime[MAX];
ull sieve() {
memset(prime, true, sizeof(prime));
for (ull p = 2; p * p < MAX; p++) {
if (prime[p] == true) {
for (ull i = 2 * p; i < MAX; i += p) {
prime[i] = false;
}
}
}
prime[0] = 0;
prime[1] = 0;
}
/*int inv[1000001]={0};
void findinverse(){inv[1] = 1;for(int i = 2; i <=1e6 ; ++i) inv[i] = (mod -
(mod/i) * inv[mod%i] % mod) % mod;}
*/
using namespace std;
set<int> g;
void primeFactors(int n) {
while (n % 2 == 0) {
g.insert(2);
n = n / 2;
}
for (int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
g.insert(i);
n = n / i;
}
}
if (n > 2)
g.insert(n);
}
int solve() {
int a, b;
cin >> a >> b;
int x = gcd(a, b);
primeFactors(x);
cout << g.size() + 1 << endl;
return 0;
}
signed main() {
fastio;
// test
solve();
} | insert | 122 | 122 | 122 | 123 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ << ": " << #x << " = " << (x) << '\n')
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
const int INF = 0x3f3f3f3f;
const int maxn = 110000;
int main() {
// 检查有没有特判0,有没有越界限.
ios::sync_with_stdio(false);
cin.tie(0);
cout << setiosflags(ios::fixed) << setprecision(12);
ll a, b;
cin >> a >> b;
ll num = __gcd(a, b);
int ans = 1;
ll cur = num;
for (ll i = 2; i <= num; i++) {
if (num % i == 0) {
ans++;
while (num % i == 0) {
num /= i;
}
}
}
if (num > 1)
ans++;
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ << ": " << #x << " = " << (x) << '\n')
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
const int INF = 0x3f3f3f3f;
const int maxn = 110000;
int main() {
// 检查有没有特判0,有没有越界限.
ios::sync_with_stdio(false);
cin.tie(0);
cout << setiosflags(ios::fixed) << setprecision(12);
ll a, b;
cin >> a >> b;
ll num = __gcd(a, b);
int ans = 1;
ll cur = num;
for (ll i = 2; i * i <= num; i++) {
if (num % i == 0) {
ans++;
while (num % i == 0) {
num /= i;
}
}
}
if (num > 1)
ans++;
cout << ans << "\n";
return 0;
} | replace | 27 | 28 | 27 | 28 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// ll gcd(ll x, ll y){ return y ? gcd(y, x%y): x;}
// ll lcm(ll x, ll y){ return x*y/gcd(x, y);}
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
ll s = g;
ll ans = 1;
for (int i = 2; i * i <= s; i++) {
if (g % i == 0) {
ans += 1;
while (g % i == 0) {
g /= i;
}
}
}
if (g > 1) {
ans++;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// ll gcd(ll x, ll y){ return y ? gcd(y, x%y): x;}
// ll lcm(ll x, ll y){ return x*y/gcd(x, y);}
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
ll s = g;
ll ans = 1;
for (ll i = 2; i * i <= s; i++) {
if (g % i == 0) {
ans += 1;
while (g % i == 0) {
g /= i;
}
}
}
if (g > 1) {
ans++;
}
cout << ans;
} | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
ll s = g;
ll ans = 1;
for (int i = 2; i * i <= s; i++) {
if (g % i == 0) {
ans += 1;
while (g % i == 0) {
g /= i;
}
}
}
if (g > 1) {
ans++;
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
ll s = g;
ll ans = 1;
for (ll i = 2; i * i <= s; i++) {
if (g % i == 0) {
ans += 1;
while (g % i == 0) {
g /= i;
}
}
}
if (g > 1) {
ans++;
}
cout << ans;
}
| replace | 10 | 11 | 10 | 11 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
ll s = g;
ll ans = 1;
for (int i = 2; i * i <= s; i++) {
if (g % i == 0) {
ans += 1;
while (g % i == 0) {
g /= i;
}
}
}
if (g > 1) {
ans++;
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
ll s = g;
ll ans = 1;
for (ll i = 2; i * i <= s; i++) {
if (g % i == 0) {
ans += 1;
while (g % i == 0) {
g /= i;
}
}
}
if (g > 1) {
ans++;
}
cout << ans;
}
| replace | 9 | 10 | 9 | 10 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define INF ((int)1e9)
#define INFLL ((ll)1e18)
#define MOD (1000000007LL)
ll gcd(ll A, ll B) {
if (A < B)
return gcd(B, A);
if (B == 0)
return A;
return gcd(B, A % B);
}
int main(int argc, const char *argv[]) {
ios_base::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll C = gcd(A, B);
int Res = 1;
for (int i = 2; i * i <= C; ++i) {
if (C % i == 0) {
++Res;
while (C % i == 0)
C /= i;
}
}
if (C != 1)
++Res;
cout << Res << endl;
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define INF ((int)1e9)
#define INFLL ((ll)1e18)
#define MOD (1000000007LL)
ll gcd(ll A, ll B) {
if (A < B)
return gcd(B, A);
if (B == 0)
return A;
return gcd(B, A % B);
}
int main(int argc, const char *argv[]) {
ios_base::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll C = gcd(A, B);
int Res = 1;
for (ll i = 2; i * i <= C; ++i) {
if (C % i == 0) {
++Res;
while (C % i == 0)
C /= i;
}
}
if (C != 1)
++Res;
cout << Res << endl;
return 0;
}
| replace | 37 | 38 | 37 | 38 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define watch(x) cout << (#x) << " is " << (x) << endl
#define f(i, x, n) for (int i = x; i < n; i++)
#define FASTIO \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define eb(x) emplace_back(x)
#define mp(a, b) make_pair(a, b)
#define sz(a) int((a).size())
#define mod 1000000007
#define tr(c, i) for (typeof((c)).begin() i = (c).begin(); i != (c).end(); i++)
#define inf LLONG_MAX
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void seethis(vector<ll> vect) {
for (ll x : vect)
cout << x << " ";
cout << "\n";
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
// LCM
int lcm(int a, int b) { return a * (b / __gcd(a, b)); }
// For sort by second
bool cmp(const pair<int, int> &a) { return a.first < a.second; }
// Tree
/* const int MAXN = 1e5 + 5;
vector<ll> adj[MAXN];*/
// ModPower
ll modpower(ll a, ll b, ll c) {
ll res = 1;
while (b) {
if (b & 1LL)
res = (res * a) % c;
a = (a * a) % c;
b >>= 1;
}
return res;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
FASTIO;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
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 << "\n";
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define watch(x) cout << (#x) << " is " << (x) << endl
#define f(i, x, n) for (int i = x; i < n; i++)
#define FASTIO \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define eb(x) emplace_back(x)
#define mp(a, b) make_pair(a, b)
#define sz(a) int((a).size())
#define mod 1000000007
#define tr(c, i) for (typeof((c)).begin() i = (c).begin(); i != (c).end(); i++)
#define inf LLONG_MAX
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void seethis(vector<ll> vect) {
for (ll x : vect)
cout << x << " ";
cout << "\n";
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
// LCM
int lcm(int a, int b) { return a * (b / __gcd(a, b)); }
// For sort by second
bool cmp(const pair<int, int> &a) { return a.first < a.second; }
// Tree
/* const int MAXN = 1e5 + 5;
vector<ll> adj[MAXN];*/
// ModPower
ll modpower(ll a, ll b, ll c) {
ll res = 1;
while (b) {
if (b & 1LL)
res = (res * a) % c;
a = (a * a) % c;
b >>= 1;
}
return res;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
FASTIO;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
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 << "\n";
return 0;
} | replace | 73 | 74 | 73 | 74 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
bool DEBUG = true;
// find maximum kouyakusuu
// souinsuu bunkai the maximum kouyakusuu
// return the num of kinds of soinsuu + 1
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
// bool isseen(vector<int>& primes, int num) {
// bool seen = false;
// rep(pi, primes.size()){
// if (num % primes[pi] == 0) {
// seen = true;
// break;
// }
// }
// return seen;
// }
int main() {
ll A, B;
cin >> A >> B;
ll greatest_common_divisor;
if (A > B)
greatest_common_divisor = gcd(A, B);
else
greatest_common_divisor = gcd(B, A);
ll ans = 1;
ll top = greatest_common_divisor;
for (int i = 2; i * i < top; i++) {
if (top % i != 0)
continue;
ans++;
while (top % i == 0)
top /= i;
}
if (top != 1)
ans++;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
bool DEBUG = true;
// find maximum kouyakusuu
// souinsuu bunkai the maximum kouyakusuu
// return the num of kinds of soinsuu + 1
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
// bool isseen(vector<int>& primes, int num) {
// bool seen = false;
// rep(pi, primes.size()){
// if (num % primes[pi] == 0) {
// seen = true;
// break;
// }
// }
// return seen;
// }
int main() {
ll A, B;
cin >> A >> B;
ll greatest_common_divisor;
if (A > B)
greatest_common_divisor = gcd(A, B);
else
greatest_common_divisor = gcd(B, A);
ll ans = 1;
ll top = greatest_common_divisor;
for (ll i = 2; i * i < top; i++) {
if (top % i != 0)
continue;
ans++;
while (top % i == 0)
top /= i;
}
if (top != 1)
ans++;
cout << ans << endl;
} | replace | 46 | 47 | 46 | 47 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int Prime[1000000]; // Prime[i] = 1のときiは素数。0のときiは素数でない
void Eratosthenes(int n) { // n未満の素数を求める
rep(i, n) { Prime[i] = 1; }
Prime[0] = 0;
Prime[1] = 0;
for (int i = 2; i * i < n; i++) {
if (Prime[i]) {
for (int j = 2; i * j < n; j++) {
Prime[i * j] = 0;
}
}
}
}
ll gcd(ll x, ll y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
int main() {
ll a, b;
cin >> a >> b;
ll G = gcd(a, b);
Eratosthenes(1000000);
int ans = 1;
for (int i = 2; i * i <= G; i++) {
if (Prime[i] && G % i == 0) {
ans++;
while (G % i == 0) {
G /= i;
}
}
}
if (G != 1) {
ans++;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int Prime[1000000]; // Prime[i] = 1のときiは素数。0のときiは素数でない
void Eratosthenes(int n) { // n未満の素数を求める
rep(i, n) { Prime[i] = 1; }
Prime[0] = 0;
Prime[1] = 0;
for (int i = 2; i * i < n; i++) {
if (Prime[i]) {
for (int j = 2; i * j < n; j++) {
Prime[i * j] = 0;
}
}
}
}
ll gcd(ll x, ll y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
int main() {
ll a, b;
cin >> a >> b;
ll G = gcd(a, b);
Eratosthenes(1000000);
ll ans = 1LL;
for (ll i = 2; i * i <= G; i++) {
if (Prime[i] && G % i == 0) {
ans++;
while (G % i == 0) {
G /= i;
}
}
}
if (G != 1) {
ans++;
}
cout << ans << endl;
return 0;
} | replace | 48 | 50 | 48 | 50 | 0 | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
// 出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
// 最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
auto f = factorize(g);
int ans = f.size() + 1;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
// 出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
auto f = factorize(g);
int ans = f.size() + 1;
cout << ans << endl;
} | replace | 21 | 32 | 21 | 22 | 0 | |
p02900 | 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;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
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)) {
ans++;
g /= i;
while (!(g % i)) {
g /= i;
}
}
}
if (g != 1)
ans++;
cout << ans << 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;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
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)) {
ans++;
g /= i;
while (!(g % i)) {
g /= i;
}
}
}
if (g != 1)
ans++;
cout << ans << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | TLE | |
p02900 | C++ | Time Limit Exceeded | /**
* @Author: G_bg
* @DateTime: 2019-09-28 20:22:27
* @Description:
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const double PI = 3.1415926535898;
const double E = 2.718281828459;
const int INF = 0x7fffffff;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
LL gcd(LL a, LL b) { return b == 0 ? a : gcd(b, a % b); }
int prime[maxn], m;
void decompose(LL n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) { // i一定是素数
prime[++m] = i;
while (n % i == 0)
n /= i;
}
}
if (n > 1)
prime[++m] = n; // n是质数
}
int main(int argc, const char *argv[]) {
ios::sync_with_stdio(0);
cin.tie(0);
LL a, b;
cin >> a >> b;
LL g = gcd(a, b);
decompose(g);
cout << m + 1 << endl;
return 0;
} | /**
* @Author: G_bg
* @DateTime: 2019-09-28 20:22:27
* @Description:
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const double PI = 3.1415926535898;
const double E = 2.718281828459;
const int INF = 0x7fffffff;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
LL gcd(LL a, LL b) { return b == 0 ? a : gcd(b, a % b); }
int prime[maxn], m;
void decompose(LL n) {
for (LL i = 2; i * i <= n; i++) {
if (n % i == 0) { // i一定是素数
prime[++m] = i;
while (n % i == 0)
n /= i;
}
}
if (n > 1)
prime[++m] = n; // n是质数
}
int main(int argc, const char *argv[]) {
ios::sync_with_stdio(0);
cin.tie(0);
LL a, b;
cin >> a >> b;
LL g = gcd(a, b);
decompose(g);
cout << m + 1 << endl;
return 0;
} | replace | 16 | 17 | 16 | 17 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(i) sort((i).begin(), (i).end())
#define INF 2000000000
constexpr ll mod = 1000000007;
ll gcd(ll x, ll y) { return y != 0 ? gcd(y, x % y) : x; }
vector<pair<ll, int>> factorize(ll N) {
vector<pair<ll, int>> res;
for (ll i = 0; i * i <= N; ++i) {
if (N % i)
continue;
res.emplace_back(i, 0);
while (N % i == 0) {
N /= i;
res.back().second++;
}
}
if (N != 1)
res.emplace_back(N, 1);
return res;
}
int main() {
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
auto f = factorize(g);
int ans = f.size() + 1;
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(i) sort((i).begin(), (i).end())
#define INF 2000000000
constexpr ll mod = 1000000007;
ll gcd(ll x, ll y) { return y != 0 ? gcd(y, x % y) : x; }
vector<pair<ll, int>> factorize(ll N) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= N; ++i) {
if (N % i)
continue;
res.emplace_back(i, 0);
while (N % i == 0) {
N /= i;
res.back().second++;
}
}
if (N != 1)
res.emplace_back(N, 1);
return res;
}
int main() {
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
auto f = factorize(g);
int ans = f.size() + 1;
cout << ans << "\n";
return 0;
} | replace | 10 | 11 | 10 | 11 | -8 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll get_gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return ((a % b == 0 ? b : get_gcd(b, a % b)));
}
vector<pair<ll, ll>> prime_factorize(ll gcd) {
vector<pair<ll, ll>> ans;
for (int i = 2; i * i <= gcd; i++) {
if (gcd % i != 0)
continue;
int ex = 0;
while (gcd % i == 0) {
ex++;
gcd /= i;
}
ans.push_back({i, ex});
}
if (gcd != 1)
ans.push_back({gcd, 1});
return ans;
}
int main() {
ll a, b;
cin >> a >> b;
ll gcd = get_gcd(a, b);
vector<pair<ll, ll>> ans = prime_factorize(gcd);
cout << ((int)ans.size() + 1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll get_gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return ((a % b == 0 ? b : get_gcd(b, a % b)));
}
vector<pair<ll, ll>> prime_factorize(ll gcd) {
vector<pair<ll, ll>> ans;
for (ll i = 2; i * i <= gcd; i++) {
if (gcd % i != 0)
continue;
int ex = 0;
while (gcd % i == 0) {
ex++;
gcd /= i;
}
ans.push_back({i, ex});
}
if (gcd != 1)
ans.push_back({gcd, 1});
return ans;
}
int main() {
ll a, b;
cin >> a >> b;
ll gcd = get_gcd(a, b);
vector<pair<ll, ll>> ans = prime_factorize(gcd);
cout << ((int)ans.size() + 1) << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#include <set>
using namespace std;
using ll = long long int;
// num: 12 -> {2, 3}
// num は最大で1e12
set<int> get_factors(ll num) {
ll n = num;
set<int> ret;
while (n % 2 == 0) {
n /= 2;
ret.insert(2);
}
// nは奇数
for (int i = 3; i * i <= num; i += 2) {
while (n % i == 0) {
n /= i;
ret.insert(i);
}
}
if (n != 1) {
ret.insert(n);
}
return ret;
}
int main() {
// your code goes here
ll A, B;
cin >> A >> B;
auto res1 = get_factors(A);
auto res2 = get_factors(B);
int cnt = 0;
for (auto e : res1) {
cnt += res2.count(e);
}
++cnt;
cout << cnt << endl;
return 0;
} | #include <iostream>
#include <set>
using namespace std;
using ll = long long int;
// num: 12 -> {2, 3}
// num は最大で1e12
set<int> get_factors(ll num) {
ll n = num;
set<int> ret;
while (n % 2 == 0) {
n /= 2;
ret.insert(2);
}
// nは奇数
for (ll i = 3; i * i <= num; i += 2) {
while (n % i == 0) {
n /= i;
ret.insert(i);
}
}
if (n != 1) {
ret.insert(n);
}
return ret;
}
int main() {
// your code goes here
ll A, B;
cin >> A >> B;
auto res1 = get_factors(A);
auto res2 = get_factors(B);
int cnt = 0;
for (auto e : res1) {
cnt += res2.count(e);
}
++cnt;
cout << cnt << endl;
return 0;
} | replace | 16 | 17 | 16 | 17 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> T gcd(T a, T b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B;
cin >> A >> B;
ll gcdn = gcd(A, B);
ll gcdcopy = gcdn;
int res = 1;
for (int i = 2; i * i <= gcdn; i++) {
if (gcdcopy % i != 0)
continue;
res++;
while (gcdcopy % i == 0) {
gcdcopy /= i;
}
}
if (gcdcopy > 1) {
res++;
}
cout << res << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> T gcd(T a, T b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B;
cin >> A >> B;
ll gcdn = gcd(A, B);
ll gcdcopy = gcdn;
int res = 1;
for (ll i = 2; i * i <= gcdn; i++) {
if (gcdcopy % i != 0)
continue;
res++;
while (gcdcopy % i == 0) {
gcdcopy /= i;
}
}
if (gcdcopy > 1) {
res++;
}
cout << res << '\n';
return 0;
}
| replace | 22 | 23 | 22 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() // 昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> Vl;
typedef vector<int> VI; // VI a(n);
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<VS> VSS;
typedef vector<VC> VCC;
typedef vector<VI> VVI; // VVI a(n,vector<int>(m)) n * m
typedef vector<Vl> VVl;
typedef pair<int, int> PII;
typedef map<int, int> MP; // MP a;
typedef vector<pair<int, int>> PS;
typedef long long ll; // ll とdoubleは違う
// stack<int> st;
// cout << << endl;
// cin >> ;
template <typename T> // operator << (cout,a);
ostream &operator<<(ostream &os, vector<T> &v) {
os << "{";
rep(i, (int)v.size()) { os << v[i] << (i < v.size() - 1 ? ", " : ""); }
os << "}";
return os;
}
template <typename T> T gcd(T a, T b) { return b != 0 ? gcd(b, a % b) : a; }
template <typename T> vector<pair<T, int>> prime_factorization(T n) {
vector<pair<T, int>> res;
for (T i = 2; i * i <= n; i++) {
int cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
if (cnt > 0)
res.push_back(make_pair(i, cnt));
}
if (n > 1)
res.push_back(make_pair(n, 1));
return res;
}
int main() {
int a, b, x = 0, y = 0, d = 0, n, h, w, k, max = -100, ans = 0, ptr = 0,
sum = 0;
string s;
cin >> a >> b;
a = gcd(a, b);
cout << prime_factorization(a).size() + 1 << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() // 昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> Vl;
typedef vector<int> VI; // VI a(n);
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<VS> VSS;
typedef vector<VC> VCC;
typedef vector<VI> VVI; // VVI a(n,vector<int>(m)) n * m
typedef vector<Vl> VVl;
typedef pair<int, int> PII;
typedef map<int, int> MP; // MP a;
typedef vector<pair<int, int>> PS;
typedef long long ll; // ll とdoubleは違う
// stack<int> st;
// cout << << endl;
// cin >> ;
template <typename T> // operator << (cout,a);
ostream &operator<<(ostream &os, vector<T> &v) {
os << "{";
rep(i, (int)v.size()) { os << v[i] << (i < v.size() - 1 ? ", " : ""); }
os << "}";
return os;
}
template <typename T> T gcd(T a, T b) { return b != 0 ? gcd(b, a % b) : a; }
template <typename T> vector<pair<T, int>> prime_factorization(T n) {
vector<pair<T, int>> res;
for (T i = 2; i * i <= n; i++) {
int cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
if (cnt > 0)
res.push_back(make_pair(i, cnt));
}
if (n > 1)
res.push_back(make_pair(n, 1));
return res;
}
int main() {
ll a, b, x = 0, y = 0, d = 0, n, h, w, k, max = -100, ans = 0, ptr = 0,
sum = 0;
string s;
cin >> a >> b;
a = gcd(a, b);
cout << prime_factorization(a).size() + 1 << endl;
return 0;
} | replace | 50 | 52 | 50 | 52 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, ll> P;
ll gcd(ll a, ll b) {
if (a != 0 && b == 0) {
return a;
}
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (
ll i = 2; i * i <= n;
i++) // i以下はすでに試しているからi*iよりnが小さかったらもう割り切れるものはない
{
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
vector<ll> prime(g + 1);
vector<bool> is_prime(g + 1, true);
ll p = 0;
auto st = prime_factor(g);
cout << st.size() + 1;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, ll> P;
ll gcd(ll a, ll b) {
if (a != 0 && b == 0) {
return a;
}
if (a % b == 0) {
return b;
} else {
return (gcd(b, a % b));
}
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (
ll i = 2; i * i <= n;
i++) // i以下はすでに試しているからi*iよりnが小さかったらもう割り切れるものはない
{
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
auto st = prime_factor(g);
cout << st.size() + 1;
} | delete | 48 | 51 | 48 | 48 | 0 | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int s = 1000000;
bool vis[s + 1];
bool is_prime[s + 1];
int main() {
long long int a, b, i, j, count = 0, num1, num2;
cin >> a >> b;
is_prime[0] = true;
for (i = 2; i * i <= s; i++) {
if (!is_prime[i]) {
for (j = i * i; j <= s; j += i) {
is_prime[j] = true;
}
}
}
num1 = a, num2 = b;
for (i = 1; i * i <= a; i++) {
if (!is_prime[i]) {
if (a % i == 0) {
vis[i] = true;
}
while (i != 1 && num1 % i == 0) {
num1 = (num1 / i);
}
}
}
for (i = 1; i * i <= b; i++) {
if (!is_prime[i]) {
if (b % i == 0) {
if (vis[i]) {
count++;
} else if (i == num1)
count++;
while (i != 1 && num2 % i == 0) {
num2 /= i;
}
}
}
}
if (num1 != 1 && num2 != 1 && num1 == num2) {
if (!is_prime[num1])
count++;
} else if (num2 != 1 && num2 <= s && vis[num2])
count++;
cout << count << "\n";
} | #include <bits/stdc++.h>
using namespace std;
const int s = 1000000;
bool vis[s + 1];
bool is_prime[s + 1];
int main() {
long long int a, b, i, j, count = 0, num1, num2;
cin >> a >> b;
is_prime[0] = true;
for (i = 2; i * i <= s; i++) {
if (!is_prime[i]) {
for (j = i * i; j <= s; j += i) {
is_prime[j] = true;
}
}
}
num1 = a, num2 = b;
for (i = 1; i * i <= a; i++) {
if (!is_prime[i]) {
if (a % i == 0) {
vis[i] = true;
}
while (i != 1 && num1 % i == 0) {
num1 = (num1 / i);
}
}
}
for (i = 1; i * i <= b; i++) {
if (!is_prime[i]) {
if (b % i == 0) {
if (vis[i]) {
count++;
} else if (i == num1)
count++;
while (i != 1 && num2 % i == 0) {
num2 /= i;
}
}
}
}
if (num1 != 1 && num2 != 1 && num1 == num2) {
count++;
} else if (num2 != 1 && num2 <= s && vis[num2])
count++;
cout << count << "\n";
} | replace | 43 | 45 | 43 | 44 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
long long int a, b, s, l, tmp;
cin >> a >> b;
s = (a < b) ? a : b;
l = (a < b) ? b : a;
while (s > 0) {
l = l % s;
if (l < s) {
tmp = s;
s = l;
l = tmp;
}
}
if (l == 1) {
cout << 1 << endl;
return 0;
}
int cnt = 0, i = 2;
while (l > 1) {
if (l % i == 0)
cnt++;
while (l % i == 0) {
l = l / i;
}
i++;
if (i * i > l)
break;
}
if (l > 1)
cnt++;
cout << cnt + 1 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
long long int a, b, s, l, tmp;
cin >> a >> b;
s = (a < b) ? a : b;
l = (a < b) ? b : a;
while (s > 0) {
l = l % s;
if (l < s) {
tmp = s;
s = l;
l = tmp;
}
}
if (l == 1) {
cout << 1 << endl;
return 0;
}
long long int cnt = 0, i = 2;
while (l > 1) {
if (l % i == 0)
cnt++;
while (l % i == 0) {
l = l / i;
}
i++;
if (i * i > l)
break;
}
if (l > 1)
cnt++;
cout << cnt + 1 << endl;
return 0;
} | replace | 27 | 28 | 27 | 28 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long euclidean_gcd(long long a, long long b) {
long long temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (a % b == 0)
return b;
euclidean_gcd(b, a % b);
}
int main() {
long long A, B, cnt;
cnt = 0;
cin >> A;
cin >> B;
long long gcd = euclidean_gcd(A, B);
for (long long i = 2; i <= gcd; i++) {
if (gcd % i == 0) {
cnt++;
}
while (gcd % i == 0)
gcd /= i;
}
if (gcd > 1)
cnt++;
cout << cnt + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long euclidean_gcd(long long a, long long b) {
long long temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (a % b == 0)
return b;
euclidean_gcd(b, a % b);
}
int main() {
long long A, B, cnt;
cnt = 0;
cin >> A;
cin >> B;
long long gcd = euclidean_gcd(A, B);
for (long long i = 2; i * i <= gcd; i++) {
if (gcd % i == 0) {
cnt++;
}
while (gcd % i == 0)
gcd /= i;
}
if (gcd > 1)
cnt++;
cout << cnt + 1 << endl;
return 0;
}
| replace | 26 | 27 | 26 | 27 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef unsigned long long ll;
// A > B
ll calcGCD(ll A, ll B) {
if (A % B == 0) {
return B;
} else {
calcGCD(B, A % B);
}
}
bool isPrime(ll gcd) {}
int main() {
ll A, B;
cin >> A >> B;
ll bigger = A;
ll smaller = B;
if (A < B) {
bigger = B;
smaller = A;
}
ll gcd = calcGCD(bigger, smaller);
if (gcd == 1) {
cout << 1 << endl;
return 0;
}
// gcdを素因数分解
ll counter = 1;
ll root = (ll)sqrt(gcd);
ll gcd_copy = gcd;
for (ll i = 2; i < gcd_copy; i++) {
bool isDevide = false;
while (gcd % i == 0) {
if (!isDevide) {
counter++;
isDevide = true;
}
gcd = gcd / i;
}
if (i > gcd) {
cout << counter << endl;
return 0;
}
root = sqrt(gcd);
if (i > root && counter == 1) {
cout << 2 << endl;
return 0;
}
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef unsigned long long ll;
// A > B
ll calcGCD(ll A, ll B) {
if (A % B == 0) {
return B;
} else {
calcGCD(B, A % B);
}
}
bool isPrime(ll gcd) {}
int main() {
ll A, B;
cin >> A >> B;
ll bigger = A;
ll smaller = B;
if (A < B) {
bigger = B;
smaller = A;
}
ll gcd = calcGCD(bigger, smaller);
if (gcd == 1) {
cout << 1 << endl;
return 0;
}
// gcdを素因数分解
ll counter = 1;
ll root = (ll)sqrt(gcd);
ll gcd_copy = gcd;
for (ll i = 2; i < gcd_copy; i++) {
bool isDevide = false;
while (gcd % i == 0) {
if (!isDevide) {
counter++;
isDevide = true;
}
gcd = gcd / i;
}
if (i > gcd) {
cout << counter << endl;
return 0;
}
root = sqrt(gcd);
if (i > root) {
cout << counter + 1 << endl;
return 0;
}
}
return 0;
}
| replace | 52 | 54 | 52 | 54 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int a, b, c, t, i;
int main() {
cin >> a >> b;
c = __gcd(a, b);
for (i = 2; i * i <= c; i++) {
if (c % i == 0) {
t++;
while (c % i == 0)
c /= i;
}
}
if (c != 1)
t++;
cout << t + 1;
}
| #include <bits/stdc++.h>
using namespace std;
long a, b, c, t, i;
int main() {
cin >> a >> b;
c = __gcd(a, b);
for (i = 2; i * i <= c; i++) {
if (c % i == 0) {
t++;
while (c % i == 0)
c /= i;
}
}
if (c != 1)
t++;
cout << t + 1;
}
| replace | 2 | 3 | 2 | 3 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long m, n, g, cnt = 1;
long long gcd(int m, int n) {
if (m % n == 0)
return n;
else
return gcd(n, m % n);
}
int main() {
cin >> m >> n;
g = gcd(m, n);
for (long long i = 2; i <= sqrt(g); i++) {
if (g % i == 0) {
cnt++;
while (g % i == 0)
g = g / i;
}
}
if (g > 1)
cnt++;
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long m, n, g, cnt = 1;
long long gcd(long long m, long long n) {
if (m % n == 0)
return n;
else
return gcd(n, m % n);
}
int main() {
cin >> m >> n;
g = gcd(m, n);
for (long long i = 2; i <= sqrt(g); i++) {
if (g % i == 0) {
cnt++;
while (g % i == 0)
g = g / i;
}
}
if (g > 1)
cnt++;
cout << cnt << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ll a, b;
cin >> a >> b;
ll n = gcd(a, b);
int ans = 1;
for (int i = 2; i * i <= n; i++) {
if (n % i)
continue;
ans++;
while (n % i == 0)
n /= i;
}
if (n != 1)
ans++;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ll a, b;
cin >> a >> b;
ll n = gcd(a, b);
int ans = 1;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
ans++;
while (n % i == 0)
n /= i;
}
if (n != 1)
ans++;
cout << ans << endl;
return 0;
}
| replace | 18 | 19 | 18 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL A, B;
int main() {
cin >> A >> B;
LL C = __gcd(A, B);
int ans = 0;
for (int i = 1; (LL)i * i <= C; i++)
if (C % i == 0) {
ans++;
while (C % i == 0)
C /= i;
}
if (C > 1)
ans++;
cout << ans + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL A, B;
int main() {
cin >> A >> B;
LL C = __gcd(A, B);
int ans = 0;
for (int i = 2; (LL)i * i <= C; i++)
if (C % i == 0) {
ans++;
while (C % i == 0)
C /= i;
}
if (C > 1)
ans++;
cout << ans + 1 << endl;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> T gcd(T a, T b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B;
cin >> A >> B;
ll gcdn = gcd(A, B);
ll gcdc = gcdn;
ll res = 1;
for (int i = 2; i * i <= gcdn; i++) {
if (gcdc % i != 0)
continue;
res++;
while (gcdc % i == 0) {
gcdc /= i;
}
}
if (gcdc > 1) {
res++;
}
cout << res << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> T gcd(T a, T b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B;
cin >> A >> B;
ll gcdn = gcd(A, B);
ll gcdc = gcdn;
ll res = 1;
for (ll i = 2; i * i <= gcdn; i++) {
if (gcdc % i != 0)
continue;
res++;
while (gcdc % i == 0) {
gcdc /= i;
}
}
if (gcdc > 1) {
res++;
}
cout << res << '\n';
return 0;
}
| replace | 22 | 23 | 22 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 10010010010010010;
map<ll, int> prime_factor(ll N) {
map<ll, int> RES;
for (int I = 2; I * I <= N; I++) {
while (N % I == 0) {
RES[I]++;
N /= I;
}
}
if (N != 1)
RES[N] = 1;
return RES;
}
int main() {
ll a, b;
cin >> a >> b;
map<ll, int> ap = prime_factor(a);
map<ll, int> bp = prime_factor(b);
int ans = 1;
for (auto itr = ap.begin(); itr != ap.end(); itr++) {
if (bp[itr->first] != 0)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 10010010010010010;
map<ll, int> prime_factor(ll N) {
map<ll, int> 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() {
ll a, b;
cin >> a >> b;
map<ll, int> ap = prime_factor(a);
map<ll, int> bp = prime_factor(b);
int ans = 1;
for (auto itr = ap.begin(); itr != ap.end(); itr++) {
if (bp[itr->first] != 0)
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
using namespace std;
long long gcd(long long a, long long b) {
if (!b)
return a;
return gcd(b, a % b);
}
int main() {
long long a, b, g, t, ans = 1, tt;
cin >> a >> b;
g = gcd(a, b);
t = g;
int ss = sqrt(t);
for (int i = 2; i <= ss; i++) {
if (!(g % i)) {
while (!(g % i))
g /= i;
ans++;
}
}
for (int i = ss; i >= 1; i--) {
if (!(t % i) && !(g % (t / i))) {
tt = t / i;
while (!(g % tt))
g /= tt;
ans++;
}
}
cout << ans;
return 0;
}
| #include <iostream>
#include <math.h>
using namespace std;
long long gcd(long long a, long long b) {
if (!b)
return a;
return gcd(b, a % b);
}
int main() {
long long a, b, g, t, ans = 1, tt;
cin >> a >> b;
g = gcd(a, b);
t = g;
int ss = sqrt(t);
for (int i = 2; i <= ss; i++) {
if (!(g % i)) {
while (!(g % i))
g /= i;
ans++;
}
}
if (g != 1)
ans++;
cout << ans;
return 0;
}
| replace | 21 | 29 | 21 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a > b)
return gcd(a, b);
if (a == 0)
return b;
return gcd(b % a, a);
}
int main() {
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)
continue;
ans++;
while (g % i == 0)
g /= i;
}
if (g != 1)
ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a > b)
return gcd(b, a);
if (a == 0)
return b;
return gcd(b % a, a);
}
int main() {
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)
continue;
ans++;
while (g % i == 0)
g /= i;
}
if (g != 1)
ans++;
cout << ans << endl;
}
| replace | 5 | 6 | 5 | 6 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
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);
int cnt = 1;
for (int i = 2; i * i <= C; i++)
if (C % i == 0) {
while (C % i == 0) {
C /= i;
}
cnt++;
if (C == 1)
break;
}
if (C != 1)
cnt++;
cout << cnt << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
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);
int cnt = 1;
for (ll i = 2; i * i <= C; i++)
if (C % i == 0) {
while (C % i == 0) {
C /= i;
}
cnt++;
if (C == 1)
break;
}
if (C != 1)
cnt++;
cout << cnt << endl;
return 0;
} | replace | 16 | 17 | 16 | 17 | TLE | |
p02900 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
ll A, B, C;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin >> A >> B;
C = gcd(A, B);
int cnt = 1;
for (ll i = 0; i * i <= C; i++) {
if (C % i != 0)
continue;
while (C % i == 0) {
C /= i;
}
cnt++;
}
if (C != 1)
cnt++;
cout << cnt << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
ll A, B, C;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin >> A >> B;
C = gcd(A, B);
int cnt = 1;
for (ll i = 2; i * i <= C; i++) {
if (C % i != 0)
continue;
while (C % i == 0) {
C /= i;
}
cnt++;
}
if (C != 1)
cnt++;
cout << cnt << endl;
return 0;
} | replace | 17 | 18 | 17 | 18 | -8 | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
long long n, m, ans;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
cin >> n >> m;
m = gcd(n, m);
for (int i = 2; i * i <= m; i++) {
if (m % i == 0) {
++ans;
while (m % i == 0)
m /= i;
}
}
if (m > 1)
++ans;
cout << ans + 1 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
long long n, m, ans;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
cin >> n >> m;
m = gcd(n, m);
for (long long i = 2; i * i <= m; i++) {
if (m % i == 0) {
++ans;
while (m % i == 0)
m /= i;
}
}
if (m > 1)
++ans;
cout << ans + 1 << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, m, n) for (ll(i) = (m), i##_len = (n); (i) < (i##_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define _PR(x) cout << (x) << endl
#define _PS(x) cout << (x) << " "
#define SZ(x) ((int)(x).size())
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define pb push_back
ll gcd(ll a, ll b) {
if (a == 0)
return b;
if (b == 0)
return a;
if (a > b)
return gcd(a % b, b);
else if (a < b)
return gcd(a, b % a);
else
return a;
}
vector<ll> factorization(ll n) {
ll _n = n;
ll s = (ll)sqrt(n);
ll r;
vector<ll> p;
for (ll i = 2; i <= s; ++i) {
if (_n % i == 0) {
do {
_n /= i;
} while (_n % i == 0);
p.pb(i);
}
}
if (_n > s)
p.pb(_n);
return p;
}
int main() {
ll A, B;
cin >> A >> B;
ll G = gcd(A, B);
set<ll> cd;
REP(i, 1, G + 1) {
if (G % i == 0)
cd.insert(i);
}
auto p = factorization(G);
_PS(p.size() + 1);
return 0;
}
/*
*/ | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, m, n) for (ll(i) = (m), i##_len = (n); (i) < (i##_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define _PR(x) cout << (x) << endl
#define _PS(x) cout << (x) << " "
#define SZ(x) ((int)(x).size())
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define pb push_back
ll gcd(ll a, ll b) {
if (a == 0)
return b;
if (b == 0)
return a;
if (a > b)
return gcd(a % b, b);
else if (a < b)
return gcd(a, b % a);
else
return a;
}
vector<ll> factorization(ll n) {
ll _n = n;
ll s = (ll)sqrt(n);
ll r;
vector<ll> p;
for (ll i = 2; i <= s; ++i) {
if (_n % i == 0) {
do {
_n /= i;
} while (_n % i == 0);
p.pb(i);
}
}
if (_n > s)
p.pb(_n);
return p;
}
int main() {
ll A, B;
cin >> A >> B;
ll G = gcd(A, B);
auto p = factorization(G);
_PS(p.size() + 1);
return 0;
}
/*
*/ | delete | 53 | 58 | 53 | 53 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
/*
最大公約数の素因数の個数+1
a, bの公約数 ＝ GCD(a, b)の約数
*/
// ユークリッドの互除法: x>y
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
// 素因数分解: vector(素因数, 数)
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
// nが変化していく
for (ll i = 2; i * 2 <= n; ++i) {
if (n % i) {
continue;
}
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1) {
res.emplace_back(n, 1);
}
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
auto f = factorize(g);
int ans = f.size() + 1;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
/*
最大公約数の素因数の個数+1
a, bの公約数 ＝ GCD(a, b)の約数
*/
// ユークリッドの互除法: x>y
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
// 素因数分解: vector(素因数, 数)
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
// nが変化していく
for (ll i = 2; i * i <= n; ++i) {
if (n % i) {
continue;
}
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1) {
res.emplace_back(n, 1);
}
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
auto f = factorize(g);
int ans = f.size() + 1;
cout << ans << endl;
return 0;
}
| replace | 23 | 24 | 23 | 24 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for (long long i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; --i)
#define yesno(flag) \
if (flag) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
using namespace std;
const ll INF = 1000000000000LL;
const ll r197 = 1000000007;
typedef pair<int, int> P;
typedef pair<int, P> Pa;
bool Inframe(int a, int b, int c, int d, int h, int w) {
if (a + b >= 0 && a + b < h && c + d >= 0 && c + d < w)
return true;
return false;
}
long long a, b;
string str;
int ans = 0;
priority_queue<P, vector<P>, greater<P>> que;
set<P> st;
long long reg(long long l, long long r) {
if (l < r) {
ll d = r;
r = l;
l = d;
}
while (r) {
l %= r;
ll d = r;
r = l;
l = d;
}
return l;
}
int main() {
cin >> a >> b;
long long n = reg(a, b);
for (int i = 2; i <= n; ++i) {
if (n % i == 0) {
ans++;
while (n % i == 0) {
n /= i;
}
}
}
cout << ans + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for (long long i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; --i)
#define yesno(flag) \
if (flag) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
using namespace std;
const ll INF = 1000000000000LL;
const ll r197 = 1000000007;
typedef pair<int, int> P;
typedef pair<int, P> Pa;
bool Inframe(int a, int b, int c, int d, int h, int w) {
if (a + b >= 0 && a + b < h && c + d >= 0 && c + d < w)
return true;
return false;
}
long long a, b;
string str;
int ans = 0;
priority_queue<P, vector<P>, greater<P>> que;
set<P> st;
long long reg(long long l, long long r) {
if (l < r) {
ll d = r;
r = l;
l = d;
}
while (r) {
l %= r;
ll d = r;
r = l;
l = d;
}
return l;
}
int main() {
cin >> a >> b;
long long n = reg(a, b);
for (int i = 2; i <= n; ++i) {
if (i > 1000000) {
ans++;
break;
}
if (n % i == 0) {
ans++;
while (n % i == 0) {
n /= i;
}
}
}
cout << ans + 1 << endl;
return 0;
}
| insert | 43 | 43 | 43 | 47 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define inc(a) sort(a.begin(), a.end())
#define dec(a) sort(a.rbegin(), a.rend())
#define loop(n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
ll a, b;
cin >> a >> b;
ll count = 1, m = __gcd(a, b);
for (ll i = 2; i <= m; i++) {
if (m % i == 0) {
count++;
while (m % i == 0)
m /= i;
}
}
if (m != 1)
count++;
cout << count;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define inc(a) sort(a.begin(), a.end())
#define dec(a) sort(a.rbegin(), a.rend())
#define loop(n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
ll a, b;
cin >> a >> b;
ll count = 1, m = __gcd(a, b);
for (ll i = 2; i * i <= m; i++) {
if (m % i == 0) {
count++;
while (m % i == 0)
m /= i;
}
}
if (m != 1)
count++;
cout << count;
return 0;
} | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
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...));
}
ll gcd(ll x, ll y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int ans = 0;
for (int i = 2; i * i <= g; i++) {
if (g % i == 0) {
ans++;
while (g % i == 0) {
g /= i;
}
}
}
ans += g != 1 ? 2 : 1;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
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...));
}
ll gcd(ll x, ll y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int ans = 0;
for (ll i = 2; i * i <= g; i++) {
if (g % i == 0) {
ans++;
while (g % i == 0) {
g /= i;
}
}
}
ans += g != 1 ? 2 : 1;
cout << ans << endl;
return 0;
}
| replace | 31 | 32 | 31 | 32 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
constexpr long long mod = 1000000007;
constexpr double eps = 0.0000000001;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll a, b;
cin >> a >> b;
ll c = gcd(a, b);
ll *p = new ll[500000];
ll pc = 0;
for (ll i = 2; i * i <= c; i++) {
bool flag = true;
for (ll j = 0; j < pc; j++) {
if (i % p[j] == 0) {
flag = false;
break;
}
}
if (flag) {
p[pc] = i;
pc++;
}
}
int r = 1;
for (ll i = 0; i < pc; i++) {
if ((c % p[i]) == 0) {
r++;
while ((c % p[i]) == 0)
c /= p[i];
}
}
if (c != 1)
r++;
cout << r << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
constexpr long long mod = 1000000007;
constexpr double eps = 0.0000000001;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll a, b;
cin >> a >> b;
ll c = gcd(a, b);
ll *p = new ll[500000];
ll pc = 0;
for (ll i = 2; i * i <= c; i++) {
bool flag = true;
for (ll j = 0; j < pc && p[j] * p[j] <= i; j++) {
if (i % p[j] == 0) {
flag = false;
break;
}
}
if (flag) {
p[pc] = i;
pc++;
}
}
int r = 1;
for (ll i = 0; i < pc; i++) {
if ((c % p[i]) == 0) {
r++;
while ((c % p[i]) == 0)
c /= p[i];
}
}
if (c != 1)
r++;
cout << r << endl;
} | replace | 31 | 32 | 31 | 32 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
while (b != 0) {
ll r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
ll a, b;
cin >> a >> b;
ll n = gcd(a, b);
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 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
while (b != 0) {
ll r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
ll a, b;
cin >> a >> b;
ll n = gcd(a, b);
int ans = 1;
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 | 20 | 21 | 20 | 21 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main(void) {
long long a, b;
cin >> a >> b;
ll g = gcd(a, b);
int ans = 1;
if (g % 2 == 0) {
ans++;
while (!(g % 2))
g /= 2;
}
for (int i = 3; i * i <= g; i += 2) {
if (g % i == 0) {
ans++;
while (g % i == 0)
g /= i;
}
}
if (g != 1)
ans++;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main(void) {
long long a, b;
cin >> a >> b;
ll g = gcd(a, b);
int ans = 1;
if (g % 2 == 0) {
ans++;
while (!(g % 2))
g /= 2;
}
for (ll i = 3; i * i <= g; i += 2) {
if (g % i == 0) {
ans++;
while (g % i == 0)
g /= i;
}
}
if (g != 1)
ans++;
cout << ans << endl;
return 0;
}
| replace | 23 | 24 | 23 | 24 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll a, b;
cin >> a >> b;
ll d = gcd(a, b);
ll r = 1;
ll t = d;
for (int i = 2; i <= t && i * i <= d; i++) {
if (t % i == 0) {
r++;
while (t % i == 0)
t /= i;
}
}
r += t > 1;
cout << r << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll a, b;
cin >> a >> b;
ll d = gcd(a, b);
ll r = 1;
ll t = d;
for (ll i = 2; i <= t && i * i <= d; i++) {
if (t % i == 0) {
r++;
while (t % i == 0)
t /= i;
}
}
r += t > 1;
cout << r << endl;
}
| replace | 12 | 13 | 12 | 13 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll A, B;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
cin >> A >> B;
ll u = gcd(A, B);
ll count = 0;
if (u % 2 == 0)
count++;
while (u % 2 == 0)
u /= 2;
for (ll i = 3; i + i < u; i += 2) {
if (u % i == 0) {
count++;
while (u % i == 0) {
u /= i;
}
}
}
if (u != 1)
count++;
cout << count + 1 << endl;
return 0;
} | #include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll A, B;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
cin >> A >> B;
ll u = gcd(A, B);
ll count = 0;
if (u % 2 == 0)
count++;
while (u % 2 == 0)
u /= 2;
for (ll i = 3; i * i < u; i++) {
if (u % i == 0) {
count++;
while (u % i == 0) {
u /= i;
}
}
}
if (u != 1)
count++;
cout << count + 1 << endl;
return 0;
} | replace | 21 | 22 | 21 | 22 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
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; }
int main() {
ll A, B;
cin >> A >> B;
ll G = gcd(A, B);
map<ll, ll> ps;
auto decompositPrime = [&](ll n, map<ll, ll> &mp) {
int a = 2;
while (n >= a * a) {
if (n % a == 0) {
mp[a]++;
n /= a;
} else {
a++;
}
}
if (n != 1)
mp[n]++;
};
decompositPrime(G, ps);
ll ans = 1;
for (auto [e0, e1] : ps) {
++ans;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
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; }
int main() {
ll A, B;
cin >> A >> B;
ll G = gcd(A, B);
map<ll, ll> ps;
auto decompositPrime = [&](ll n, map<ll, ll> &mp) {
ll a = 2;
while (n >= a * a) {
if (n % a == 0) {
mp[a]++;
n /= a;
} else {
a++;
}
}
if (n != 1)
mp[n]++;
};
decompositPrime(G, ps);
ll ans = 1;
for (auto [e0, e1] : ps) {
++ans;
}
cout << ans << endl;
}
| replace | 17 | 18 | 17 | 18 | TLE | |
p02900 | C++ | Time Limit Exceeded | #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 (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;
}
long long GCD(long long x, long long y) { return y ? GCD(y, x % y) : x; }
int main() {
long long A, B;
cin >> A >> B;
long long G = GCD(A, B);
auto pf = prime_factorize(G);
cout << pf.size() + 1 << endl;
} | #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 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;
}
long long GCD(long long x, long long y) { return y ? GCD(y, x % y) : x; }
int main() {
long long A, B;
cin >> A >> B;
long long G = GCD(A, B);
auto pf = prime_factorize(G);
cout << pf.size() + 1 << endl;
} | replace | 5 | 6 | 5 | 6 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll BIG = 1e9;
bool is_prime[1000002];
vector<int> P;
void Eratosthenes(const int N) {
for (int i = 0; i <= N; i++) {
is_prime[i] = true; // 初期化
}
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
}
// 最大公約数
ll yaku(ll a, ll b) {
if (a > b)
return yaku(b, a);
else {
if (b % a == 0)
return a;
else
return yaku(b % a, a);
}
}
int main() {
ll A, B, ans = 1;
cin >> A >> B;
ll N = yaku(A, B);
Eratosthenes(1000001);
// cout<<P.size();
if (N == 1)
ans = 1;
else {
int i = 0;
while (true) {
int m = P.at(i);
bool kari = false;
while (N % m == 0) {
kari = true;
N /= m;
}
if (kari)
ans++;
if (m * m > N)
break;
i++;
}
if (N != 1)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll BIG = 1e9;
bool is_prime[1000002];
vector<int> P;
void Eratosthenes(const int N) {
for (int i = 0; i <= N; i++) {
is_prime[i] = true; // 初期化
}
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
}
// 最大公約数
ll yaku(ll a, ll b) {
if (a > b)
return yaku(b, a);
else {
if (b % a == 0)
return a;
else
return yaku(b % a, a);
}
}
int main() {
ll A, B, ans = 1;
cin >> A >> B;
ll N = yaku(A, B);
Eratosthenes(1000001);
// cout<<P.size();
if (N == 1)
ans = 1;
else {
int i = 0;
while (true) {
int m = P.at(i);
bool kari = false;
while (N % m == 0) {
kari = true;
N /= m;
}
if (kari)
ans++;
if (m * m > N)
break;
i++;
if (i == P.size())
break;
}
if (N != 1)
ans++;
}
cout << ans << endl;
}
| insert | 59 | 59 | 59 | 61 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int i = ((a) + (b)-1); i >= (a); --i)
void solve() {
ll a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
vector<ll> prime;
for (ll i = 2; i < 1000010; ++i) {
bool yprime = true;
for (auto x : prime) {
if (i % x == 0) {
yprime = false;
break;
}
if (x * x > i)
break;
}
if (yprime)
prime.push_back(i);
}
{
bool yprime = true;
for (auto x : prime) {
if (a % x == 0) {
yprime = false;
break;
}
}
if (yprime)
prime.push_back(a);
yprime = true;
for (auto x : prime) {
if (b % x == 0) {
yprime = false;
break;
}
}
if (yprime)
prime.push_back(b);
}
vector<ll> p(prime.size(), 0);
{
for (int i = 0; i < prime.size(); ++i) {
ll cnt = 0;
while (a % prime[i] == 0) {
a /= prime[i];
cnt++;
}
p[i] = cnt;
if (a == 1)
break;
}
if (a > 1) {
prime.push_back(a);
p.push_back(1);
}
for (int i = 0; i < prime.size(); ++i) {
ll cnt = 0;
while (b % prime[i] == 0) {
b /= prime[i];
cnt++;
}
p[i] = min(p[i], cnt);
}
}
ll ans = 1;
// for(int i=0; i<p.size(); ++i) if(p[i]>0) cout << prime[i] << "," << p[i] <<
// " ";
for (auto x : p) {
ans += (x > 0);
}
cout << ans
<< '\n'; // cout << 359120361600%12457 << " " << 390691501200%12457;
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int i = ((a) + (b)-1); i >= (a); --i)
void solve() {
ll a, b;
cin >> a >> b;
if (a == 1 || b == 1) {
cout << 1 << '\n';
return;
}
if (a > b)
swap(a, b);
vector<ll> prime;
for (ll i = 2; i < 1000010; ++i) {
bool yprime = true;
for (auto x : prime) {
if (i % x == 0) {
yprime = false;
break;
}
if (x * x > i)
break;
}
if (yprime)
prime.push_back(i);
}
{
bool yprime = true;
for (auto x : prime) {
if (a % x == 0) {
yprime = false;
break;
}
}
if (yprime)
prime.push_back(a);
yprime = true;
for (auto x : prime) {
if (b % x == 0) {
yprime = false;
break;
}
}
if (yprime)
prime.push_back(b);
}
vector<ll> p(prime.size(), 0);
{
for (int i = 0; i < prime.size(); ++i) {
ll cnt = 0;
while (a % prime[i] == 0) {
a /= prime[i];
cnt++;
}
p[i] = cnt;
if (a == 1)
break;
}
if (a > 1) {
prime.push_back(a);
p.push_back(1);
}
for (int i = 0; i < prime.size(); ++i) {
ll cnt = 0;
while (b % prime[i] == 0) {
b /= prime[i];
cnt++;
}
p[i] = min(p[i], cnt);
}
}
ll ans = 1;
// for(int i=0; i<p.size(); ++i) if(p[i]>0) cout << prime[i] << "," << p[i] <<
// " ";
for (auto x : p) {
ans += (x > 0);
}
cout << ans
<< '\n'; // cout << 359120361600%12457 << " " << 390691501200%12457;
}
int main() {
solve();
return 0;
} | insert | 12 | 12 | 12 | 16 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long a, b;
cin >> a >> b;
auto factorize = [](long long n) {
set<long long> res;
int d = 2;
while (d * d <= n) {
while (n % d == 0) {
n /= d;
res.insert(d);
}
d++;
}
if (n > 1) {
res.insert(n);
}
return res;
};
set<long long> s1 = factorize(a);
set<long long> s2 = factorize(b);
vector<long long> common;
set_intersection(s1.begin(), s1.end(), s2.begin(), s2.end(),
back_inserter(common));
cout << common.size() + 1 << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long a, b;
cin >> a >> b;
auto factorize = [](long long n) {
set<long long> res;
long long d = 2;
while (d * d <= n) {
while (n % d == 0) {
n /= d;
res.insert(d);
}
d++;
}
if (n > 1) {
res.insert(n);
}
return res;
};
set<long long> s1 = factorize(a);
set<long long> s2 = factorize(b);
vector<long long> common;
set_intersection(s1.begin(), s1.end(), s2.begin(), s2.end(),
back_inserter(common));
cout << common.size() + 1 << '\n';
return 0;
} | replace | 13 | 14 | 13 | 14 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define fs first
#define sc second
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;
}
// std::vector Declaration
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...));
}
// std::vector Initialization
template <typename T> void fill_all(T &arr, const T &v) { arr = v; }
template <typename T, typename U> void fill_all(T &arr, const U &v) {
for (auto &i : arr)
fill_all(i, v);
}
// std::vector Debug
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
bool a = 1;
for (auto e : v) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "]";
return os;
}
// std::deque Debug
template <typename T> ostream &operator<<(ostream &os, const deque<T> &d) {
os << "[";
bool a = 1;
for (auto e : d) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "]";
return os;
}
// std::pair Debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << " " << p.second << ")";
return os;
}
// std::set Debug
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
os << "{";
bool a = 1;
for (auto e : st) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "}";
return os;
}
// std::multiset Debug
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
os << "{";
bool a = 1;
for (auto e : st) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "}";
return os;
}
// std::map Debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
os << "{";
bool a = 1;
for (auto e : mp) {
os << (a ? "" : " ");
os << e.first << ":" << e.second;
a = 0;
}
os << "}";
return os;
}
// std::tuple Debug
template <int N, class Tuple> void out(ostream &os, const Tuple &t) {}
template <int N, class Tuple, class H, class... Ts>
void out(ostream &os, const Tuple &t) {
if (N)
os << " ";
os << get<N>(t);
out<N + 1, Tuple, Ts...>(os, t);
}
template <class... Ts> ostream &operator<<(ostream &os, const tuple<Ts...> &t) {
os << "(";
out<0, tuple<Ts...>, Ts...>(os, t);
os << ")";
return os;
}
// Debug
#define DUMP(x) cerr << #x << " = " << (x) << endl
struct edge {
int to, cost;
};
ostream &operator<<(ostream &os, const edge &e) {
os << "(" << e.to << ", " << e.cost << ")";
return os;
}
const LL LINF = 1LL << 60;
const int IINF = 1 << 30;
const LL MOD = 1e9 + 7;
struct IsPrime {
int sz;
vector<bool> isprime;
IsPrime(int n) : sz(n + 1) {
isprime.resize(n + 1, true);
isprime[0] = isprime[1] = false;
for (int i = 2; i * i <= n; ++i)
if (isprime[i]) {
for (int j = 2; i * j <= n; ++j) {
isprime[i * j] = false;
}
}
}
bool operator[](int i) { return isprime[i]; }
};
template <typename T> struct Factorizer {
IsPrime isprime;
Factorizer(int n) : isprime(n + 1) {}
map<T, int> operator()(T m) {
map<T, int> res;
for (int i = 2; i < isprime.sz; ++i) {
if (isprime[i]) {
while (m % i == 0) {
++res[i];
m /= i;
}
}
}
if (m != 1)
++res[m];
return res;
}
};
int main() {
LL A, B;
cin >> A >> B;
auto fact = Factorizer<LL>(max(A, B));
auto mpa = fact(A), mpb = fact(B);
int ans = 1;
for (auto p : mpa) {
if (mpb.find(p.fs) != mpb.end()) {
++ans;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define fs first
#define sc second
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;
}
// std::vector Declaration
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...));
}
// std::vector Initialization
template <typename T> void fill_all(T &arr, const T &v) { arr = v; }
template <typename T, typename U> void fill_all(T &arr, const U &v) {
for (auto &i : arr)
fill_all(i, v);
}
// std::vector Debug
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
bool a = 1;
for (auto e : v) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "]";
return os;
}
// std::deque Debug
template <typename T> ostream &operator<<(ostream &os, const deque<T> &d) {
os << "[";
bool a = 1;
for (auto e : d) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "]";
return os;
}
// std::pair Debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << " " << p.second << ")";
return os;
}
// std::set Debug
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
os << "{";
bool a = 1;
for (auto e : st) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "}";
return os;
}
// std::multiset Debug
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
os << "{";
bool a = 1;
for (auto e : st) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "}";
return os;
}
// std::map Debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
os << "{";
bool a = 1;
for (auto e : mp) {
os << (a ? "" : " ");
os << e.first << ":" << e.second;
a = 0;
}
os << "}";
return os;
}
// std::tuple Debug
template <int N, class Tuple> void out(ostream &os, const Tuple &t) {}
template <int N, class Tuple, class H, class... Ts>
void out(ostream &os, const Tuple &t) {
if (N)
os << " ";
os << get<N>(t);
out<N + 1, Tuple, Ts...>(os, t);
}
template <class... Ts> ostream &operator<<(ostream &os, const tuple<Ts...> &t) {
os << "(";
out<0, tuple<Ts...>, Ts...>(os, t);
os << ")";
return os;
}
// Debug
#define DUMP(x) cerr << #x << " = " << (x) << endl
struct edge {
int to, cost;
};
ostream &operator<<(ostream &os, const edge &e) {
os << "(" << e.to << ", " << e.cost << ")";
return os;
}
const LL LINF = 1LL << 60;
const int IINF = 1 << 30;
const LL MOD = 1e9 + 7;
struct IsPrime {
int sz;
vector<bool> isprime;
IsPrime(int n) : sz(n + 1) {
isprime.resize(n + 1, true);
isprime[0] = isprime[1] = false;
for (int i = 2; i * i <= n; ++i)
if (isprime[i]) {
for (int j = 2; i * j <= n; ++j) {
isprime[i * j] = false;
}
}
}
bool operator[](int i) { return isprime[i]; }
};
template <typename T> struct Factorizer {
IsPrime isprime;
Factorizer(int n) : isprime(n + 1) {}
map<T, int> operator()(T m) {
map<T, int> res;
for (int i = 2; i < isprime.sz; ++i) {
if (isprime[i]) {
while (m % i == 0) {
++res[i];
m /= i;
}
}
}
if (m != 1)
++res[m];
return res;
}
};
int main() {
LL A, B;
cin >> A >> B;
auto fact = Factorizer<LL>((int)sqrt(max(A, B)));
auto mpa = fact(A), mpb = fact(B);
int ans = 1;
for (auto p : mpa) {
if (mpb.find(p.fs) != mpb.end()) {
++ans;
}
}
cout << ans << endl;
return 0;
}
| replace | 178 | 179 | 178 | 179 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define fs first
#define sc second
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;
}
// std::vector Declaration
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...));
}
// std::vector Initialization
template <typename T> void fill_all(T &arr, const T &v) { arr = v; }
template <typename T, typename U> void fill_all(T &arr, const U &v) {
for (auto &i : arr)
fill_all(i, v);
}
// std::vector Debug
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
bool a = 1;
for (auto e : v) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "]";
return os;
}
// std::deque Debug
template <typename T> ostream &operator<<(ostream &os, const deque<T> &d) {
os << "[";
bool a = 1;
for (auto e : d) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "]";
return os;
}
// std::pair Debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << " " << p.second << ")";
return os;
}
// std::set Debug
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
os << "{";
bool a = 1;
for (auto e : st) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "}";
return os;
}
// std::multiset Debug
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
os << "{";
bool a = 1;
for (auto e : st) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "}";
return os;
}
// std::map Debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
os << "{";
bool a = 1;
for (auto e : mp) {
os << (a ? "" : " ");
os << e.first << ":" << e.second;
a = 0;
}
os << "}";
return os;
}
// std::tuple Debug
template <int N, class Tuple> void out(ostream &os, const Tuple &t) {}
template <int N, class Tuple, class H, class... Ts>
void out(ostream &os, const Tuple &t) {
if (N)
os << " ";
os << get<N>(t);
out<N + 1, Tuple, Ts...>(os, t);
}
template <class... Ts> ostream &operator<<(ostream &os, const tuple<Ts...> &t) {
os << "(";
out<0, tuple<Ts...>, Ts...>(os, t);
os << ")";
return os;
}
// Debug
#define DUMP(x) cerr << #x << " = " << (x) << endl
struct edge {
int to, cost;
};
ostream &operator<<(ostream &os, const edge &e) {
os << "(" << e.to << ", " << e.cost << ")";
return os;
}
const LL LINF = 1LL << 60;
const int IINF = 1 << 30;
const LL MOD = 1e9 + 7;
// O(sqrt(N))
template <typename T> map<T, int> factorize(T m) {
map<T, int> res;
for (int i = 2; i * i <= m; ++i) {
while (m % i == 0) {
++res[i];
m /= i;
}
}
if (m != 1)
++res[m];
return res;
};
int main() {
LL A, B;
cin >> A >> B;
auto mpa = factorize(A), mpb = factorize(B);
int ans = 1;
for (auto p : mpa) {
if (mpb.find(p.fs) != mpb.end()) {
++ans;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define fs first
#define sc second
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;
}
// std::vector Declaration
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...));
}
// std::vector Initialization
template <typename T> void fill_all(T &arr, const T &v) { arr = v; }
template <typename T, typename U> void fill_all(T &arr, const U &v) {
for (auto &i : arr)
fill_all(i, v);
}
// std::vector Debug
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
bool a = 1;
for (auto e : v) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "]";
return os;
}
// std::deque Debug
template <typename T> ostream &operator<<(ostream &os, const deque<T> &d) {
os << "[";
bool a = 1;
for (auto e : d) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "]";
return os;
}
// std::pair Debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << " " << p.second << ")";
return os;
}
// std::set Debug
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
os << "{";
bool a = 1;
for (auto e : st) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "}";
return os;
}
// std::multiset Debug
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
os << "{";
bool a = 1;
for (auto e : st) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "}";
return os;
}
// std::map Debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
os << "{";
bool a = 1;
for (auto e : mp) {
os << (a ? "" : " ");
os << e.first << ":" << e.second;
a = 0;
}
os << "}";
return os;
}
// std::tuple Debug
template <int N, class Tuple> void out(ostream &os, const Tuple &t) {}
template <int N, class Tuple, class H, class... Ts>
void out(ostream &os, const Tuple &t) {
if (N)
os << " ";
os << get<N>(t);
out<N + 1, Tuple, Ts...>(os, t);
}
template <class... Ts> ostream &operator<<(ostream &os, const tuple<Ts...> &t) {
os << "(";
out<0, tuple<Ts...>, Ts...>(os, t);
os << ")";
return os;
}
// Debug
#define DUMP(x) cerr << #x << " = " << (x) << endl
struct edge {
int to, cost;
};
ostream &operator<<(ostream &os, const edge &e) {
os << "(" << e.to << ", " << e.cost << ")";
return os;
}
const LL LINF = 1LL << 60;
const int IINF = 1 << 30;
const LL MOD = 1e9 + 7;
// O(sqrt(N))
template <typename T> map<T, int> factorize(T m) {
map<T, int> res;
for (T i = 2; i * i <= m; ++i) {
while (m % i == 0) {
++res[i];
m /= i;
}
}
if (m != 1)
++res[m];
return res;
};
int main() {
LL A, B;
cin >> A >> B;
auto mpa = factorize(A), mpb = factorize(B);
int ans = 1;
for (auto p : mpa) {
if (mpb.find(p.fs) != mpb.end()) {
++ans;
}
}
cout << ans << endl;
return 0;
}
| replace | 142 | 143 | 142 | 143 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, k, n) for (int i = (k); i < (n); i++)
#define irep(i, k, n) for (int i = (k); i > (n); i--)
using namespace std;
using ll = long long;
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; }
int main(void) {
ll a, b;
cin >> a >> b;
ll c = gcd(a, b);
int ans = 1;
rep(i, 0, 1e6 + 1) {
if (c % i)
continue;
while (!(c % i))
c /= i;
ans++;
}
if (c != 1)
ans++;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, k, n) for (int i = (k); i < (n); i++)
#define irep(i, k, n) for (int i = (k); i > (n); i--)
using namespace std;
using ll = long long;
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; }
int main(void) {
ll a, b;
cin >> a >> b;
ll c = gcd(a, b);
ll ans = 1;
rep(i, 2, 1e6 + 1) {
if (c % i)
continue;
while (!(c % i))
c /= i;
ans++;
}
if (c != 1)
ans++;
cout << ans << endl;
return 0;
} | replace | 15 | 17 | 15 | 17 | -8 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define all(t) (t).begin(), (t).end()
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline T GCD(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <class T> inline T LCM(T a, T b) { return a * b / GCD(a, b); }
int main() {
ll a, b;
cin >> a >> b;
ll x = GCD(a, b);
ll num = x, ans = 1;
for (int i = 2; i * i <= x; i++) {
if (num % i == 0)
ans++;
while (num % i == 0)
num /= i;
}
if (num != 1)
ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define all(t) (t).begin(), (t).end()
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inline T GCD(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <class T> inline T LCM(T a, T b) { return a * b / GCD(a, b); }
int main() {
ll a, b;
cin >> a >> b;
ll x = GCD(a, b);
ll num = x, ans = 1;
for (ll i = 2; i * i <= x; i++) {
if (num % i == 0)
ans++;
while (num % i == 0)
num /= i;
}
if (num != 1)
ans++;
cout << ans << endl;
}
| replace | 38 | 39 | 38 | 39 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.