problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02899 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#pragma region Macros
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define all(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
int ... | replace | 32 | 34 | 32 | 34 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
cin >> n;
vector<int> a(10000), ans(10000, 0);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
ans.at(a.at(i) - 1) += i + 1;
}
for (int i = 0; i < n; i++) {
cout << ans.at(i) << " ";
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
cin >> n;
vector<int> a(n), ans(n, 0);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
ans.at(a.at(i) - 1) += i + 1;
}
for (int i = 0; i < n; i++) {
cout << ans.at(i) << " ";
}
cout... | replace | 8 | 9 | 8 | 9 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
cin >> a;
vector<int> vec(a);
vector<int> mvec(a);
rep(i, a) { cin >> vec.at(i); }
rep(i, a) { mvec.at(vec.at(i)) = i + 1; }
rep(i, a) { cout << vec.... | #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
cin >> a;
vector<int> vec(a);
vector<int> mvec(a);
rep(i, a) { cin >> vec.at(i); }
rep(i, a) { mvec.at(vec.at(i) - 1) = i + 1; }
rep(i, a) { cout << ... | replace | 11 | 13 | 11 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<int> ans(N);
for (int i = 1; i <= N; i++) {
for (int j = 0; j < N; j++) {
if (vec.at(j) != i) {
continue;
}
if (vec.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<int> ans(N);
for (int i = 0; i < N; i++) {
ans.at(vec.at(i) - 1) = i + 1;
}
for (int i = 0; i < N; i++) {
if (i != N - 1)
cout <... | replace | 12 | 22 | 12 | 14 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(10001);
vector<int> b(10001);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
b.at(a.at(i) - 1) = i + 1;
for (int i = 0; i < n; i++)
cout << b.at(i) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(100001);
vector<int> b(100001);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
b.at(a.at(i) - 1) = i + 1;
for (int i = 0; i < n; i++)
cout << b.at(i) << endl;
} | replace | 6 | 8 | 6 | 8 | 0 | |
p02899 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), ans(N);
for (int i = 1; i <= N; ++i) {
int n;
cin >> n;
A[n] = i;
}
for (int i = 0; i < N; ++i) {
cout << A[i] << " ";
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), ans(N);
for (int i = 1; i <= N; ++i) {
int n;
cin >> n;
A[n - 1] = i;
}
for (int i = 0; i < N; ++i) {
cout << A[i] << " ";
}
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], num[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (A[j] == i + 1) {
cout << j + 1 << ' ';
}
}
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], num[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
num[A[i] - 1] = i + 1;
}
for (int i = 0; i < N; i++) {
cout << num[i] << ' ';
}
cout << endl;
return 0;
} | replace | 11 | 16 | 11 | 15 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> seito(n);
for (int i = 0; i < n; i++) {
cin >> seito.at(i);
}
for (int i = 1; i < n + 1; i++) {
for (int j = 0; j < n; j++) {
if (i == seito.at(j)) {
if (i == n) {
cout << j + 1 << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> seito(n);
for (int i = 0; i < n; i++) {
cin >> seito.at(i);
}
vector<int> ans(n);
for (int i = 0; i < n; i++) {
ans.at(seito.at(i) - 1) = i;
}
for (int i = 0; i < n; i++) {
cout << ans.at(i) + 1 << ... | replace | 12 | 24 | 12 | 19 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 1; i <= N; i++) {
for (int j = 0; j < N; j++) {
if (A.at(j) == i) {
cout << j + 1 << " ";
break;
}
}
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
B.at(A.at(i) - 1) = i + 1;
}
for (int i = 0; i < N; i++) {
cout << B.at(i) << " ";
}
cout << en... | replace | 10 | 17 | 10 | 16 | TLE | |
p02899 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1); // 3.1415926535897932384626433832795028...
const ll SIZE... | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1); // 3.1415926535897932384626433832795028...
const ll SIZE... | replace | 71 | 72 | 71 | 72 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end() // 使うときはsort(all())という感じで
using ll = long long;
#define PI 3.14159265359
int main() {
int n;
cin >> n;
vector<int> num(n), ans(n + 1, 0);
rep(i, n) {
cin >> num[i + 1];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end() // 使うときはsort(all())という感じで
using ll = long long;
#define PI 3.14159265359
int main() {
int n;
cin >> n;
vector<int> num(n + 1, 0), ans(n + 1, 0);
rep(i, n) {
cin >> num[i ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, order;
// input
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
// calc
for (int i = 0; i < N; i++) {
order = i + 1;
for (int j = 0; j < N; j++) {
if (A.at(j) == order) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, order;
// input
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
B.at(A.at(i) - 1) = i + 1;
}
// output
for (int i = 0; i < N; i++) {
cout << B.at(i) << " ";
}
cout << endl;
... | replace | 12 | 24 | 12 | 13 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 1; i < N + 1; i++) {
std::vector<int>::iterator itr = std::find(A.begin(), A.end(), i)... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
B[A[i] - 1] = i + 1;
}
for (int i = 0; i < N... | replace | 15 | 18 | 15 | 22 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
A.push_back(a);
}
vector<int> Ranking;
for (int rank = 1; rank <= n; rank++) {
for (int i = 0; i < n; i++) {
if (rank == A[i]) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
A.push_back(a);
}
vector<int> Ranking(n, 0);
for (int i = 0; i < n; i++) {
Ranking[A[i] - 1] = i + 1;
}
for (int i = 0; i < n; i++... | replace | 16 | 23 | 16 | 19 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define ve vector
#define vii vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define sz size
#define len length
#define se secon... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define ve vector
#define vii vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define sz size
#define len length
#define se secon... | replace | 32 | 37 | 32 | 33 | -11 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[N], b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 1; i < N + 1; i++) {
for (int j = 0; j < N; j++) {
if (a[j] == i) {
b[i - 1] = j + 1;
break;
}
}
}
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a[N], b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
b[a[i] - 1] = i + 1;
}
for (int i = 0; i < N; i++) {
cout << b[i] << endl;
}
return 0;
} | replace | 11 | 18 | 11 | 13 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
int main() {
using namespace std; // swap
int n, value;
cin >> n;
vector<int> vec(n + 1), ivec(n + 1);
for (int i = 1; i <= n; i++)
cin >> vec[i];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (i == v... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
int main() {
using namespace std; // swap
int n, value;
cin >> n;
vector<int> vec(n + 1), ivec(n + 1);
for (int i = 1; i <= n; i++)
cin >> vec[i];
for (int i = 1; i <= n; i++)
ivec[vec[i]] = i;
for (int i = 1; i <= n; i... | replace | 12 | 17 | 12 | 13 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define M 1005
#define N 15
#define ll long long
int arr[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
arr[x] = i;
}
for (int i = 1; i <= n; i++)
cout << arr[i] << " ";
return 0;
}
/*
2 3
10 1
1
15 1
2
30 2
1... | #include <bits/stdc++.h>
using namespace std;
#define N 100005
#define ll long long
int arr[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
arr[x] = i;
}
for (int i = 1; i <= n; i++)
cout << arr[i] << " ";
return 0;
}
/*
2 3
10 1
1
15 1
2
30 2
1 2
*/
| replace | 3 | 5 | 3 | 4 | 0 | |
p02899 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int N;
int main() {
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<int> rev(N);
rep(i, N) rev[A[i] - 1] = i++;
rep(i, N) cout << rev[i] << " ";
re... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int N;
int main() {
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<int> rev(N);
rep(i, N) rev[A[i] - 1] = i + 1;
rep(i, N) cout << rev[i] << " ";
... | replace | 15 | 16 | 15 | 16 | -6 | double free or corruption (out)
|
p02899 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
struct Node {
int num;
int v;
} a[10010];
bool cmp(Node a, Node b) { return a.num < b.num; }
int n;
using namespace std;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].num;
a[i].v = i;
}
sort(a + 1, a + n ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
struct Node {
int num;
int v;
} a[100100];
bool cmp(Node a, Node b) { return a.num < b.num; }
int n;
using namespace std;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].num;
a[i].v = i;
}
sort(a + 1, a + n... | replace | 7 | 8 | 7 | 8 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans(n);
rep(i, n) {
rep(j, n) {
if (a[j] == (i + 1)) {
ans[i] = (j + 1);
}
}
}
rep(i, n) co... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans(n);
rep(i, n) ans[a[i] - 1] = i + 1;
rep(i, n) cout << ans[i] << ' ';
cout << endl;
return 0;
} | replace | 11 | 18 | 11 | 12 | TLE | |
p02899 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, i, temp;
cin >> n;
int *brr = new int(n);
for (i = 0; i < n; i++) {
cin >> temp;
brr[temp - 1] = i + 1;
}
for (i = 0; i < n; i++) {
cout << brr[i] << ' ';
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, i, temp;
cin >> n;
int brr[100000];
for (i = 0; i < n; i++) {
cin >> temp;
brr[temp - 1] = i + 1;
}
for (i = 0; i < n; i++) {
cout << brr[i] << ' ';
}
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02899 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
b[a[i]] = i + 1;
}
for (int i ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
b[a[i] - 1] = i + 1;
}
for (in... | replace | 17 | 18 | 17 | 18 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
rep(i, N) {
auto iter = find(A.begin(), A.end(), i + 1);
auto index = distance(A.begin(), iter);
cout << index... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
map<int, int> order;
rep(i, N) { order[--A[i]] = i + 1; }
rep(i, N) { cout << order[i] << " "; }
cout << endl;
ret... | replace | 10 | 15 | 10 | 13 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define maxim (ll)1000000000000
#define PB push_back
#define MP make_pair
using namespace std;
bool sortbysecond(const pair<ll, ll> &a, const pair<ll, ll> &b) {
if (a.second < b.second)
return true;
else
return false;
}
int main() {
#i... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define maxim (ll)1000000000000
#define PB push_back
#define MP make_pair
using namespace std;
bool sortbysecond(const pair<ll, ll> &a, const pair<ll, ll> &b) {
if (a.second < b.second)
return true;
else
return false;
}
int main() {
... | replace | 14 | 18 | 14 | 15 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int a[10010] = {};
int b[10010] = {};
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
b[a[i]] = i;
}
for (int i = 1; i <= n; i++) {
cout << b[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int a[100100] = {};
int b[100100] = {};
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
b[a[i]] = i;
}
for (int i = 1; i <= n; i++) {
cout << b[i] << endl;
}
}
| replace | 4 | 6 | 4 | 6 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
using LL = long long;
template <typename T> using V = vector<T>;
using Vi = V<int>;
using Vll = V<LL>;
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
using LL = long long;
template <typename T> using V = vector<T>;
using Vi = V<int>;
using Vll = V<LL>;
... | delete | 69 | 76 | 69 | 69 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | replace | 38 | 39 | 38 | 39 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
// #pragma GCC optimize("unroll-loops,no-stack-protector")
// #pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
ty... | #include <bits/stdc++.h>
// #pragma GCC optimize("unroll-loops,no-stack-protector")
// #pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
ty... | replace | 16 | 20 | 16 | 20 | 0 | |
p02900 | C++ | Time Limit Exceeded | /*
https://t.me/unstoppabIesoIvemachinechannel
*/
#pragma ARCENIY_KIRILLOV_POVELITEL_KROKODILOV
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC pu... | /*
https://t.me/unstoppabIesoIvemachinechannel
*/
#pragma ARCENIY_KIRILLOV_POVELITEL_KROKODILOV
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC pu... | replace | 44 | 46 | 44 | 46 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long int gcd(long long int x, long long int y) {
if (y == 0) {
return x;
}
return gcd(y, x % y);
}
int main(void) {
long long int A, B, ans = 1;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long int gcd(long long int x, long long int y) {
if (y == 0) {
return x;
}
return gcd(y, x % y);
}
int main(void) {
long long int A, B, ans = 1;
... | replace | 21 | 22 | 21 | 22 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
vector<int> primes;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void prime_list() {
primes.push_back(2);
for (int i = 3; i <= 1000009; i += 2) {
int tmp = primes.size();
for (int j = 0; primes[j... | #include <iostream>
#include <vector>
using namespace std;
vector<int> primes;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void prime_list() {
primes.push_back(2);
for (int i = 3; i <= 1000009; i += 2) {
int tmp = primes.size();
for (int j = 0; primes[j... | replace | 29 | 30 | 29 | 30 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n, m;
int ans = 1;
int main() {
scanf("%lld%lld", &n, &m);
for (int i = 2; i * i <= n; i++)
if (n % i == 0) {
while (n % i == 0)
n /= i;
if (m % i == 0)
ans++;
while (m % i == 0)
m /= i;
}
if (n != 1)
if ... | #include <bits/stdc++.h>
using namespace std;
long long n, m;
int ans = 1;
int main() {
scanf("%lld%lld", &n, &m);
for (int i = 2; 1ll * i * i <= n; i++)
if (n % i == 0) {
while (n % i == 0)
n /= i;
if (m % i == 0)
ans++;
while (m % i == 0)
m /= i;
}
if (n != 1)
... | replace | 6 | 7 | 6 | 7 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
/********************************************
This code belongs to Pranay Mishra
The following template belongs to Anil Kumar
*******************************************/
#define bolt \
ios_base::sync_wit... | #include <bits/stdc++.h>
using namespace std;
/********************************************
This code belongs to Pranay Mishra
The following template belongs to Anil Kumar
*******************************************/
#define bolt \
ios_base::sync_wit... | replace | 84 | 85 | 84 | 85 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
using name... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
using name... | replace | 26 | 27 | 26 | 27 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long int i = 0; i < n; i++)
#define P pair<long int, long int>
vector<P> prime;
long int gcd(long int x, long int y) {
if (y == 0)
retu... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long int i = 0; i < n; i++)
#define P pair<long int, long int>
vector<P> prime;
long int gcd(long int x, long int y) {
if (y == 0)
retu... | replace | 23 | 24 | 23 | 24 | TLE | |
p02900 | C++ | Runtime Error | // 参加気分でさ
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#defi... | // 参加気分でさ
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#defi... | replace | 45 | 46 | 45 | 46 | 0 | |
p02900 | C++ | Runtime Error | #include <iomanip>
#include <iostream>
#include <map>
#include <utility>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
ll gcd(ll a, ll b) {
int x, y;
x = max(a, b);
y = min(a, b);
if (x % y == 0) {
return y;
... | #include <iomanip>
#include <iostream>
#include <map>
#include <utility>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
ll gcd(ll a, ll b) {
ll x, y;
x = max(a, b);
y = min(a, b);
if (x % y == 0) {
return y;
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool c... | replace | 51 | 52 | 51 | 52 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
typedef long long ll;
using namespace std;
const ll mod = 998244353;
template <class T> inline T lcm(T a, T b) { return (a * b / __gcd(a, b)); }
int main() {
... | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
typedef long long ll;
using namespace std;
const ll mod = 998244353;
template <class T> inline T lcm(T a, T b) { return (a * b / __gcd(a, b)); }
int main() {
... | replace | 16 | 17 | 16 | 17 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) \
for (auto x : (V)) \
cout << x << " " << endl;
using namespace ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) \
for (auto x : (V)) \
cout << x << " " << endl;
using namespace ... | replace | 71 | 72 | 71 | 72 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <stdio.h>
#include <tuple>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
ll GCD(ll a, ll b) {
if (a < b)
swap(a, b);
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll a, b;
int main() {
scanf("%lld %lld", &a, &b);
ll G = GCD(a, b), d = G;
... | #include <algorithm>
#include <stdio.h>
#include <tuple>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
ll GCD(ll a, ll b) {
if (a < b)
swap(a, b);
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll a, b;
int main() {
scanf("%lld %lld", &a, &b);
ll G = GCD(a, b), d = G;
... | replace | 21 | 22 | 21 | 22 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return (gcd(b, a % b));
}
int main() {
long long a, b, g, ans;
cin >> a >> b;
g = gcd(a, ... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return (gcd(b, a % b));
}
int main() {
long long a, b, g, ans;
cin >> a >> b;
g = gcd(a, ... | replace | 22 | 23 | 22 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int a, b, c, i, ans;
int main() {
cin >> a >> b;
c = __gcd(a, b);
for (i = 2; i * i <= c; ++i) {
if (c % i == 0) {
++ans;
while (c % i == 0) {
c /= i;
}
}
}
if (c != 1) {
++ans;
}
cout << ans + 1;
} | #include <bits/stdc++.h>
using namespace std;
long a, b, c, i, ans;
int main() {
cin >> a >> b;
c = __gcd(a, b);
for (i = 2; i * i <= c; ++i) {
if (c % i == 0) {
++ans;
while (c % i == 0) {
c /= i;
}
}
}
if (c != 1) {
++ans;
}
cout << ans + 1;
} | replace | 2 | 3 | 2 | 3 | TLE | |
p02900 | C++ | Runtime Error | /* while(!cin.eof()) */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod (int)(1e9 + 7)
#define MAXI (int)(1e15 + 100)
#define N 1000500
// Driver code to test above functions
int32_t main() {
#ifndef ONLINE_JUDGE
// for getting input from inpu.txt
freopen("input.txt", "r", stdin);... | /* while(!cin.eof()) */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod (int)(1e9 + 7)
#define MAXI (int)(1e15 + 100)
#define N 1000500
// Driver code to test above functions
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >>... | delete | 11 | 18 | 11 | 11 | 0 | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod 1000000007
#define MAX 1000000000000000
#define all(v) v.begin(), v.end()
#define rep(i, ... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod 1000000007
#define MAX 1000000000000000
#define all(v) v.begin(), v.end()
#define rep(i, ... | replace | 49 | 50 | 49 | 50 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << #x << ": " << x << '\n';
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, n, cnt = 1;
cin >> a >> b;
n ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << #x << ": " << x << '\n';
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, n, cnt = 1;
cin >> a >> b;
n ... | replace | 14 | 15 | 14 | 15 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int GCD(int a, int b) {
if (a % b == 0)
return b;
return GCD(b, a % b);
}
// 素因数分解
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
f... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll GCD(ll a, ll b) {
if (a % b == 0)
return b;
return GCD(b, a % b);
}
// 素因数分解
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for ... | replace | 5 | 6 | 5 | 6 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
long long gcd(long long x, long long y) {
if (y)
return gcd(y, x % y);
else
return x;
}
int main() {
long long a, b;
cin >> a >> b;
long long g = gcd(a, b);
long long count = 1;
int i;
for (i = 2; i * i <= g; i++) {
if (g % i)
continue;
c... | #include <iostream>
using namespace std;
long long gcd(long long x, long long y) {
if (y)
return gcd(y, x % y);
else
return x;
}
int main() {
long long a, b;
cin >> a >> b;
long long g = gcd(a, b);
long long i, count = 1;
for (i = 2; i * i <= g; i++) {
if (g % i)
continue;
count++... | replace | 15 | 17 | 15 | 16 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define IO_OP \
std::ios::sync_with_stdio(0); \
std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_bac... | #include <bits/stdc++.h>
#define IO_OP \
std::ios::sync_with_stdio(0); \
std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_bac... | replace | 27 | 28 | 27 | 28 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
typedef long long int ll;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(_... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
typedef long long int ll;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(_... | replace | 42 | 43 | 42 | 43 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end()); // 昇順に並べる
return ret;
... | #include <bits/stdc++.h>
using namespace std;
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end()); // 昇順に並べる
return ret;
... | replace | 19 | 33 | 19 | 36 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
long long calc_gcd(long long a, long long b) {
long long x = max(a, b), y = min(a, b);
if (y == 0) {
return x;
} else {
return calc_gcd(b, a % b);
}
}
int main() {
long long A, B;
cin >> A >> B;
long long gcd = calc_gcd(A, B);
// cout... | #include <iostream>
#include <vector>
using namespace std;
long long calc_gcd(long long a, long long b) {
long long x = max(a, b), y = min(a, b);
if (y == 0) {
return x;
} else {
return calc_gcd(b, a % b);
}
}
int main() {
long long A, B;
cin >> A >> B;
long long gcd = calc_gcd(A, B);
// cout... | replace | 21 | 22 | 21 | 22 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (int i = 2; i * i < n; ++i) {
ll num = 0;
if (n % i != 0)
continue;
while (n % i == 0) {
++num;
n /= i;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (ll i = 2; i * i < n; ++i) {
ll num = 0;
if (n % i != 0)
continue;
while (n % i == 0) {
++num;
n /= i;
... | replace | 7 | 8 | 7 | 8 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
ll gcd(int x, int y) {
if (x % y == 0)
return y;
else {
return gcd(y, x % y);
}
}
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
else {
return gcd(y, x % y);
}
}
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for ... | replace | 6 | 7 | 6 | 7 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
using namespace std;
set<int> pfact(int a) {
set<int> ret;
// cout<<1<<endl;
for (int i = 2; i * i <= a; i++) {
// cout<<i<<endl;
if (a % i == 0)
ret.insert(i);
while (a % i == 0)
a /= i;
}
// cout<<2<<endl;
if (a != 1) {
ret.inse... | #include <bits/stdc++.h>
#define int long long
using namespace std;
set<int> pfact(int a) {
set<int> ret;
// cout<<1<<endl;
for (int i = 2; i * i <= a; i++) {
// cout<<i<<endl;
if (a % i == 0)
ret.insert(i);
while (a % i == 0)
a /= i;
}
// cout<<2<<endl;
if (a != 1) {
ret.inse... | replace | 40 | 42 | 40 | 42 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int>>;
const ll LINF = 1LL << 60;
const int INF = 1 << 29;
const ll MOD = 1e9 + 7;
vector<ll> prime_fac(ll n... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int>>;
const ll LINF = 1LL << 60;
const int INF = 1 << 29;
const ll MOD = 1e9 + 7;
vector<ll> prime_fac(ll n... | replace | 18 | 19 | 18 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
vector<ll> factor(ll a) {
vector<ll> v;
for (int i = 2; i * i <= a; i++) {
if (a % i != 0)
continue;
while (a % i == 0)
a /= i;
v.push_back(i);
}
if (a > 1)
v.push_back(a);
return v;
}
int main() {
ll a, b;
cin... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
vector<ll> factor(ll a) {
vector<ll> v;
for (ll i = 2; i * i <= a; i++) {
if (a % i != 0)
continue;
while (a % i == 0)
a /= i;
v.push_back(i);
}
if (a > 1)
v.push_back(a);
return v;
}
int main() {
ll a, b;
cin ... | replace | 6 | 7 | 6 | 7 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h> // ver2.1.4
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define Pii pair<int, int>
#define Tiii tuple<int, int, int>
#define PQi priority_queue<int>
#define PQir priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define ... | #include <bits/stdc++.h> // ver2.1.4
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define Pii pair<int, int>
#define Tiii tuple<int, int, int>
#define PQi priority_queue<int>
#define PQir priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define ... | replace | 102 | 103 | 102 | 103 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#d... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#d... | replace | 78 | 79 | 78 | 79 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (int i = num, i##_len = (... | #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 <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long GCD(long long a, long long b) {
if (b == 0) {
return a;
}
GCD(b, a % b);
}
bool IsPrime(long long n) {
if (n == 1... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long GCD(long long a, long long b) {
if (b == 0) {
return a;
}
GCD(b, a % b);
}
bool IsPrime(long long n) {
if (n == 1... | insert | 82 | 82 | 82 | 86 | TLE | |
p02900 | C++ | Time Limit Exceeded | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author TM
*/
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define S... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author TM
*/
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define S... | replace | 27 | 28 | 27 | 28 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
int main() {
long long a, b, ans = 0, k, i = 2;
cin >> a >> b;
k = (a > b ? gcd(a, b) : gcd(b, a));
while (k > 1) {
if (k % i == 0) {
ans++;
while (k % i == 0)
k /= ... | #include <iostream>
using namespace std;
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
int main() {
long long a, b, ans = 0, k, i = 2;
cin >> a >> b;
k = (a > b ? gcd(a, b) : gcd(b, a));
while (k > 1) {
if (i * i > k) {
ans++;
break;
}
if (k % i == 0) ... | insert | 9 | 9 | 9 | 13 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long a, b;
cin >> a >> b;
long long g = __gcd(a, b);
map<int, int> mp;
for (int i = 2; i * i <= g; i++) {
while (g % i == 0) {
mp[i]++;
g /= i;
}
}
if (g > 1)
mp[g]++;
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long a, b;
cin >> a >> b;
long long g = __gcd(a, b);
map<int, int> mp;
for (int i = 2; (long long)i * i <= g; i++) {
while (g % i == 0) {
mp[i]++;
g /= i;
}
}
if (g > 1)
m... | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long llong;
// refering to exp.
int main() {
llong a, b;
cin >> a >> b;
llong n = __gcd(a, b);
llong cnt = 1;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
cnt++;
while (n % i == 0)
n /= i;
}
}
... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long llong;
// refering to exp.
int main() {
llong a, b;
cin >> a >> b;
llong n = __gcd(a, b);
llong cnt = 1;
for (llong i = 2; i * i <= n; ++i) {
if (n % i == 0) {
cnt++;
while (n % i == 0)
n /= i;
}
}
... | replace | 12 | 13 | 12 | 13 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
signed main() {
int A, B, i;
scanf("%lld%lld", &A, &B);
int g = gcd(A, B);
int ans = 0;
for (i = 1; i * i <= g; i++) {
if (g % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
signed main() {
int A, B, i;
scanf("%lld%lld", &A, &B);
int g = gcd(A, B);
int ans = 1;
for (i = 2; i * i <= g; i++) {
if (g % i == 0) {
... | replace | 16 | 18 | 16 | 18 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REAP(i, a, n) for (int i = (a); i < (n); i++)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define fr first
#define sc second
#define pb push_back
#define All(v) v.begin(), v.end()
typedef long long ll... | #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REAP(i, a, n) for (int i = (a); i < (n); i++)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define fr first
#define sc second
#define pb push_back
#define All(v) v.begin(), v.end()
typedef long long ll... | replace | 28 | 29 | 28 | 29 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mp make_pair
#define pb push_back
#define fr first
#define se second
#define forn(i, a, n) for (int i = a; i < n; i++)
#define foreach(i, c) \
for (__typeof(c.begin()) i = (c.begin()... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mp make_pair
#define pb push_back
#define fr first
#define se second
#define forn(i, a, n) for (int i = a; i < n; i++)
#define foreach(i, c) \
for (__typeof(c.begin()) i = (c.begin()... | replace | 29 | 31 | 29 | 31 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
int tbl[1000010] = {};
vector<int> so;
signed main() {
int a, b;
cin >> a >> b;
for (int i = 2; i * i <= max(a, b); i++) {
if (tbl[i] == 0) {
so.push_back(i);
for (int j = i * 2; j <= max(a, b); j += i) {
tbl[i] = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int tbl[1000010] = {};
vector<int> so;
signed main() {
int a, b;
cin >> a >> b;
for (int i = 2; i * i <= max(a, b); i++) {
if (tbl[i] == 0) {
so.push_back(i);
for (int j = i * 2; j * j <= max(a, b); j += i) {
tbl[i] =... | replace | 16 | 17 | 16 | 17 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
long long AA, BB;
AA = A, BB = B;
long long k = 1;
long long j = 0;
while (k > 0) {
j = A / B;
k = A % B;
A = B;
B = k;
}
int count = 1;
long long E = A;
int x = max(sqrt(AA), sqrt(BB));
//... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
long long AA, BB;
AA = A, BB = B;
long long k = 1;
long long j = 0;
while (k > 0) {
j = A / B;
k = A % B;
A = B;
B = k;
}
int count = 1;
long long E = A;
int x = max(sqrt(AA), sqrt(BB));
//... | replace | 20 | 21 | 20 | 21 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, b, a) for (int i = (b)-1; i >= 0; --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n)-1; i >= 0; --i)
#define ITER(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define SORT(v) ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, b, a) for (int i = (b)-1; i >= 0; --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n)-1; i >= 0; --i)
#define ITER(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define SORT(v) ... | replace | 22 | 23 | 22 | 23 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define MAX_N 51
using namespace std;
// Aの約数とBの約数のから互いに素であるものを選んだ時の最大個数
// gcd(A,B)の因数のうち互いに素であるものの個数
// gcd(A,B)の素因数の個数
ll gcd(ll a, ll b) {
ll r;
while (b != 0) {
if (a < b)
swap(a, b);
r = a % b;
a = b;
b = r;
}
return a;
}
map<ll, ll> p... | #include <bits/stdc++.h>
#define ll long long
#define MAX_N 51
using namespace std;
// Aの約数とBの約数のから互いに素であるものを選んだ時の最大個数
// gcd(A,B)の因数のうち互いに素であるものの個数
// gcd(A,B)の素因数の個数
ll gcd(ll a, ll b) {
ll r;
while (b != 0) {
if (a < b)
swap(a, b);
r = a % b;
a = b;
b = r;
}
return a;
}
map<ll, ll> p... | replace | 44 | 50 | 44 | 46 | TLE | |
p02900 | C++ | Time Limit Exceeded | /**
* author: souzai32
* created: 13.08.2020 01:17:53
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
long gcd(long a, long b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
long lcm(long a, long b) { return a * b / ... | /**
* author: souzai32
* created: 13.08.2020 01:17:53
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
long gcd(long a, long b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
long lcm(long a, long b) { return a * b / ... | replace | 26 | 27 | 26 | 27 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
template <typename T> T lcm(T a, T b) { return (a * b) / gcd(b % a, a); }
ll PrimeFactorization(ll n) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
template <typename T> T lcm(T a, T b) { return (a * b) / gcd(b % a, a); }
ll PrimeFactorization(ll n) ... | replace | 15 | 16 | 15 | 21 | TLE | |
p02900 | C++ | Time Limit Exceeded | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
ll GCD(ll a, ll b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int main() {
ll A,... | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
ll GCD(ll a, ll b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int main() {
ll A,... | replace | 20 | 21 | 20 | 21 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define maxn 100005
#define ll long long
ll a, b;
int main() {
cin >> a >> b;
ll x = __gcd(a, b);
int tot = 0;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) {
tot++;
while (x % i == 0)
x /= i;
}
}
if (x > 1)
tot++;
cout <... | #include <bits/stdc++.h>
using namespace std;
#define maxn 100005
#define ll long long
ll a, b;
int main() {
cin >> a >> b;
ll x = __gcd(a, b);
int tot = 0;
for (ll i = 2; i * i <= x; i++) {
if (x % i == 0) {
tot++;
while (x % i == 0)
x /= i;
}
}
if (x > 1)
tot++;
cout <<... | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long A, long long B) {
if (B == 0) {
return A;
}
return gcd(B, A % B);
}
vector<pair<long long, long long>> prime_factorize(long long A) {
vector<pair<long long, long long>> res;
for (int i = 2; i * i <= A; i++) {
if (A % i != 0) {
... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long A, long long B) {
if (B == 0) {
return A;
}
return gcd(B, A % B);
}
vector<pair<long long, long long>> prime_factorize(long long A) {
vector<pair<long long, long long>> res;
for (long long i = 2; i * i <= A; i++) {
if (A % i != 0)... | replace | 12 | 13 | 12 | 13 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
... | #include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
... | insert | 31 | 31 | 31 | 36 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1)
return true;
for (long long i = 2; i < x; i++) {
if (x % i == 0)
return false;
}
return true... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1)
return true;
for (long long i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return... | replace | 11 | 12 | 11 | 12 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (a % b) {
return gcd(b, a % b);
} else {
return b;
}
}
int main() {
long long a, b;
cin >> a >> b;
long long n = gcd(a, b);
vector<pair<long long, long long>> fs;
for (int i... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (a % b) {
return gcd(b, a % b);
} else {
return b;
}
}
int main() {
long long a, b;
cin >> a >> b;
long long n = gcd(a, b);
vector<pair<long long, long long>> fs;
for (long ... | replace | 18 | 19 | 18 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | replace | 60 | 61 | 60 | 61 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; ... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; ... | replace | 83 | 84 | 83 | 84 | TLE | |
p02900 | C++ | Runtime Error | /**Function Template**/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /**Function Template**/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | replace | 195 | 203 | 195 | 197 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long gcd(long a, long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
long long A, B, cnt;
cin >> A >> B;
long long n = gcd(A, B);
cnt = 1;
for (int i = 2; i * i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long gcd(long a, long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
long long A, B, cnt;
cin >> A >> B;
long long n = gcd(A, B);
cnt = 1;
for (long long i = 2; i * i <= n; i++... | replace | 18 | 19 | 18 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <iostream>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
ll t = a % b;
while (t > 0) {
a = b;
b = t;
t = a % b;
}
return b;
}
int main() {
ll A, B, ans = 1;
cin >> A >> B;
ll N = gcd(A, B);
for (int i = 2; i * i <= N; i++) {
if (N % i == 0) {
ans++;
... | #include <iostream>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
ll t = a % b;
while (t > 0) {
a = b;
b = t;
t = a % b;
}
return b;
}
int main() {
ll A, B, ans = 1;
cin >> A >> B;
ll N = gcd(A, B);
for (ll i = 2; i * i <= N; i++) {
if (N % i == 0) {
ans++;
... | replace | 19 | 20 | 19 | 20 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | insert | 110 | 110 | 110 | 114 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
void solve() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int count = 1;
for (ll i = 2; i * i < g; ++i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
void solve() {
ll a, b;
cin >> a >> b;
ll g = gcd(a, b);
int count = 1;
for (ll i = 2; i * i < g; ++i) {... | replace | 5 | 6 | 5 | 6 | 0 | |
p02900 | C++ | Time Limit Exceeded | // #include "stdc++.h"
#include <bits/stdc++.h>
using namespace std;
long long gcd(long a, long b) {
if (a % b)
return gcd(b, a % b);
else
return b;
}
int main() {
long long a, b;
cin >> a >> b;
long long g;
if (a > b) {
g = gcd(a, b);
} else {
g = gcd(b, a);
}
int count = 1;
for... | // #include "stdc++.h"
#include <bits/stdc++.h>
using namespace std;
long long gcd(long a, long b) {
if (a % b)
return gcd(b, a % b);
else
return b;
}
int main() {
long long a, b;
cin >> a >> b;
long long g;
if (a > b) {
g = gcd(a, b);
} else {
g = gcd(b, a);
}
int count = 1;
for... | replace | 23 | 24 | 23 | 24 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) { return b != 0 ? gcd(b, a % b) : a; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int64_t A, B;
cin >> A >> B;
int64_t g = gcd(A, B);
int64_t cnt = 1;
if (g % 2 == 0) {
cnt++;
while (g % 2 == 0)
g /... | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) { return b != 0 ? gcd(b, a % b) : a; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int64_t A, B;
cin >> A >> B;
int64_t g = gcd(A, B);
int64_t cnt = 1;
if (g % 2 == 0) {
cnt++;
while (g % 2 == 0)
g /... | replace | 18 | 19 | 18 | 19 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep2(i, s, n) for (int i = (s); i < (int)n; i++)
int INF = 1e9 + 7;
ll gcd(ll m, ll n) {
if (m % n == 0)
return n;
return gcd(n, m % n);
}
int main() {
ll... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep2(i, s, n) for (int i = (s); i < (int)n; i++)
int INF = 1e9 + 7;
ll gcd(ll m, ll n) {
if (m % n == 0)
return n;
return gcd(n, m % n);
}
int main() {
ll... | replace | 23 | 24 | 23 | 24 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#incl... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#incl... | replace | 50 | 51 | 50 | 51 | TLE | |
p02900 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 1;
long long int a, b, tmp;
vector<long long int> v;
cin >> a >> b;
// aの素数の約数を全て求める
tmp = a;
for (int i = 2; i <= (int)sqrt(tmp); i++) {
int flag = 0;
while (tmp % i == 0) {
tmp /= i;
// cout << "[" << tmp << "]";... | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 1;
long long int a, b, tmp;
vector<long long int> v;
cin >> a >> b;
// aの素数の約数を全て求める
tmp = a;
for (int i = 2; i <= (int)sqrt(tmp); i++) {
int flag = 0;
while (tmp % i == 0) {
tmp /= i;
// cout << "[" << tmp << "]";... | replace | 27 | 29 | 27 | 34 | 0 | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a, b, c, ans = 0, p = 1, q = 1;
map<ll, int> mp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
c = __gcd(a, b);
for (int i = 2; i * i <= c; i++) {
while (c % i == 0) {
mp[i]++;
c /= i;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a, b, c, ans = 0, p = 1, q = 1;
map<ll, int> mp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
c = __gcd(a, b);
for (ll i = 2; i * i <= c; i++) {
while (c % i == 0) {
mp[i]++;
c /= i;
}
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// ax + by = gcd(a, b) O(logN)
long long extended_euclidean(long long a, long long b, long long &x,
long long &y) {
x = 1;
y = 0;
long long u = 0, v = 1;
long long ri = a, rj = b, rk, k;
// [x y]
// [u v]
while (1) {
k = ri / ... | #include <bits/stdc++.h>
using namespace std;
// ax + by = gcd(a, b) O(logN)
long long extended_euclidean(long long a, long long b, long long &x,
long long &y) {
x = 1;
y = 0;
long long u = 0, v = 1;
long long ri = a, rj = b, rk, k;
// [x y]
// [u v]
while (1) {
k = ri / ... | replace | 38 | 39 | 38 | 39 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
// gcd(A, B)の約数（＝A, Bの公約数）を求める関数
// 求めた公約数は、vector<pair<ll,
// int>>型配列に入れられる。(firstが公約数の値、secondが出現回数)
vector<pair<ll,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
// gcd(A, B)の約数（＝A, Bの公約数）を求める関数
// 求めた公約数は、vector<pair<ll,
// int>>型配列に入れられる。(firstが公約数の値、secondが出現回数)
vector<pair<ll,... | replace | 20 | 21 | 20 | 21 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <map>
using namespace std;
#define N 100005
#define ll long long
#define MOD 1000000007
ll x, y;
map<ll, bool> vis;
ll p[N];
int pn;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
scanf("%lld %lld", &x, &y);
ll d = gcd... | #include <algorithm>
#include <cstdio>
#include <map>
using namespace std;
#define N 100005
#define ll long long
#define MOD 1000000007
ll x, y;
map<ll, bool> vis;
ll p[N];
int pn;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
scanf("%lld %lld", &x, &y);
ll d = gcd... | replace | 25 | 26 | 25 | 26 | TLE | |
p02900 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
int main() {
long long A, B;
std::priority_queue<int> aque, bque;
std::vector<int> d;
scanf("%lld %lld", &A, &B);
int amin = (int)std::sqrt(... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
int main() {
long long A, B;
std::priority_queue<long long> aque, bque;
std::vector<long long> d;
scanf("%lld %lld", &A, &B);
int amin = (in... | replace | 12 | 14 | 12 | 14 | 0 | |
p02900 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(a) a.begin(), a.end()
#define lb lower_bound
#define ub upper_bound
#define owo \
ios_... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(a) a.begin(), a.end()
#define lb lower_bound
#define ub upper_bound
#define owo \
ios_... | replace | 37 | 38 | 37 | 38 | TLE | |
p02900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<ll> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define mins(x, y) x = min(x, ... | #include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<ll> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define mins(x, y) x = min(x, ... | replace | 56 | 57 | 56 | 58 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.