problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec se... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec se... | replace | 148 | 149 | 148 | 149 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
int64_t g = max(a, b), l = min(a, b), n = l;
while (g % l != 0) {
n = l;
l = g % l;
g = n;
}
return l;
}
int main() {
int64_t a, b;
cin >> a >> b;
int64_t n = gcd(a, b), ans = 1;
for (int i = 2; i * i <= n; i... | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
int64_t g = max(a, b), l = min(a, b), n = l;
while (g % l != 0) {
n = l;
l = g % l;
g = n;
}
return l;
}
int main() {
int64_t a, b;
cin >> a >> b;
int64_t n = gcd(a, b);
int ans = 1;
for (int64_t i = 2; i *... | replace | 16 | 18 | 16 | 19 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#in... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#in... | replace | 68 | 69 | 68 | 69 | -11 | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace ::std;
int main() {
long long int a, b;
cin >> a >> b;
long long int g = __gcd(a, b), ans = 1;
bool is = 1;
for (long long int i = 2; i <= g; i++) {
if (is) {
bool chc = 0;
for (long long int j = 2; j <= sqrt(g); j++)
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace ::std;
int main() {
long long int a, b;
cin >> a >> b;
long long int g = __gcd(a, b), ans = 1;
bool is = 1;
for (long long int i = 2; i <= g; i++) {
if (is) {
bool chc = 0;
for (long long int j = 2; j <= sqrt(g); j++)
... | insert | 20 | 20 | 20 | 21 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define llu unsigned long long int
#define Endl endl
#define mod 998244353
#define mkp make_pair
#define pb push_back
#define cin(n) scanf("%d", &n)
#define cout(n) printf("%d ", n)
#define sf(n) scanf("%d", &n)
#define pf(n) printf("%d ", n)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define llu unsigned long long int
#define Endl endl
#define mod 998244353
#define mkp make_pair
#define pb push_back
#define cin(n) scanf("%d", &n)
#define cout(n) printf("%d ", n)
#define sf(n) scanf("%d", &n)
#define pf(n) printf("%d ", n)
#defin... | replace | 44 | 45 | 44 | 45 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
#define db double
#define ui unsigned int
#define ll long long
#define ull unsiged ll
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define per(i, r, l) for (int i = r; i >= l; i--)
#define pb push_back
#define pp pop_back
#define pii pair<int, int>
#define pll pair<ll... | #include <bits/stdc++.h>
typedef long long ll;
#define db double
#define ui unsigned int
#define ll long long
#define ull unsiged ll
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define per(i, r, l) for (int i = r; i >= l; i--)
#define pb push_back
#define pp pop_back
#define pii pair<int, int>
#define pll pair<ll... | replace | 64 | 65 | 64 | 67 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include <math.h>
#include <regex>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int MGN = 10;
const int ARY_SZ_MAX = 10000000;
using namespace std;
using ll = long long... | #include "bits/stdc++.h"
#include <math.h>
#include <regex>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX / 2)
const int MGN = 10;
const int ARY_SZ_MAX = 10000000;
using namespace std;
using ll = long long... | replace | 35 | 36 | 35 | 36 | TLE | |
p02900 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <chrono>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#i... |
#include <algorithm>
#include <chrono>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#i... | replace | 93 | 95 | 93 | 95 | TLE | |
p02900 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &... | replace | 37 | 38 | 37 | 38 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod = 1000000007;
/*"itob" int to "N"base */ template <typename TypeInt>
string itob(const TypeInt v, int base) {
static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod = 1000000007;
/*"itob" int to "N"base */ template <typename TypeInt>
string itob(const TypeInt v, int base) {
static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";... | replace | 72 | 73 | 72 | 73 | TLE | |
p02900 | C++ | Time Limit Exceeded | // #include <tourist>
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#includ... | // #include <tourist>
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#includ... | replace | 54 | 55 | 54 | 55 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
ll intpow(ll N, ll P) {
if (P =... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
ll intpow(ll N, ll P) {
if (P =... | replace | 43 | 45 | 43 | 45 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <set>
using namespace std;
int main() {
int64_t a, b;
cin >> a >> b;
int ans = 1;
set<int64_t> set;
auto n = min(a, b);
auto m = max(a, b);
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
if (set.find(i) == set.end())... | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <set>
using namespace std;
int main() {
int64_t a, b;
cin >> a >> b;
int ans = 1;
set<int64_t> set;
auto n = min(a, b);
auto m = max(a, b);
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
if (set.find(i) == set.en... | replace | 14 | 15 | 14 | 15 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using LL = int64_t;
using VL = vector<LL>;
using PLL = pair<LL, LL>;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> std::map<T, int> factorize(T n) {
std::map<T, int> res;
for (int i = 2; i * i <= n; i++) {
while (n % i... | #include <bits/stdc++.h>
using namespace std;
using LL = int64_t;
using VL = vector<LL>;
using PLL = pair<LL, LL>;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> std::map<T, int> factorize(T n) {
std::map<T, int> res;
for (LL i = 2; i * i <= n; i++) {
while (n % i ... | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
int ans = 1;
if (g % 2 == 0) {
ans++;
while (g % 2 == 0)
g >> 1;
}
for (ll p = 3; p <= sqrt(g); p += 2) {
if (g % p == 0) {
ans++;
while (g % p == 0... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
int ans = 1;
if (g % 2 == 0) {
ans++;
while (g % 2 == 0)
g >>= 1;
}
for (ll p = 3; p <= sqrt(g); p += 2) {
if (g % p == 0) {
ans++;
while (g % p == ... | replace | 14 | 15 | 14 | 15 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, db> pdb;
typedef pair<ldb, ldb> pldb;
template <typename T> void Debug(T begi... | #include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, db> pdb;
typedef pair<ldb, ldb> pldb;
template <typename T> void Debug(T begi... | replace | 42 | 43 | 42 | 43 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (... | replace | 138 | 139 | 138 | 139 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | replace | 31 | 33 | 31 | 33 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | replace | 33 | 34 | 33 | 34 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t A, int64_t B) {
if (B == 0) {
return A;
}
return gcd(B, A % B);
}
map<int64_t, int> prime_list(int64_t n) {
map<int64_t, int> ans;
for (int i = 2; i * i <= n; ++i) {
while (n % i == 0) {
++ans[i];
n = n / i;
}
}
if... | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t A, int64_t B) {
if (B == 0) {
return A;
}
return gcd(B, A % B);
}
map<int64_t, int> prime_list(int64_t n) {
map<int64_t, int> ans;
for (int64_t i = 2; i * i <= n; ++i) {
while (n % i == 0) {
++ans[i];
n = n / i;
}
}
... | replace | 12 | 13 | 12 | 13 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, r, tmp;
cin >> a >> b;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
int ans = 1;
for (int i = 2; i * i <= b; i++) {
if (b % i == 0) {
ans++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, r, tmp;
cin >> a >> b;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
long long ans = 1;
for (long long i = 2; i * i <= b; i++) {
if (b % i == 0) {
... | replace | 17 | 19 | 17 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
ret... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
ret... | replace | 33 | 34 | 33 | 34 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class U> U lcm(U m, U n) {
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n);
}
template <typename T> auto divisors(T n) {
vector<T> v;
for (int i = 1; i * i <= n; i++)... | #include <bits/stdc++.h>
using namespace std;
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class U> U lcm(U m, U n) {
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n);
}
template <typename T> auto divisors(T n) {
vector<T> v;
for (T i = 1; i * i <= n; i++) {... | replace | 10 | 11 | 10 | 11 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
const int Maxn = 1e6;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
return GCD(y, x % y);
}
int main() {
#ifdef LOACL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ll x, y;
scanf(... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
const int Maxn = 1e6;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
return GCD(y, x % y);
}
int main() {
#ifdef LOACL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ll x, y;
scanf(... | replace | 23 | 24 | 23 | 24 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long prime_factor(long long N) {
int ans = 1;
for (int i = 2; i * i <= N; i++) {
if (N % i == 0)
ans++;
while (N % i == 0) {
N /= i;
}
}
if... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long prime_factor(long long N) {
long long ans = 1;
for (long long i = 2; i * i <= N; i++) {
if (N % i != 0)
continue;
if (N % i == 0)
ans++;
w... | replace | 10 | 12 | 10 | 14 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
tem... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
tem... | replace | 29 | 30 | 29 | 30 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ll Pow_m... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ll Pow_m... | replace | 46 | 47 | 46 | 47 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define pb push_back
#define eb emplace_back
#define a first
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define pb push_back
#define eb emplace_back
#define a first
#def... | replace | 26 | 27 | 26 | 27 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
... | replace | 68 | 71 | 68 | 80 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repk(i, k, n) for (int i = k; i < (int)(n); ++i)
#define MAX 500010
typedef long long int ll;
using namespace std;
// 最大公約数のll版
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
int main() {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repk(i, k, n) for (int i = k; i < (int)(n); ++i)
#define MAX 500010
typedef long long int ll;
using namespace std;
// 最大公約数のll版
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
int main() {
... | replace | 22 | 23 | 22 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define all(a) (a).begin(), (a).end()
template <class T> inl... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define all(a) (a).begin(), (a).end()
template <class T> inl... | replace | 43 | 44 | 43 | 44 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i, s, t) for (ll i = s; i < t; i++)
typedef long long ll;
typedef pair<ll, ll> P;
const int max_n = 1e5;
const ll mod = 1e9 + 7;
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ma;
rep(i, 2, n + 1) {
while (n % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i, s, t) for (ll i = s; i * i <= t; i++)
typedef long long ll;
typedef pair<ll, ll> P;
const int max_n = 1e5;
const ll mod = 1e9 + 7;
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ma;
rep(i, 2, n + 1) {
while (n % i == 0... | replace | 4 | 5 | 4 | 5 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, (a % b));
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll mpower(ll a, ll b, ll c) {
int z;
if (b == 0) {
z = 1;
z %= c;
return z;
}
if (b == ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, (a % b));
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll mpower(ll a, ll b, ll c) {
int z;
if (b == 0) {
z = 1;
z %= c;
return z;
}
if (b == ... | replace | 59 | 60 | 59 | 60 | TLE | |
p02900 | C++ | Runtime Error | /* ꧁༒☬महाकाल☬༒꧂ ꧁༒ঔमहाकालঔ༒꧂
ঔৣमहाकालᴳᵒᵈঔৣ
*/
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, r... | /* ꧁༒☬महाकाल☬༒꧂ ꧁༒ঔमहाकालঔ༒꧂
ঔৣमहाकालᴳᵒᵈঔৣ
*/
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, r... | replace | 45 | 46 | 45 | 46 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | replace | 33 | 34 | 33 | 34 | TLE | |
p02900 | C++ | Time Limit Exceeded | //
// Created by Hideaki Imamura on 2020-03-18.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline boo... | //
// Created by Hideaki Imamura on 2020-03-18.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline boo... | replace | 48 | 49 | 48 | 49 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll a, b, GCD, c = 1;
cin >> a >> b;
while (a && b) {
if (a >= b)
a %= b;
else
b %= a;
}
GCD = a + b;
for (int i = 2; i * i <= GCD; i++) {
if (GCD % i == 0)
c++;
while (GCD % i == 0)
G... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll a, b, GCD, c = 1;
cin >> a >> b;
while (a && b) {
if (a >= b)
a %= b;
else
b %= a;
}
GCD = a + b;
for (ll i = 2; i * i <= GCD; i++) {
if (GCD % i == 0)
c++;
while (GCD % i == 0)
GC... | replace | 13 | 14 | 13 | 14 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll gcd(ll A, ll B) {
ll R = A % B;
if (R == 0) {
return B;
} else {
return gcd(B, R);
}
}
int main() {
ll A, B;
cin >> A >> B;
ll tar = gcd(A, B);
ll ans = 1, num = 2;
while (tar != 1) {
bool div = false;
whil... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll gcd(ll A, ll B) {
ll R = A % B;
if (R == 0) {
return B;
} else {
return gcd(B, R);
}
}
int main() {
ll A, B;
cin >> A >> B;
ll tar = gcd(A, B);
ll ans = 1, num = 2;
while (tar != 1) {
bool div = false;
if (... | insert | 23 | 23 | 23 | 28 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define FIND(x, target) find(x.begin(), x.... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define FIND(x, target) find(x.begin(), x.... | insert | 62 | 62 | 62 | 66 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> p;
#define rep(i, ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> p;
#define rep(i, ... | replace | 48 | 49 | 48 | 49 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
if (r == 0)
return b;
else
return gcd(b, r);
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll count = 1;
ll h = g;
for (int i = 2; i * i <= h; i+... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
ll r = a % b;
if (r == 0)
return b;
else
return gcd(b, r);
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll count = 1;
ll h = g;
for (ll i = 2; i * i <= h; i++... | replace | 25 | 26 | 25 | 26 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
ll a, b;
cin >> a >> b;
ll p = __gcd(a, b);
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
ll a, b;
cin >> a >> b;
ll p = __gcd(a, b);
... | replace | 26 | 27 | 26 | 27 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll gcd(ll a, ll b) {
while (b != 0) {
ll t = a % b;
a = b;
b = t;
}
return (a);
}
int main() {
ll a, b, GCD;
cin >> a >> b;
GCD = __gcd(a, b);
vector<ll> num;
for (int i = 1; i * i <= GCD; i++) {
if (GCD % i == 0)
... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll gcd(ll a, ll b) {
while (b != 0) {
ll t = a % b;
a = b;
b = t;
}
return (a);
}
int main() {
ll a, b, GCD;
cin >> a >> b;
GCD = __gcd(a, b);
vector<ll> num;
for (int i = 1; i <= sqrt(GCD); i++) {
if (GCD % i == 0)
... | replace | 16 | 17 | 16 | 17 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c = 1ll;
scanf("%lld %lld", &a, &b);
if (a > b)
swap(a, b);
long long d = b;
for (int i = 2; i * i <= b; i += (i == 2 ? 1 : 2)) {
if (d % i == 0) {
while (d % i == 0) {
d /= i;
}
if (a % i == 0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c = 1ll;
scanf("%lld %lld", &a, &b);
if (a > b)
swap(a, b);
long long d = b;
for (long long i = 2; i * i <= b; i += (i == 2 ? 1 : 2)) {
if (d % i == 0) {
while (d % i == 0) {
d /= i;
}
if (a % i == ... | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
const int INF = 1001001000;
const int mINF = -1001001000;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll common(ll x) {
ll res = 1;
for (int i = 2; i * i <= x; i++) {
if (x % i)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
const int INF = 1001001000;
const int mINF = -1001001000;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll common(ll x) {
ll res = 1;
for (ll i = 2; i * i <= x; i++) {
if (x % i)
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
// require: a > b
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll a, b;
cin >> a >> b;
ll gc = gcd(a, b);
if (gc == 1) {
cout << 1 << endl;
return 0;
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
// require: a > b
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll a, b;
cin >> a >> b;
ll gc = gcd(a, b);
if (gc == 1) {
cout << 1 << endl;
return 0;
}... | replace | 20 | 21 | 20 | 22 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 30
#define endl '\n'
#define maxn 100005
#define tc printf("Case %d: ", cs)
#define tcn printf("Case %d:\n", cs);
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
#define dbg1(x) ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 30
#define endl '\n'
#define maxn 100005
#define tc printf("Case %d: ", cs)
#define tcn printf("Case %d:\n", cs);
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
#define dbg1(x) ... | insert | 129 | 129 | 129 | 131 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((ll)x.size())
#define MOD (ll)(1e9 + 7)
#define INF (9e18)
#define EPS (1e-6)
#ifdef LOCAL_TES... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((ll)x.size())
#define MOD (ll)(1e9 + 7)
#define INF (9e18)
#define EPS (1e-6)
#ifdef LOCAL_TES... | replace | 59 | 60 | 59 | 60 | TLE | |
p02900 | C++ | Time Limit Exceeded | //----------BHAVIK DIWANI(PICT_COMP)---------------
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#define test \
ll t; \
cin >> t; ... | //----------BHAVIK DIWANI(PICT_COMP)---------------
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#define test \
ll t; \
cin >> t; ... | insert | 122 | 122 | 122 | 123 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ << ": " << #x << " = " << (x) << '\n')
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.beg... | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ << ": " << #x << " = " << (x) << '\n')
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.beg... | replace | 27 | 28 | 27 | 28 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// ll gcd(ll x, ll y){ return y ? gcd(y, x%y): x;}
// ll lcm(ll x, ll y){ return x*y/gcd(x, y);}
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
ll s = g;
ll ans = 1;
for (int i = 2; i * i <= s; i++) {
if (g % i == 0) {
a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// ll gcd(ll x, ll y){ return y ? gcd(y, x%y): x;}
// ll lcm(ll x, ll y){ return x*y/gcd(x, y);}
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
ll s = g;
ll ans = 1;
for (ll i = 2; i * i <= s; i++) {
if (g % i == 0) {
an... | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
ll s = g;
ll ans = 1;
for (int i = 2; i * i <= s; i++) {
if (g % i == 0) {
ans += 1;
while (g % i == 0) {
g ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
ll A, B;
cin >> A >> B;
ll g = gcd(A, B);
ll s = g;
ll ans = 1;
for (ll i = 2; i * i <= s; i++) {
if (g % i == 0) {
ans += 1;
while (g % i == 0) {
g /... | replace | 10 | 11 | 10 | 11 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
ll s = g;
ll ans = 1;
for (int i = 2; i * i <= s; i++) {
if (g % i == 0) {
ans += 1;
while (g % i == 0) {
g /= i;
}
}
}
if (g > 1) {
ans++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B;
cin >> A >> B;
ll g = __gcd(A, B);
ll s = g;
ll ans = 1;
for (ll i = 2; i * i <= s; i++) {
if (g % i == 0) {
ans += 1;
while (g % i == 0) {
g /= i;
}
}
}
if (g > 1) {
ans++;
... | replace | 9 | 10 | 9 | 10 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#de... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#de... | replace | 37 | 38 | 37 | 38 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define watch(x) cout << (#x) << " is " << (x) << endl
#define f(i, x, n) for (int i = x; i < n; i++)
#define FASTIO \
cin.tie(0); ... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define watch(x) cout << (#x) << " is " << (x) << endl
#define f(i, x, n) for (int i = x; i < n; i++)
#define FASTIO \
cin.tie(0); ... | replace | 73 | 74 | 73 | 74 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
bool DEBUG = true;
// find maximum kouyakusuu
// souinsuu bunkai the maximum kouyakusuu
// retu... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
bool DEBUG = true;
// find maximum kouyakusuu
// souinsuu bunkai the maximum kouyakusuu
// retu... | replace | 46 | 47 | 46 | 47 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int Prime[1000000]; // Pr... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int Prime[1000000]; // Pr... | replace | 48 | 50 | 48 | 50 | 0 | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
// 出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
// 出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (... | replace | 21 | 32 | 21 | 22 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll ans = 1;
for (int i = 2; i * i <= g; i++) {
if (!(g % i)) {
ans++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll ans = 1;
for (ll i = 2; i * i <= g; i++) {
if (!(g % i)) {
ans++;
... | replace | 13 | 14 | 13 | 14 | TLE | |
p02900 | C++ | Time Limit Exceeded | /**
* @Author: G_bg
* @DateTime: 2019-09-28 20:22:27
* @Description:
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const double PI = 3.1415926535898;
const double E = 2.718281828459;
const int INF = 0x7fffffff;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
LL gcd(LL a, LL b) {... | /**
* @Author: G_bg
* @DateTime: 2019-09-28 20:22:27
* @Description:
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const double PI = 3.1415926535898;
const double E = 2.718281828459;
const int INF = 0x7fffffff;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
LL gcd(LL a, LL b) {... | replace | 16 | 17 | 16 | 17 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(i) sort((i).begin(), (i).end())
#define INF 2000000000
constexpr ll mod = 1000000007;
ll gcd(ll x, ll y) { return y != 0 ? gcd(y, x % y) : x; }
vector<pair<ll, int>> factorize(ll N) {
vector<pair<ll, int>> res;
for (ll i = 0; i * i <=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(i) sort((i).begin(), (i).end())
#define INF 2000000000
constexpr ll mod = 1000000007;
ll gcd(ll x, ll y) { return y != 0 ? gcd(y, x % y) : x; }
vector<pair<ll, int>> factorize(ll N) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <=... | replace | 10 | 11 | 10 | 11 | -8 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll get_gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return ((a % b == 0 ? b : get_gcd(b, a % b)));
}
vector<pair<ll, ll>> prime_factorize(ll gcd) {
vector<pair<ll, ll>> ans;
for (int i = 2; i * i <= gcd; i++) {
if (gcd % i != 0)
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll get_gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return ((a % b == 0 ? b : get_gcd(b, a % b)));
}
vector<pair<ll, ll>> prime_factorize(ll gcd) {
vector<pair<ll, ll>> ans;
for (ll i = 2; i * i <= gcd; i++) {
if (gcd % i != 0)
co... | replace | 14 | 15 | 14 | 15 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#include <set>
using namespace std;
using ll = long long int;
// num: 12 -> {2, 3}
// num は最大で1e12
set<int> get_factors(ll num) {
ll n = num;
set<int> ret;
while (n % 2 == 0) {
n /= 2;
ret.insert(2);
}
// nは奇数
for (int i = 3; i * i <= num; i += 2) {
while (n % i == 0) {
... | #include <iostream>
#include <set>
using namespace std;
using ll = long long int;
// num: 12 -> {2, 3}
// num は最大で1e12
set<int> get_factors(ll num) {
ll n = num;
set<int> ret;
while (n % 2 == 0) {
n /= 2;
ret.insert(2);
}
// nは奇数
for (ll i = 3; i * i <= num; i += 2) {
while (n % i == 0) {
... | replace | 16 | 17 | 16 | 17 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> T gcd(T a, T b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B;
cin >> A >> B;
ll gcdn = gcd(A, B);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> T gcd(T a, T b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B;
cin >> A >> B;
ll gcdn = gcd(A, B);
... | replace | 22 | 23 | 22 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() // 昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> Vl;
typedef vector<int... | #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() // 昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> Vl;
typedef vector<int... | replace | 50 | 52 | 50 | 52 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<i... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<i... | delete | 48 | 51 | 48 | 48 | 0 | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int s = 1000000;
bool vis[s + 1];
bool is_prime[s + 1];
int main() {
long long int a, b, i, j, count = 0, num1, num2;
cin >> a >> b;
is_prime[0] = true;
for (i = 2; i * i <= s; i++) {
if (!is_prime[i]) {
for (j = i * i; j <= s; j += i) {
is... | #include <bits/stdc++.h>
using namespace std;
const int s = 1000000;
bool vis[s + 1];
bool is_prime[s + 1];
int main() {
long long int a, b, i, j, count = 0, num1, num2;
cin >> a >> b;
is_prime[0] = true;
for (i = 2; i * i <= s; i++) {
if (!is_prime[i]) {
for (j = i * i; j <= s; j += i) {
is... | replace | 43 | 45 | 43 | 44 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
long long int a, b, s, l, tmp;
cin >> a >> b;
s = (a < b) ? a : b;... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
long long int a, b, s, l, tmp;
cin >> a >> b;
s = (a < b) ? a : b;... | replace | 27 | 28 | 27 | 28 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long euclidean_gcd(long long a, long long b) {
long long temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (a % b == 0)
return b;
euclidean_gcd(b, a % b);
}
int main() {
long long A, B, cnt;
cnt = 0;
cin >> A;
cin >> B;
long l... | #include <bits/stdc++.h>
using namespace std;
long long euclidean_gcd(long long a, long long b) {
long long temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
if (a % b == 0)
return b;
euclidean_gcd(b, a % b);
}
int main() {
long long A, B, cnt;
cnt = 0;
cin >> A;
cin >> B;
long l... | replace | 26 | 27 | 26 | 27 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef unsigned long long ll;
// A > B
ll calcGCD(ll A, ll B) {
if (A % B == 0) {
return B;
} else {
calcGCD(B, A % B);
}
}
bool isPrime(l... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef unsigned long long ll;
// A > B
ll calcGCD(ll A, ll B) {
if (A % B == 0) {
return B;
} else {
calcGCD(B, A % B);
}
}
bool isPrime(l... | replace | 52 | 54 | 52 | 54 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int a, b, c, t, i;
int main() {
cin >> a >> b;
c = __gcd(a, b);
for (i = 2; i * i <= c; i++) {
if (c % i == 0) {
t++;
while (c % i == 0)
c /= i;
}
}
if (c != 1)
t++;
cout << t + 1;
}
| #include <bits/stdc++.h>
using namespace std;
long a, b, c, t, i;
int main() {
cin >> a >> b;
c = __gcd(a, b);
for (i = 2; i * i <= c; i++) {
if (c % i == 0) {
t++;
while (c % i == 0)
c /= i;
}
}
if (c != 1)
t++;
cout << t + 1;
}
| replace | 2 | 3 | 2 | 3 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long m, n, g, cnt = 1;
long long gcd(int m, int n) {
if (m % n == 0)
return n;
else
return gcd(n, m % n);
}
int main() {
cin >> m >> n;
g = gcd(m, n);
for (long long i = 2; i <= sqrt(g); i++) {
if (g % i == 0) {
cnt++;
while (g % i == ... | #include <bits/stdc++.h>
using namespace std;
long long m, n, g, cnt = 1;
long long gcd(long long m, long long n) {
if (m % n == 0)
return n;
else
return gcd(n, m % n);
}
int main() {
cin >> m >> n;
g = gcd(m, n);
for (long long i = 2; i <= sqrt(g); i++) {
if (g % i == 0) {
cnt++;
whil... | replace | 3 | 4 | 3 | 4 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ll a, b;
cin >> a >> b;
ll n = gcd(a, b);
int ans = 1;
for (int i = 2; i * i <= n; i++) {
i... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ll a, b;
cin >> a >> b;
ll n = gcd(a, b);
int ans = 1;
for (ll i = 2; i * i <= n; i++) {
if... | replace | 18 | 19 | 18 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL A, B;
int main() {
cin >> A >> B;
LL C = __gcd(A, B);
int ans = 0;
for (int i = 1; (LL)i * i <= C; i++)
if (C % i == 0) {
ans++;
while (C % i == 0)
C /= i;
}
if (C > 1)
ans++;
cout << ans + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL A, B;
int main() {
cin >> A >> B;
LL C = __gcd(A, B);
int ans = 0;
for (int i = 2; (LL)i * i <= C; i++)
if (C % i == 0) {
ans++;
while (C % i == 0)
C /= i;
}
if (C > 1)
ans++;
cout << ans + 1 << endl;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> T gcd(T a, T b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B;
cin >> A >> B;
ll gcdn = gcd(A, B);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> T gcd(T a, T b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B;
cin >> A >> B;
ll gcdn = gcd(A, B);
... | replace | 22 | 23 | 22 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 10010010010010010;
map<ll, int> prime_factor(ll N) {
map<ll, int> RES;
for (int I = 2; I * I <= N; I++) {
while (N % I =... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 10010010010010010;
map<ll, int> prime_factor(ll N) {
map<ll, int> RES;
for (ll I = 2; I * I <= N; I++) {
while (N % I ==... | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
using namespace std;
long long gcd(long long a, long long b) {
if (!b)
return a;
return gcd(b, a % b);
}
int main() {
long long a, b, g, t, ans = 1, tt;
cin >> a >> b;
g = gcd(a, b);
t = g;
int ss = sqrt(t);
for (int i = 2; i <= ss; i++) {
if (!(g % i)) {
... | #include <iostream>
#include <math.h>
using namespace std;
long long gcd(long long a, long long b) {
if (!b)
return a;
return gcd(b, a % b);
}
int main() {
long long a, b, g, t, ans = 1, tt;
cin >> a >> b;
g = gcd(a, b);
t = g;
int ss = sqrt(t);
for (int i = 2; i <= ss; i++) {
if (!(g % i)) {
... | replace | 21 | 29 | 21 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a > b)
return gcd(a, b);
if (a == 0)
return b;
return gcd(b % a, a);
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll ans = 1;
for (ll i = 2; i * i <= g; i++) {
if (g % i != 0)
cont... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a > b)
return gcd(b, a);
if (a == 0)
return b;
return gcd(b % a, a);
}
int main() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
ll ans = 1;
for (ll i = 2; i * i <= g; i++) {
if (g % i != 0)
cont... | replace | 5 | 6 | 5 | 6 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll A, B;
cin >> A >> B;
ll C = gcd(A, B);
int cnt = 1;
for (int i = 2; i * i <= C; i++)
if (C % i == 0) {
while (C % i == 0) {
... | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll A, B;
cin >> A >> B;
ll C = gcd(A, B);
int cnt = 1;
for (ll i = 2; i * i <= C; i++)
if (C % i == 0) {
while (C % i == 0) {
... | replace | 16 | 17 | 16 | 17 | TLE | |
p02900 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
ll A, B, C;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin >> A >> B;
C = gcd(A, B);
int cnt = 1;
for (ll i = 0; i * i <= C; i++) {
if (C % i != 0)
continue;
while (C % i... | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
ll A, B, C;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin >> A >> B;
C = gcd(A, B);
int cnt = 1;
for (ll i = 2; i * i <= C; i++) {
if (C % i != 0)
continue;
while (C % i... | replace | 17 | 18 | 17 | 18 | -8 | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
long long n, m, ans;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
cin >> n >> m;
m = gcd(n, m);
for (int i = 2; i * i <= m; i++) {
if (m % i == 0) {
++ans;
while (m % i == 0)
... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
long long n, m, ans;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
cin >> n >> m;
m = gcd(n, m);
for (long long i = 2; i * i <= m; i++) {
if (m % i == 0) {
++ans;
while (m % i ... | replace | 9 | 10 | 9 | 10 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, m, n) for (ll(i) = (m), i##_len = (n); (i) < (i##_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define _PR(x) cout << (x) << endl
#define _PS(x) cout << (x) << " "
#define SZ(x) ((int)(x).size... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, m, n) for (ll(i) = (m), i##_len = (n); (i) < (i##_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define _PR(x) cout << (x) << endl
#define _PS(x) cout << (x) << " "
#define SZ(x) ((int)(x).size... | delete | 53 | 58 | 53 | 53 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
/*
最大公約数の素因数の個数+1
a, bの公約数 ＝ GCD(a, b)の約数
*/
// ユークリッドの互除法: x>y
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
// 素因数分解: vector(素因数, 数)
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
/*
最大公約数の素因数の個数+1
a, bの公約数 ＝ GCD(a, b)の約数
*/
// ユークリッドの互除法: x>y
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
// 素因数分解: vector(素因数, 数)
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> re... | replace | 23 | 24 | 23 | 24 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for (long long i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; --i)
#define yesno(flag) \
if (flag) \
c... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for (long long i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; --i)
#define yesno(flag) \
if (flag) \
c... | insert | 43 | 43 | 43 | 47 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define inc(a) sort(a.begin(), a.end())
#define dec(a) sort(a.rbegin(), a.rend())
#define loop(n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
ll a, b;
cin >> a >> b;
ll count = 1, m = __gcd(a, b);
for (ll i = 2; i <= m; i++) {
if (m % i == 0) {... | #include <bits/stdc++.h>
#define ll long long
#define inc(a) sort(a.begin(), a.end())
#define dec(a) sort(a.rbegin(), a.rend())
#define loop(n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
ll a, b;
cin >> a >> b;
ll count = 1, m = __gcd(a, b);
for (ll i = 2; i * i <= m; i++) {
if (m % i == ... | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | replace | 31 | 32 | 31 | 32 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
constexpr long long mod = 1000000007;
constexpr double eps = 0.0... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
constexpr long long mod = 1000000007;
constexpr double eps = 0.0... | replace | 31 | 32 | 31 | 32 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
while (b != 0) {
ll r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
ll a, b;
cin >> a >> b;
ll n = gcd(a, b);
int ans = 1;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
++ans;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
while (b != 0) {
ll r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
ll a, b;
cin >> a >> b;
ll n = gcd(a, b);
int ans = 1;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
++ans;
... | replace | 20 | 21 | 20 | 21 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main(void) {
long long a, b;
cin >> a >> b;
ll g = gcd(a, b);
int ans = 1;
if (g % 2 == 0) {
ans++;
while (!(g % ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main(void) {
long long a, b;
cin >> a >> b;
ll g = gcd(a, b);
int ans = 1;
if (g % 2 == 0) {
ans++;
while (!(g % ... | replace | 23 | 24 | 23 | 24 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll a, b;
cin >> a >> b;
ll d = gcd(a, b);
ll r = 1;
ll t = d;
for (int i = 2; i <= t && i * i <= d; i++) {
if (t % i == 0) {
r++;
while (t % i == 0)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll a, b;
cin >> a >> b;
ll d = gcd(a, b);
ll r = 1;
ll t = d;
for (ll i = 2; i <= t && i * i <= d; i++) {
if (t % i == 0) {
r++;
while (t % i == 0)
... | replace | 12 | 13 | 12 | 13 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll A, B;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
cin >> A >> B;
ll u = gcd(A, B);
ll count = 0;
if (u % 2 == 0)
count... | #include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll A, B;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
cin >> A >> B;
ll u = gcd(A, B);
ll count = 0;
if (u % 2 == 0)
count... | replace | 21 | 22 | 21 | 22 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
... | replace | 17 | 18 | 17 | 18 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (int p = 2; p * p <= n; p++) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
num++;
n /= p;
}
res.push_back... | #include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long long p = 2; p * p <= n; p++) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
num++;
n /= p;
}
res.pus... | replace | 5 | 6 | 5 | 6 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll BIG = 1e9;
bool is_prime[1000002];
vector<int> P;
void Eratosthenes(const int N) {
for (int i = 0; i <= N; i++) {
is_prime[i] = true; // 初期化
}
for (int i = 2; i <= N; i++) {
if (is_... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll BIG = 1e9;
bool is_prime[1000002];
vector<int> P;
void Eratosthenes(const int N) {
for (int i = 0; i <= N; i++) {
is_prime[i] = true; // 初期化
}
for (int i = 2; i <= N; i++) {
if (is_... | insert | 59 | 59 | 59 | 61 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int i = ((a) + (b)-1); i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int i = ((a) + (b)-1); i... | insert | 12 | 12 | 12 | 16 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long a, b;
cin >> a >> b;
auto factorize = [](long long n) {
set<long long> res;
int d = 2;
while (d * d <= n) {
while (n % d == 0) {
n /= d;
res.insert(d);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long a, b;
cin >> a >> b;
auto factorize = [](long long n) {
set<long long> res;
long long d = 2;
while (d * d <= n) {
while (n % d == 0) {
n /= d;
res.insert(d)... | replace | 13 | 14 | 13 | 14 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define fs first
#define sc second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define fs first
#define sc second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}... | replace | 178 | 179 | 178 | 179 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define fs first
#define sc second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define fs first
#define sc second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}... | replace | 142 | 143 | 142 | 143 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, k, n) for (int i = (k); i < (n); i++)
#define irep(i, k, n) for (int i = (k); i > (n); i--)
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main(void) {
ll a, b;
cin >> a >... | #include <bits/stdc++.h>
#define rep(i, k, n) for (int i = (k); i < (n); i++)
#define irep(i, k, n) for (int i = (k); i > (n); i--)
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main(void) {
ll a, b;
cin >> a >... | replace | 15 | 17 | 15 | 17 | -8 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define all(t) (t).begin(), (t).end()
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inl... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define all(t) (t).begin(), (t).end()
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inl... | replace | 38 | 39 | 38 | 39 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.