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++ | Runtime Error | #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);
vector<ll> V(u);
ll j = 0;
for (ll i = 2; i * i <= u; i++) {
if (u % i == 0) {
V[j] = i;
j++;
while (u % i == 0) {
u /= i;
}
}
}
if (u != 1) {
V[j] = u;
j++;
}
cout << j + 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);
vector<ll> V(1000);
ll j = 0;
for (ll i = 2; i * i <= u; i++) {
if (u % i == 0) {
V[j] = i;
j++;
while (u % i == 0) {
u /= i;
}
}
}
if (u != 1) {
V[j] = u;
j++;
}
cout << j + 1 << endl;
return 0;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define ggr \
getchar(); \
getchar(); \
return 0;
#define prique priority_queue
#define inf 1145141919364364
#define double long double
using namespace std;
typedef pair<ll, ll> P;
bool prime(int n) {
int cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0)
cnt++;
}
if (cnt != 1)
return false;
else
return n != 1;
}
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
map<ll, ll> mp;
signed main() {
ll a, b, ans = 0;
cin >> a >> b;
ll l = gcd(a, b);
for (int i = 2; i * i <= l; i++) {
while (l % i == 0) {
mp[i]++;
l /= i;
}
}
if (l != 1)
mp[l] = 1;
for (auto x : mp) {
if (x.second)
ans++;
}
cout << ans + 1 << endl;
ggr
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define ggr \
getchar(); \
getchar(); \
return 0;
#define prique priority_queue
#define inf 1145141919364364
#define double long double
using namespace std;
typedef pair<ll, ll> P;
bool prime(int n) {
int cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0)
cnt++;
}
if (cnt != 1)
return false;
else
return n != 1;
}
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
map<ll, ll> mp;
signed main() {
ll a, b, ans = 0;
cin >> a >> b;
ll l = gcd(a, b);
for (ll i = 2; i * i <= l; i++) {
while (l % i == 0) {
mp[i]++;
l /= i;
}
}
if (l != 1)
mp[l] = 1;
for (auto x : mp) {
if (x.second)
ans++;
}
cout << ans + 1 << endl;
ggr
} | replace | 43 | 44 | 43 | 44 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#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()
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
ll A, B;
cin >> A >> B;
map<int, int> mp;
for (ll i = 1; i * i <= A; i++) {
if (A % i == 0) {
if (B % i == 0)
mp[i]++;
if (i * i != A && B % (A / i) == 0) {
mp[A / i]++;
}
}
}
vector<ll> yakusu;
for (auto y : mp) {
yakusu.pb(y.first);
}
int ysize = (int)yakusu.size();
// cout << ysize << endl;
vector<ll> ans;
rep(i, ysize) {
bool ok = true;
rep(j, (int)ans.size()) {
if (j == 0)
continue;
if (yakusu[i] % ans[j] == 0) {
ok = false;
break;
}
}
if (ok) {
ans.pb(yakusu[i]);
}
}
cout << (int)ans.size() << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#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()
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
ll A, B;
cin >> A >> B;
map<ll, int> mp;
for (ll i = 1; i * i <= A; i++) {
if (A % i == 0) {
if (B % i == 0)
mp[i]++;
if (i * i != A && B % (A / i) == 0) {
mp[A / i]++;
}
}
}
vector<ll> yakusu;
for (auto y : mp) {
yakusu.pb(y.first);
}
int ysize = (int)yakusu.size();
// cout << ysize << endl;
vector<ll> ans;
rep(i, ysize) {
bool ok = true;
rep(j, (int)ans.size()) {
if (j == 0)
continue;
if (yakusu[i] % ans[j] == 0) {
ok = false;
break;
}
}
if (ok) {
ans.pb(yakusu[i]);
}
}
cout << (int)ans.size() << endl;
return 0;
}
| replace | 24 | 25 | 24 | 25 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define co(x) cout << x << endl
#define cs(x) cout << x << " "
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
using namespace std;
int mod = 1e9 + 7;
ll gcd(ll, ll);
ll numFact(ll a);
int main() {
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
ll numF = numFact(g);
co(numF + 1);
return 0;
}
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
while (b != 0) {
ll r = a % b;
a = b;
b = r;
}
return a;
}
ll numFact(ll a) {
ll res = 0;
ll i = 2;
ll a_o = a;
while ((a > 1) || i * i <= a_o) {
ll cnt = 0;
while (a % i == 0) {
cnt++;
a /= i;
if (cnt == 1)
res++;
}
i++;
}
if (a > 1)
res++;
return res;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define co(x) cout << x << endl
#define cs(x) cout << x << " "
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
using namespace std;
int mod = 1e9 + 7;
ll gcd(ll, ll);
ll numFact(ll a);
int main() {
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
ll numF = numFact(g);
co(numF + 1);
return 0;
}
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
while (b != 0) {
ll r = a % b;
a = b;
b = r;
}
return a;
}
ll numFact(ll a) {
ll res = 0;
ll i = 2;
ll a_o = a;
while ((a > 1) && i * i <= a_o) {
ll cnt = 0;
while (a % i == 0) {
cnt++;
a /= i;
if (cnt == 1)
res++;
}
i++;
}
if (a > 1)
res++;
return res;
}
| replace | 43 | 44 | 43 | 44 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
// 公約数計算
while (a > 0 && b > 0) {
if (a < b) {
b = b % a;
} else {
a = a % b;
}
}
if (b > 0) {
a = b;
}
// 素因数分解
// 素数列の生成
vector<bool> isprime;
vector<int> prime;
int i = 1;
int p = 0;
while (i * i < a) {
i++;
}
isprime.resize(i + 1, true);
isprime[1] = false;
for (int j = 2; j <= i; j++) {
if (isprime[j]) {
prime.push_back(j);
p++;
for (int k = 2; j * k <= i; k++) {
isprime[j * k] = false;
}
}
}
/*for(int j=0;j<p;j++){
cout<<prime[j]<<endl;
}*/
// 素数列に従って調査
int cnt = 0;
for (int d = 0; d < p; d++) {
if (a % prime[d] == 0) {
cnt++;
while (a % prime[d] == 0) {
a = a / prime[d];
}
}
}
if (a != 1) {
cnt++;
}
cout << cnt + 1 << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
// 公約数計算
while (a > 0 && b > 0) {
if (a < b) {
b = b % a;
} else {
a = a % b;
}
}
if (b > 0) {
a = b;
}
// 素因数分解
// 素数列の生成
vector<bool> isprime;
vector<int> prime;
long long int i = 1;
int p = 0;
while (i * i < a) {
i++;
}
isprime.resize(i + 1, true);
isprime[1] = false;
for (int j = 2; j <= i; j++) {
if (isprime[j]) {
prime.push_back(j);
p++;
for (int k = 2; j * k <= i; k++) {
isprime[j * k] = false;
}
}
}
/*for(int j=0;j<p;j++){
cout<<prime[j]<<endl;
}*/
// 素数列に従って調査
int cnt = 0;
for (int d = 0; d < p; d++) {
if (a % prime[d] == 0) {
cnt++;
while (a % prime[d] == 0) {
a = a / prime[d];
}
}
}
if (a != 1) {
cnt++;
}
cout << cnt + 1 << endl;
return 0;
} | replace | 21 | 22 | 21 | 22 | TLE | |
p02900 | Python | Runtime Error | def p(n):
i = 2
t = []
while i * i <= n:
while n % i == 0:
n //= i
t.append(i)
i += 1
if n > 1:
t.append(n)
return t
def main():
from math import gcd
a, b = map(int, input().split())
g = gcd(a, b)
print(len(set(p(g))) + 1)
if __name__ == "__main__":
main()
| def p(n):
i = 2
t = []
while i * i <= n:
while n % i == 0:
n //= i
t.append(i)
i += 1
if n > 1:
t.append(n)
return t
def main():
from fractions import gcd
a, b = map(int, input().split())
g = gcd(a, b)
print(len(set(p(g))) + 1)
if __name__ == "__main__":
main()
| replace | 14 | 15 | 14 | 15 | 0 | |
p02900 | Python | Time Limit Exceeded | def gcd(x, y):
if y == 0:
return x
return gcd(y, x % y)
A, B = map(int, input().split())
C = gcd(A, B)
ans = []
i = 2
while True:
if C == 1:
break
if C % i != 0:
i += 1
continue
ans.append(i)
C //= i
print(len(set(ans)) + 1)
| def gcd(x, y):
if y == 0:
return x
return gcd(y, x % y)
A, B = map(int, input().split())
C = gcd(A, B)
ans = []
while C % 2 == 0:
ans.append(2)
C //= 2
i = 3
while C >= i * i:
if C % i == 0:
ans.append(i)
C //= i
else:
i += 2
if C != 1:
ans.append(C)
print(len(set(ans)) + 1)
| replace | 10 | 19 | 10 | 22 | TLE | |
p02900 | Python | Time Limit Exceeded | from sys import stdin
a, b = [int(x) for x in stdin.readline().split()]
while b != 0:
a, b = b, a % b
c = 1
lim = a // 2
n = 0
i = 2
while a > 1 and i <= lim:
n = 0
while a % i == 0:
a //= i
n += 1
if n > 0:
c += 1
i += 1
if a > 1:
c += 1
print(c)
| from sys import stdin
a, b = [int(x) for x in stdin.readline().split()]
while b != 0:
a, b = b, a % b
c = 1
lim = a**0.5 + 10
n = 0
i = 2
while a > 1 and i <= lim:
n = 0
while a % i == 0:
a //= i
n += 1
if n > 0:
c += 1
i += 1
if a > 1:
c += 1
print(c)
| replace | 8 | 9 | 8 | 9 | TLE | |
p02900 | Python | Runtime Error | from math import gcd
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
A, B = tuple(map(int, input().split(" ")))
print(len(set(prime_factorize(gcd(A, B)))) + 1)
| from fractions import gcd
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
A, B = tuple(map(int, input().split(" ")))
print(len(set(prime_factorize(gcd(A, B)))) + 1)
| replace | 0 | 1 | 0 | 1 | 0 | |
p02900 | Python | Time Limit Exceeded | def slove():
import sys
import fractions
input = sys.stdin.readline
a, b = list(map(int, input().rstrip("\n").split()))
gcd = fractions.gcd(a, b)
cnt = 1
for i in range(2, int(gcd**0.5) + 2):
while True:
if gcd % i == 0:
cnt += 1
while True:
if gcd % i == 0:
gcd //= i
else:
break
print(cnt)
if __name__ == "__main__":
slove()
| def slove():
import sys
import fractions
input = sys.stdin.readline
a, b = list(map(int, input().rstrip("\n").split()))
gcd = fractions.gcd(a, b)
cnt = 1
for i in range(2, int(gcd**0.5) + 1):
if gcd % i == 0:
cnt += 1
while True:
if gcd % i == 0:
gcd //= i
else:
break
if gcd != 1:
cnt += 1
print(cnt)
if __name__ == "__main__":
slove()
| replace | 8 | 17 | 8 | 18 | TLE | |
p02900 | Python | Runtime Error | #!/usr/bin/env python3
from math import gcd
a, b = map(int, input().split())
g = gcd(a, b)
ans = {}
for i in range(2, int(g**0.5 + 1)):
while g % i == 0:
ans[i] = ans[i] + 1 if i in ans else 1
g //= i
if g != 1:
ans[g] = 1
print(len(ans) + 1)
| #!/usr/bin/env python3
from fractions import gcd
a, b = map(int, input().split())
g = gcd(a, b)
ans = {}
for i in range(2, int(g**0.5 + 1)):
while g % i == 0:
ans[i] = ans[i] + 1 if i in ans else 1
g //= i
if g != 1:
ans[g] = 1
print(len(ans) + 1)
| replace | 1 | 2 | 1 | 2 | 0 | |
p02900 | Python | Runtime Error | def input_li():
return list(map(int, input().split()))
def input_int():
return int(input())
def prime_factorization(n):
table = []
for x in range(2, int(n**0.5) + 1):
while n % x == 0:
table.append(x)
n //= x
if n > 1:
table.append(n)
return table
A, B = input_li()
A_LI = [x[0] for x in prime_factorization(A)]
B_LI = [x[0] for x in prime_factorization(B)]
print(len(set(A_LI) & set(B_LI)) + 1)
| def input_li():
return list(map(int, input().split()))
def input_int():
return int(input())
def prime_factorization(n):
table = []
for x in range(2, int(n**0.5) + 1):
while n % x == 0:
table.append(x)
n //= x
if n > 1:
table.append(n)
return table
A, B = input_li()
A_SET = set(prime_factorization(A))
B_SET = set(prime_factorization(B))
print(len((A_SET) & set(B_SET)) + 1)
| replace | 20 | 23 | 20 | 23 | TypeError: 'int' object is not subscriptable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02900/Python/s286157860.py", line 21, in <module>
A_LI = [x[0] for x in prime_factorization(A)]
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02900/Python/s286157860.py", line 21, in <listcomp>
A_LI = [x[0] for x in prime_factorization(A)]
TypeError: 'int' object is not subscriptable
|
p02900 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define LL long long
#define MAXN 1000001
using namespace std;
LL a, b;
LL inv[MAXN], prime[MAXN], cnt = 0;
void getp() {
for (int i = 2; i < MAXN; i++) {
if (!inv[i]) {
prime[++cnt] = i;
inv[i] = i;
}
for (int j = 1; j <= cnt && prime[j] * i < MAXN; j++) {
inv[prime[j] * i] = prime[j];
if (i % prime[j] == 0)
break;
}
}
}
LL gcd(LL x, LL y) { return y ? gcd(y, x % y) : x; }
int main() {
cin >> a >> b;
a = gcd(a, b);
getp();
int ans = 1;
for (int i = 1; i <= cnt; i++) {
if (a % prime[i] == 0)
ans++;
// cout<<prime[i]<<endl;
while (a % prime[i] == 0)
a /= prime[i];
}
if (inv[a] == a)
ans++;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define LL long long
#define MAXN 1000001
using namespace std;
LL a, b;
LL inv[MAXN], prime[MAXN], cnt = 0;
void getp() {
for (int i = 2; i < MAXN; i++) {
if (!inv[i]) {
prime[++cnt] = i;
inv[i] = i;
}
for (int j = 1; j <= cnt && prime[j] * i < MAXN; j++) {
inv[prime[j] * i] = prime[j];
if (i % prime[j] == 0)
break;
}
}
}
LL gcd(LL x, LL y) { return y ? gcd(y, x % y) : x; }
int main() {
cin >> a >> b;
a = gcd(a, b);
getp();
int ans = 1;
for (int i = 1; i <= cnt; i++) {
if (a % prime[i] == 0)
ans++;
// cout<<prime[i]<<endl;
while (a % prime[i] == 0)
a /= prime[i];
}
if (a != 1)
ans++;
cout << ans << endl;
return 0;
}
| replace | 36 | 37 | 36 | 37 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<ll>
#define vii vector<pair<int, int>>
#define ii pair<int, int>
#define loop(n) for (int i = 0; i < n; i++)
#define pb push_back
const ll mod = 1e9 + 7;
void fast();
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
int main() {
fast();
ll a, b;
cin >> a >> b;
set<int> s;
a = gcd(a, b);
for (int i = 2; i * i <= a; i++) {
if (a % i == 0) {
while (a % i == 0)
a /= i;
s.insert(i);
}
}
if (a > 1)
s.insert(a);
cout << s.size() + 1;
}
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
/*
*/
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<ll>
#define vii vector<pair<int, int>>
#define ii pair<int, int>
#define loop(n) for (int i = 0; i < n; i++)
#define pb push_back
const ll mod = 1e9 + 7;
void fast();
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
int main() {
fast();
ll a, b;
cin >> a >> b;
set<int> s;
a = __gcd(a, b);
for (ll i = 2; i * i <= a; i++) {
if (a % i == 0) {
while (a % i == 0)
a /= i;
s.insert(i);
}
}
if (a > 1)
s.insert(a);
cout << s.size() + 1;
}
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
/*
*/
| replace | 20 | 22 | 20 | 22 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
#define MOD 1e9 + 7
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
map<int, int> prime(ll n) {
map<int, int> ret;
ret[1]++;
;
ll temp = n;
for (int i = 2; i * i <= n; i++) {
while (temp % i == 0) {
temp /= i;
ret[i]++;
}
}
if (temp != 1)
ret[temp]++;
return ret;
}
int main() {
ll a, b;
cin >> a >> b;
ll r = gcd(a, b);
map<int, int> mp = prime(r);
int ans = 0;
for (auto x : mp)
ans++;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
#define MOD 1e9 + 7
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
map<int, int> prime(ll n) {
map<int, int> ret;
ret[1]++;
;
ll temp = n;
for (ll i = 2; i * i <= n; i++) {
while (temp % i == 0) {
temp /= i;
ret[i]++;
}
}
if (temp != 1)
ret[temp]++;
return ret;
}
int main() {
ll a, b;
cin >> a >> b;
ll r = gcd(a, b);
map<int, int> mp = prime(r);
int ans = 0;
for (auto x : mp)
ans++;
cout << ans << endl;
}
| replace | 25 | 26 | 25 | 26 | 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 t = b;
b = a % b;
a = t;
}
return a;
}
ll solve() {
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
set<ll> d;
for (int k = 2; k * k <= g; k++) {
while (g % k == 0) {
g /= k;
d.insert(k);
}
}
if (g > 1)
d.insert(g);
ll ans = d.size() + 1;
return ans;
}
int main() {
auto ans = solve();
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
while (b != 0) {
ll t = b;
b = a % b;
a = t;
}
return a;
}
ll solve() {
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
set<ll> d;
for (ll k = 2; k * k <= g; k++) {
while (g % k == 0) {
g /= k;
d.insert(k);
}
}
if (g > 1)
d.insert(g);
ll ans = d.size() + 1;
return ans;
}
int main() {
auto ans = solve();
cout << ans << "\n";
return 0;
} | replace | 19 | 20 | 19 | 20 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define let auto const
template <typename... Types> struct dynarr : std::vector<Types...> {
using std::vector<Types...>::vector;
using size_type = typename std::vector<Types...>::size_type;
auto &&operator[](size_type i) { return this->at(i); }
auto &&operator[](size_type i) const { return this->at(i); }
};
i64 gcd(i64 a, i64 b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
i64 a, b;
cin >> a >> b;
i64 g = gcd(a, b);
i64 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 i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define let auto const
template <typename... Types> struct dynarr : std::vector<Types...> {
using std::vector<Types...>::vector;
using size_type = typename std::vector<Types...>::size_type;
auto &&operator[](size_type i) { return this->at(i); }
auto &&operator[](size_type i) const { return this->at(i); }
};
i64 gcd(i64 a, i64 b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
i64 a, b;
cin >> a >> b;
i64 g = gcd(a, b);
i64 ans = 1;
for (i64 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 | 26 | 27 | 26 | 27 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
map<ll, ll> Pf(ll n) {
map<ll, ll> rep;
for (int i = 2; i * i <= n; i++) {
if (n % i)
continue;
while (n % i == 0) {
rep[i]++;
n /= i;
}
}
if (n != 1)
rep[n] = 1;
return rep;
}
int main() {
ll A, B;
cin >> A >> B;
ll C = gcd(B, A);
// cout << C << endl ;
auto D = Pf(C);
// for(auto f : Pf(C) ) cout << f.first <<" "<< f.second << endl;
ll E = D.size();
cout << E + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
map<ll, ll> Pf(ll n) {
map<ll, ll> rep;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
while (n % i == 0) {
rep[i]++;
n /= i;
}
}
if (n != 1)
rep[n] = 1;
return rep;
}
int main() {
ll A, B;
cin >> A >> B;
ll C = gcd(B, A);
// cout << C << endl ;
auto D = Pf(C);
// for(auto f : Pf(C) ) cout << f.first <<" "<< f.second << endl;
ll E = D.size();
cout << E + 1 << endl;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR_LT(i, beg, end) for (int i = beg; i < end; i++)
#define FOR_LE(i, beg, end) for (int i = beg; i <= end; i++)
#define FOR_DW(i, beg, end) for (int i = beg; end <= i; i--)
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
// sqrt(n) までの素数を求める。1000014129 (31623 * 31623) まで対応
void create_primes(int64_t n, bitset<1000001> &primes) {
primes.flip();
int64_t u_b = sqrt(n + 1);
assert(u_b < 31624);
{
for (int64_t j = 4; j <= u_b; j += 2) {
primes.reset(j);
}
}
for (int64_t i = 3; i <= u_b; i += 2) {
if (!primes.test(i))
continue;
for (int64_t j = i * 2; j <= u_b; j += i) {
primes.reset(j);
}
}
}
struct FactorInfo {
int64_t v;
int64_t c;
};
// n の素因数分解を行う。
bitset<1000001> primes;
vector<FactorInfo> make_factors(int64_t n) {
create_primes(n, primes);
int64_t v = n;
int64_t limit = sqrt(n + 1);
vector<FactorInfo> ans;
FOR_LE(i, 2, limit) {
if (!primes.test(i))
continue;
int64_t count = 0;
while (v % i == 0) {
v /= i;
count++;
}
if (count != 0) {
ans.push_back({i, count});
}
}
if (v != 1) {
ans.push_back({v, 1});
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int64_t a, b;
cin >> a >> b;
int64_t g = gcd(a, b);
vector<FactorInfo> factors = make_factors(g);
cout << factors.size() + 1 << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR_LT(i, beg, end) for (int i = beg; i < end; i++)
#define FOR_LE(i, beg, end) for (int i = beg; i <= end; i++)
#define FOR_DW(i, beg, end) for (int i = beg; end <= i; i--)
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
// sqrt(n) までの素数を求める。1000014129 (31623 * 31623) まで対応
void create_primes(int64_t n, bitset<1000001> &primes) {
primes.flip();
int64_t u_b = sqrt(n + 1);
assert(u_b < 1000002);
{
for (int64_t j = 4; j <= u_b; j += 2) {
primes.reset(j);
}
}
for (int64_t i = 3; i <= u_b; i += 2) {
if (!primes.test(i))
continue;
for (int64_t j = i * 2; j <= u_b; j += i) {
primes.reset(j);
}
}
}
struct FactorInfo {
int64_t v;
int64_t c;
};
// n の素因数分解を行う。
bitset<1000001> primes;
vector<FactorInfo> make_factors(int64_t n) {
create_primes(n, primes);
int64_t v = n;
int64_t limit = sqrt(n + 1);
vector<FactorInfo> ans;
FOR_LE(i, 2, limit) {
if (!primes.test(i))
continue;
int64_t count = 0;
while (v % i == 0) {
v /= i;
count++;
}
if (count != 0) {
ans.push_back({i, count});
}
}
if (v != 1) {
ans.push_back({v, 1});
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int64_t a, b;
cin >> a >> b;
int64_t g = gcd(a, b);
vector<FactorInfo> factors = make_factors(g);
cout << factors.size() + 1 << endl;
return 0;
} | replace | 42 | 43 | 42 | 43 | 0 | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long //
#define rp(i, a, b) for (ll i = a; i < b; i++)
#define r(i, n) for (ll i = 0; i < n; i++)
#define rt return
#define db double
#define ldb long double
#define vd void
#define p(x) cout << (x) << endl;
#define psc(x) cout << setprecision(50) << (x) << endl;
#define precise(x) cout << setprecision(50) << x << endl;
#define ce continue;
#define bl bool
#define r0 rt 0;
#define r1 rt 1;
#define elif else if
#define bk break;
#define A p("A")
#define B p("B")
#define C p("C")
#define D p("D")
#define E p("E")
#define F p("F")
#define S(a) sort(a.begin(), a.end());
#define R(a) reverse(a.begin(), a.end());
#define cl cout << endl;
#define pb(x) push_back((x));
#define str string
using namespace std;
void Cond(int g) {
if (g)
p("YES") else p("NO") rt;
}
void cond(int g) {
if (g)
p("Yes") else p("No") rt;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
rt b;
gcd(b, a % b);
}
str su = "0123456789";
str m1 = "abcdefghijklmnopqrstuvwxyz";
str m2 = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
map<char, ll> m5;
typedef pair<ll, ll> P;
const ll INF = (ll)1e18 + 10;
ll t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0, t8 = 0, g = 0,
ans = 0;
ll n = 0, m = 0, mx = -INF, mn = INF, ct = 0, cnt = 0;
ll sum = 0, mask = 0;
ll k;
set<P> pst;
set<ll> st;
ll powmod(ll a, ll b, ll x) { //(a^b)modx
if (!b)
r1 if (!(b % 2)) { // B
ll t = powmod(a, b / 2, x);
rt t *t % x;
}
rt((a)*powmod(a, b - 1, x)) % x;
}
void di() {
m5['a'] = 0;
m5['b'] = 1;
m5['c'] = 2;
m5['d'] = 3;
m5['e'] = 4;
m5['f'] = 5;
m5['g'] = 6;
m5['h'] = 7;
m5['i'] = 8;
m5['j'] = 9;
m5['k'] = 10;
m5['l'] = 11;
m5['m'] = 12;
m5['n'] = 13;
m5['o'] = 14;
m5['p'] = 15;
m5['q'] = 16;
m5['r'] = 17;
m5['s'] = 18;
m5['t'] = 19;
m5['u'] = 20;
m5['v'] = 21;
m5['w'] = 22;
m5['x'] = 23;
m5['y'] = 24;
m5['z'] = 25;
}
map<ll, ll> mp;
typedef std::vector<ll> vl;
typedef pair<ll, ll> P;
typedef pair<ll, P> P2;
typedef priority_queue<P, vector<P>, greater<P>> prq;
typedef struct edge2 {
P tos;
ll cost;
} EDGE2;
typedef struct edge1 {
ll to, cost;
} EDGE;
bl used[(ll)1e6];
const ll M = (ll)1e9 + 7;
ll fac[1000007], finv[1000007], inv[1000007];
void initcmb() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000007; i++) {
fac[i] = fac[i - 1] * i % M;
inv[i] = M - inv[M % i] * (M / i) % M;
finv[i] = finv[i - 1] * inv[i] % M;
}
}
ll cmb(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % M) % M;
}
db pi =
3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534211706798214808651328230664709384460955058223172535940812848111745028410270193852110555964462294895493038196;
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;
}
const ll MAX = (ll)1e5 * 3;
vl rui(MAX);
priority_queue<P, vector<P>, greater<P>> q42;
// int -2,147,483,648 ～ 2,147,483,647
// alt f3
map<ll, ll> primeFactorAndIndex;
set<ll> setOfPrimeFactors;
vector<P> vectorOfPrimeFactorsAndIndices;
vd factorize(ll x) {
ll y = x;
for (ll i = 2; i <= (ll)ceil(sqrt((db)y)); i++) {
while (!(x % i)) {
primeFactorAndIndex[i]++;
x /= i;
setOfPrimeFactors.insert(i);
}
}
if (x != 1) {
setOfPrimeFactors.insert(x);
primeFactorAndIndex[x] = 1;
}
for (ll i : setOfPrimeFactors) {
vectorOfPrimeFactorsAndIndices.push_back({i, primeFactorAndIndex[i]});
// cout << i << " " << primeFactorAndIndex[i] << endl;
}
}
int main() { // swap(ary１,ary２)
// a.erase(a.begin()+5),a.insert(a.begin()+3,tmp)
// ios_base::sync_with_stdio(0); cin.tie(0);
// long long 型でREになる時はint型で書き直す
clock_t start = clock(); // timecalc
cin >> n >> m;
t1 = gcd(n, m);
factorize(t1);
p(vectorOfPrimeFactorsAndIndices.size() + 1)
clock_t end = clock(); //
const double time =
static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0; // timecalc
// printfz("time %lf[ms]\n", time);//
return 0;
} // main
| #include <bits/stdc++.h>
#define ll long long //
#define rp(i, a, b) for (ll i = a; i < b; i++)
#define r(i, n) for (ll i = 0; i < n; i++)
#define rt return
#define db double
#define ldb long double
#define vd void
#define p(x) cout << (x) << endl;
#define psc(x) cout << setprecision(50) << (x) << endl;
#define precise(x) cout << setprecision(50) << x << endl;
#define ce continue;
#define bl bool
#define r0 rt 0;
#define r1 rt 1;
#define elif else if
#define bk break;
#define A p("A")
#define B p("B")
#define C p("C")
#define D p("D")
#define E p("E")
#define F p("F")
#define S(a) sort(a.begin(), a.end());
#define R(a) reverse(a.begin(), a.end());
#define cl cout << endl;
#define pb(x) push_back((x));
#define str string
using namespace std;
void Cond(int g) {
if (g)
p("YES") else p("NO") rt;
}
void cond(int g) {
if (g)
p("Yes") else p("No") rt;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
rt b;
gcd(b, a % b);
}
str su = "0123456789";
str m1 = "abcdefghijklmnopqrstuvwxyz";
str m2 = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
map<char, ll> m5;
typedef pair<ll, ll> P;
const ll INF = (ll)1e18 + 10;
ll t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0, t8 = 0, g = 0,
ans = 0;
ll n = 0, m = 0, mx = -INF, mn = INF, ct = 0, cnt = 0;
ll sum = 0, mask = 0;
ll k;
set<P> pst;
set<ll> st;
ll powmod(ll a, ll b, ll x) { //(a^b)modx
if (!b)
r1 if (!(b % 2)) { // B
ll t = powmod(a, b / 2, x);
rt t *t % x;
}
rt((a)*powmod(a, b - 1, x)) % x;
}
void di() {
m5['a'] = 0;
m5['b'] = 1;
m5['c'] = 2;
m5['d'] = 3;
m5['e'] = 4;
m5['f'] = 5;
m5['g'] = 6;
m5['h'] = 7;
m5['i'] = 8;
m5['j'] = 9;
m5['k'] = 10;
m5['l'] = 11;
m5['m'] = 12;
m5['n'] = 13;
m5['o'] = 14;
m5['p'] = 15;
m5['q'] = 16;
m5['r'] = 17;
m5['s'] = 18;
m5['t'] = 19;
m5['u'] = 20;
m5['v'] = 21;
m5['w'] = 22;
m5['x'] = 23;
m5['y'] = 24;
m5['z'] = 25;
}
map<ll, ll> mp;
typedef std::vector<ll> vl;
typedef pair<ll, ll> P;
typedef pair<ll, P> P2;
typedef priority_queue<P, vector<P>, greater<P>> prq;
typedef struct edge2 {
P tos;
ll cost;
} EDGE2;
typedef struct edge1 {
ll to, cost;
} EDGE;
bl used[(ll)1e6];
const ll M = (ll)1e9 + 7;
ll fac[1000007], finv[1000007], inv[1000007];
void initcmb() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000007; i++) {
fac[i] = fac[i - 1] * i % M;
inv[i] = M - inv[M % i] * (M / i) % M;
finv[i] = finv[i - 1] * inv[i] % M;
}
}
ll cmb(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % M) % M;
}
db pi =
3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534211706798214808651328230664709384460955058223172535940812848111745028410270193852110555964462294895493038196;
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;
}
const ll MAX = (ll)1e5 * 3;
vl rui(MAX);
priority_queue<P, vector<P>, greater<P>> q42;
// int -2,147,483,648 ～ 2,147,483,647
// alt f3
map<ll, ll> primeFactorAndIndex;
set<ll> setOfPrimeFactors;
vector<P> vectorOfPrimeFactorsAndIndices;
vd factorize(ll x) {
ll y = x;
for (ll i = 2; i <= (ll)ceil(sqrt((db)y)); i++) {
while (!(x % i)) {
primeFactorAndIndex[i]++;
x /= i;
setOfPrimeFactors.insert(i);
}
}
if (x != 1) {
setOfPrimeFactors.insert(x);
primeFactorAndIndex[x] = 1;
}
for (ll i : setOfPrimeFactors) {
vectorOfPrimeFactorsAndIndices.push_back({i, primeFactorAndIndex[i]});
// cout << i << " " << primeFactorAndIndex[i] << endl;
}
}
int main() { // swap(ary１,ary２)
// a.erase(a.begin()+5),a.insert(a.begin()+3,tmp)
// ios_base::sync_with_stdio(0); cin.tie(0);
// long long 型でREになる時はint型で書き直す
clock_t start = clock(); // timecalc
cin >> n >> m;
t1 = __gcd(n, m);
factorize(t1);
p(vectorOfPrimeFactorsAndIndices.size() + 1)
clock_t end = clock(); //
const double time =
static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0; // timecalc
// printfz("time %lf[ms]\n", time);//
return 0;
} // main
| replace | 179 | 180 | 179 | 180 | 0 | |
p02900 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#define _ << " " <<
#define all(v) v.begin(), v.end()
#define sp(n) fixed << setprecision(n)
#define ff first
#define ss second
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll mod = 1e9 + 7;
const double eps = DBL_EPSILON;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
set<ll> div;
for (int i = 2; i * i <= a; i++) {
while (a % i == 0) {
div.insert(i);
a /= i;
}
}
if (a != 1)
div.insert(a);
int ans = 0;
for (ll i : div) {
if (b % i == 0)
ans++;
}
cout << ans + 1 << endl;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#define _ << " " <<
#define all(v) v.begin(), v.end()
#define sp(n) fixed << setprecision(n)
#define ff first
#define ss second
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll mod = 1e9 + 7;
const double eps = DBL_EPSILON;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
set<ll> div;
for (ll i = 2; i * i <= a; i++) {
while (a % i == 0) {
div.insert(i);
a /= i;
}
}
if (a != 1)
div.insert(a);
int ans = 0;
for (ll i : div) {
if (b % i == 0)
ans++;
}
cout << ans + 1 << endl;
return 0;
} | replace | 29 | 30 | 29 | 30 | TLE | |
p02900 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
typedef string::const_iterator State;
class ParseError {};
void IOS() { ios::sync_with_stdio(false), cin.tie(0); }
constexpr ll INF = 1e16;
constexpr ll INM = 114514;
constexpr ll MOD = 1e9 + 7;
constexpr ld EPS = 1e-12;
template <typename T> void dump(T x) { cout << x << endl; }
void dumpf(ld x, int t) { cout << setprecision(t) << fixed << x << endl; }
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
inline ll mod(ll a, ll b) {
if (a > 0)
return a % b;
if (a % b == 0)
return 0;
ll x = -a / b + 1;
a += x * b;
return a % b;
}
ll powm(ll a, ll b, ll c) {
if (b == 0)
return 1;
else if (b % 2 == 0) {
ll d = powm(a, b / 2, c);
return (d * d) % c;
} else
return (a * powm(a, b - 1, c)) % c;
}
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; }
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
vector<ll> pfact(ll n) {
vector<ll> ret;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
ret.push_back(n);
return ret;
}
int main() {
IOS();
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
dump(pfact(g).size() + 1);
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
typedef string::const_iterator State;
class ParseError {};
void IOS() { ios::sync_with_stdio(false), cin.tie(0); }
constexpr ll INF = 1e16;
constexpr ll INM = 114514;
constexpr ll MOD = 1e9 + 7;
constexpr ld EPS = 1e-12;
template <typename T> void dump(T x) { cout << x << endl; }
void dumpf(ld x, int t) { cout << setprecision(t) << fixed << x << endl; }
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
inline ll mod(ll a, ll b) {
if (a > 0)
return a % b;
if (a % b == 0)
return 0;
ll x = -a / b + 1;
a += x * b;
return a % b;
}
ll powm(ll a, ll b, ll c) {
if (b == 0)
return 1;
else if (b % 2 == 0) {
ll d = powm(a, b / 2, c);
return (d * d) % c;
} else
return (a * powm(a, b - 1, c)) % c;
}
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; }
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
vector<ll> pfact(ll n) {
vector<ll> ret;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
ret.push_back(n);
return ret;
}
int main() {
IOS();
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
dump(pfact(g).size() + 1);
return 0;
} | replace | 53 | 54 | 53 | 54 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
map<long long int, long long int> prime_factor(long long int n) {
map<long long int, long long int> res;
for (long long 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(int argc, char **argv) {
long long int A, B;
cin >> A >> B;
map<long long int, long long int> a = prime_factor(A);
map<long long int, long long int> b = prime_factor(B);
long long int ans = 1;
for (auto itr = a.begin(); itr != a.end(); itr++) {
if (b[itr->first] > 0)
ans++;
}
cout << ans << "\n";
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
map<long long int, long long int> prime_factor(long long int n) {
map<long long int, long long int> res;
for (long long 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(int argc, char **argv) {
long long int A, B;
cin >> A >> B;
map<long long int, long long int> a = prime_factor(A);
map<long long int, long long int> b = prime_factor(B);
long long int ans = 1;
for (auto itr = a.begin(); itr != a.end(); itr++) {
if (b[itr->first] > 0)
ans++;
}
cout << ans << "\n";
return 0;
}
| replace | 9 | 10 | 9 | 10 | TLE | |
p02900 | C++ | Runtime Error | // Warmdust Code
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define db double
#define ll long long
#define ull unsigned long long
#define ft float
#define PI acos(-1)
#define L(i, a, b) for (int i = a; i <= b; i++)
#define R(i, a, b) for (int i = a; i >= b; i--)
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
#define Warmdust int main() {
#define RETURN \
return 0; \
}
#define TvT ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
using namespace std;
const int maxn = 1e5 + 7;
const int mod = 10000 + 7;
int sz[maxn];
// vector<ll>v;
Warmdust TvT;
ll a, b;
int cnt = 0;
cin >> a >> b;
ll s = __gcd(a, b);
// cout << s << endl;
for (ll i = 1; i * i <= s; i++) {
if (s % i == 0) {
sz[cnt++] = i;
if (i * i == s)
continue;
sz[cnt++] = s / i;
}
}
sort(sz, sz + cnt);
R(i, cnt - 1, 1) {
// int sum = cnt;
R(j, i - 1, 1) {
if (sz[i] % sz[j] == 0) {
cnt--;
break;
}
}
// mn=min(mn,sum) ;
}
cout << cnt << endl;
RETURN
| // Warmdust Code
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define db double
#define ll long long
#define ull unsigned long long
#define ft float
#define PI acos(-1)
#define L(i, a, b) for (int i = a; i <= b; i++)
#define R(i, a, b) for (int i = a; i >= b; i--)
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
#define Warmdust int main() {
#define RETURN \
return 0; \
}
#define TvT ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
using namespace std;
const int maxn = 1e5 + 7;
const int mod = 10000 + 7;
ll sz[maxn];
// vector<ll>v;
Warmdust TvT;
ll a, b;
int cnt = 0;
cin >> a >> b;
ll s = __gcd(a, b);
// cout << s << endl;
for (ll i = 1; i * i <= s; i++) {
if (s % i == 0) {
sz[cnt++] = i;
if (i * i == s)
continue;
sz[cnt++] = s / i;
}
}
sort(sz, sz + cnt);
R(i, cnt - 1, 1) {
// int sum = cnt;
R(j, i - 1, 1) {
if (sz[i] % sz[j] == 0) {
cnt--;
break;
}
}
// mn=min(mn,sum) ;
}
cout << cnt << endl;
RETURN
| replace | 31 | 32 | 31 | 32 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, ans = 1;
cin >> A >> B;
long long g = __gcd(A, B);
vector<long long> K;
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;
int main() {
long long A, B, ans = 1;
cin >> A >> B;
long long g = __gcd(A, B);
for (long long 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 | 7 | 9 | 7 | 8 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(const char &ch) { return string(1, ch); }
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N> string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define pr(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define pr(...) 42
#endif
double tick() {
static clock_t oldtick;
clock_t newtick = clock();
double diff = 1.0 * (newtick - oldtick) / CLOCKS_PER_SEC;
oldtick = newtick;
return diff;
}
typedef long long ll;
vector<ll> factorise(ll val) {
vector<ll> fac;
for (ll n = 1; n * n <= val; n++) {
if (val % n == 0) {
if (val / n == n)
fac.emplace_back(n);
else {
fac.emplace_back(n);
fac.emplace_back(val / n);
}
}
}
return fac;
}
ll gcd(ll a, ll b) {
while (b > 0) {
ll temp = b;
b = a % b;
a = temp;
}
return a;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << setprecision(10);
cout << fixed;
#ifdef LOCAL
freopen("d_commmon_divisors.in", "rt", stdin);
#endif
ll a, b;
cin >> a >> b;
vector<ll> faca = factorise(a);
vector<ll> facb = factorise(b);
int an = faca.size();
int bn = facb.size();
map<ll, int> mp;
for (int i = 0; i < an; i++) {
mp[faca[i]]++;
}
for (int i = 0; i < bn; i++) {
mp[facb[i]]++;
}
vector<ll> arr;
for (auto pr : mp) {
if (pr.second == 2)
arr.emplace_back(pr.first);
}
// pr(arr);
int n = arr.size();
vector<vector<ll>> vec(n);
for (int i = 0; i < n; i++) {
vec[i].emplace_back(arr[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
else {
bool found = false;
for (ll val : vec[j]) {
if (gcd(val, arr[i]) != 1LL) {
found = true;
break;
}
}
if (!found)
vec[j].emplace_back(arr[i]);
}
}
}
// pr(vec);
int ans = INT_MIN;
for (int i = 0; i < n; i++) {
int size = vec[i].size();
ans = max(ans, size);
}
cout << ans << endl;
#ifdef LOCAL
// fprintf(stderr, "Time elapsed: %.12lf secs...\n", tick());
#endif
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(const char &ch) { return string(1, ch); }
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N> string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define pr(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define pr(...) 42
#endif
double tick() {
static clock_t oldtick;
clock_t newtick = clock();
double diff = 1.0 * (newtick - oldtick) / CLOCKS_PER_SEC;
oldtick = newtick;
return diff;
}
typedef long long ll;
vector<ll> factorise(ll val) {
vector<ll> fac;
for (ll n = 1; n * n <= val; n++) {
if (val % n == 0) {
if (val / n == n)
fac.emplace_back(n);
else {
fac.emplace_back(n);
fac.emplace_back(val / n);
}
}
}
return fac;
}
ll gcd(ll a, ll b) {
while (b > 0) {
ll temp = b;
b = a % b;
a = temp;
}
return a;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << setprecision(10);
cout << fixed;
#ifdef LOCAL
freopen("d_commmon_divisors.in", "rt", stdin);
#endif
ll a, b;
cin >> a >> b;
vector<ll> faca = factorise(a);
vector<ll> facb = factorise(b);
int an = faca.size();
int bn = facb.size();
map<ll, int> mp;
for (int i = 0; i < an; i++) {
mp[faca[i]]++;
}
for (int i = 0; i < bn; i++) {
mp[facb[i]]++;
}
vector<ll> arr;
for (auto pr : mp) {
if (pr.second == 2)
arr.emplace_back(pr.first);
}
// pr(arr);
int n = arr.size();
vector<vector<ll>> vec(n);
for (int i = 0; i < n; i++) {
vec[i].emplace_back(arr[i]);
}
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (i == j)
continue;
else {
bool found = false;
for (ll val : vec[j]) {
if (gcd(val, arr[i]) != 1LL) {
found = true;
break;
}
}
if (!found)
vec[j].emplace_back(arr[i]);
}
}
}
// pr(vec);
int ans = INT_MIN;
for (int i = 0; i < n; i++) {
int size = vec[i].size();
ans = max(ans, size);
}
cout << ans << endl;
#ifdef LOCAL
// fprintf(stderr, "Time elapsed: %.12lf secs...\n", tick());
#endif
return 0;
}
| replace | 154 | 156 | 154 | 156 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
long int gcd(long int x, long int y) { return y ? gcd(y, x % y) : x; }
vector<pair<long int, int>> factorize(long int N) {
vector<pair<long int, int>> res;
for (long int 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() {
long int a, b;
cin >> a >> b;
long int g = gcd(a, b);
auto f = factorize(g);
int ans = f.size() + 1;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
long int gcd(long int x, long int y) { return y ? gcd(y, x % y) : x; }
vector<pair<long int, int>> factorize(long int N) {
vector<pair<long int, int>> res;
for (long int 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() {
long int a, b;
cin >> a >> b;
long int g = gcd(a, b);
auto f = factorize(g);
int ans = f.size() + 1;
cout << ans << endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02900 | C++ | Time Limit Exceeded | /* C++14(GCC5.4.1) */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const ll MAX_N = 1000000;
// m>=nを想定している
ll gcd(ll m, ll n) {
if (n == 0)
return m;
return gcd(n, m % n);
}
/*map<ll,ll> prime_factor(ll n){
map<ll,ll> 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;
}*/
// [[vectorを使うかmapを使うか.]]
// 要素の個数に興味があるので
// insertがO(1)のvectorの方が
// insertにO(log n)かかるmapよりも
// 使えるってことね!
// 素因数分解
// nを次々と割っていく
// i=2からスタート
vector<pair<ll, int>> prime_factor(ll n) {
vector<pair<ll, int>> res;
for (int i = 2; i * i <= n; ++i) {
int k = 0;
while (n % i == 0) {
n /= i;
k++;
}
// iで一回以上割り切れるなら追加
if (k != 0)
res.push_back({i, k});
}
// 残ったnが1ではない時、i*i<=nに引っかかったn=iである.
if (n != 1)
res.push_back({n, 1});
return res;
}
int main(void) {
// 入力
ll a, b;
cin >> a >> b;
// a,bのGCDを求める
ll gcd_of_ab;
if (a >= b)
gcd_of_ab = gcd(a, b);
else
gcd_of_ab = gcd(b, a);
// 求めたいのはGCD以下のGCDを割り切る素数の個数
ll ans = 1;
auto m = prime_factor(gcd_of_ab);
ans += m.size();
cout << ans;
return 0;
} | /* C++14(GCC5.4.1) */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const ll MAX_N = 1000000;
// m>=nを想定している
ll gcd(ll m, ll n) {
if (n == 0)
return m;
return gcd(n, m % n);
}
/*map<ll,ll> prime_factor(ll n){
map<ll,ll> 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;
}*/
// [[vectorを使うかmapを使うか.]]
// 要素の個数に興味があるので
// insertがO(1)のvectorの方が
// insertにO(log n)かかるmapよりも
// 使えるってことね!
// 素因数分解
// nを次々と割っていく
// i=2からスタート
vector<pair<ll, int>> prime_factor(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
int k = 0;
while (n % i == 0) {
n /= i;
k++;
}
// iで一回以上割り切れるなら追加
if (k != 0)
res.push_back({i, k});
}
// 残ったnが1ではない時、i*i<=nに引っかかったn=iである.
if (n != 1)
res.push_back({n, 1});
return res;
}
int main(void) {
// 入力
ll a, b;
cin >> a >> b;
// a,bのGCDを求める
ll gcd_of_ab;
if (a >= b)
gcd_of_ab = gcd(a, b);
else
gcd_of_ab = gcd(b, a);
// 求めたいのはGCD以下のGCDを割り切る素数の個数
ll ans = 1;
auto m = prime_factor(gcd_of_ab);
ans += m.size();
cout << ans;
return 0;
} | replace | 36 | 37 | 36 | 37 | TLE | |
p02900 | C++ | Time Limit Exceeded | // #include <windows.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// #define int ll
typedef vector<vector<pair<int, int>>> vvp;
typedef vector<pair<int, int>> vp;
typedef vector<vector<int>> vvi;
typedef vector<int> vi;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<double>> vvd;
typedef vector<double> vd;
typedef vector<vector<bool>> vvb;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef pair<string, int> psi;
typedef pair<int, int> pii;
// #define unix ((unsigned int)time(NULL))
#define rep(i, s, n) for (int i = (s); i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define yn(f) (f ? "yes" : "no")
#define YN(f) (f ? "YES" : "NO")
#define Yn(f) (f ? "Yes" : "No")
#define len(x) int(x.size())
#define inf (1000000007)
#define ll_inf (1000000000000000007)
#define nil -1
void puts() { cout << endl; }
template <class Head, class... Tail> void puts(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) == 0) {
cout << endl;
} else {
cout << " ";
puts(forward<Tail>(tail)...);
}
}
void puts(vector<pair<int, int>> &A) {
for (int i = 0; i < A.size(); i++) {
cout << "(" << A[i].first << "," << A[i].second << ")";
if (A.size() - 1 == i) {
cout << endl;
} else {
cout << " ";
}
}
}
void puts(vector<vector<pair<int, int>>> &A) {
for (int i = 0; i < A.size(); i++) {
puts(A[i]);
}
}
template <class T> void puts(vector<T> &A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i];
if (A.size() - 1 == i) {
cout << endl;
} else {
cout << " ";
}
}
}
template <class T> void puts(vector<vector<T>> &A) {
for (int i = 0; i < A.size(); i++) {
puts(A[i]);
}
}
class disjoint_set {
public:
vi p, rank;
disjoint_set(int size) {
p.resize(size, 0);
rank.resize(size, 0);
for (int i = 0; i < size; i++)
makeSet(i);
}
void makeSet(int x) {
p[x] = x;
rank[x] = 0;
}
bool same(int x, int y) { return findSet(x) == findSet(y); }
void unite(int x, int y) { link(findSet(x), findSet(y)); }
void link(int x, int y) {
if (rank[x] < rank[y]) {
p[x] = y;
} else {
p[y] = x;
if (rank[x] == rank[y]) {
rank[x]++;
}
}
}
int findSet(int x) {
if (x != p[x]) {
p[x] = findSet(p[x]);
}
return p[x];
}
};
int gcd(int a, int b) { // log N
return (b == 0) ? a : gcd(b, a % b);
}
ll gcd(ll a, ll b) { // log N
return (b == 0) ? a : gcd(b, a % b);
}
int lcm(int a, int b) { // log N
return (a * b) / gcd(a, b);
}
ll lcm(ll a, ll b) { // log N
return (a * b) / gcd(a, b);
}
int extgcd(int a, int b, int &x, int &y) { // log N
int d = a;
if (b == 0) {
x = 1;
y = 0;
} else {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
}
return d;
}
vi get_primes(int limit) { // N log N
vb A(limit + 1, true);
for (int i = 2; i < A.size(); i++) {
if (!A[i])
continue;
for (int j = i * 2; j < A.size(); j += i)
A[j] = false;
}
vi B;
for (int i = 2; i < A.size(); i++) {
if (A[i])
B.push_back(i);
}
return B;
}
bool is_prime(int num) { // sqrt(N)
if (num < 2)
return false;
for (int i = 2; i <= sqrt(num); i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
ll merge_count(vi &A) { // N log N
int n = A.size();
if (n <= 1)
return 0;
long long count = 0;
int mid = n / 2;
vector<int> B(A.begin(), A.begin() + mid);
vector<int> C(A.begin() + mid, A.end());
count += merge_count(B);
count += merge_count(C);
B.push_back(inf);
C.push_back(inf);
int B_i = 0;
int C_i = 0;
for (int i = 0; i < n; i++) {
if (B[B_i] <= C[C_i]) {
A[i] = B[B_i++];
} else {
count += (n / 2) - B_i;
A[i] = C[C_i++];
}
}
return count;
}
vi bit(int size, int num) {
vi A;
for (int j = 0; j < size; j++) {
if ((num & (1 << (size - j - 1))) > 0) {
A.push_back(1);
} else {
A.push_back(0);
}
}
return A;
}
vvi bit_z(int size) { // 2**N
vvi A;
for (int i = 0; i < (1 << size); i++) {
vi temp = bit(size, i);
A.push_back(temp);
}
return A;
}
vvi bit_z(int size, int n) {
vvi A;
int s = (1 << n) - 1;
A.push_back(bit(size, s));
while (true) {
int x = s & (-s);
int y = s + x;
int z = s & (~y);
z /= x;
z = z >> 1;
s = (y | z);
if (s >= (1 << size))
break;
A.push_back(bit(size, s));
}
return A;
}
vvi bit_z(int size, int min, int max) {
vvi A;
for (int i = min; i <= max; i++) {
vvi B = bit_z(size, i);
A.insert(A.end(), B.begin(), B.end());
}
return A;
}
int random(int min, int max) {
int r = rand() % (max + 1 - min) + min;
return r;
}
vector<pair<ll, int>> factorize(ll n) {
ll count = 0;
vector<pair<ll, int>> res;
for (int 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);
ll ans = factorize(g).size() + 1;
puts(ans);
}
| // #include <windows.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// #define int ll
typedef vector<vector<pair<int, int>>> vvp;
typedef vector<pair<int, int>> vp;
typedef vector<vector<int>> vvi;
typedef vector<int> vi;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<double>> vvd;
typedef vector<double> vd;
typedef vector<vector<bool>> vvb;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef pair<string, int> psi;
typedef pair<int, int> pii;
// #define unix ((unsigned int)time(NULL))
#define rep(i, s, n) for (int i = (s); i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define yn(f) (f ? "yes" : "no")
#define YN(f) (f ? "YES" : "NO")
#define Yn(f) (f ? "Yes" : "No")
#define len(x) int(x.size())
#define inf (1000000007)
#define ll_inf (1000000000000000007)
#define nil -1
void puts() { cout << endl; }
template <class Head, class... Tail> void puts(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) == 0) {
cout << endl;
} else {
cout << " ";
puts(forward<Tail>(tail)...);
}
}
void puts(vector<pair<int, int>> &A) {
for (int i = 0; i < A.size(); i++) {
cout << "(" << A[i].first << "," << A[i].second << ")";
if (A.size() - 1 == i) {
cout << endl;
} else {
cout << " ";
}
}
}
void puts(vector<vector<pair<int, int>>> &A) {
for (int i = 0; i < A.size(); i++) {
puts(A[i]);
}
}
template <class T> void puts(vector<T> &A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i];
if (A.size() - 1 == i) {
cout << endl;
} else {
cout << " ";
}
}
}
template <class T> void puts(vector<vector<T>> &A) {
for (int i = 0; i < A.size(); i++) {
puts(A[i]);
}
}
class disjoint_set {
public:
vi p, rank;
disjoint_set(int size) {
p.resize(size, 0);
rank.resize(size, 0);
for (int i = 0; i < size; i++)
makeSet(i);
}
void makeSet(int x) {
p[x] = x;
rank[x] = 0;
}
bool same(int x, int y) { return findSet(x) == findSet(y); }
void unite(int x, int y) { link(findSet(x), findSet(y)); }
void link(int x, int y) {
if (rank[x] < rank[y]) {
p[x] = y;
} else {
p[y] = x;
if (rank[x] == rank[y]) {
rank[x]++;
}
}
}
int findSet(int x) {
if (x != p[x]) {
p[x] = findSet(p[x]);
}
return p[x];
}
};
int gcd(int a, int b) { // log N
return (b == 0) ? a : gcd(b, a % b);
}
ll gcd(ll a, ll b) { // log N
return (b == 0) ? a : gcd(b, a % b);
}
int lcm(int a, int b) { // log N
return (a * b) / gcd(a, b);
}
ll lcm(ll a, ll b) { // log N
return (a * b) / gcd(a, b);
}
int extgcd(int a, int b, int &x, int &y) { // log N
int d = a;
if (b == 0) {
x = 1;
y = 0;
} else {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
}
return d;
}
vi get_primes(int limit) { // N log N
vb A(limit + 1, true);
for (int i = 2; i < A.size(); i++) {
if (!A[i])
continue;
for (int j = i * 2; j < A.size(); j += i)
A[j] = false;
}
vi B;
for (int i = 2; i < A.size(); i++) {
if (A[i])
B.push_back(i);
}
return B;
}
bool is_prime(int num) { // sqrt(N)
if (num < 2)
return false;
for (int i = 2; i <= sqrt(num); i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
ll merge_count(vi &A) { // N log N
int n = A.size();
if (n <= 1)
return 0;
long long count = 0;
int mid = n / 2;
vector<int> B(A.begin(), A.begin() + mid);
vector<int> C(A.begin() + mid, A.end());
count += merge_count(B);
count += merge_count(C);
B.push_back(inf);
C.push_back(inf);
int B_i = 0;
int C_i = 0;
for (int i = 0; i < n; i++) {
if (B[B_i] <= C[C_i]) {
A[i] = B[B_i++];
} else {
count += (n / 2) - B_i;
A[i] = C[C_i++];
}
}
return count;
}
vi bit(int size, int num) {
vi A;
for (int j = 0; j < size; j++) {
if ((num & (1 << (size - j - 1))) > 0) {
A.push_back(1);
} else {
A.push_back(0);
}
}
return A;
}
vvi bit_z(int size) { // 2**N
vvi A;
for (int i = 0; i < (1 << size); i++) {
vi temp = bit(size, i);
A.push_back(temp);
}
return A;
}
vvi bit_z(int size, int n) {
vvi A;
int s = (1 << n) - 1;
A.push_back(bit(size, s));
while (true) {
int x = s & (-s);
int y = s + x;
int z = s & (~y);
z /= x;
z = z >> 1;
s = (y | z);
if (s >= (1 << size))
break;
A.push_back(bit(size, s));
}
return A;
}
vvi bit_z(int size, int min, int max) {
vvi A;
for (int i = min; i <= max; i++) {
vvi B = bit_z(size, i);
A.insert(A.end(), B.begin(), B.end());
}
return A;
}
int random(int min, int max) {
int r = rand() % (max + 1 - min) + min;
return r;
}
vector<pair<ll, int>> factorize(ll n) {
ll count = 0;
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);
ll ans = factorize(g).size() + 1;
puts(ans);
}
| replace | 227 | 228 | 227 | 228 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a, b;
ll gcd(ll a, ll b) {
if (!b)
return a;
else
return gcd(b, a % b);
}
int main() {
cin >> a >> b;
ll res = gcd(a, b);
ll ans = 0;
for (int i = 2; i * i < res; i++) {
if (res % i == 0) {
ans++;
while (res % i == 0)
res /= i;
}
}
if (res > 1)
ans++;
cout << ++ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a, b;
ll gcd(ll a, ll b) {
if (!b)
return a;
else
return gcd(b, a % b);
}
int main() {
cin >> a >> b;
ll res = gcd(a, b);
ll ans = 0;
for (ll i = 2; i * i < res; i++) {
if (res % i == 0) {
ans++;
while (res % i == 0)
res /= i;
}
}
if (res > 1)
ans++;
cout << ++ans << endl;
}
| replace | 14 | 15 | 14 | 15 | TLE | |
p02900 | C++ | Time Limit Exceeded | /* بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ */
// codeforces
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FASTIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define mp make_pair
#define pb push_back
#define sz(v) ((int)v.size())
#define all(v) v.begin(), v.end()
void parseArray(ll *A, ll n) {
for (ll K = 0; K < n; K++) {
cin >> A[K];
}
}
ll modInverse(ll a, ll b) {
return 1 < a ? b - modInverse(b % a, a) * b / a : 1;
}
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); }
ld dist(ll x, ll y, ll a, ll b) {
return sqrt((x - a) * (x - a) + (y - b) * (y - b));
}
void debug(ll *a, ll n) {
for (int k = 0; k < n; k++) {
cout << a[k] << " ";
}
cerr << "\n";
}
int main() {
ll a, b;
cin >> a >> b;
vector<ll> div;
ll y = max(a, b);
ll x = min(a, b);
ll ans = 1;
if (x % 2 == 0) {
if (y % 2 == 0)
ans++;
x /= 2;
}
while (x % 2 == 0)
x /= 2;
for (int i = 3; i * i <= x; i += 2) {
if (x % i == 0) {
if (y % i == 0)
ans++;
x /= i;
}
while (x % i == 0)
x /= i;
}
if (x > 2 && y % x == 0)
ans++;
cout << ans << endl;
return 0;
} | /* بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ */
// codeforces
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FASTIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define mp make_pair
#define pb push_back
#define sz(v) ((int)v.size())
#define all(v) v.begin(), v.end()
void parseArray(ll *A, ll n) {
for (ll K = 0; K < n; K++) {
cin >> A[K];
}
}
ll modInverse(ll a, ll b) {
return 1 < a ? b - modInverse(b % a, a) * b / a : 1;
}
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); }
ld dist(ll x, ll y, ll a, ll b) {
return sqrt((x - a) * (x - a) + (y - b) * (y - b));
}
void debug(ll *a, ll n) {
for (int k = 0; k < n; k++) {
cout << a[k] << " ";
}
cerr << "\n";
}
int main() {
ll a, b;
cin >> a >> b;
vector<ll> div;
ll y = max(a, b);
ll x = min(a, b);
ll ans = 1;
if (x % 2 == 0) {
if (y % 2 == 0)
ans++;
x /= 2;
}
while (x % 2 == 0)
x /= 2;
for (ll i = 3; i * i <= x; i += 2) {
if (x % i == 0) {
if (y % i == 0)
ans++;
x /= i;
}
while (x % i == 0)
x /= i;
}
if (x > 2 && y % x == 0)
ans++;
cout << ans << endl;
return 0;
} | replace | 47 | 48 | 47 | 48 | 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 ans = 0;
ll x = g;
for (int i = 2; i * i <= x; i++) {
if (g % i == 0) {
ans++;
while ((g % i) == 0) {
g = (g / i);
}
}
}
if (g != 1)
ans++;
cout << ans + 1;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// typedef tree<int, nuint_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> new_data_set;
#define int long long
#define MOD 1000000007
#define what_is(x) cerr << #x << " is " << x << endl;
#define loop(i, a, n) for (int i = a; i < n; i++)
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, szof(x))
#define sortall(x) sort(aint(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
typedef pair<int, int> pt;
// int arr[2][2]={{0,1},{1,0}};
signed main() {
fastio();
// #define LOCAL_DEFINE
#ifdef LOCAL_DEFINE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// https://zhuhan0.blogspot.com/2017/09/leetcode-425-word-squares.html
// https://yzygitzh.github.io/algorithm/2018/11/09/leetcode-summary.html
// https://beginnersbook.com/2015/03/why-dont-we-call-run-method-directly-why-call-start-method/
// https://leetcode.com/problems/lfu-cache/
// int n,k;
// cin>>n>>k;
// vector<int> arr(n);
// for(int i=0;i<n;i++)
// {
// cin>>arr[i];
// }
// set<int> hash;
// int ans=0;
// bool flag=false;
// for(int i=0;i<k;i++)
// {
// if(hash.lower_bound(arr[i])!=hash.end())
// {
// flag=true;
// }
// hash.insert(arr[i]);
// }
// if(flag)
// {
// ans++;
// }
// bool flag1=false;
// for(int i=k;i<n;i++)
// {
// cout<<ans<<endl;
// hash.erase(arr[i-k]);
// if(hash.lower_bound(arr[i])!=hash.end())
// {
// ans++;
// }else if(hash.lower_bound(arr[i-k])!=hash.begin())
// {
// ans++;
// }else{
// flag1=true;
// }
// hash.insert(arr[i]);
// }
// if(!flag || !flag1)
// ans++;
// cout<<ans;
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
ll ans = 0;
ll x = g;
for (int i = 2; i * i <= x; i++) {
if (g % i == 0) {
ans++;
while ((g % i) == 0) {
g = (g / i);
}
}
}
if (g != 1)
ans++;
cout << ans + 1;
} | replace | 3 | 4 | 3 | 84 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll x, ll y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll ans = 0;
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 << endl;
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll x, ll y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll ans = 0;
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 + 1 << endl;
return (0);
}
| replace | 16 | 17 | 16 | 17 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main() {
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
if (g == 1) {
cout << 1 << endl;
return 0;
}
ll cnt = 0;
for (int i = 2; i * i <= g; i++) {
if (g % i == 0) {
cnt++;
while (!(g % i))
g /= i;
}
}
if (g != 1)
cnt++;
cout << cnt + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main() {
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
if (g == 1) {
cout << 1 << endl;
return 0;
}
ll cnt = 0;
for (ll i = 2; i * i <= g; i++) {
if (g % i == 0) {
cnt++;
while (!(g % i))
g /= i;
}
}
if (g != 1)
cnt++;
cout << cnt + 1 << endl;
return 0;
} | replace | 17 | 18 | 17 | 18 | TLE | |
p02900 | C++ | Time Limit Exceeded | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep2(i, n) for (int i = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.16f\n", a) // 少数出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2) // 等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
using ll = long long;
const int INF = 2147483647;
const int MINF = -2147483648;
const ll LINF = ll(9223372036854775807);
const ll MOD = 1000000007;
const double PI = acos(-1);
// マクロとかここまで
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll number1, ll number2) { // lcmを求める
return number1 * number2 / gcd(number1, number2);
}
bool is_prime(int64_t x) { // 素数判定
for (int64_t i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
ll nearPow2(ll n) // x以上の2のべき乗を返す
{
// nが0以下の時は0とする。
if (n <= 0)
return 0;
// (n & (n - 1)) == 0 の時は、nが2の冪乗であるため、そのままnを返す。
if ((n & (n - 1)) == 0)
return ll(n);
// bitシフトを用いて、2の冪乗を求める。
ll ret = 1;
while (n > 0) {
ret <<= 1;
n >>= 1;
}
return ret;
}
map<int64_t, int> prime_factor(int64_t n) { // 素因数分解
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<MOD>; // MOD=10億7
// mod. m での a の逆元 a^{-1} を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// nCrを1000000007で割った余りを求める
modint nCr(ll a, ll b) {
modint ans = 1;
for (ll i = 0; i < b; i++) {
ans *= a - i;
}
for (ll i = 1; i <= b; i++) {
ans *= modinv(i, MOD);
}
return ans;
}
void scans(string &str) {
char s[1000000];
scanf("%s", s);
str = s;
}
/*-----------------------------------------ここまでライブラリとか-----------------------------------------*/
int main() {
ll n, m;
scanf("%lld%lld", &n, &m);
ll a = gcd(n, m), count = 0;
vector<ll> yakusuu;
for (ll i = 1; i <= a; ++i) {
if (a % i == 0)
yakusuu.pb(i);
}
for (auto b : yakusuu) {
if (is_prime(b))
++count;
}
printf("%lld\n", count);
return 0;
}
| /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep2(i, n) for (int i = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.16f\n", a) // 少数出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2) // 等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
using ll = long long;
const int INF = 2147483647;
const int MINF = -2147483648;
const ll LINF = ll(9223372036854775807);
const ll MOD = 1000000007;
const double PI = acos(-1);
// マクロとかここまで
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll number1, ll number2) { // lcmを求める
return number1 * number2 / gcd(number1, number2);
}
bool is_prime(int64_t x) { // 素数判定
for (int64_t i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
ll nearPow2(ll n) // x以上の2のべき乗を返す
{
// nが0以下の時は0とする。
if (n <= 0)
return 0;
// (n & (n - 1)) == 0 の時は、nが2の冪乗であるため、そのままnを返す。
if ((n & (n - 1)) == 0)
return ll(n);
// bitシフトを用いて、2の冪乗を求める。
ll ret = 1;
while (n > 0) {
ret <<= 1;
n >>= 1;
}
return ret;
}
map<int64_t, int> prime_factor(int64_t n) { // 素因数分解
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<MOD>; // MOD=10億7
// mod. m での a の逆元 a^{-1} を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// nCrを1000000007で割った余りを求める
modint nCr(ll a, ll b) {
modint ans = 1;
for (ll i = 0; i < b; i++) {
ans *= a - i;
}
for (ll i = 1; i <= b; i++) {
ans *= modinv(i, MOD);
}
return ans;
}
void scans(string &str) {
char s[1000000];
scanf("%s", s);
str = s;
}
/*-----------------------------------------ここまでライブラリとか-----------------------------------------*/
int main() {
ll n, m;
scanf("%lld%lld", &n, &m);
ll a = gcd(n, m), count = 0;
for (ll i = 1; i <= sqrt(a); ++i) {
if (a % i == 0) {
if (is_prime(i))
++count;
if (is_prime(a / i))
++count;
if (i == a / i && is_prime(i))
--count;
}
}
printf("%lld\n", count);
return 0;
}
| replace | 221 | 231 | 221 | 231 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long A, B, num;
long long gcd(long long a, long long b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
cin >> A >> B;
long long gc = gcd(A, B);
long long k = gc;
num++;
for (int i = 2; i * i <= gc; i++) {
if (k % i == 0) {
num++;
while (k % i == 0) {
k /= i;
}
}
}
if (k > 1) {
num++;
}
cout << num << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long A, B, num;
long long gcd(long long a, long long b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
cin >> A >> B;
long long gc = gcd(A, B);
long long k = gc;
num++;
for (long long i = 2; i * i <= gc; i++) {
if (k % i == 0) {
num++;
while (k % i == 0) {
k /= i;
}
}
}
if (k > 1) {
num++;
}
cout << num << endl;
}
| replace | 18 | 19 | 18 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
map<long long, long long> prime_map;
long long cal_gcd(long long A, long long B) {
if (B == 0) {
return A;
}
return cal_gcd(B, A % B);
}
void prime_factor(int64_t bak) {
for (int i = 2; i * i <= bak; ++i) {
while (bak % i == 0) {
++prime_map[i];
bak /= i;
}
}
if (bak > 1) {
++prime_map[bak];
}
}
void prime_list(int64_t n) {
for (int64_t i = 2; i * i <= n; ++i) {
while (n % i == 0) {
++prime_map[i];
n = n / i;
}
}
if (n != 1) {
++prime_map[n];
}
}
int main() {
long long A, B;
cin >> A >> B;
long long gcd = cal_gcd(A, B);
prime_factor(gcd);
// prime_list(gcd);
cout << prime_map.size() + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
map<long long, long long> prime_map;
long long cal_gcd(long long A, long long B) {
if (B == 0) {
return A;
}
return cal_gcd(B, A % B);
}
void prime_factor(int64_t bak) {
for (int64_t i = 2; i * i <= bak; ++i) {
while (bak % i == 0) {
++prime_map[i];
bak /= i;
}
}
if (bak > 1) {
++prime_map[bak];
}
}
void prime_list(int64_t n) {
for (int64_t i = 2; i * i <= n; ++i) {
while (n % i == 0) {
++prime_map[i];
n = n / i;
}
}
if (n != 1) {
++prime_map[n];
}
}
int main() {
long long A, B;
cin >> A >> B;
long long gcd = cal_gcd(A, B);
prime_factor(gcd);
// prime_list(gcd);
cout << prime_map.size() + 1 << endl;
} | replace | 13 | 14 | 13 | 14 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for (uint64_t i = start; i < end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0) {
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) { return (m * n) / gcd(m, n); }
// vector<vector<uint64_t> > v(n+1, vector<uint64_t>(n+1, 0))
// v[n][k]に組み合わせ数が入る。
void comb(vector<vector<uint64_t>> &v) {
for (uint64_t i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (uint64_t k = 1; k < v.size(); k++) {
for (uint64_t j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
// 掛け算オーバーフロー判定
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
// 素因数分解
void primeFactorization(
uint64_t a, list<uint64_t> &factors) { // 素因数分解を出力するプログラム
long i, sq;
if (a % 2 == 0) { // 偶数の場合
factors.push_back(2);
primeFactorization(a / 2, factors); // 2で割った値で再帰
return;
}
sq = sqrt(a);
for (i = 3; i <= sq; i += 2) { // 3以上√a以下の奇数の場合
if (a % i == 0) {
factors.push_back(i);
primeFactorization(a / i, factors); // 割れた値で再帰
return;
}
}
// 偶数でも3以上√a以下の奇数の場合でも割り切れない場合
if (a != 1) { // aが1でないなら、a自身は素数
factors.push_back(a);
}
}
// フェルマーの小定理
// mod. m での a の逆元 a^{-1} を計算する
// (a/b)%m = a*movinv(b,m)%m
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// 円周率
// M_PI
// #include <iomanip> // setprecisionを使用するのに必要
// cout << std::fixed << std::setprecision(15) << y << endl;
// 昇順
// priority_queue<int, vector<int>, greater<int> > queue;
signed main() {
uint64_t a, b;
cin >> a >> b;
list<uint64_t> factA, factB;
primeFactorization(a, factA);
primeFactorization(b, factB);
factA.sort();
factB.sort();
uint64_t x = factA.front();
uint64_t y = factB.front();
int count = 1;
uint64_t prevC = 0;
while (factA.size() != 0 && factB.size() != 0) {
if (x == y) {
if (prevC != x) {
count++;
prevC = x;
}
factA.pop_front();
factB.pop_front();
} else if (x < y) {
factA.pop_front();
} else {
y = factB.front();
}
x = factA.front();
y = factB.front();
}
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for (uint64_t i = start; i < end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0) {
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) { return (m * n) / gcd(m, n); }
// vector<vector<uint64_t> > v(n+1, vector<uint64_t>(n+1, 0))
// v[n][k]に組み合わせ数が入る。
void comb(vector<vector<uint64_t>> &v) {
for (uint64_t i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (uint64_t k = 1; k < v.size(); k++) {
for (uint64_t j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
// 掛け算オーバーフロー判定
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
// 素因数分解
void primeFactorization(
uint64_t a, list<uint64_t> &factors) { // 素因数分解を出力するプログラム
long i, sq;
if (a % 2 == 0) { // 偶数の場合
factors.push_back(2);
primeFactorization(a / 2, factors); // 2で割った値で再帰
return;
}
sq = sqrt(a);
for (i = 3; i <= sq; i += 2) { // 3以上√a以下の奇数の場合
if (a % i == 0) {
factors.push_back(i);
primeFactorization(a / i, factors); // 割れた値で再帰
return;
}
}
// 偶数でも3以上√a以下の奇数の場合でも割り切れない場合
if (a != 1) { // aが1でないなら、a自身は素数
factors.push_back(a);
}
}
// フェルマーの小定理
// mod. m での a の逆元 a^{-1} を計算する
// (a/b)%m = a*movinv(b,m)%m
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// 円周率
// M_PI
// #include <iomanip> // setprecisionを使用するのに必要
// cout << std::fixed << std::setprecision(15) << y << endl;
// 昇順
// priority_queue<int, vector<int>, greater<int> > queue;
signed main() {
uint64_t a, b;
cin >> a >> b;
list<uint64_t> factA, factB;
primeFactorization(a, factA);
primeFactorization(b, factB);
factA.sort();
factB.sort();
uint64_t x = factA.front();
uint64_t y = factB.front();
int count = 1;
uint64_t prevC = 0;
while (factA.size() != 0 && factB.size() != 0) {
if (x == y) {
if (prevC != x) {
count++;
prevC = x;
}
factA.pop_front();
factB.pop_front();
} else if (x < y) {
factA.pop_front();
} else {
factB.pop_front();
}
x = factA.front();
y = factB.front();
}
cout << count << endl;
return 0;
}
| replace | 116 | 117 | 116 | 117 | 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 * i <= 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 * i <= 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>
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
ll n = a, m = b;
map<ll, ll> res;
for (int i = 2; i * i <= min(n, m); i++) {
while (min(n, m) % i == 0) {
if (max(n, m) % i == 0) {
res[i]++;
n /= i;
m /= i;
} else {
if (min(n, m) == n) {
n /= i;
} else {
m /= i;
}
}
}
}
if (min(n, m) != 1) {
if (max(m, n) % min(n, m) == 0)
res[min(n, m)] = 1;
}
cout << res.size() + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
ll n = a, m = b;
map<ll, ll> res;
for (ll i = 2; i * i <= min(n, m); i++) {
while (min(n, m) % i == 0) {
if (max(n, m) % i == 0) {
res[i]++;
n /= i;
m /= i;
} else {
if (min(n, m) == n) {
n /= i;
} else {
m /= i;
}
}
}
}
if (min(n, m) != 1) {
if (max(m, n) % min(n, m) == 0)
res[min(n, m)] = 1;
}
cout << res.size() + 1 << endl;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll zero = 0;
ll INF = 10000000000;
int main(void) {
ll A, B;
cin >> A >> B;
ll D;
D = __gcd(A, B);
ll count = 1;
for (int i = 2; D >= i * i; i++) {
if (D % i == 0) {
count++;
while (D % i == 0) {
D = D / i;
}
}
}
if (D != 1)
count++;
printf("%lld\n", count);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll zero = 0;
ll INF = 10000000000;
int main(void) {
ll A, B;
cin >> A >> B;
ll D;
D = __gcd(A, B);
ll count = 1;
for (ll i = 2; D >= i * i; i++) {
if (D % i == 0) {
count++;
while (D % i == 0) {
D = D / i;
}
}
}
if (D != 1)
count++;
printf("%lld\n", count);
}
| replace | 13 | 14 | 13 | 14 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
#define mt make_tuple
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sqr(x) ((ll)(x) * (x))
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll a, b;
cin >> a >> b;
ll nzd = __gcd(a, b);
vi v;
for (int i = 2; i * i <= nzd; ++i) {
bool jelUsao = false;
while (nzd % i == 0) {
jelUsao = true;
nzd /= i;
}
if (jelUsao)
v.pb(i);
}
if (nzd > 1)
v.pb(nzd);
cout << 1LL + (ll)v.size() << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
#define mt make_tuple
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sqr(x) ((ll)(x) * (x))
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll a, b;
cin >> a >> b;
ll nzd = __gcd(a, b);
vi v;
for (ll i = 2; i * i <= nzd; ++i) {
bool jelUsao = false;
while (nzd % i == 0) {
jelUsao = true;
nzd /= i;
}
if (jelUsao)
v.pb(i);
}
if (nzd > 1)
v.pb(nzd);
cout << 1LL + (ll)v.size() << '\n';
return 0;
}
| replace | 31 | 32 | 31 | 32 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main() {
ll a, b;
cin >> a >> b;
vector<bool> sosu(1000005, true);
sosu[0] = false;
for (ll i = 2; i <= 1000000; i++) {
if (!sosu[i])
continue;
for (ll j = i * 2; j <= 1000000; j += i) {
sosu[j] = false;
}
}
set<ll> st1, st2;
for (ll i = 1; i <= sqrt(a); i++) {
if (a % i == 0) {
st1.insert(i);
st1.insert(a / i);
}
}
for (ll i = 1; i <= sqrt(b); i++) {
if (b % i == 0) {
st2.insert(i);
st2.insert(b / i);
}
}
ll ans = 0;
set<ll> st3;
for (auto &x : st1) {
if (x > 1000000) {
if (st2.find(x) != st2.end()) {
bool f = true;
for (auto &xx : st3) {
if (xx == 1)
continue;
if (x % xx == 0) {
f = false;
break;
}
}
if (f) {
ans++;
}
}
}
if (sosu[x] && st2.find(x) != st2.end()) {
ans++;
st3.insert(x);
}
}
cout << ans << endl;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main() {
ll a, b;
cin >> a >> b;
vector<bool> sosu(1000005, true);
sosu[0] = false;
for (ll i = 2; i <= 1000000; i++) {
if (!sosu[i])
continue;
for (ll j = i * 2; j <= 1000000; j += i) {
sosu[j] = false;
}
}
set<ll> st1, st2;
for (ll i = 1; i <= sqrt(a); i++) {
if (a % i == 0) {
st1.insert(i);
st1.insert(a / i);
}
}
for (ll i = 1; i <= sqrt(b); i++) {
if (b % i == 0) {
st2.insert(i);
st2.insert(b / i);
}
}
ll ans = 0;
set<ll> st3;
for (auto &x : st1) {
if (x > 1000000) {
if (st2.find(x) != st2.end()) {
bool f = true;
for (auto &xx : st3) {
if (xx == 1)
continue;
if (x % xx == 0) {
f = false;
break;
}
}
if (f) {
ans++;
}
}
} else if (sosu[x] && st2.find(x) != st2.end()) {
ans++;
st3.insert(x);
}
}
cout << ans << endl;
} | replace | 76 | 78 | 76 | 77 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B, C, ans = 1;
cin >> A >> B;
while (B != 0) {
A %= B;
swap(A, B);
}
C = A;
for (int i = 2; i * i <= C; i++) {
if (C % i == 0) {
ans++;
while (C % i == 0) {
C /= i;
}
}
}
if (C > 1) {
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B, C, ans = 1;
cin >> A >> B;
while (B != 0) {
A %= B;
swap(A, B);
}
C = A;
for (int64_t i = 2; i * i <= C; i++) {
if (C % i == 0) {
ans++;
while (C % i == 0) {
C /= i;
}
}
}
if (C > 1) {
ans++;
}
cout << ans << endl;
}
| replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
long long commonfactor = __gcd(a, b);
long long n = commonfactor;
long count = 0;
for (int i = 2; i * i <= commonfactor; i++) {
if (n % i != 0) {
continue;
}
while (n % i == 0) {
n /= i;
}
count++;
}
if (n != 1) {
count++;
}
cout << count + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
long long commonfactor = __gcd(a, b);
long long n = commonfactor;
long long count = 0;
for (long long i = 2; i * i <= commonfactor; i++) {
if (n % i != 0) {
continue;
}
while (n % i == 0) {
n /= i;
}
count++;
}
if (n != 1) {
count++;
}
cout << count + 1 << endl;
}
| replace | 8 | 10 | 8 | 10 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define DEBUG_MAT(v) \
cerr << #v << endl; \
for (int i = 0; i < v.size(); i++) { \
for (int j = 0; j < v[i].size(); j++) { \
cerr << v[i][j] << " "; \
} \
cerr << endl; \
}
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
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 (a > b) {
a = b;
return 1;
}
return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout << setprecision(15) << fixed << p << endl;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
#define fio() \
cin.tie(0); \
ios::sync_with_stdio(false);
// #define mp make_pair
// #define endl '\n'
ll gcd(ll a, ll b) {
if (b > a) {
swap(a, b);
}
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
ll a, b;
cin >> a >> b;
vl kou;
for (ll i = 1; i * i <= a; i++) {
if (a % i == 0) {
int x = i, y = a / i;
if (b % x == 0) {
kou.push_back(x);
}
if (b % y == 0) {
kou.push_back(y);
}
}
}
sort(all(kou));
UNIQUE(kou);
vl ans;
rep(i, kou.size()) {
ll x = kou[i];
bool flag = true;
for (int j = 0; j < ans.size(); j++) {
if (gcd(x, ans[j]) > 1) {
flag = false;
break;
}
}
if (flag) {
ans.push_back(x);
}
}
cout << ans.size() << endl;
}
| #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define DEBUG_MAT(v) \
cerr << #v << endl; \
for (int i = 0; i < v.size(); i++) { \
for (int j = 0; j < v[i].size(); j++) { \
cerr << v[i][j] << " "; \
} \
cerr << endl; \
}
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
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 (a > b) {
a = b;
return 1;
}
return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout << setprecision(15) << fixed << p << endl;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
#define fio() \
cin.tie(0); \
ios::sync_with_stdio(false);
// #define mp make_pair
// #define endl '\n'
ll gcd(ll a, ll b) {
if (b > a) {
swap(a, b);
}
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
ll a, b;
cin >> a >> b;
vl kou;
for (ll i = 1; i * i <= a; i++) {
if (a % i == 0) {
ll x = i, y = a / i;
if (b % x == 0) {
kou.push_back(x);
}
if (b % y == 0) {
kou.push_back(y);
}
}
}
sort(all(kou));
UNIQUE(kou);
vl ans;
rep(i, kou.size()) {
ll x = kou[i];
bool flag = true;
for (int j = 0; j < ans.size(); j++) {
if (gcd(x, ans[j]) > 1) {
flag = false;
break;
}
}
if (flag) {
ans.push_back(x);
}
}
cout << ans.size() << endl;
}
| replace | 98 | 99 | 98 | 99 | 0 | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
int u[111];
typedef long long ll;
const int maxn = (int)1e5 + 1;
const int inf = (int)1e9 + 7;
int a[maxn], b[111];
int cnt[maxn];
string s, t;
int ans = 0, sum1, sum2, sum3;
ll n, k;
int dp[maxn];
vector<ll> v, g;
int now = 0;
bool isprime(ll x) {
for (ll i = 2; i <= sqrt(x); i++) {
if (x % i == 0) {
return 0;
}
}
return 1;
}
ll GCD(ll u, ll v) {
while (v != 0) {
ll r = u % v;
u = v;
v = r;
}
return u;
}
int main() {
cin >> n >> k;
now = GCD(n, k);
for (ll i = 1; i <= sqrt(now); i++) {
if (now % i == 0) {
v.push_back(i);
v.push_back(now / i);
}
}
if (ll(sqrt(now)) * ll(sqrt(now)) == now)
v.pop_back();
sort(v.begin(), v.end());
for (ll i : v)
if (isprime(i)) {
ans++;
}
cout << ans;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
int u[111];
typedef long long ll;
const int maxn = (int)1e5 + 1;
const int inf = (int)1e9 + 7;
int a[maxn], b[111];
int cnt[maxn];
string s, t;
int ans = 0, sum1, sum2, sum3;
ll n, k;
int dp[maxn];
vector<ll> v, g;
ll now = 0;
bool isprime(ll x) {
for (ll i = 2; i <= sqrt(x); i++) {
if (x % i == 0) {
return 0;
}
}
return 1;
}
ll GCD(ll u, ll v) {
while (v != 0) {
ll r = u % v;
u = v;
v = r;
}
return u;
}
int main() {
cin >> n >> k;
now = GCD(n, k);
for (ll i = 1; i <= sqrt(now); i++) {
if (now % i == 0) {
v.push_back(i);
v.push_back(now / i);
}
}
if (ll(sqrt(now)) * ll(sqrt(now)) == now)
v.pop_back();
sort(v.begin(), v.end());
for (ll i : v)
if (isprime(i)) {
ans++;
}
cout << ans;
} | replace | 51 | 52 | 51 | 52 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int>> minHeap;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define scn(n) scanf("%d", &n)
#define scnll(n) scanf("%lld", &n)
#define scn2(n, m) scanf("%d%d", &n, &m)
#define scn3(n, m, w) scanf("%d%d%d", &n, &m, &w)
#define scn2ll(n, m) scanf("%lld%lld", &n, &m)
#define atoz(v) v.begin(), v.end()
#define ratoz(v) v.rbegin(), v.rend()
#define Fill(a, v) memset(a, v, sizeof(a))
#define fi first
#define se second
#define inf 1e9
#define pi acos(-1.0)
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mod 1000000007
#define FastIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define bug(x) cerr << __LINE__ << " says: " << #x << " = " << (x) << "\n"
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
inline int addmod(int x, int y) { return (x % mod + y % mod) % mod; }
inline int submod(int x, int y) { return (x % mod - y % mod + mod) % mod; }
inline int mulmod(int x, int y) { return (x % mod * 1LL * y % mod) % mod; }
inline int nextSubMask(int i, int mask) {
return (i - 1) & mask; /// returns next submask
}
template <typename T> void we_r_done(T mssg) {
cout << mssg;
exit(0);
}
int main() {
/// freopen("output.txt","w",stdout);
// freopen("input.txt","r",stdin);
// FastIO;
lli a, b;
cin >> a >> b;
lli g = __gcd(a, b);
int cnt = 1;
for (int i = 2; (i * i) <= g; i++) {
if (g % i)
continue;
cnt++;
while (g % i == 0)
g /= i;
}
if (g > 1)
cnt++;
cout << cnt;
return 0;
}
/// sin and cos expect input in radians not degrees. so use , sin(degrees * pi /
/// 180) using bs = bitset<MX>; // how many distinct number can be form?
/// sort(atoz(v), [](const data x, const data y){return (x.a==y.a?x.b>y.b :
/// x.a<y.a);});
| #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int>> minHeap;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define scn(n) scanf("%d", &n)
#define scnll(n) scanf("%lld", &n)
#define scn2(n, m) scanf("%d%d", &n, &m)
#define scn3(n, m, w) scanf("%d%d%d", &n, &m, &w)
#define scn2ll(n, m) scanf("%lld%lld", &n, &m)
#define atoz(v) v.begin(), v.end()
#define ratoz(v) v.rbegin(), v.rend()
#define Fill(a, v) memset(a, v, sizeof(a))
#define fi first
#define se second
#define inf 1e9
#define pi acos(-1.0)
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mod 1000000007
#define FastIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define bug(x) cerr << __LINE__ << " says: " << #x << " = " << (x) << "\n"
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
inline int addmod(int x, int y) { return (x % mod + y % mod) % mod; }
inline int submod(int x, int y) { return (x % mod - y % mod + mod) % mod; }
inline int mulmod(int x, int y) { return (x % mod * 1LL * y % mod) % mod; }
inline int nextSubMask(int i, int mask) {
return (i - 1) & mask; /// returns next submask
}
template <typename T> void we_r_done(T mssg) {
cout << mssg;
exit(0);
}
int main() {
/// freopen("output.txt","w",stdout);
// freopen("input.txt","r",stdin);
// FastIO;
lli a, b;
cin >> a >> b;
lli g = __gcd(a, b);
int cnt = 1;
for (lli i = 2; (i * i) <= g; i++) {
if (g % i)
continue;
cnt++;
while (g % i == 0)
g /= i;
}
if (g > 1)
cnt++;
cout << cnt;
return 0;
}
/// sin and cos expect input in radians not degrees. so use , sin(degrees * pi /
/// 180) using bs = bitset<MX>; // how many distinct number can be form?
/// sort(atoz(v), [](const data x, const data y){return (x.a==y.a?x.b>y.b :
/// x.a<y.a);});
| replace | 64 | 65 | 64 | 65 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
int ans = 0;
ll x = __gcd(n, m);
for (ll i = 2; i <= x; i++) {
if (x % i == 0) {
ans++;
while (x % i == 0) {
x /= i;
}
}
}
if (x > 1)
ans += 2;
else
ans++;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
int ans = 0;
ll x = __gcd(n, m);
for (ll i = 2; i * i <= x; i++) {
if (x % i == 0) {
ans++;
while (x % i == 0) {
x /= i;
}
}
}
if (x > 1)
ans += 2;
else
ans++;
cout << ans << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long gcd(long a, long b) {
if (a % b)
return gcd(b, a % b);
else
return b;
}
int main() {
long long A, B, S;
int count;
count = 1;
cin >> A >> B;
if (A > B) {
S = gcd(A, B);
} else {
S = gcd(B, A);
}
for (int i = 2; i * i <= S; i++) {
if (S % i == 0) {
count++;
while (S % i == 0)
S /= i;
}
}
if (S != 1)
count++;
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long gcd(long a, long b) {
if (a % b)
return gcd(b, a % b);
else
return b;
}
int main() {
long long A, B, S;
int count;
count = 1;
cin >> A >> B;
if (A > B) {
S = gcd(A, B);
} else {
S = gcd(B, A);
}
for (long long i = 2; i * i <= S; i++) {
if (S % i == 0) {
count++;
while (S % i == 0)
S /= i;
}
}
if (S != 1)
count++;
cout << count << endl;
} | replace | 22 | 23 | 22 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
const int INF = 1 << 28;
const long long MOD = 1000000007;
using namespace std;
using Graph = vector<vector<int>>;
template <class T> bool chmin(T &a, T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> using P = pair<T, U>;
vector<int> seen(50, -1);
int counter_for_dfs = 0;
void dfs(Graph &G, int v) {
seen[v] = counter_for_dfs;
counter_for_dfs++;
for (auto v_next : G[v]) {
if (seen[v_next] >= 0)
continue;
dfs(G, v_next);
}
}
void bfs(Graph &G) {
vector<int> dist(G.size(), -1);
queue<int> que;
dist[0] = 0;
que.push(0);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int g : G[v]) {
if (dist[g] != -1)
continue;
dist[g] = dist[v] + 1;
que.push(g);
}
}
for (auto i : dist) {
cout << i << " ";
}
}
int counter[200005] = {};
void bfs2(Graph &G, int p, int x) {
vector<int> dist(G.size(), -1);
queue<int> que;
dist[p] = 0;
que.push(p);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int g : G[v]) {
if (dist[g] != -1)
continue;
dist[g] = dist[v] + 1;
que.push(g);
counter[g] += x;
}
}
}
long long int gcd(long long int a, long long int b) {
long long int c = std::min(a, b);
a = std::max(a, b);
b = c;
while (true) {
c = a % b;
a = b;
b = c;
if (c == 0)
break;
}
return a;
}
int main() {
long long int a, b;
std::cin >> a >> b;
long long int c = gcd(a, b);
long long int counter = 1;
for (long long int i = 2; i < c; i++) {
if (c % i == 0) {
counter++;
while (c % i == 0)
c /= i;
}
}
if (c != 1)
counter++;
std::cout << counter;
return 0;
} |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
const int INF = 1 << 28;
const long long MOD = 1000000007;
using namespace std;
using Graph = vector<vector<int>>;
template <class T> bool chmin(T &a, T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> using P = pair<T, U>;
vector<int> seen(50, -1);
int counter_for_dfs = 0;
void dfs(Graph &G, int v) {
seen[v] = counter_for_dfs;
counter_for_dfs++;
for (auto v_next : G[v]) {
if (seen[v_next] >= 0)
continue;
dfs(G, v_next);
}
}
void bfs(Graph &G) {
vector<int> dist(G.size(), -1);
queue<int> que;
dist[0] = 0;
que.push(0);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int g : G[v]) {
if (dist[g] != -1)
continue;
dist[g] = dist[v] + 1;
que.push(g);
}
}
for (auto i : dist) {
cout << i << " ";
}
}
int counter[200005] = {};
void bfs2(Graph &G, int p, int x) {
vector<int> dist(G.size(), -1);
queue<int> que;
dist[p] = 0;
que.push(p);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int g : G[v]) {
if (dist[g] != -1)
continue;
dist[g] = dist[v] + 1;
que.push(g);
counter[g] += x;
}
}
}
long long int gcd(long long int a, long long int b) {
long long int c = std::min(a, b);
a = std::max(a, b);
b = c;
while (true) {
c = a % b;
a = b;
b = c;
if (c == 0)
break;
}
return a;
}
int main() {
long long int a, b;
std::cin >> a >> b;
long long int c = gcd(a, b);
long long int counter = 1;
for (long long int i = 2; i * i < c; i++) {
if (c % i == 0) {
counter++;
while (c % i == 0)
c /= i;
}
}
if (c != 1)
counter++;
std::cout << counter;
return 0;
} | replace | 108 | 109 | 108 | 109 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main() {
int64_t A, B, gc;
int64_t cnt = 1;
cin >> A >> B;
if (A >= B)
gc = gcd(A, B);
else if (A < B)
gc = gcd(B, A);
int64_t tmp = gc;
for (int i = 2; i * i < gc; i++) {
if (tmp % i == 0) {
cnt++;
while (tmp % i == 0) {
tmp /= i;
}
}
}
if (tmp != 1)
cnt++;
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main() {
int64_t A, B, gc;
int64_t cnt = 1;
cin >> A >> B;
if (A >= B)
gc = gcd(A, B);
else if (A < B)
gc = gcd(B, A);
int64_t tmp = gc;
for (int64_t i = 2; i * i < tmp; i++) {
if (tmp % i == 0) {
cnt++;
while (tmp % i == 0) {
tmp /= i;
}
}
}
if (tmp != 1)
cnt++;
cout << cnt << endl;
}
| replace | 20 | 21 | 20 | 21 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define MAX_N 1002
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P1;
typedef pair<int, int> Pi;
typedef pair<double, Pi> Pdi;
typedef pair<ll, int> Pli;
typedef pair<P1, ll> P2;
const ll INF = 100000007;
struct edge {
int to, cost;
};
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
struct Road {
double cost;
int a, b;
};
ll gcd(ll a2, ll b2) {
ll t;
if (a2 < b2) {
t = a2;
a2 = b2;
b2 = t;
}
while (b2 != 0) {
t = a2 % b2;
a2 = b2;
b2 = t;
}
return a2;
}
int main() {
ll a, b;
cin >> a >> b;
ll total = 1;
ll t2 = gcd(a, b);
for (int i = 2; i * i <= t2; i++) {
if (t2 % i == 0) {
total++;
while (t2 % i == 0) {
t2 /= i;
}
}
}
if (t2 != 1)
total++;
cout << total << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define MAX_N 1002
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P1;
typedef pair<int, int> Pi;
typedef pair<double, Pi> Pdi;
typedef pair<ll, int> Pli;
typedef pair<P1, ll> P2;
const ll INF = 100000007;
struct edge {
int to, cost;
};
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
struct Road {
double cost;
int a, b;
};
ll gcd(ll a2, ll b2) {
ll t;
if (a2 < b2) {
t = a2;
a2 = b2;
b2 = t;
}
while (b2 != 0) {
t = a2 % b2;
a2 = b2;
b2 = t;
}
return a2;
}
int main() {
ll a, b;
cin >> a >> b;
ll total = 1;
ll t2 = gcd(a, b);
for (ll i = 2; i * i <= t2; i++) {
if (t2 % i == 0) {
total++;
while (t2 % i == 0) {
t2 /= i;
}
}
}
if (t2 != 1)
total++;
cout << total << endl;
return 0;
}
| replace | 53 | 54 | 53 | 54 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repx(i, s, e) for (int i = s, i##_end = (e); i < i##_end; ++i)
#define rept(n) \
for (int ___i___ = 0, i##_len = (n); ___i___ < i##_len; ++___i___)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define CEIL(x, y) (((x) + (y)-1) / (y))
// vector
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
// pair
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// vector
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{";
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
os << "}";
return os;
}
// map
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
os << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
os << ", ";
itr--;
}
os << "}";
return os;
}
// set
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
os << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
os << ", ";
itr--;
}
os << "}";
return os;
}
#define DUMPOUT cout
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
#ifdef LOCAL_
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
typedef long long int lli;
typedef pair<int, int> ii;
typedef priority_queue<int, vector<int>, greater<int>> heapq;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
inline lli gcd(lli a, lli b) {
if (b == 0)
return abs(a);
return gcd(b, a % b);
}
signed main() {
lli A, B;
cin >> A >> B;
lli G = gcd(max(A, B), min(A, B));
dump(G);
int kind = 1;
for (int i = 2; i * i <= G; i++) {
if (G % i == 0) {
kind++;
while (G % i == 0) {
G /= i;
}
}
}
if (G != 1)
kind++;
cout << kind << endl;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repx(i, s, e) for (int i = s, i##_end = (e); i < i##_end; ++i)
#define rept(n) \
for (int ___i___ = 0, i##_len = (n); ___i___ < i##_len; ++___i___)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define CEIL(x, y) (((x) + (y)-1) / (y))
// vector
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
// pair
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// vector
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{";
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
os << "}";
return os;
}
// map
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
os << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
os << ", ";
itr--;
}
os << "}";
return os;
}
// set
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
os << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
os << ", ";
itr--;
}
os << "}";
return os;
}
#define DUMPOUT cout
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
#ifdef LOCAL_
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
typedef long long int lli;
typedef pair<int, int> ii;
typedef priority_queue<int, vector<int>, greater<int>> heapq;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
inline lli gcd(lli a, lli b) {
if (b == 0)
return abs(a);
return gcd(b, a % b);
}
signed main() {
lli A, B;
cin >> A >> B;
lli G = gcd(max(A, B), min(A, B));
dump(G);
int kind = 1;
for (lli i = 2; i * i <= G; i++) {
if (G % i == 0) {
kind++;
while (G % i == 0) {
G /= i;
}
}
}
if (G != 1)
kind++;
cout << kind << endl;
}
| replace | 123 | 124 | 123 | 124 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define LEN(x) int(x.size())
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) ((uint64_t)bit & ((uint64_t)1 << (uint64_t)i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))
typedef long long LL;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
} // C++14
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value == 0>::type fill_v(T &t,
const V &v) {
t = v;
}
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value != 0>::type fill_v(T &t,
const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
std::cout << head;
if (sizeof...(tail) != 0) {
std::cout << " ";
}
print(std::forward<Tail>(tail)...);
}
template <class T> void print(std::vector<T> &v) {
for (auto &a : v) {
std::cout << a;
if (&a != &v.back()) {
std::cout << " ";
}
}
std::cout << std::endl;
}
template <class T> void print(std::vector<std::vector<T>> &vv) {
for (auto &v : vv) {
print(v);
}
}
void debug() { std::cerr << std::endl; }
template <class Head, class... Tail> void debug(Head &&head, Tail &&...tail) {
std::cerr << head;
if (sizeof...(tail) != 0) {
std::cerr << " ";
}
print(std::forward<Tail>(tail)...);
}
template <class T> void debug(std::vector<T> &v) {
for (auto &a : v) {
std::cerr << a;
if (&a != &v.back()) {
std::cerr << " ";
}
}
std::cerr << std::endl;
}
template <class T> void debug(std::vector<std::vector<T>> &vv) {
for (auto &v : vv) {
print(v);
}
}
inline bool inside(long long y, long long x, long long H, long long W) {
return 0 <= y and y < H and 0 <= x and x < W;
}
template <class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) {
return abs(x1 - x2) + abs(y1 - y2);
}
template <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
template <class T> inline std::vector<T> unique(std::vector<T> v) {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
return v;
}
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
return n * (2 * s + (n - 1) * d) / 2;
}
bool is_power_of_two(long long x) { return !(x & (x - 1)); }
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
long long gcd(std::vector<long long> &v) {
long long ans = v[0];
for (int i = 1; i < (int)v.size(); ++i) {
ans = gcd(ans, v[i]);
}
return ans;
}
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
const int INF = 1u << 30u; // 1,073,741,824
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1},
dx8 = {1, 0, -1, 0, 1, 1, -1, -1};
using namespace std;
// 約数を列挙する(O(sqrt(n)))
// 約数の個数はO(root(n))
unordered_set<LL> get_divisor(LL n) {
unordered_set<LL> ret;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.insert(i);
if (i * i != n) {
ret.insert(n / i);
}
}
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL A, B;
cin >> A >> B;
auto a = get_divisor(A);
auto b = get_divisor(B);
vector<LL> c;
FOE(x, a) {
if (b.find(x) != b.end()) {
c.emplace_back(x);
}
}
sort(ALL(c));
vector<bool> ok(LEN(c), true);
FOR(i, 1, LEN(c)) {
if (not ok[i]) {
continue;
}
FOR(j, i + 1, LEN(c)) {
if (not ok[j]) {
continue;
}
if (c[j] % c[i] == 0) {
ok[j] = false;
}
}
}
int ans = 0;
FOR(i, 0, LEN(ok)) { ans += ok[i]; }
print(ans);
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define LEN(x) int(x.size())
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) ((uint64_t)bit & ((uint64_t)1 << (uint64_t)i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))
typedef long long LL;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
} // C++14
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value == 0>::type fill_v(T &t,
const V &v) {
t = v;
}
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value != 0>::type fill_v(T &t,
const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
std::cout << head;
if (sizeof...(tail) != 0) {
std::cout << " ";
}
print(std::forward<Tail>(tail)...);
}
template <class T> void print(std::vector<T> &v) {
for (auto &a : v) {
std::cout << a;
if (&a != &v.back()) {
std::cout << " ";
}
}
std::cout << std::endl;
}
template <class T> void print(std::vector<std::vector<T>> &vv) {
for (auto &v : vv) {
print(v);
}
}
void debug() { std::cerr << std::endl; }
template <class Head, class... Tail> void debug(Head &&head, Tail &&...tail) {
std::cerr << head;
if (sizeof...(tail) != 0) {
std::cerr << " ";
}
print(std::forward<Tail>(tail)...);
}
template <class T> void debug(std::vector<T> &v) {
for (auto &a : v) {
std::cerr << a;
if (&a != &v.back()) {
std::cerr << " ";
}
}
std::cerr << std::endl;
}
template <class T> void debug(std::vector<std::vector<T>> &vv) {
for (auto &v : vv) {
print(v);
}
}
inline bool inside(long long y, long long x, long long H, long long W) {
return 0 <= y and y < H and 0 <= x and x < W;
}
template <class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) {
return abs(x1 - x2) + abs(y1 - y2);
}
template <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
template <class T> inline std::vector<T> unique(std::vector<T> v) {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
return v;
}
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
return n * (2 * s + (n - 1) * d) / 2;
}
bool is_power_of_two(long long x) { return !(x & (x - 1)); }
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
long long gcd(std::vector<long long> &v) {
long long ans = v[0];
for (int i = 1; i < (int)v.size(); ++i) {
ans = gcd(ans, v[i]);
}
return ans;
}
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
const int INF = 1u << 30u; // 1,073,741,824
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1},
dx8 = {1, 0, -1, 0, 1, 1, -1, -1};
using namespace std;
// 約数を列挙する(O(sqrt(n)))
// 約数の個数はO(root(n))
unordered_set<LL> get_divisor(LL n) {
unordered_set<LL> ret;
for (LL i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.insert(i);
if (i * i != n) {
ret.insert(n / i);
}
}
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL A, B;
cin >> A >> B;
auto a = get_divisor(A);
auto b = get_divisor(B);
vector<LL> c;
FOE(x, a) {
if (b.find(x) != b.end()) {
c.emplace_back(x);
}
}
sort(ALL(c));
vector<bool> ok(LEN(c), true);
FOR(i, 1, LEN(c)) {
if (not ok[i]) {
continue;
}
FOR(j, i + 1, LEN(c)) {
if (not ok[j]) {
continue;
}
if (c[j] % c[i] == 0) {
ok[j] = false;
}
}
}
int ans = 0;
FOR(i, 0, LEN(ok)) { ans += ok[i]; }
print(ans);
return 0;
} | replace | 157 | 158 | 157 | 158 | TLE | |
p02900 | C++ | Runtime Error | #include <iostream>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
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() {
int a, b;
cin >> a >> b;
ll m = gcd(a, b);
auto vp = factorize(m);
cout << vp.size() + 1 << endl;
}
| #include <iostream>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
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 m = gcd(a, b);
auto vp = factorize(m);
cout << vp.size() + 1 << endl;
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int(n); i++)
#define RREP(i, m, n) for (int i = int(n) - 1; i >= int(m); --i)
#define EACH(i, c) for (auto &(i) : c)
#define all(c) begin(c), end(c)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(begin(c), end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) \
do { \
} while (0)
#define dump(x) \
do { \
} while (0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int, int>;
using VP = vector<PII>;
// struct edge {int from, to, cost;};
constexpr double EPS = 1e-10;
// constexpr double PI = acos(-1.0);
// constexpr int INF = INT_MAX;
constexpr int MOD = 1'000'000'007;
// inline void modAdd(LL &l, LL &r) {l = (l + r) % MOD;}
template <class T> inline T sqr(T x) { return x * x; }
LL gcd(LL m, LL n) {
if (m < n)
swap(m, n);
while (n) {
m %= n;
swap(m, n);
}
return m;
}
void solve() {
LL a, b;
cin >> a >> b;
int ans = 1;
LL g = gcd(a, b);
if (g % 2 == 0) {
++ans;
while (g % 2 == 0)
g /= 2;
}
for (int i = 3; i * i <= g; i += 2) {
if (g % i == 0) {
++ans;
g /= i;
}
while (g % i == 0)
g /= i;
}
if (g > 1)
++ans;
cout << ans << endl;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int(n); i++)
#define RREP(i, m, n) for (int i = int(n) - 1; i >= int(m); --i)
#define EACH(i, c) for (auto &(i) : c)
#define all(c) begin(c), end(c)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(begin(c), end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) \
do { \
} while (0)
#define dump(x) \
do { \
} while (0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int, int>;
using VP = vector<PII>;
// struct edge {int from, to, cost;};
constexpr double EPS = 1e-10;
// constexpr double PI = acos(-1.0);
// constexpr int INF = INT_MAX;
constexpr int MOD = 1'000'000'007;
// inline void modAdd(LL &l, LL &r) {l = (l + r) % MOD;}
template <class T> inline T sqr(T x) { return x * x; }
LL gcd(LL m, LL n) {
if (m < n)
swap(m, n);
while (n) {
m %= n;
swap(m, n);
}
return m;
}
void solve() {
LL a, b;
cin >> a >> b;
int ans = 1;
LL g = gcd(a, b);
if (g % 2 == 0) {
++ans;
while (g % 2 == 0)
g /= 2;
}
for (LL i = 3; i * i <= g; i += 2) {
if (g % i == 0) {
++ans;
g /= i;
}
while (g % i == 0)
g /= i;
}
if (g > 1)
++ans;
cout << ans << endl;
}
int main() {
solve();
return 0;
} | replace | 84 | 85 | 84 | 85 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define debug(s) cout << s << endl
#define debug1(s, t) cout << s << " " << t << endl
using namespace std;
using i64 = long long;
// m > n >= 0
template <class T> T gcd(T m, T n) {
if (n == 0)
return m;
return gcd(n, m % n);
}
int main() {
i64 A, B;
cin >> A >> B;
// GCD(A,B) を割り切れる素数の個数 +1
if (A < B)
swap(A, B);
i64 g; // GCD
g = gcd(A, B);
int gsq = sqrt(g);
vector<int> primelist{2};
vector<bool> seen(gsq + 10, false);
// エラトステネスの篩
// gsq以上の素数は高々一つ
// なのでgsq以下の素数で順々に割っていけばよい
for (int num = 3; num <= gsq; num++) {
if (seen[num])
continue;
bool isprime = true;
for (auto &&p : primelist) {
if (num % p == 0) {
isprime = false;
break;
}
}
if (isprime)
primelist.push_back(num);
}
int counter = 1;
for (auto &&p : primelist) {
if (g % p != 0)
continue;
counter++;
while (g % p == 0) {
g /= p;
}
}
if (g != 1)
counter++;
/*
debug(g);
for (auto &&p : primelist)
{
debug(p);
}
*/
cout << counter << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define debug(s) cout << s << endl
#define debug1(s, t) cout << s << " " << t << endl
using namespace std;
using i64 = long long;
// m > n >= 0
template <class T> T gcd(T m, T n) {
if (n == 0)
return m;
return gcd(n, m % n);
}
int main() {
i64 A, B;
cin >> A >> B;
// GCD(A,B) を割り切れる素数の個数 +1
if (A < B)
swap(A, B);
i64 g; // GCD
g = gcd(A, B);
int gsq = sqrt(g);
vector<int> primelist{2};
vector<bool> seen(gsq + 10, false);
// エラトステネスの篩
// gsq以上の素数は高々一つ
// なのでgsq以下の素数で順々に割っていけばよい
for (int num = 3; num <= gsq; num++) {
if (seen[num])
continue;
for (int i = 2; i * num <= gsq; i++)
seen[i * num] = true;
primelist.push_back(num);
}
int counter = 1;
for (auto &&p : primelist) {
if (g % p != 0)
continue;
counter++;
while (g % p == 0) {
g /= p;
}
}
if (g != 1)
counter++;
/*
debug(g);
for (auto &&p : primelist)
{
debug(p);
}
*/
cout << counter << endl;
return 0;
} | replace | 40 | 49 | 40 | 43 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(x) cerr << #x << ' ' << x << endl;
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int MAXN = 2e5 + 7;
int main(int argc, char const *argv[]) {
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)
continue;
ans++;
while (g % i == 0)
g /= i;
}
if (g != 1)
ans++;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(x) cerr << #x << ' ' << x << endl;
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int MAXN = 2e5 + 7;
int main(int argc, char const *argv[]) {
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)
continue;
ans++;
while (g % i == 0)
g /= i;
}
if (g != 1)
ans++;
cout << ans << endl;
return 0;
} | replace | 15 | 16 | 15 | 16 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll prime_factor_num(ll n) {
ll ret = 0;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
ret += 1;
while (n % i == 0)
n /= i;
}
}
if (n != 1)
ret += 1;
return ret;
}
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
cout << prime_factor_num(g) + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll prime_factor_num(ll n) {
ll ret = 0;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
ret += 1;
while (n % i == 0)
n /= i;
}
}
if (n != 1)
ret += 1;
return ret;
}
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
cout << prime_factor_num(g) + 1 << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define ll long long
#define pi 3.14159265359
map<int, int> prime_factor(ll n) {
map<int, 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;
ll g = __gcd(a, b);
if (g == 1) {
cout << 1 << endl;
return 0;
}
cout << prime_factor(g).size() + 1 << endl;
}
| #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define ll long long
#define pi 3.14159265359
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
if (g == 1) {
cout << 1 << endl;
return 0;
}
cout << prime_factor(g).size() + 1 << endl;
}
| replace | 6 | 9 | 6 | 9 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
bool is_prime(long long _Num) {
if (_Num < 2)
return false;
if (_Num % 2 == 0) {
if (_Num == 2)
return true;
else
return false;
}
bool prime = true;
for (long long i = 3; i <= sqrt(_Num); i += 2) {
if (_Num % i == 0) {
prime = false;
break;
}
}
return prime;
}
int main() {
long long A, B;
cin >> A >> B;
if (A < B)
swap(A, B); // A >= B
set<long long> ans;
ans.insert(1);
for (long long i = 2; i <= sqrt(A); i++) {
long long j = B / i;
long long k = A / i;
if (A % i == 0 && B % i == 0 && is_prime(i))
ans.insert(i);
if (A % j == 0 && B % j == 0 && is_prime(j))
ans.insert(j);
if (A % k == 0 && B % k == 0 && is_prime(k))
ans.insert(k);
}
if (A == B && is_prime(A))
ans.insert(A);
cout << ans.size() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool is_prime(long long _Num) {
if (_Num < 2)
return false;
if (_Num % 2 == 0) {
if (_Num == 2)
return true;
else
return false;
}
bool prime = true;
for (long long i = 3; i <= sqrt(_Num); i += 2) {
if (_Num % i == 0) {
prime = false;
break;
}
}
return prime;
}
int main() {
long long A, B;
cin >> A >> B;
if (A < B)
swap(A, B); // A >= B
set<long long> ans;
ans.insert(1);
for (long long i = 2; i <= sqrt(A); i++) {
if (A % i == 0) {
long long j = A / i;
if (B % i == 0 && is_prime(i))
ans.insert(i);
if (B % j == 0 && is_prime(j))
ans.insert(j);
}
if (B % i == 0) {
long long j = B / i;
if (A % i == 0 && is_prime(i))
ans.insert(i);
if (A % j == 0 && is_prime(j))
ans.insert(j);
}
}
if (A == B && is_prime(A))
ans.insert(A);
cout << ans.size() << endl;
return 0;
} | replace | 31 | 39 | 31 | 45 | 0 | |
p02900 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r) {
a = b;
b = r;
r = a % b;
}
return b;
}
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 gcdv = gcd(a, b);
auto f = factorize(gcdv);
cout << f.size() + 1;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
while (r) {
a = b;
b = r;
r = a % b;
}
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 gcdv = gcd(a, b);
auto f = factorize(gcdv);
cout << f.size() + 1;
return 0;
}
| replace | 19 | 20 | 19 | 20 | -8 | |
p02900 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
#define max3(a, b, c) max(max(a, b), c)
#define min3(a, b, c) min(min(a, b), c)
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define mod 1000000007
using namespace std;
typedef long long ll;
template <class T> using V = vector<T>;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
typedef unsigned long long ull;
typedef long double ldouble;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) {
ll r;
while (a % b != 0) {
r = a % b;
a = b;
b = r;
}
return b;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> 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;
}
signed main() {
ll a, b;
cin >> a >> b;
ll n = gcd(a, b);
map<ll, ll> mp = prime_factor(n);
cout << mp.size() + 1 << endl;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
#define max3(a, b, c) max(max(a, b), c)
#define min3(a, b, c) min(min(a, b), c)
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define mod 1000000007
using namespace std;
typedef long long ll;
template <class T> using V = vector<T>;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
typedef unsigned long long ull;
typedef long double ldouble;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) {
ll r;
while (a % b != 0) {
r = a % b;
a = b;
b = r;
}
return b;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
signed main() {
ll a, b;
cin >> a >> b;
ll n = gcd(a, b);
map<ll, ll> mp = prime_factor(n);
cout << mp.size() + 1 << endl;
}
| replace | 49 | 50 | 49 | 50 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n1, n2, cnt = 1;
cin >> n1 >> n2;
long long int n = __gcd(n1, n2);
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
cnt++;
while (n % i == 0)
n /= i;
}
}
if (n > 1)
cnt++;
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n1, n2, cnt = 1;
cin >> n1 >> n2;
long long int n = __gcd(n1, n2);
for (long long int i = 2; i * i <= n; i++) {
if (n % i == 0) {
cnt++;
while (n % i == 0)
n /= i;
}
}
if (n > 1)
cnt++;
cout << cnt << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
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;
typedef pair<int, int> P;
ll gcd(ll x, ll y) { return (y != 0) ? gcd(y, x % y) : x; }
// 素因数分解はO(√n)までオーダーを落とせる
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> v;
v.emplace_back(1, 1);
for (int i = 2; i * i < n; i++) {
if (n % i != 0)
continue;
v.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
v.back().second++;
}
}
if (n != 1)
v.emplace_back(n, 1);
return v;
}
int main() {
ll A, B;
cin >> A >> B;
ll gcd_val = gcd(A, B);
auto res = factorize(gcd_val);
int ans = res.size();
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll x, ll y) { return (y != 0) ? gcd(y, x % y) : x; }
// 素因数分解はO(√n)までオーダーを落とせる
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> v;
v.emplace_back(1, 1);
for (ll i = 2; i * i < n; i++) {
if (n % i != 0)
continue;
v.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
v.back().second++;
}
}
if (n != 1)
v.emplace_back(n, 1);
return v;
}
int main() {
ll A, B;
cin >> A >> B;
ll gcd_val = gcd(A, B);
auto res = factorize(gcd_val);
int ans = res.size();
cout << ans << endl;
} | replace | 14 | 15 | 14 | 15 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define forloop(n) for (int i = 0; i < n; i++)
#define ll long long
#define mod 1000000007
ll ebob(ll a, ll b) {
if (a == 0)
return b;
return ebob(b % a, a);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b;
cin >> a >> b;
a = ebob(a, b);
ll res = 1;
if (a == 1) {
cout << 1;
return 0;
} else if (a == 2 || a == 3) {
cout << 2;
return 0;
}
ll temp = 1;
for (int i = 2; i * i <= a; i++) {
if (temp < a && (a / temp) % i == 0) {
res++;
while (temp < a) {
temp *= i;
if (a % temp) {
temp /= i;
break;
}
}
}
}
if (a > temp)
res++;
cout << res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define forloop(n) for (int i = 0; i < n; i++)
#define ll long long
#define mod 1000000007
ll ebob(ll a, ll b) {
if (a == 0)
return b;
return ebob(b % a, a);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b;
cin >> a >> b;
a = ebob(a, b);
ll res = 1;
if (a == 1) {
cout << 1;
return 0;
} else if (a == 2 || a == 3) {
cout << 2;
return 0;
}
ll temp = 1;
for (ll i = 2; i * i <= a; i++) {
if (temp < a && (a / temp) % i == 0) {
res++;
while (temp < a) {
temp *= i;
if (a % temp) {
temp /= i;
break;
}
}
}
}
if (a > temp)
res++;
cout << res;
return 0;
} | replace | 27 | 28 | 27 | 28 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
map<long long, int> PF;
void primeF(long long n) {
long long tmp = n;
for (int i = 2; i * i <= n; i++) {
while (tmp % i == 0) {
PF[i]++;
tmp /= i;
}
}
if (tmp != 1)
PF[tmp]++;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long long A, B;
cin >> A >> B;
long long G = __gcd(A, B);
primeF(G);
printf("%ld\n", PF.size() + 1);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
map<long long, int> PF;
void primeF(long long n) {
long long tmp = n;
for (int i = 2; (long long)i * i <= tmp; i++) {
while (tmp % i == 0) {
PF[i]++;
tmp /= i;
}
}
if (tmp != 1)
PF[tmp]++;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long long A, B;
cin >> A >> B;
long long G = __gcd(A, B);
primeF(G);
printf("%ld\n", PF.size() + 1);
return 0;
}
| replace | 5 | 6 | 5 | 6 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <regex>
#include <string>
#include <vector>
using namespace std;
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<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;
}
int main() {
long long A, B;
cin >> A >> B;
long long gcd = GCD(A, B);
vector<pair<long long, long long>> v;
v = prime_factorize(gcd);
cout << 1 + v.size() << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <regex>
#include <string>
#include <vector>
using namespace std;
long long GCD(long long x, long long y) { return y ? GCD(y, x % y) : x; }
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;
}
int main() {
long long A, B;
cin >> A >> B;
long long gcd = GCD(A, B);
vector<pair<long long, long long>> v;
v = prime_factorize(gcd);
cout << 1 + v.size() << endl;
} | replace | 12 | 22 | 12 | 13 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
long long gcd(long long x, long long y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
bool is_prime(ll x) {
for (ll i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
set<ll> st;
st.insert(1);
if (is_prime(g))
st.insert(g);
ll ans = 0;
for (int i = 1; i * i <= g; i++) {
if (g % i == 0) {
if (is_prime(i))
ans++;
if (is_prime(g / i))
ans++;
}
}
if (g == 1)
ans--;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
long long gcd(long long x, long long y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
bool is_prime(ll x) {
for (ll i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
set<ll> st;
st.insert(1);
if (is_prime(g))
st.insert(g);
ll ans = 0;
for (ll i = 1; i * i <= g; i++) {
if (g % i == 0) {
if (is_prime(i))
ans++;
if (is_prime(g / i))
ans++;
}
}
if (g == 1)
ans--;
cout << ans << endl;
return 0;
}
| replace | 38 | 39 | 38 | 39 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using namespace std;
map<ll, ll> prime_factor(ll x) {
map<ll, ll> ret;
for (ll a = 2; a < x; ++a) {
if (x % a == 0) {
ret[a]++;
x /= a;
while (x % a == 0) {
ret[a]++;
x /= a;
}
}
}
if (x != 1)
ret[x] = 1;
return ret;
}
int main() {
ll A, B;
cin >> A >> B;
ll G = __gcd(A, B);
cout << prime_factor(G).size() + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using namespace std;
map<ll, ll> prime_factor(ll x) {
map<ll, ll> ret;
for (ll a = 2; a * a <= x; ++a) {
if (x % a == 0) {
ret[a]++;
x /= a;
while (x % a == 0) {
ret[a]++;
x /= a;
}
}
}
if (x != 1)
ret[x] = 1;
return ret;
}
int main() {
ll A, B;
cin >> A >> B;
ll G = __gcd(A, B);
cout << prime_factor(G).size() + 1 << endl;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long int GCL(long long int a, long long int b) {
if (b == 0)
return a;
return GCL(b, a % b);
}
int main() {
long long int a, b;
cin >> a >> b;
long long int g = GCL(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++;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long int GCL(long long int a, long long int b) {
if (b == 0)
return a;
return GCL(b, a % b);
}
int main() {
long long int a, b;
cin >> a >> b;
long long int g = GCL(a, b);
int ans = 1;
for (int i = 2; i <= sqrt(g); i++) {
if (g % i == 0) {
ans++;
while (g % i == 0) {
g /= i;
}
}
}
if (g > 1)
ans++;
cout << ans << endl;
} | replace | 16 | 17 | 16 | 17 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
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;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
gcd(b, a % b);
}
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (int i = 2; i * i <= n; i++) {
if (n % i != 0)
continue;
res.push_back(make_pair(i, 0));
while (n % i == 0) {
res.back().second++;
n /= i;
}
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
auto f = factorize(g);
ll ans = f.size() + 1;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
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;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
gcd(b, a % b);
}
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i != 0)
continue;
res.push_back(make_pair(i, 0));
while (n % i == 0) {
res.back().second++;
n /= i;
}
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
auto f = factorize(g);
ll ans = f.size() + 1;
cout << ans << endl;
} | replace | 28 | 29 | 28 | 29 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define all(i, n) (i), (i + n)
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, -1, 0, 1};
int dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
int dx9[9] = {0, 1, 0, -1, 1, -1, 1, 0, -1};
int dy9[9] = {0, 1, 1, 1, 0, 0, -1, -1, -1};
typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
typedef pair<ll, ll> PLL;
const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6 + 1;
const ll mod = 1000000007;
// << fixed << setprecision
// --------------------------------------
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
++res[n];
return res;
}
ll a, b;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b;
ll gc = gcd(a, b);
auto mp = prime_factor(gc);
cout << mp.size() + 1 << endl;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define all(i, n) (i), (i + n)
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, -1, 0, 1};
int dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
int dx9[9] = {0, 1, 0, -1, 1, -1, 1, 0, -1};
int dy9[9] = {0, 1, 1, 1, 0, 0, -1, -1, -1};
typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
typedef pair<ll, ll> PLL;
const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6 + 1;
const ll mod = 1000000007;
// << fixed << setprecision
// --------------------------------------
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
++res[n];
return res;
}
ll a, b;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b;
ll gc = gcd(a, b);
auto mp = prime_factor(gc);
cout << mp.size() + 1 << endl;
}
| replace | 46 | 47 | 46 | 47 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long a, b;
/*
int get(int x)
{
if(x==fa[x]) return x;
return fa[x]=get(fa[x]);
}//路径压缩
int merge(int x,int y)
{
fa[get(x)]=get(y);
}//合并 */
int ans = 1;
int main() {
cin >> a >> b;
if (a < b) {
long long c = a;
a = b;
b = c;
}
// cout<<a;
while (b != 0) {
a = a % b;
if (a < b) {
long long c = a;
a = b;
b = c;
}
}
// cout<<a;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0) {
ans++;
while (a % i == 0)
a /= i;
}
}
if (a > 1)
ans++;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long a, b;
/*
int get(int x)
{
if(x==fa[x]) return x;
return fa[x]=get(fa[x]);
}//路径压缩
int merge(int x,int y)
{
fa[get(x)]=get(y);
}//合并 */
int ans = 1;
int main() {
cin >> a >> b;
if (a < b) {
long long c = a;
a = b;
b = c;
}
// cout<<a;
while (b != 0) {
a = a % b;
if (a < b) {
long long c = a;
a = b;
b = c;
}
}
// cout<<a;
for (int i = 2; (long long)i * i <= a; i++) {
if (a % i == 0) {
ans++;
while (a % i == 0)
a /= i;
}
}
if (a > 1)
ans++;
cout << ans;
return 0;
} | replace | 31 | 32 | 31 | 32 | TLE | |
p02900 | C++ | Time Limit Exceeded | // ROAD TO GREEN
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#define ll long long
#define uint unsigned int
#define ull unsigned ll
using namespace std;
const ll MAXN = 2e9 + 2;
const ll SIZE = 1e6 + 2;
int main() {
ll a, b;
cin >> a >> b;
ll gcd = __gcd(a, b);
int i = 2;
int cnt = 1;
while (gcd > 1) {
if (gcd % i == 0) {
cnt++;
while (gcd % i == 0) {
gcd /= i;
}
}
i++;
if (i * i > gcd)
break;
}
if (gcd > 1)
cnt++;
cout << cnt << endl;
return 0;
}
| // ROAD TO GREEN
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#define ll long long
#define uint unsigned int
#define ull unsigned ll
using namespace std;
const ll MAXN = 2e9 + 2;
const ll SIZE = 1e6 + 2;
int main() {
ll a, b;
cin >> a >> b;
ll gcd = __gcd(a, b);
ll i = 2;
ll cnt = 1;
while (gcd > 1) {
if (gcd % i == 0) {
cnt++;
while (gcd % i == 0) {
gcd /= i;
}
}
i++;
if (i * i > gcd)
break;
}
if (gcd > 1)
cnt++;
cout << cnt << endl;
return 0;
}
| replace | 24 | 26 | 24 | 26 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
set<int> fact(ll n) {
set<int> res;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
res.insert(i);
while (n % i == 0)
n /= i;
}
}
if (n > 1)
res.insert(n);
return res;
}
int main() {
ll a, b;
cin >> a >> b;
cout << fact(gcd(a, b)).size() + 1 << endl;
} | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
set<ll> fact(ll n) {
set<ll> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
res.insert(i);
while (n % i == 0)
n /= i;
}
}
if (n > 1)
res.insert(n);
return res;
}
int main() {
ll a, b;
cin >> a >> b;
cout << fact(gcd(a, b)).size() + 1 << endl;
} | replace | 16 | 19 | 16 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
vector<long long> av;
for (long long i = 1; i * i <= A; i++) {
if (A % i == 0) {
av.push_back(i);
if (i * i != A)
av.push_back(A / i);
}
}
vector<long long> bv;
for (long long i = 1; i * i <= B; i++) {
if (B % i == 0) {
bv.push_back(i);
if (i * i != B)
bv.push_back(B / i);
}
}
vector<long long> cv;
for (long long i = 0; i < av.size(); i++) {
for (long long j = 0; j < bv.size(); j++) {
if (av[i] == bv[j])
cv.push_back(av[i]);
}
}
// sort(cv.begin(),cv.end());
vector<long long> dv;
for (long long i = 0; i < cv.size(); i++) {
bool flag = true;
for (long long j = 2; j < cv[i]; j++) {
if (cv[i] % j == 0) {
flag = false;
break;
}
}
if (flag == true)
dv.push_back(cv[i]);
}
cout << dv.size() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
vector<long long> av;
for (long long i = 1; i * i <= A; i++) {
if (A % i == 0) {
av.push_back(i);
if (i * i != A)
av.push_back(A / i);
}
}
vector<long long> bv;
for (long long i = 1; i * i <= B; i++) {
if (B % i == 0) {
bv.push_back(i);
if (i * i != B)
bv.push_back(B / i);
}
}
vector<long long> cv;
for (long long i = 0; i < av.size(); i++) {
for (long long j = 0; j < bv.size(); j++) {
if (av[i] == bv[j])
cv.push_back(av[i]);
}
}
// sort(cv.begin(),cv.end());
vector<long long> dv;
for (long long i = 0; i < cv.size(); i++) {
bool flag = true;
if (cv[i] == 1)
flag = true;
else if (cv[i] == 2)
flag = true;
else if (cv[i] % 2 == 0)
flag = false;
else {
for (long long j = 3; j * j <= cv[i]; j += 2) {
if (cv[i] % j == 0) {
flag = false;
break;
}
}
}
if (flag == true)
dv.push_back(cv[i]);
}
cout << dv.size() << endl;
return 0;
} | replace | 38 | 42 | 38 | 50 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = (1e9) + 7;
using P = pair<ll, ll>;
int main() {
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
map<ll, int> co;
for (int p = 2; p * p <= g; ++p) {
while (g % p == 0) {
co[p]++;
g /= p;
}
}
if (g != 1)
co[g]++;
ll ans = co.size() + 1;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = (1e9) + 7;
using P = pair<ll, ll>;
int main() {
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
map<ll, int> co;
for (ll p = 2; p * p <= g; ++p) {
while (g % p == 0) {
co[p]++;
g /= p;
}
}
if (g != 1)
co[g]++;
ll ans = co.size() + 1;
cout << ans << endl;
return 0;
} | replace | 15 | 16 | 15 | 16 | TLE | |
p02900 | C++ | Time Limit Exceeded | // Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
using namespace std;
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
bool sortbysec(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.second < b.second);
}
int main() {
ios;
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
map<ll, ll> m;
m[1] = 1;
for (int i = 2; i * i <= g; i++) {
if (g % i == 0) {
m[i] = 1;
while (g % i == 0)
g /= i;
}
}
m[g] = 1;
ll sum = 0;
map<ll, ll>::iterator it;
for (it = m.begin(); it != m.end(); it++)
sum += it->ss;
cout << sum << endl;
}
| // Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
using namespace std;
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
bool sortbysec(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.second < b.second);
}
int main() {
ios;
ll a, b;
cin >> a >> b;
ll g = __gcd(a, b);
map<ll, ll> m;
m[1] = 1;
for (ll i = 2; i * i <= g; i++) {
if (g % i == 0) {
m[i] = 1;
while (g % i == 0)
g /= i;
}
}
m[g] = 1;
ll sum = 0;
map<ll, ll>::iterator it;
for (it = m.begin(); it != m.end(); it++)
sum += it->ss;
cout << sum << endl;
}
| replace | 24 | 25 | 24 | 25 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
vector<pair<long long, long long>> prime_foctorize(long long N) {
vector<pair<long long, long long>> res;
for (long long i = 2; i <= N; i++) {
if (N % i != 0)
continue;
long long ex = 0;
while (N % i == 0) {
ex++;
N /= i;
}
res.push_back({i, ex});
}
if (N != 1)
res.push_back({N, 1});
return res;
}
int main() {
long long A, B;
cin >> A >> B;
long long X = __gcd(A, B);
const auto &pf = prime_foctorize(X);
cout << pf.size() + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
vector<pair<long long, long long>> prime_foctorize(long long N) {
vector<pair<long long, long long>> res;
for (long long i = 2; i * i <= N; i++) {
if (N % i != 0)
continue;
long long ex = 0;
while (N % i == 0) {
ex++;
N /= i;
}
res.push_back({i, ex});
}
if (N != 1)
res.push_back({N, 1});
return res;
}
int main() {
long long A, B;
cin >> A >> B;
long long X = __gcd(A, B);
const auto &pf = prime_foctorize(X);
cout << pf.size() + 1 << endl;
} | replace | 6 | 7 | 6 | 7 | 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;
vector<ll> a_prime;
a_prime.push_back(1);
int c = a;
for (int i = 2; i * i <= a; i++) {
if (c % i == 0) {
a_prime.push_back(i);
while (c % i == 0) {
c /= i;
}
}
}
if (c != 1) {
a_prime.push_back(c);
}
int count = 0;
for (int i = 0; i < a_prime.size(); i++) {
ll k = a_prime.at(i);
if (b % k == 0)
count++;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
vector<ll> a_prime;
a_prime.push_back(1);
ll c = a;
for (ll i = 2; i * i <= a; i++) {
if (c % i == 0) {
a_prime.push_back(i);
while (c % i == 0) {
c /= i;
}
}
}
if (c != 1) {
a_prime.push_back(c);
}
int count = 0;
for (int i = 0; i < a_prime.size(); i++) {
ll k = a_prime.at(i);
if (b % k == 0)
count++;
}
cout << count << endl;
}
| replace | 9 | 11 | 9 | 11 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <class TI, class TF> TI bin_search(TI l, TI u, TF f) {
while (u - l > 1) {
TI c = (l + u) / 2;
if (f(c))
u = c;
// if (!f(c)) u = c;
else
l = c;
}
assert(l + 1 == u);
return u;
// return l;
}
template <class T> bool is_prime(T n) {
if (n < 2)
return false;
int u = bin_search((T)1, n, [n](T i) { return i * i > n; });
for (int i = 2; i < u; i++) {
if (n % i == 0)
return false;
}
return true;
}
struct primes_ {
vector<int> v;
primes_(int n) : v{2, 3} {
if (n < 3) {
if (n == 2)
v = vector<int>(1, 2);
else
v.clear();
return;
}
bool f = false;
int end = 1;
for (int i = 5; i <= n; i += (f = !f) ? 2 : 4) {
while (v[end] * v[end] <= i)
end++;
bool isprime = true;
for (int k = 0; k < end; k++) {
if (i % v[k] == 0) {
isprime = false;
break;
}
}
if (isprime)
v.push_back(i);
}
}
auto begin() { return v.begin(); }
auto end() { return v.end(); }
} primes(1000000);
template <class T> T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
long long a, b;
cin >> a >> b;
auto d = gcd<long long>(a, b);
int ans = 1;
for (auto p : primes)
if (d % p == 0) {
ans++;
do
d /= p;
while (d % p == 0);
}
if (d > 1000000 && is_prime(d))
ans++;
// if (d > 1000000 && ans == 1) ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
template <class TI, class TF> TI bin_search(TI l, TI u, TF f) {
while (u - l > 1) {
TI c = (l + u) / 2;
if (f(c))
u = c;
// if (!f(c)) u = c;
else
l = c;
}
assert(l + 1 == u);
return u;
// return l;
}
template <class T> bool is_prime(T n) {
if (n < 2)
return false;
int u = bin_search((T)1, n, [n](T i) { return n / i / i == 0; });
for (int i = 2; i < u; i++) {
if (n % i == 0)
return false;
}
return true;
}
struct primes_ {
vector<int> v;
primes_(int n) : v{2, 3} {
if (n < 3) {
if (n == 2)
v = vector<int>(1, 2);
else
v.clear();
return;
}
bool f = false;
int end = 1;
for (int i = 5; i <= n; i += (f = !f) ? 2 : 4) {
while (v[end] * v[end] <= i)
end++;
bool isprime = true;
for (int k = 0; k < end; k++) {
if (i % v[k] == 0) {
isprime = false;
break;
}
}
if (isprime)
v.push_back(i);
}
}
auto begin() { return v.begin(); }
auto end() { return v.end(); }
} primes(1000000);
template <class T> T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
long long a, b;
cin >> a >> b;
auto d = gcd<long long>(a, b);
int ans = 1;
for (auto p : primes)
if (d % p == 0) {
ans++;
do
d /= p;
while (d % p == 0);
}
if (d > 1000000 && is_prime(d))
ans++;
// if (d > 1000000 && ans == 1) ans++;
cout << ans << endl;
}
| replace | 20 | 21 | 20 | 21 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, h = 0, ans = 0;
cin >> a >> b;
k = 1;
while (k != 0) {
k = max(a, b) % min(a, b);
a = min(a, b);
b = k;
}
k = a;
if (k == 1) {
cout << 1;
return 0;
}
if (k == 2 || k == 3) {
cout << 2;
return 0;
}
for (int i = 2; i < sqrt(a) + 1; i++) {
while (k % i == 0) {
k = k / i;
h = 1;
}
if (h == 1) {
ans++;
}
h = 0;
}
if (k == 1) {
cout << ans + 1;
} else {
cout << ans + 2;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k, h = 0, ans = 0;
cin >> a >> b;
k = 1;
while (k != 0) {
k = max(a, b) % min(a, b);
a = min(a, b);
b = k;
}
k = a;
if (k == 1) {
cout << 1;
return 0;
}
if (k == 2 || k == 3) {
cout << 2;
return 0;
}
for (int i = 2; i < sqrt(a) + 1; i++) {
while (k % i == 0) {
k = k / i;
h = 1;
}
if (h == 1) {
ans++;
}
h = 0;
}
if (k == 1) {
cout << ans + 1;
} else {
cout << ans + 2;
}
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll a7 = 1000000007;
ll inf = 100000000000000000;
ll min(ll a, ll b) {
if (a < b)
return a;
return b;
}
ll max(ll a, ll b) {
if (a > b)
return a;
return b;
}
ll gcd(ll x, ll y) {
if (x < y)
return gcd(y, x);
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll ans = 1;
for (ll i = 2; g > 1; i++) {
if (g % i == 0) {
ans++;
while (g % i == 0) {
g = g / i;
}
}
if (i != 2) {
i++;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll a7 = 1000000007;
ll inf = 100000000000000000;
ll min(ll a, ll b) {
if (a < b)
return a;
return b;
}
ll max(ll a, ll b) {
if (a > b)
return a;
return b;
}
ll gcd(ll x, ll y) {
if (x < y)
return gcd(y, x);
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll ans = 1;
for (ll i = 2; g > 1; i++) {
if (g % i == 0) {
ans++;
while (g % i == 0) {
g = g / i;
}
}
if (i != 2) {
i++;
}
if ((i + 1) * (i + 1) > g && g != 1) {
ans++;
g = 1;
}
}
cout << ans << endl;
return 0;
}
| insert | 39 | 39 | 39 | 43 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
long long int t;
long long int x, y;
x = max(a, b);
y = min(a, b);
while (true) {
if (x % y == 0) {
t = y;
break;
} else {
x = x % y;
swap(x, y);
}
}
long long int ans = 1;
for (int i = 2; i * i <= t; i++) {
if (t % i == 0) {
ans++;
while (t % i == 0) {
t = t / i;
}
}
}
if (t != 1)
ans++;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
long long int t;
long long int x, y;
x = max(a, b);
y = min(a, b);
while (true) {
if (x % y == 0) {
t = y;
break;
} else {
x = x % y;
swap(x, y);
}
}
long long int ans = 1;
for (long long int i = 2; i * i <= t; i++) {
if (t % i == 0) {
ans++;
while (t % i == 0) {
t = t / i;
}
}
}
if (t != 1)
ans++;
cout << ans;
}
| replace | 19 | 20 | 19 | 20 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ms(x, y) memset(x, y, sizeof(x))
#define lowbit(x) ((x) & (-x))
#define sqr(x) ((x) * (x))
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
void run_case() {
LL a, b;
cin >> a >> b;
LL gcd = __gcd(a, b);
int ans = 0;
for (LL i = 1; i * i <= gcd; ++i) {
if (gcd % i == 0) {
ans++;
while (gcd % i == 0)
gcd /= i;
}
}
if (gcd > 1)
ans++;
cout << ans;
}
int main() {
// freopen("input", "r", stdin);
ios::sync_with_stdio(false), cin.tie(0);
cout.flags(ios::fixed);
cout.precision(9);
// int t; cin >> t;
// while(t--)
run_case();
cout.flush();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ms(x, y) memset(x, y, sizeof(x))
#define lowbit(x) ((x) & (-x))
#define sqr(x) ((x) * (x))
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
void run_case() {
LL a, b;
cin >> a >> b;
LL gcd = __gcd(a, b);
int ans = 1;
for (LL i = 2; i * i <= gcd; ++i) {
if (gcd % i == 0) {
ans++;
while (gcd % i == 0)
gcd /= i;
}
}
if (gcd > 1)
ans++;
cout << ans;
}
int main() {
// freopen("input", "r", stdin);
ios::sync_with_stdio(false), cin.tie(0);
cout.flags(ios::fixed);
cout.precision(9);
// int t; cin >> t;
// while(t--)
run_case();
cout.flush();
return 0;
} | replace | 13 | 15 | 13 | 15 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main() {
ll a, b;
cin >> a >> b;
ll n = __gcd(a, b);
ll ans = 1;
if (n % 2 == 0) {
ans++;
while (n % 2 == 0)
n /= 2;
}
for (int i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
ans++;
while (n % i == 0)
n /= i;
}
if (n == 1)
break;
}
if (n != 1)
ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main() {
ll a, b;
cin >> a >> b;
ll n = __gcd(a, b);
ll ans = 1;
if (n % 2 == 0) {
ans++;
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
ans++;
while (n % i == 0)
n /= i;
}
if (n == 1)
break;
}
if (n != 1)
ans++;
cout << ans << endl;
}
| replace | 18 | 19 | 18 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
using namespace std;
using ll = long long;
int main() {
ll a, b;
cin >> a >> b;
ll tmp1, n;
while (true) {
tmp1 = a;
a = b;
b = tmp1 % b;
if (b == 0) {
n = a;
break;
}
}
ll ans = 1, cnt = 0;
if (n % 2 == 0) {
ans++;
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i <= n; i += 2) {
cnt = 0;
if (n % i == 0) {
ans++;
while (n % i == 0)
n /= i;
}
if (n == 1)
break;
}
if (n != 1)
ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
using namespace std;
using ll = long long;
int main() {
ll a, b;
cin >> a >> b;
ll tmp1, n;
while (true) {
tmp1 = a;
a = b;
b = tmp1 % b;
if (b == 0) {
n = a;
break;
}
}
ll ans = 1, cnt = 0;
if (n % 2 == 0) {
ans++;
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
cnt = 0;
if (n % i == 0) {
ans++;
while (n % i == 0)
n /= i;
}
if (n == 1)
break;
}
if (n != 1)
ans++;
cout << ans << endl;
}
| replace | 26 | 27 | 26 | 27 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long int gcd(long int a, long int b) {
long int c;
if (a > b)
swap(a, b);
while (b % a > 0) {
c = b % a;
b = a;
a = c;
}
return a;
}
int main() {
long int A, B;
cin >> A >> B;
vector<int> p;
long int g = gcd(A, B);
long int n = 1;
vector<int> prime;
for (int i = 2; i * i <= g; i++) {
bool check = true;
for (int p : prime) {
if (i % p == 0) {
check = false;
break;
}
}
if (check)
prime.push_back(i);
}
for (int i : prime) {
while (g % i == 0) {
g /= i;
if (n < i) {
n = i;
p.push_back(i);
}
}
}
if (g > n)
p.push_back(g);
cout << (int)p.size() + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
long int gcd(long int a, long int b) {
long int c;
if (a > b)
swap(a, b);
while (b % a > 0) {
c = b % a;
b = a;
a = c;
}
return a;
}
int main() {
long int A, B;
cin >> A >> B;
vector<int> p;
long int g = gcd(A, B);
long int n = 1;
auto rg = sqrt(g);
for (int i = 2; i <= rg; i++) {
while (g % i == 0) {
g /= i;
if (n < i) {
n = i;
p.push_back(i);
}
}
}
if (g > n)
p.push_back(g);
cout << (int)p.size() + 1 << endl;
} | replace | 21 | 34 | 21 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n1, n2, cnt = 1;
cin >> n1 >> n2;
long long int n = __gcd(n1, n2);
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
cnt++;
while (n % i == 0)
n /= i;
}
}
if (n > 1)
cnt++;
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n1, n2, cnt = 1;
cin >> n1 >> n2;
long long int n = __gcd(n1, n2);
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
cnt++;
while (n % i == 0)
n /= i;
}
}
if (n > 1)
cnt++;
cout << cnt << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define fore(i, a, b) for (int i = a; i < (int)(b); ++i)
#define forin(i, n) for (auto &i : (n))
#define make_unique(x) (x).erase(unique(all((x))), (x).end())
#define hbar \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
template <class T> T mgcd(T a, T b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
int main() {
hbar;
ll a, b;
cin >> a >> b;
ll n = mgcd(a, b), ans = 1;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0)
n /= i;
++ans;
}
}
if (n > 1)
++ans;
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define fore(i, a, b) for (int i = a; i < (int)(b); ++i)
#define forin(i, n) for (auto &i : (n))
#define make_unique(x) (x).erase(unique(all((x))), (x).end())
#define hbar \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
template <class T> T mgcd(T a, T b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
int main() {
hbar;
ll a, b;
cin >> a >> b;
ll n = mgcd(a, b), ans = 1;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0)
n /= i;
++ans;
}
}
if (n > 1)
++ans;
cout << ans << '\n';
return 0;
}
| replace | 53 | 54 | 53 | 54 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define out16(X) cout << setprecision(16) << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define MAX(A) *max_element(A.begin(), A.end())
#define MIN(A) *min_element(A.begin(), A.end())
#define SORT(A) sort(A.begin(), A.end())
#define REV(A) reverse(A.begin(), A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<int>>;
using vd = std::vector<double>;
using vvd = std::vector<std::vector<double>>;
using vll = std::vector<ll>;
using vvll = std::vector<std::vector<ll>>;
using namespace std;
#define MOD 1000000007
#define INF 1000000001
#define LL_INF 1001001001001001001
ll Gcd(ll x, ll y) {
if (y == 0)
return x;
return Gcd(y, x % y);
}
int main(void) {
ll a, b;
cin >> a >> b;
ll gcd = Gcd(a, b);
int ans = 0;
for (int i = 2; i * i <= gcd; i++) {
if (gcd % i)
continue;
ans++;
while (gcd % i == 0)
gcd /= i;
}
if (gcd != 1)
ans++;
ans++;
out(ans);
}
| #include <bits/stdc++.h>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define out16(X) cout << setprecision(16) << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define MAX(A) *max_element(A.begin(), A.end())
#define MIN(A) *min_element(A.begin(), A.end())
#define SORT(A) sort(A.begin(), A.end())
#define REV(A) reverse(A.begin(), A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<int>>;
using vd = std::vector<double>;
using vvd = std::vector<std::vector<double>>;
using vll = std::vector<ll>;
using vvll = std::vector<std::vector<ll>>;
using namespace std;
#define MOD 1000000007
#define INF 1000000001
#define LL_INF 1001001001001001001
ll Gcd(ll x, ll y) {
if (y == 0)
return x;
return Gcd(y, x % y);
}
int main(void) {
ll a, b;
cin >> a >> b;
ll gcd = Gcd(a, b);
ll ans = 0;
for (ll i = 2; i * i <= gcd; i++) {
if (gcd % i)
continue;
ans++;
while (gcd % i == 0)
gcd /= i;
}
if (gcd != 1)
ans++;
ans++;
out(ans);
}
| replace | 32 | 34 | 32 | 34 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdlib>
#include <math.h>
#include <string>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define pb push_back
#define eb emplace_back
#define in insert
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define FOR(i, n, x) for (int i = x; i < n; i++)
#define OUT(a, e) FOR(i, e, 0) cout << a[i] << ' '
#define OUTV(a) \
for (auto i : a) \
cout << i << ' ';
#define maxim(a, n, mx) FOR(i, n, x) mx = max(mx, a[i]);
using namespace std;
const int N = 5e3;
int used[N];
vector<ll> d;
int main() {
ll a, b;
cin >> a >> b;
ll n = __gcd(a, b);
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
d.pb(i);
if (n / i != i)
d.pb(n / i);
}
}
sort(all(d));
int ans = 0, cnt = 1, sz = d.size();
FOR(i, sz, 0) {
if (d[i] == 1)
continue;
if (used[i])
continue;
FOR(j, sz, 0) {
if (d[j] % d[i] == 0)
used[j] = 1;
}
cnt++;
}
cout << cnt;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cstdlib>
#include <math.h>
#include <string>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define pb push_back
#define eb emplace_back
#define in insert
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define FOR(i, n, x) for (int i = x; i < n; i++)
#define OUT(a, e) FOR(i, e, 0) cout << a[i] << ' '
#define OUTV(a) \
for (auto i : a) \
cout << i << ' ';
#define maxim(a, n, mx) FOR(i, n, x) mx = max(mx, a[i]);
using namespace std;
const int N = 1e5;
int used[N];
vector<ll> d;
int main() {
ll a, b;
cin >> a >> b;
ll n = __gcd(a, b);
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
d.pb(i);
if (n / i != i)
d.pb(n / i);
}
}
sort(all(d));
int ans = 0, cnt = 1, sz = d.size();
FOR(i, sz, 0) {
if (d[i] == 1)
continue;
if (used[i])
continue;
FOR(j, sz, 0) {
if (d[j] % d[i] == 0)
used[j] = 1;
}
cnt++;
}
cout << cnt;
return 0;
}
| replace | 28 | 29 | 28 | 29 | 0 | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int ans = 0;
for (ll i = 1; i * i <= g; i++) {
if (g % i == 0 && is_prime(i)) {
ans++;
}
int rest = g / i;
if (g % rest == 0 && is_prime(rest)) {
ans++;
}
if (g == i * i && is_prime(i)) {
ans--;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int ans = 0;
for (ll i = 1; i * i <= g; i++) {
if (g % i == 0 && is_prime(i)) {
ans++;
}
ll rest = g / i;
if (g % rest == 0 && is_prime(rest)) {
ans++;
}
if (g == i * i && is_prime(i)) {
ans--;
}
}
cout << ans << endl;
return 0;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, res = 1;
cin >> a >> b;
long long gcd = __gcd(a, b);
for (int i = 2; i * i <= gcd; i++) {
bool ok = false;
while (gcd % i == 0)
gcd /= i, ok = true;
res += ok;
}
res += (gcd != 1);
cout << res << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, res = 1;
cin >> a >> b;
long long gcd = __gcd(a, b);
for (long long i = 2; i * i <= gcd; i++) {
bool ok = false;
while (gcd % i == 0)
gcd /= i, ok = true;
res += ok;
}
res += (gcd != 1);
cout << res << "\n";
} | replace | 6 | 7 | 6 | 7 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y == 0 ? x : gcd(y, x % y); }
int main() {
ll a, b;
cin >> a >> b;
ll maxNum = gcd(a, b);
ll ans = 1;
for (int i = 2; i * i <= maxNum; i++) {
if (maxNum % i == 0) {
ans++;
while (maxNum % i == 0) {
maxNum /= i;
}
}
}
if (maxNum != 1)
ans++;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y == 0 ? x : gcd(y, x % y); }
int main() {
ll a, b;
cin >> a >> b;
ll maxNum = gcd(a, b);
ll ans = 1;
for (ll i = 2; i * i <= maxNum; i++) {
if (maxNum % i == 0) {
ans++;
while (maxNum % i == 0) {
maxNum /= i;
}
}
}
if (maxNum != 1)
ans++;
cout << ans << endl;
return 0;
} | replace | 15 | 16 | 15 | 16 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
#include <list>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
#define yes(j) std::cout << (j ? "yes" : "no") << endl;
typedef long long ll;
void factprime(long long x, std::set<long long> &st) {
long long i = 2;
long long cur = x;
// map<long long, long long> tmp;
while (cur >= 2) {
for (long long i = 2; i < cur; i++) {
if (i * i > cur) {
st.insert(cur);
return;
}
if (cur % i == 0) {
cur = cur / i;
// tmp[i]++;
st.insert(i);
break;
}
}
}
// primefact[x] = tmp;
}
int main(void) {
ll a, b;
cin >> a >> b;
std::set<long long> sta;
std::set<long long> stb;
factprime(a, sta);
factprime(b, stb);
// cout << sta << stb << endl;
auto itra = sta.begin();
auto itrb = stb.begin();
long long ans = 1;
for (; itra != sta.end() && itrb != stb.end();) {
if (*itra == *itrb) {
ans++;
itra++;
itrb++;
} else if (*itra > *itrb) {
itrb++;
} else {
itra++;
/* code */
}
}
cout << ans << "\n";
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
#include <list>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
#define yes(j) std::cout << (j ? "yes" : "no") << endl;
typedef long long ll;
void factprime(long long x, std::set<long long> &st) {
long long i = 2;
long long cur = x;
// map<long long, long long> tmp;
while (cur >= 2) {
for (long long i = 2;; i++) {
if (i * i > cur) {
st.insert(cur);
return;
}
if (cur % i == 0) {
cur = cur / i;
// tmp[i]++;
st.insert(i);
break;
}
}
}
// primefact[x] = tmp;
}
int main(void) {
ll a, b;
cin >> a >> b;
std::set<long long> sta;
std::set<long long> stb;
factprime(a, sta);
factprime(b, stb);
// cout << sta << stb << endl;
auto itra = sta.begin();
auto itrb = stb.begin();
long long ans = 1;
for (; itra != sta.end() && itrb != stb.end();) {
if (*itra == *itrb) {
ans++;
itra++;
itrb++;
} else if (*itra > *itrb) {
itrb++;
} else {
itra++;
/* code */
}
}
cout << ans << "\n";
} | replace | 31 | 32 | 31 | 32 | TLE | |
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;
int main() {
ll 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 = 0;
for (int i = 2; i * i <= b; i++) {
bool flag = 0;
while (b % i == 0) {
flag = 1;
b /= i;
}
if (flag == 1)
ans++;
}
if (b != 1)
ans++;
cout << ans + 1 << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll 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 = 0;
ll gcd = b;
for (ll i = 2; i * i <= gcd; i++) {
bool flag = 0;
while (b % i == 0) {
flag = 1;
b /= i;
}
if (flag == 1)
ans++;
}
if (b != 1)
ans++;
cout << ans + 1 << endl;
}
| replace | 20 | 21 | 20 | 22 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define REP(i, l, n) for (int i = (l), i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
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;
int i = 2;
map<ll, ll> mp1, mp2;
mp1[1] = 1;
mp2[1] = 1;
while (a >= i * i) {
if (a % i == 0) {
mp1[i]++;
a /= i;
} else {
i++;
}
}
mp1[a]++;
i = 2;
while (b >= i * i) {
if (b % i == 0) {
mp2[i]++;
b /= i;
} else {
i++;
}
}
mp2[b]++;
ll ans = 0;
for (auto &x : mp1) {
if (mp2[x.first] != 0) {
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define REP(i, l, n) for (int i = (l), i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
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 i = 2;
map<ll, ll> mp1, mp2;
mp1[1] = 1;
mp2[1] = 1;
while (a >= i * i) {
if (a % i == 0) {
mp1[i]++;
a /= i;
} else {
i++;
}
}
mp1[a]++;
i = 2;
while (b >= i * i) {
if (b % i == 0) {
mp2[i]++;
b /= i;
} else {
i++;
}
}
mp2[b]++;
ll ans = 0;
for (auto &x : mp1) {
if (mp2[x.first] != 0) {
ans++;
}
}
cout << ans << endl;
} | replace | 15 | 16 | 15 | 16 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.