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 ... | #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... | 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 ... | #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 ... | 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.e... | #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.e... | 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) (... | #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) (... | 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;... | #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;... | 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 __nam... | 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 ... | 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(... | 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, ... | 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(... | 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 Tru... | 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 ==... | 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,... | 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,... | 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 <l... |
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... | #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... | 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);... | #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);... | 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 ... | #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 ... | 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;
... | #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;
... | 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 = typenam... | #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 = typenam... | 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]++;
... | #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]++;
... | 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 ... | #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 ... | 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... | #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... | 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... | #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... | 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); ... | #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); ... | 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... | #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... | 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
... | // 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
... | 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 << ... | #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 s... | #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 s... | 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)
... | #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)
... | 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)... | /* 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)... | 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 ve... | // #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 ve... | 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 =... | #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 ==... | 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())
... | /* بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ */
// 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())
... | 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+... | #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
#defin... | 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++;
... | #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++;
... | 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 << end... | #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 << end... | 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>... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>... | 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 =... | #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... | 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];
... | #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];... | 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;
}
ui... | #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;
}
ui... | 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)... | #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 ... | 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... | #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 ... | 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;
}... | #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;
}
... | 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).b... | #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).b... | 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>
#includ... | #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>
#includ... | 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... | #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) {
... | 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;
}
... | #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 /... | 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++) ... | #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++) ... | 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 <n... | #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 <n... | 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... | #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... | 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++;
... | #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+... | 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... | #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 <... | 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 ch... |
#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 ch... | 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... | #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... | 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; ... | #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; ... | 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 ... | #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 ... | 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 <un... | #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 <un... | 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 ... | #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 ... | 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... | #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... | 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... | #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... | 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[]) {
... | #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[]) {
... | 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 re... | #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 re... | 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 ma... | #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() ... | 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 = fa... | #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 = fa... | 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... | #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... | 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)
... | #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)
... | 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;
... | #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 <<... | 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... | #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... | 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... | #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... | 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);
... | #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_s... | 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)) ... | #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>> ... | 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... | #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... | 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) {
... | #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) {
... | 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) {
... | #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) {
... | 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 =... | #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 =... | 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(... | #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(... | 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;
}
... | #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;
}
... | 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;... | // 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;... | 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) { retur... | #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) { retur... | 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 ... | #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 ... | 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; ... | #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; +... | 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); \
... | // Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
using namespace std;
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
... | 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... | #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) {
... | 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;
}
}
}
i... | #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 ... | 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(... | #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(... | 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;
}
f... | #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;
... | 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)
retu... | #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)
retu... | 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;... | #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;... | 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 =... | #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 =... | 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... | #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;... | 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 =... | #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 =... | 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;
vec... | #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;
aut... | 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;
... | #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 << end... | 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 cha... | #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 cha... | 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(), ... | #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(), ... | 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_bas... | #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_bas... | 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);
... | #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);
... | 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) {
a... | #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) {
an... | 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... | #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... | 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... | #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 =... | 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) ... | #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) ... | 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.