problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03062 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 10];
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 0, nummi = 0, mina;
if (a[0] < 0) {
mina = -a[0];
} else {
mina = a[0];
}
for (int i = 0; i < n; i++) {
if (a... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[n + 10];
for (int i = 0; i < n; i++)
cin >> a[i];
long long int ans = 0, nummi = 0, mina;
if (a[0] < 0) {
mina = -a[0];
} else {
mina = a[0];
}
for (int ... | [
"variable_declaration.type.widen.change"
] | 876,942 | 876,943 | u337054478 | cpp |
p03062 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
#define double long double
#define vec vector
#define pb push_back
#define unset unordered_set
#define ii pair<int, int>
#define X first
#define Y second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
#define double long double
#define vec vector
#define pb push_back
#define unset unordered_set
#define ii pair<int, int>
#define X first
#define Y second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b... | [
"expression.operation.binary.add"
] | 876,950 | 876,951 | u210484769 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 999999999;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (ll i = 0; i < N; i++)
cin >> A[i];
sort(A.begin(), A.end()... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 999999999;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (ll i = 0; i < N; i++)
cin >> A[i];
sort(A.begin(), A.end()... | [
"variable_declaration.type.change"
] | 876,957 | 876,958 | u239023686 | cpp |
p03062 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 999999999;
int main() {
ll N;
cin >> N;
vector<int> A(N);
for (ll i = 0; i < N; i++)
cin >> A[i];
sort(A.begin(), A.end(... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 999999999;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (ll i = 0; i < N; i++)
cin >> A[i];
sort(A.begin(), A.end()... | [
"variable_declaration.type.change"
] | 876,959 | 876,958 | u239023686 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF 10000000
#define MOD 998244353
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
int main() {
int N;
string s;
cin >> N >> s;
vector<int> black(N +... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF 10000000
#define MOD 998244353
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
int main() {
int N;
string s;
cin >> N >> s;
vector<int> black(N +... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 876,982 | 876,983 | u864171425 | cpp |
p03063 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 1000000000000000
#define endl '\n'
template <class T> inlin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 1000000000000000
#define endl '\n'
template <class T> inlin... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 876,992 | 876,993 | u807998890 | cpp |
p03063 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... | [
"expression.operation.binary.add"
] | 877,003 | 877,004 | u614497125 | cpp |
p03063 | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a <<... | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a <<... | [
"expression.operation.binary.remove"
] | 877,018 | 877,019 | u030685402 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define ... | [
"assignment.change"
] | 877,034 | 877,035 | u764234894 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 2e5 + 5;
string s;
int preB[N], sufW[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> s;
// ....###
int len = s.length();
for (int i = 0; s[i]; i++) {
if (i == 0)
preB[i] = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 2e5 + 5;
string s;
int n, preB[N], sufW[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> s;
// ....###
int len = s.length();
for (int i = 0; s[i]; i++) {
if (i == 0)
p... | [
"variable_declaration.add"
] | 877,055 | 877,056 | u029340806 | cpp |
p03063 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (auto i = 0; i < n; ++i)
#define REPR(i, n) for ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (auto i = 0; i < n; ++i)
#define REPR(i, n) for ... | [
"variable_declaration.value.change"
] | 877,061 | 877,062 | u479953984 | cpp |
p03063 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
using namesp... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
using namesp... | [
"call.add"
] | 877,069 | 877,070 | u568370190 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
inline void chkmin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
inline void chkmin... | [
"variable_declaration.value.change"
] | 877,078 | 877,079 | u900306103 | cpp |
p03063 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
inline void chkmin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
inline void chkmin... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 877,080 | 877,079 | u900306103 | cpp |
p03063 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define pie 3.141592653589793238462643383279
#defi... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define pie 3.141592653589793238462643383279
#defi... | [
"variable_declaration.remove",
"identifier.change"
] | 877,085 | 877,086 | u277153875 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b > a)
return gcd(b, a);
else if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
long long r... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b > a)
return gcd(b, a);
else if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
long long r... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 877,121 | 877,122 | u074014027 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd1[100000];
int gcd2[100000];
int gcd(int a, int b) {
if (a < b) {
swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
int gcd1[100000];
int gcd2[100000];
int gcd(int a, int b) {
if (a < b) {
swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 877,123 | 877,124 | u115086397 | cpp |
p03061 | #include <bits/stdc++.h>
#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 fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fals... | #include <bits/stdc++.h>
#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 fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fals... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 877,132 | 877,133 | u532065884 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n;
vector<long long> a;
cin >> n;
for (int i = 0; i < n; ++i) {
long long tmp;
cin >> tmp;
a.push_back(tmp);
}
long long l[100010], r[100010];
l[0] = r[n] = 0;
for (int i = 1; i <= n; ++i) {
l[i] = __gcd(l[i - 1], ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n;
vector<long long> a;
cin >> n;
for (int i = 0; i < n; ++i) {
long long tmp;
cin >> tmp;
a.push_back(tmp);
}
long long l[100010], r[100010];
l[0] = r[n] = 0;
for (int i = 1; i <= n; ++i) {
l[i] = __gcd(l[i - 1], ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 877,136 | 877,137 | u464540027 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int gcd(int m, int n);
int a[100010];
int l[100010];
int r[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
if (j == 0)
l[j] = a[0];
else {
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int gcd(int m, int n);
int a[100010];
int l[100010];
int r[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
if (j == 0)
l[j] = a[0];
else {
... | [
"call.add",
"call.arguments.add"
] | 877,138 | 877,139 | u125468789 | cpp |
p03061 | #include <iostream>
#include <vector>
using namespace std;
using ull = unsigned long long;
ull gcd(ull u, ull v) {
ull shift;
if (u == 0)
return v;
if (v == 0)
return u;
shift = __builtin_ctzll(u | v);
u >>= __builtin_ctzll(u);
do {
v >>= __builtin_ctzll(v);
if (u > v) {
ull t =... | #include <iostream>
#include <vector>
using namespace std;
using ull = unsigned long long;
ull gcd(ull u, ull v) {
ull shift;
if (u == 0)
return v;
if (v == 0)
return u;
shift = __builtin_ctzll(u | v);
u >>= __builtin_ctzll(u);
do {
v >>= __builtin_ctzll(v);
if (u > v) {
ull t =... | [
"identifier.change",
"call.arguments.change"
] | 877,153 | 877,154 | u977980482 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
long long gcd(long long a, long long b) {
long long temp;
if (a < b) {
temp = b;
b = a;
a = temp;
}
if (b == 0)
return a;
while (a % b != 0) {
temp = a % b;
a = b;
b = temp;
}
return b;
}
using namespace std;
int mai... | #include <algorithm>
#include <iostream>
#include <vector>
long long gcd(long long a, long long b) {
long long temp;
if (a < b) {
temp = b;
b = a;
a = temp;
}
if (b == 0)
return a;
while (a % b != 0) {
temp = a % b;
a = b;
b = temp;
}
return b;
}
using namespace std;
int mai... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 877,158 | 877,159 | u950603962 | cpp |
p03061 | using namespace std;
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A[i];
int ans;
if (N > 2) {
int gcd_l[N];
gcd_l[0] = 0;
for (... | using namespace std;
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A[i];
int ans;
if (N > 2) {
int gcd_l[N];
gcd_l[0] = 0;
for (i... | [
"assignment.change"
] | 877,160 | 877,161 | u981068718 | cpp |
p03061 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int arr[100005], seg[4 * 100005];
int gcd(int a, int b) {
if (a * b == 0)
return a ? a : b;
while (a % b != 0) {
a = a % b;
swap(a, b);
}
return b;
}
void build(int index, int left, int right) {
if (left == right) {
seg[index]... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int arr[100005], seg[4 * 100005];
int gcd(int a, int b) {
if (a * b == 0)
return a ? a : b;
while (a % b != 0) {
a = a % b;
swap(a, b);
}
return b;
}
void build(int index, int left, int right) {
if (left == right) {
seg[index]... | [
"call.arguments.change"
] | 877,165 | 877,166 | u023397458 | cpp |
p03061 | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 1e5 + 9;
int s[N], l[N], r[N];
int main(void) {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> s[i];
l[0] = 0;
l[1] = s[1];
for (int i = 2; i < n; ++i)
l[i] = __gcd(s[i], s[i - 1]);
r[... | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 1e5 + 9;
int s[N], l[N], r[N];
int main(void) {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> s[i];
l[0] = 0;
l[1] = s[1];
for (int i = 2; i < n; ++i)
l[i] = __gcd(s[i], l[i - 1]);
r[... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 877,175 | 877,176 | u777148280 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int gcd(int A, int B) {
if (A == 0)
return B;
if (B == 0)
return A;
int tmp;
if (B > A) {
tmp = B;
B = A;
A = tmp;
}
int r;
while (1) {
r = A % B;
A ... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int gcd(int A, int B) {
if (A == 0)
return B;
if (B == 0)
return A;
int tmp;
if (B > A) {
tmp = B;
B = A;
A = tmp;
}
int r;
while (1) {
r = A % B;
A ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 877,179 | 877,180 | u761510695 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ... | [
"assignment.change"
] | 877,208 | 877,209 | u373958718 | cpp |
p03061 | #include <iostream>
using namespace std;
void swap(int &a, int &b) {
int t = a;
a = b;
b = t;
}
int gcd(int a, int b) {
if (a < b)
swap(a, b);
while (b) {
a = a % b;
swap(a, b);
}
return a;
}
int main() {
int A[100005];
int N;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
i... | #include <iostream>
using namespace std;
void swap(int &a, int &b) {
int t = a;
a = b;
b = t;
}
int gcd(int a, int b) {
if (a < b)
swap(a, b);
while (b) {
a = a % b;
swap(a, b);
}
return a;
}
int main() {
int A[100005];
int N;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
i... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 877,210 | 877,211 | u058186113 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a == 0) {
return b;
}
if (b == 0) {
return a;
}
if (a < b)
gcd(b, a);
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int N;
cin >> N;
vector<int> A;
int tmp;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a == 0) {
return b;
}
if (b == 0) {
return a;
}
if (a < b)
gcd(b, a);
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int N;
cin >> N;
vector<int> A;
int tmp;
for (int i =... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 877,212 | 877,213 | u269804060 | cpp |
p03061 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"expression.operation.binary.add"
] | 877,214 | 877,215 | u186359321 | cpp |
p03061 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// const ll MOD = 1000000007;
// const int INF = 2000000000;
int gcd(int a, int ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// const ll MOD = 1000000007;
// const int INF = 2000000000;
int gcd(int a, int ... | [
"assignment.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 877,218 | 877,219 | u751964641 | cpp |
p03061 | #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[i];
sort(a.begin(), a.end());
int cnt;
for (int i = a[0]; i > 0; i--) {
cnt = 0;
for (int j = 0; j < n; j++) {
if (a[j] % i != 0)
++cnt;
if (cn... | #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[i];
sort(a.begin(), a.end());
int cnt;
for (int i = a[1]; i > 0; i--) {
cnt = 0;
for (int j = 0; j < n; j++) {
if (a[j] % i != 0)
++cnt;
if (cn... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 877,220 | 877,221 | u280114218 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
// chmax, chmin
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
// chmax, chmin
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
retur... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 877,230 | 877,231 | u806201407 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y ==... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y ==... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 877,247 | 877,248 | u452009494 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y ==... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y ==... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 877,249 | 877,248 | u452009494 | cpp |
p03061 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <vector>
#define _for(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
template <typename T> vector<size_t> sort_in... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <vector>
#define _for(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
template <typename T> vector<size_t> sort_in... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 877,250 | 877,251 | u128456980 | cpp |
p03061 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <vector>
#define _for(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
template <typename T> vector<size_t> sort_in... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <vector>
#define _for(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
template <typename T> vector<size_t> sort_in... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 877,252 | 877,251 | u128456980 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int ucrid(int x, int y) {
int a;
int b;
a = max(x, y);
b = min(x, y);
while (true) {
if (a / b == 0) {
return b;
} else {
x = b;
y = a / b;
a = x;
b = y;
}
}
}
int main() {
int n;
cin >> n;
vector<int> a(n);
vect... | #include <bits/stdc++.h>
using namespace std;
int ucrid(int x, int y) {
int a;
int b;
a = max(x, y);
b = min(x, y);
while (true) {
if (a % b == 0) {
return b;
} else {
x = b;
y = a % b;
a = x;
b = y;
}
}
}
int main() {
int n;
cin >> n;
vector<int> a(n);
vect... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 877,257 | 877,258 | u544165468 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int ucrid(int x, int y) {
int a;
int b;
a = max(x, y);
b = min(x, y);
while (true) {
if (a / b == 0) {
return b;
} else {
x = b;
y = a / b;
a = x;
b = y;
}
}
}
int main() {
int n;
cin >> n;
vector<int> a(n);
vect... | #include <bits/stdc++.h>
using namespace std;
int ucrid(int x, int y) {
int a;
int b;
a = max(x, y);
b = min(x, y);
while (true) {
if (a % b == 0) {
return b;
} else {
x = b;
y = a % b;
a = x;
b = y;
}
}
}
int main() {
int n;
cin >> n;
vector<int> a(n);
vect... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 877,259 | 877,258 | u544165468 | cpp |
p03061 | /**
* @Author: G_bg
* @DateTime: 2019-04-27 21:56:38
* @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;
int a[maxn], q[maxn]... | /**
* @Author: G_bg
* @DateTime: 2019-04-27 21:56:38
* @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;
int a[maxn], q[maxn]... | [
"assignment.variable.change",
"identifier.change"
] | 877,265 | 877,266 | u838609976 | cpp |
p03061 | #include <cstdio>
#define SWAP(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) {
if (b < a)
SWAP(a, b);
int tmp;
while (a != 0) {
tmp = b % a;
b = a;
a = tmp;
}
return b;
}
int main(void) {
int i, n;
int a[100000];
int gcd_array[100000];
scanf("%d", &n);
for (i = 0; i < n... | #include <cstdio>
#define SWAP(a, b) (a += b, b = a - b, a -= b)
int gcd(int a, int b) {
if (b < a)
SWAP(a, b);
int tmp;
while (a != 0) {
tmp = b % a;
b = a;
a = tmp;
}
return b;
}
int main(void) {
int i, n;
int a[100000];
int gcd_array[100000];
scanf("%d", &n);
for (i = 0; i < n... | [
"misc.opposites",
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"assignment.variable.change",
"call.arguments.change",
"io.output.change"
] | 877,271 | 877,272 | u651808137 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [
"call.add"
] | 877,275 | 877,276 | u692336506 | cpp |
p03061 | #include <algorithm>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <sys/timeb.h>
#include <vector>
using namespace std;
#define repr(i, a, b)... | #include <algorithm>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <sys/timeb.h>
#include <vector>
using namespace std;
#define repr(i, a, b)... | [
"expression.operation.binary.remove"
] | 877,277 | 877,278 | u702133921 | cpp |
p03061 | #include <iostream>
using namespace std;
int gcd(long long int a, long long int b) {
long long int temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
while (a % b) {
temp = a % b;
a = b;
b = temp;
}
return b;
}
int main() {
int N;
long long int A[100000];
long long int fromleft[... | #include <iostream>
using namespace std;
int gcd(long long int a, long long int b) {
long long int temp;
if (a < b) {
temp = a;
a = b;
b = temp;
}
while (b) {
temp = a % b;
a = b;
b = temp;
}
return a;
}
int main() {
int N;
long long int A[100000];
long long int fromleft[1000... | [
"expression.operation.binary.remove",
"identifier.change",
"function.return_value.change"
] | 877,293 | 877,294 | u448406471 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
#define dump(x) cout << (x) << '\n'
Int mod = 1e9 + 7;
Int gcd(Int n, Int m) {
Int x = max(n, m);
Int y = min(n, m);
return x % y == 0 ? y : gcd(y, x % y);
}
int main() {
Int n;
cin >> n;
vector<Int> c(n);
for (Int i = 0; i < n; i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
#define dump(x) cout << (x) << '\n'
Int mod = 1e9 + 7;
Int gcd(Int n, Int m) {
Int x = max(n, m);
Int y = min(n, m);
return x % y == 0 ? y : gcd(y, x % y);
}
int main() {
Int n;
cin >> n;
vector<Int> c(n);
for (Int i = 0; i < n; i++)
... | [
"assignment.change"
] | 877,297 | 877,298 | u572665222 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
long long int mod = 1e9;
int func(vector<int> a, int p) {
int n = a.size();
int x = a[0];
i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
long long int mod = 1e9;
int func(vector<int> a, int p) {
int n = a.size();
int x = a[0];
i... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 877,299 | 877,300 | u543657872 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
// BEGIN CUT HERE
template <typename T, typename E> struct SegmentTree {
typedef function<T(T, T)> F;
typedef function<T(T, E)> G;
int n;
F... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
// BEGIN CUT HERE
template <typename T, typename E> struct SegmentTree {
typedef function<T(T, T)> F;
typedef function<T(T, E)> G;
int n;
F... | [
"expression.operation.binary.remove"
] | 877,301 | 877,302 | u157322125 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define range(i, n, m) for (ll i = n;... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define range(i, n, m) for (ll i = n;... | [
"assignment.change"
] | 877,303 | 877,304 | u991974907 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a <= c && c <= b) && (b <= c && c <= a)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a <= c && c <= b) || (b <= c && c <= a)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 877,311 | 877,312 | u286623856 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll>> mat;
typedef vector<ll> vec;
#define rep(i, n) for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll>> mat;
typedef vector<ll> vec;
#define rep(i, n) for (int i = 0; i <... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 877,321 | 877,322 | u114137758 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | [
"literal.string.change",
"io.output.change"
] | 877,327 | 877,328 | u120143737 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.string.change"
] | 877,329 | 877,328 | u120143737 | cpp |
p03067 | #include <bits/stdc++.h>
#include <regex>
using namespace std;
// type
typedef long long int ll;
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
#define PI 3.14159265358979323846264338327950L
//略記
#define PB pus... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
// type
typedef long long int ll;
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
#define PI 3.14159265358979323846264338327950L
//略記
#define PB pus... | [] | 877,332 | 877,333 | u506464494 | cpp |
p03067 | #include <bits/stdc++.h>
#include <regex>
using namespace std;
// type
typedef long long int ll;
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
#define PI 3.14159265358979323846264338327950L
//略記
#define PB pus... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
// type
typedef long long int ll;
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
#define PI 3.14159265358979323846264338327950L
//略記
#define PB pus... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 877,334 | 877,333 | u506464494 | cpp |
p03067 | using namespace std;
#include <iostream>
#include <vector>
int A, B, C;
int main() {
cin >> A >> B >> C;
string ans = (A < C) ^ (B > C) ? "Yes" : "No";
cout << ans << endl;
return 0;
} | using namespace std;
#include <iostream>
#include <vector>
int A, B, C;
int main() {
cin >> A >> B >> C;
string ans = (A < C) ^ (B < C) ? "Yes" : "No";
cout << ans << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 877,345 | 877,346 | u288087195 | cpp |
p03067 | using namespace std;
#include <iostream>
#include <vector>
int A, B, C;
int main() {
cin >> A >> B >> C;
string ans = A < C && B > C ? "Yes" : "No";
cout << ans << endl;
return 0;
} | using namespace std;
#include <iostream>
#include <vector>
int A, B, C;
int main() {
cin >> A >> B >> C;
string ans = (A < C) ^ (B < C) ? "Yes" : "No";
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change"
] | 877,347 | 877,346 | u288087195 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie();
#define MAXX 10... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie();
#define MAXX 10... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 877,350 | 877,351 | u102842945 | cpp |
p03067 | // ABC_128_B// pair型の中にpair型
/*int main() {
int n;
cin >> n;
vector<pair<pair<string,int>,int>> a(n);
for(int i=0;i<n;i++){
string s;
cin >> s;
int num;
cin >> num;
num = num * -1;
a.at(i).first.first = s;
a.at(i).first.second = num;
a.at(i).second = i;
}
sort(a.begin(),... | // ABC_128_B// pair型の中にpair型
/*int main() {
int n;
cin >> n;
vector<pair<pair<string,int>,int>> a(n);
for(int i=0;i<n;i++){
string s;
cin >> s;
int num;
cin >> num;
num = num * -1;
a.at(i).first.first = s;
a.at(i).first.second = num;
a.at(i).second = i;
}
sort(a.begin(),... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,354 | 877,355 | u037563046 | cpp |
p03067 | // ABC_128_B// pair型の中にpair型
/*int main() {
int n;
cin >> n;
vector<pair<pair<string,int>,int>> a(n);
for(int i=0;i<n;i++){
string s;
cin >> s;
int num;
cin >> num;
num = num * -1;
a.at(i).first.first = s;
a.at(i).first.second = num;
a.at(i).second = i;
}
sort(a.begin(),... | // ABC_128_B// pair型の中にpair型
/*int main() {
int n;
cin >> n;
vector<pair<pair<string,int>,int>> a(n);
for(int i=0;i<n;i++){
string s;
cin >> s;
int num;
cin >> num;
num = num * -1;
a.at(i).first.first = s;
a.at(i).first.second = num;
a.at(i).second = i;
}
sort(a.begin(),... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 877,356 | 877,355 | u037563046 | cpp |
p03067 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(var) \
do { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(var) \
do { ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 877,366 | 877,367 | u697968316 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 100... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 100... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,368 | 877,369 | u164181205 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A > B && C > B) || (A < B && C < B))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if ((A > C && C > B) || (A < C && C < B))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,370 | 877,371 | u431389521 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c && b > c) {
cout << "YES";
} else if (a > c && b < c) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < c && b > c) {
cout << "Yes";
} else if (a > c && b < c) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 877,374 | 877,375 | u714796740 | cpp |
p03067 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
puts(min(a, c) <= b && b <= max(a, b) ? "Yes" : "No");
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
puts(min(a, b) <= c && c <= max(a, b) ? "Yes" : "No");
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 877,382 | 877,383 | u781095600 | cpp |
p03067 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((b - a) * (c - b) < 0)
cout... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((c - a) * (c - b) < 0)
cout... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,390 | 877,391 | u495704746 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a < c and c < b) or (a > c and c > b))
cout << "No" << endl;
else
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a < c and c < b) or (a > c and c > b))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"expression.operation.binary.remove"
] | 877,394 | 877,395 | u267222408 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A <= C && B >= C) {
cout << "Yes" << endl;
}
if (A >= C && B <= C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A <= C && B >= C) {
cout << "Yes" << endl;
} else if (A >= C && B <= C) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 877,399 | 877,400 | u237390401 | cpp |
p03067 | #include <iostream>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << (a < c && c < b ? "Yes" : "No");
} | #include <iostream>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << (a < c ^ b < c ? "Yes" : "No");
} | [
"control_flow.loop.for.condition.change",
"io.output.change",
"expression.operation.binary.remove"
] | 877,401 | 877,402 | u047554023 | cpp |
p03067 | #include <iostream>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << (a < b && b < c ? "Yes" : "No");
} | #include <iostream>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << (a < c ^ b < c ? "Yes" : "No");
} | [] | 877,403 | 877,402 | u047554023 | cpp |
p03067 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl /*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl /*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"expression.operation.binary.remove"
] | 877,410 | 877,411 | u682191329 | cpp |
p03061 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Apolloliu
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, b, sizeof(a))
#define UN(a) sort(all(a)), a.erase(unique(all(a)), a.end())
#define REV(a)... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Apolloliu
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, b, sizeof(a))
#define UN(a) sort(all(a)), a.erase(unique(all(a)), a.end())
#define REV(a)... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.remove",
"control_flow.branch.if.condition.change"
] | 877,420 | 877,421 | u608624039 | cpp |
p03061 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int v0 = a, v1 = b, v2 = a % b;
while (v2 != 0) {
v0 = v1;
v1 = v2;
v2 = v0 % v1;
};
return v1;
}
int main() ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int v0 = a, v1 = b, v2 = a % b;
while (v2 != 0) {
v0 = v1;
v1 = v2;
v2 = v0 % v1;
};
return v1;
}
int main() ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.change"
] | 877,422 | 877,423 | u430797067 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int eucl(int a, int b) {
if (a == 0) {
return b;
} else {
// cout << b << " "<< b%a << endl;
return eucl(b % a, a);
}
}
int main() {
int N;
cin >> N;
std::vector<int> value(N);
std::vector<int> gcd_r(N);
std::vector<int> gcd_l(N);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int eucl(int a, int b) {
if (a == 0) {
return b;
} else {
// cout << b << " "<< b%a << endl;
return eucl(b % a, a);
}
}
int main() {
int N;
cin >> N;
std::vector<int> value(N);
std::vector<int> gcd_r(N);
std::vector<int> gcd_l(N);
for (int i ... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 877,433 | 877,434 | u578276786 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int t = a;
a = b;
b = t;
}
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
int rgcd[n + 2], lgcd[n + 2], a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 2) {
... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int t = a;
a = b;
b = t;
}
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
int rgcd[n + 2], lgcd[n + 2], a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 2) {
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 877,435 | 877,436 | u174404613 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int t = a;
a = b;
b = t;
}
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
int rgcd[n + 2], lgcd[n + 2], a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 2) {
... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int t = a;
a = b;
b = t;
}
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
int rgcd[n + 2], lgcd[n + 2], a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 2) {
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 877,437 | 877,436 | u174404613 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (a < b)
swap(a, b);
while (a % b != 0) {
long long c = a % b;
a = b;
b = c;
}
return b;
}
int main() {
long lon... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (a < b)
swap(a, b);
while (a % b != 0) {
long long c = a % b;
a = b;
b = c;
}
return b;
}
int main() {
long lon... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 877,438 | 877,439 | u314960567 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int euclidean(int a, int b) {
int a1 = max(a, b);
int a2 = min(a, b);
if (a2 == 0)
return 0;
int a3 = a1 % a2;
for (; a3 > 0;) {
a1 = a2;
a2 = a3;
a3 = a1 % a2;
}
return a2;
}
int main(void) {
int N;
cin >> N;
vector<int> A(N, 0);
vec... | #include <bits/stdc++.h>
using namespace std;
int euclidean(int a, int b) {
int a1 = max(a, b);
int a2 = min(a, b);
if (a2 == 0)
return a1;
int a3 = a1 % a2;
for (; a3 > 0;) {
a1 = a2;
a2 = a3;
a3 = a1 % a2;
}
return a2;
}
int main(void) {
int N;
cin >> N;
vector<int> A(N, 0);
ve... | [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 877,443 | 877,444 | u360441331 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int a[100010];
int res[100010];
int cnt[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int x = a[0];
int y = a[1];
int c = 0;
int b = 0;
for (int i = 1; i * i <= x; i++) {
if (x % i == 0) {
res... | #include <bits/stdc++.h>
using namespace std;
int a[100010];
int res[100010];
int cnt[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int x = a[0];
int y = a[1];
int c = 0;
int b = 0;
for (int i = 1; i * i <= x; i++) {
if (x % i == 0) {
res... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 877,456 | 877,457 | u426657245 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <vector>
long int Euclid(long int A, long int B) {
if (A < B)
return Euclid(B, A);
while (A % B != 0) {
long int R = A % B;
A = B;
B = R;
}
return A;
}
int main() {
long int N;
std::cin >> N;
std::ve... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <vector>
long int Euclid(long int A, long int B) {
if (A < B)
return Euclid(B, A);
while (B != 0) {
long int R = A % B;
A = B;
B = R;
}
return A;
}
int main() {
long int N;
std::cin >> N;
std::vector... | [
"expression.operation.binary.remove"
] | 877,460 | 877,461 | u802260583 | cpp |
p03061 | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | [
"assignment.change"
] | 877,473 | 877,474 | u239493918 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vect... | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vect... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 877,478 | 877,479 | u579754454 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | [
"expression.operation.binary.remove"
] | 877,480 | 877,481 | u172929647 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | [
"control_flow.return.add",
"expression.operation.binary.remove"
] | 877,482 | 877,481 | u172929647 | cpp |
p03061 |
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int *L = new int[N];
int *R = new int[N];
L[0] = A[0];... |
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int *L = new int[N];
int *R = new int[N];
L[0] = A[0];... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 877,485 | 877,486 | u811978802 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 877,491 | 877,492 | u074445770 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
if (b == 0)
return b;
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n), l(n + ... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
if (b == 0)
return a;
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n), l(n + ... | [
"identifier.change",
"function.return_value.change"
] | 877,493 | 877,494 | u303884911 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> L(n + 1);
vector<int> R(n + 1);
for (int i = 0; i <... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) { // a < b
return b == 0 ? a : gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> L(n + 1);
vector<int> R(n + 1);
for (int... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 877,499 | 877,500 | u150861392 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
priority_queue<ll> PrimeFact(ll N) {
priority_queue<ll> que;
while (1) {
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
priority_queue<ll> PrimeFact(ll N) {
priority_queue<ll> que;
while (1) {
... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 877,503 | 877,504 | u492131209 | cpp |
p03061 | //
// Created on 2019-02-09.
//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#def... | //
// Created on 2019-02-09.
//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#def... | [
"expression.operation.binary.remove",
"identifier.change",
"function.return_value.change"
] | 877,512 | 877,513 | u299377613 | cpp |
p03061 | #include <algorithm>
#include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long max(long long a, long long b) {
if (a > b)
return a;
else
return b;
}
int main(void) {
// Your code here!
int N;
cin >> N;
long l... | #include <algorithm>
#include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long max(long long a, long long b) {
if (a > b)
return a;
else
return b;
}
int main(void) {
// Your code here!
int N;
cin >> N;
long l... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 877,516 | 877,515 | u279137361 | cpp |
p03061 | #include <algorithm>
#include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long max(long long a, long long b) {
if (a > b)
return a;
else
return b;
}
int main(void) {
// Your code here!
int N;
cin >> N;
long l... | #include <algorithm>
#include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long max(long long a, long long b) {
if (a > b)
return a;
else
return b;
}
int main(void) {
// Your code here!
int N;
cin >> N;
long l... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove"
] | 877,517 | 877,518 | u279137361 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 21474... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 21474... | [
"expression.operation.binary.remove",
"assignment.change"
] | 877,522 | 877,523 | u901561754 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define p... | [
"call.add"
] | 877,529 | 877,530 | u779159351 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> r_g(n + 1);
r_g.at(n) = 0;
for (int i = n - 1; i >= 0; i--) {
... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> r_g(n + 1);
r_g.at(n) = 0;
for (int i = n - 1; i >= 0; i--) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 877,533 | 877,534 | u465233477 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<ll> left(n, 0);
vector<ll> right(n, 0);
for (int i = 0; i < n; i++)
left[i + 1]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<ll> left(n + 1, 0);
vector<ll> right(n + 1, 0);
for (int i = 0; i < n; i++)
lef... | [
"assignment.change"
] | 877,535 | 877,536 | u568419568 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
const int maxn = 200005;
int n;
int a[maxn], pre[maxn], pos[maxn];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
if (i == 0) {
pre[i] = a[i];
} else {
pre[i] = __g... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
const int maxn = 200005;
int n;
int a[maxn], pre[maxn], pos[maxn];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
if (i == 0) {
pre[i] = a[i];
} else {
pre[i] = __g... | [
"identifier.change",
"call.arguments.change"
] | 877,539 | 877,540 | u930838529 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | [
"expression.operation.binary.remove"
] | 877,541 | 877,542 | u049420296 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int m_f[n... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int m_f[n... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 877,543 | 877,544 | u167604613 | cpp |
p03061 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) int((x).size())
#define OUT(x) cout << (x) << endl;
typed... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) int((x).size())
#define OUT(x) cout << (x) << endl;
typed... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 877,547 | 877,548 | u901615543 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int N, tmp, ans = 0;
cin >> N;
int A[N];
int left[N], right[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
left[0] = A[0];
right[N - 1] = A[N - 1];
for (i... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int N, tmp, ans = 0;
cin >> N;
int A[N];
int left[N], right[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
left[0] = A[0];
right[N - 1] = A[N - 1];
for (i... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 877,549 | 877,550 | u074306398 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.