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 |
|---|---|---|---|---|---|---|---|
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int INF = 1001001001;
ll gcd(ll a, ll b) {
if (a == INF)
return b;
if (b == INF)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int n;
cin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int INF = 1001001001;
ll gcd(ll a, ll b) {
if (a == INF)
return b;
if (b == INF)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int n;
cin... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 873,642 | 873,645 | u075775814 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int INF = 1001001001;
ll gcd(ll a, ll b) {
if (a == INF)
return b;
if (b == INF)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int n;
cin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int INF = 1001001001;
ll gcd(ll a, ll b) {
if (a == INF)
return b;
if (b == INF)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int n;
cin... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 873,644 | 873,645 | u075775814 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf 2147483647
#define int long long
signed main(void) {
int n;
cin >> n;
int a[100005... | #include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf 2147483647
#define int long long
signed main(void) {
int n;
cin >> n;
int a[100005... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.remove"
] | 873,650 | 873,651 | u451699824 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf 2147483647
#define int long long
signed main(void) {
int n;
cin >> n;
int a[100005... | #include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf 2147483647
#define int long long
signed main(void) {
int n;
cin >> n;
int a[100005... | [
"assignment.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 873,652 | 873,651 | u451699824 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespac... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespac... | [
"call.arguments.change",
"call.arguments.add"
] | 873,662 | 873,663 | u384398403 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
ll r = a % b;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
ll r = a % b;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 873,674 | 873,675 | u012298376 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
ll r = a % b;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
ll r = a % b;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 873,677 | 873,675 | u012298376 | cpp |
p03061 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
ll gcd(ll a, ll b) {... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
ll gcd(ll a, ll b) {... | [
"expression.operation.binary.add"
] | 873,679 | 873,680 | u129134470 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
const int nmax = 1e9 + 7;
typedef long long ll;
int GCD(int a, int b) {
int M = max(a, b), m = min(a, b);
if (m == 0) {
ret... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
const int nmax = 1e9 + 7;
typedef long long ll;
int GCD(int a, int b) {
int M = max(a, b), m = min(a, b);
if (m == 0) {
ret... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,681 | 873,682 | u280096880 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | [
"assignment.change"
] | 873,685 | 873,686 | u876953939 | cpp |
p03061 | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <... | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <... | [
"expression.operation.binary.add"
] | 873,687 | 873,688 | u667375816 | cpp |
p03061 | // 今日はお盆前の最終出社日です
// いい加減寝ろ
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).... | // 今日はお盆前の最終出社日です
// いい加減寝ろ
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).... | [
"identifier.change",
"call.arguments.change"
] | 873,689 | 873,690 | u683769494 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
int c;
while (a % b != 0) {
c = a % b;
a = b;
b = c;
}
return b;
}
}
int main() {
// Your code here!
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
int c;
while (a % b != 0) {
c = a % b;
a = b;
b = c;
}
return b;
}
}
int main() {
// Your code here!
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < ... | [
"variable_declaration.value.change"
] | 873,693 | 873,694 | u798818115 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b != 0)
return gcd(b, a % b);
else
return a;
}
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n), l(n), r(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
l[0] = a[0];
r[0] = a[n - 1];
for (int i = 1; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b != 0)
return gcd(b, a % b);
else
return a;
}
int main() {
int n, ans = 1;
cin >> n;
vector<int> a(n), l(n), r(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
l[0] = a[0];
r[0] = a[n - 1];
for (int i = 1; i < n; i+... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,705 | 873,706 | u501163846 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INT_INF = 2147483647;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INT_INF = 2147483647;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,715 | 873,716 | u639032323 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000000000
#define MOD 1000000007
using ll = long long;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define INF 1000000000000
#define MOD 1000000007
using ll = long long;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll ... | [
"identifier.change",
"call.arguments.change"
] | 873,717 | 873,718 | u779216084 | cpp |
p03061 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (a % b != 0) {
return gcd(b, a % b);
} else {
return b;
}
}
int main() {
int N;
cin >> N;
vector<long... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (a % b != 0) {
return gcd(b, a % b);
} else {
return b;
}
}
int main() {
int N;
cin >> N;
vector<long... | [
"assignment.change"
] | 873,721 | 873,722 | u323542775 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#def... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#def... | [
"assignment.change"
] | 873,725 | 873,726 | u342051078 | cpp |
p03061 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
retur... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
retur... | [
"variable_declaration.type.change",
"assignment.variable.change",
"identifier.change"
] | 873,731 | 873,732 | u318042557 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, result = 0;
cin >> n;
int a[n], gcdleft[n + 1], gcdright[n + 1];
gcdleft[0] = 0;
gcdrig... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, result = 0;
cin >> n;
int a[n], gcdleft[n + 1], gcdright[n + 1];
gcdleft[0] = 0;
gcdrig... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 873,739 | 873,740 | u270272336 | cpp |
p03061 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
ll gcd(ll x, ll y) {
if (x < y) {
ll temp = x;
x = y;
y = temp;
}
if (... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
ll gcd(ll x, ll y) {
if (x < y) {
ll temp = x;
x = y;
y = temp;
}
if (... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,741 | 873,742 | u075296067 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<ll>
#define vii vector<pair<int, int>>
#define ii pair<int, int>
#define loop(n) for (ll i = 0; i < n; i++)
#define pb push_back
const ll mod = 1e9 + 7;
void fast();
int main() {
fast();
int n;
cin >> n;
int a[n];
loop(n) ci... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<ll>
#define vii vector<pair<int, int>>
#define ii pair<int, int>
#define loop(n) for (ll i = 0; i < n; i++)
#define pb push_back
const ll mod = 1e9 + 7;
void fast();
int main() {
fast();
int n;
cin >> n;
int a[n];
loop(n) ci... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,747 | 873,748 | u936875047 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(a, n) for (int i = a; i < n; i++)
ll gcd(ll n1, ll n2) { return n2 == 0 ? n1 : gcd(n2, n1 % n2); }
int main() {
ll N, ans = 0;
cin >> N;
vector<ll> A(N), R(N + 1), L(N + 1);
rep... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(a, n) for (int i = a; i < n; i++)
ll gcd(ll n1, ll n2) { return n2 == 0 ? n1 : gcd(n2, n1 % n2); }
int main() {
ll N, ans = 0;
cin >> N;
vector<ll> A(N), R(N + 1), L(N + 1);
rep... | [
"assignment.value.change",
"identifier.change"
] | 873,751 | 873,752 | u432088501 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(a, n) for (int i = a; i < n; i++)
ll gcd(ll n1, ll n2) { return n2 == 0 ? n1 : gcd(n2, n1 % n2); }
int main() {
ll N, ans = 0;
cin >> N;
vector<ll> A(N), R(N + 1), L(N + 1);
rep... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(a, n) for (int i = a; i < n; i++)
ll gcd(ll n1, ll n2) { return n2 == 0 ? n1 : gcd(n2, n1 % n2); }
int main() {
ll N, ans = 0;
cin >> N;
vector<ll> A(N), R(N + 1), L(N + 1);
rep... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change"
] | 873,753 | 873,752 | u432088501 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 873,754 | 873,755 | u107995903 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> v(n);
vector<long long> left(n), right(n);
for (int i = 0; i < n; i++)
cin >> v[i];
left[0] = v[0];
right[n - 1] = v[n - 1];
long ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> v(n);
vector<long long> left(n), right(n);
for (int i = 0; i < n; i++)
cin >> v[i];
left[0] = v[0];
right[n - 1] = v[n - 1];
long ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,761 | 873,762 | u724012411 | cpp |
p03061 | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
#define re return
#define mp map<int, int>
#define N 200005
#define pq priority_queue<ll>
using namespace std;
int a[N], l[N], r[N];
int main() {
int n;
int an... | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
#define re return
#define mp map<int, int>
#define N 200005
#define pq priority_queue<ll>
using namespace std;
int a[N], l[N], r[N];
int main() {
int n;
int an... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 873,766 | 873,767 | u796123030 | cpp |
p03061 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef unsigned long long int ull;
typedef pair<ll, ll> P;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
co... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef unsigned long long int ull;
typedef pair<ll, ll> P;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
co... | [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 873,768 | 873,769 | u822169805 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), P(N), B(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
P[0] = A[0];
B[N - 1] = A[N - 1];
for (int i = 1; i < N; ++i)
P[i] = __gcd(A[i], P[i - 1]);
for (int i = N - 2; i >... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), P(N), B(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
P[0] = A[0];
B[N - 1] = A[N - 1];
for (int i = 1; i < N; ++i)
P[i] = __gcd(A[i], P[i - 1]);
for (int i = N - 2; i >... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,770 | 873,771 | u107077660 | cpp |
p03061 | #include <bits/stdc++.h>
#include <fstream>
#define inputtxt() \
std::ifstream in("input.txt"); \
std::cin.rdbuf(in.rdbuf())
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define re... | #include <bits/stdc++.h>
#include <fstream>
#define inputtxt() \
std::ifstream in("input.txt"); \
std::cin.rdbuf(in.rdbuf())
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define re... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 873,779 | 873,780 | u979852867 | cpp |
p03061 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,781 | 873,782 | u487060019 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <math.h>
#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[100000];
for (int i = 0; i < n; i++) {
cin >> a[i];... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return (gcd(b, a % b));
}
}
int main() {
int n;
cin >> n;
int a[100000];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
... | [
"expression.operation.binary.remove",
"function.return_value.change"
] | 873,785 | 873,786 | u745267317 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
ull gcd(ull a, ull b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ull N;
cin >> N;
ull A[N], next_gcd[N], back_gcd[N];
ull max_gcd = 0, gcd_n, prev_gcd_n, gcd_b, prev_gcd_b;
for (int i = 0; i < N;... | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
ull gcd(ull a, ull b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ull N;
cin >> N;
ull A[N], next_gcd[N], back_gcd[N];
ull max_gcd = 0, gcd_n, prev_gcd_n, gcd_b, prev_gcd_b;
for (int i = 0; i < N;... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 873,789 | 873,790 | u494249944 | cpp |
p03061 | #include <algorithm>
#include <iostream>
using namespace std;
int gcd(int x, int y) {
int r;
while (y != 0) {
r = x % y;
x = y;
y = r;
}
return x;
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int u[n];
int d[n];
u[0] = a[0];
d[n - 1]... | #include <algorithm>
#include <iostream>
using namespace std;
int gcd(int x, int y) {
int r;
while (y != 0) {
r = x % y;
x = y;
y = r;
}
return x;
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int u[n];
int d[n];
u[0] = a[0];
d[n - 1]... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,791 | 873,792 | u416773418 | 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 rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vecto... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vecto... | [
"expression.operation.binary.add"
] | 873,795 | 873,796 | u616029737 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define rep1(i, N) for (ll i = 1; i < (N); i++)
ll N;
ll A[100005];
ll pgcd[100005];
ll sgcd[100005];
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define rep1(i, N) for (ll i = 1; i < (N); i++)
ll N;
ll A[100005];
ll pgcd[100005];
ll sgcd[100005];
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
i... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,812 | 873,813 | u654191866 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (a == 0 || b == 0) {
return max(a, b);
} else if (a == 1 || b == 1) {
return 1;
}
long long q;
bool pro = true;
while (pro) {
q = a % b;
if (q = 0) {
return min(a, b);
} else {
a = b;... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (a == 0 || b == 0) {
return max(a, b);
} else if (a == 1 || b == 1) {
return 1;
}
long long q;
bool pro = true;
while (pro) {
q = a % b;
if (q == 0) {
return min(a, b);
} else {
a = b... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 873,816 | 873,817 | u176979814 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000000
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main(void) {
int n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000000
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main(void) {
int n;
cin >> n;
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,820 | 873,821 | u950411977 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(a % b, b);
}
int main(void) {
int N, ans = 0, temp;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int leftgcd[N]; //左からi番目までのgcd
int rightgcd[N]; /... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(a % b, b);
}
int main(void) {
int N, ans = 0, temp;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int leftgcd[N]; //左からi番目までのgcd
int rightgcd[N]; /... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 873,822 | 873,823 | u168774513 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
vector<ll> a(n), l(n + 1), r(n + 1);
rep(i, n) cin >> a[i];
for (int i = 0; i < n; ++i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
vector<ll> a(n), l(n + 1), r(n + 1);
rep(i, n) cin >> a[i];
for (int i = 0; i < n; ++i... | [
"assignment.change"
] | 873,824 | 873,825 | u620269708 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
vector<ll> a(n), l(n + 1), r(n + 1);
rep(i, n) cin >> a[i];
for (int i = 0; i < n; ++i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
vector<ll> a(n), l(n + 1), r(n + 1);
rep(i, n) cin >> a[i];
for (int i = 0; i < n; ++i... | [
"expression.operation.unary.arithmetic.remove"
] | 873,826 | 873,825 | u620269708 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (a == 0 || b == 0)
return max(a, b);
if (a == 1 || b == 1)
return 1;
if (a < b)
return gcd(b, a);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int N;
vector<int64_t> A(100010);
cin ... | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (a == 0 || b == 0)
return max(a, b);
if (a == 1 || b == 1)
return 1;
if (a < b)
return gcd(b, a);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int N;
vector<int64_t> A(100010);
cin ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 873,829 | 873,830 | u285358283 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | [] | 873,835 | 873,836 | u340010271 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | [
"variable_declaration.type.change"
] | 873,837 | 873,836 | u340010271 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
ll gcd(ll a, ll b) {
ll temp;
temp = a % b;
while (temp != 0) {
a = b;
b = temp;
temp = a % b;
}
return b;
}
int main() {
ll n, a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
ll gcd(ll a, ll b) {
ll temp;
temp = a % b;
while (temp != 0) {
a = b;
b = temp;
temp = a % b;
}
return b;
}
int main() {
ll n, a... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"assignment.change"
] | 873,838 | 873,839 | u761994361 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long gcd(long long y, long long x) { return x ? gcd(x, y % x) : y; }
int main(void) {
int n;
cin >> n;
vector<int> a(n), d(n), e(n);
rep(i, n) {
cin >> a.at(i);
d.at(i) = 0;
e.at(i) = 0;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long gcd(long long y, long long x) { return x ? gcd(x, y % x) : y; }
int main(void) {
int n;
cin >> n;
vector<int> a(n), d(n), e(n);
rep(i, n) {
cin >> a.at(i);
d.at(i) = 0;
e.at(i) = 0;
}
... | [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,842 | 873,843 | u690475097 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> data(N), front(N), back(N);
for (int i = 0; i < N; i++)
cin >> data.at(i);
front.at(N - 1) = data.at(N - 1);
back.at(0) = data.at(0);
for (int i = 1; i < N; i++) {
back.at(i) = __gcd(back.at(i - 1), data.at(i)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> data(N), front(N), back(N);
for (int i = 0; i < N; i++)
cin >> data.at(i);
front.at(N - 1) = data.at(N - 1);
back.at(0) = data.at(0);
for (int i = 1; i < N; i++) {
back.at(i) = __gcd(back.at(i - 1), data.at(i)... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"literal.number.change"
] | 873,848 | 873,849 | u239087789 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
// aとbの最大公約数を求める
long long evalmod(long long a, long long b) {
long long maxval = std::max(a, b);
long long minval = std::min(a, b);
if (minval =... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
// aとbの最大公約数を求める
long long evalmod(long long a, long long b) {
long long maxval = std::max(a, b);
long long minval = std::min(a, b);
if (minval =... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,860 | 873,861 | u339419997 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define ffrvs(ii, nn, mm) for (int ii = nn; ii >= mm; ii--)
#def... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define ffrvs(ii, nn, mm) for (int ii = nn; ii >= mm; ii--)
#def... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 873,862 | 873,863 | u771541325 | cpp |
p03061 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
type... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
type... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 873,864 | 873,865 | u016189984 | cpp |
p03061 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i... | [
"identifier.change"
] | 873,866 | 873,867 | u938389536 | cpp |
p03061 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i... | [
"assignment.change",
"identifier.change",
"expression.operation.binary.remove"
] | 873,868 | 873,867 | u938389536 | cpp |
p03061 | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> P;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1000000007;
const doub... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> P;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1000000007;
const doub... | [
"assignment.change"
] | 873,869 | 873,870 | u313994303 | cpp |
p03061 | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> P;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1000000007;
const doub... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> P;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1000000007;
const doub... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 873,871 | 873,870 | u313994303 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define PB push_back
#define fi first
#define se second
#define _SAD() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define PB push_back
#define fi first
#define se second
#define _SAD() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for... | [
"call.add",
"call.arguments.add"
] | 873,876 | 873,877 | u351012095 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
long int i, n;
cin >> n;
long int a[n + 2];
for (i = 0; i < n; i++)
cin >> a[i];
long int x[n + 2], y[n + 2];
x[0] = a[0];
for (i = 1; i < n; i++) {
x[i] = __gcd(x[i - 1], a[i]);
}
y[n - 1] = a[n - 1];
for (i = n - 2; i >= 0; i--) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int i, n;
cin >> n;
long int a[n + 2];
for (i = 0; i < n; i++)
cin >> a[i];
long int x[n + 2], y[n + 2];
x[0] = a[0];
for (i = 1; i < n; i++) {
x[i] = __gcd(x[i - 1], a[i]);
}
y[n - 1] = a[n - 1];
for (i = n - 2; i >= 0; i--) ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,878 | 873,879 | u135798926 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return ((a % b == 0 ? b : 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> gcd_1(n);
vector<int> gcd_2(n);
gcd_1[0] = a[0];
gcd_2[0] = a[n - 1];
for (int ... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return ((a % b == 0 ? b : 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> gcd_1(n);
vector<int> gcd_2(n);
gcd_1[0] = a[0];
gcd_2[0] = a[n - 1];
for (int ... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 873,880 | 873,881 | u045368371 | cpp |
p03061 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll, ll>
#define int long long
using namespace std;
const ll N = 1e6 + 2;
const ll MOD = 1e9 + 7;
const ll INF = 1e15;... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll, ll>
#define int long long
using namespace std;
const ll N = 1e6 + 2;
const ll MOD = 1e9 + 7;
const ll INF = 1e15;... | [
"assignment.change"
] | 873,882 | 873,883 | u435416250 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int GCD(int x, int y) {
if (y == 0)
return x;
return GCD(y, x % y);
}
int main() {
int ans = 0;
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int GCD(int x, int y) {
if (y == 0)
return x;
return GCD(y, x % y);
}
int main() {
int ans = 0;
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}... | [
"assignment.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,884 | 873,885 | u491330513 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
usin... | #include <algorithm>
#include <bitset>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
usin... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 873,890 | 873,891 | u374929478 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> vect(n);
// storing in vector
for (int i = 0; i < n; i++)
cin >> vect[i];
vector<long> l(n + 1, 0), r(n + 1, 0);
// base initialization
l[1] = vect[0];
r[n - 1] = vect[n - 1];... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vect(n);
// storing in vector
for (int i = 0; i < n; i++)
cin >> vect[i];
vector<int> l(n + 1, 0), r(n + 1, 0);
// base initialization
l[1] = vect[0];
r[n - 1] = vect[n - 1];
... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 873,899 | 873,900 | u551519692 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> vect(n);
// storing in vector
for (int i = 0; i < n; i++)
cin >> vect[i];
vector<long> l(n + 1, 0), r(n + 1, 0);
// base initialization
l[1] = vect[0];
r[n - 1] = vect[n - 1];... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> vect(n);
// storing in vector
for (int i = 0; i < n; i++)
cin >> vect[i];
vector<long> l(n + 1, 0), r(n + 1, 0);
// base initialization
l[1] = vect[0];
r[n - 1] = vect[n - 1];... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 873,899 | 873,901 | u551519692 | 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;
int a[100100];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> L(n), R(n);
for (int i = 0; i < n; i++) {
L[i + 1] = gcd(L[i], a[i]);
}
fo... | #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;
int a[100100];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> L(n), R(n);
for (int i = 0; i < n - 1; i++) {
L[i + 1] = gcd(L[i], a[i]);
}
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 873,910 | 873,909 | u796877631 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int g1[100010], g2[100010], a[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
g1[0] = a[0];
for (int i = 1; i < n; i++) {
g1[i] = __gcd(g1[i - 1], a[i]);
}
g2[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {... | #include <bits/stdc++.h>
using namespace std;
int g1[100010], g2[100010], a[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
g1[0] = a[0];
for (int i = 1; i < n; i++) {
g1[i] = __gcd(g1[i - 1], a[i]);
}
g2[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {... | [
"assignment.change"
] | 873,919 | 873,920 | u684822781 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N;
vector<int> Z(0, 0);
for (int i = 0; i < N; i++) {
cin >> A;
Z.push_back(A);
}
vector<int> X(1, Z[0]), Y(1, Z[N - 1]);
int b = Z[0];
for (int i = 1; i < N - 1; i++) {
int a = Z[i], c = a % b;
while (c != 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N;
vector<int> Z(0, 0);
for (int i = 0; i < N; i++) {
cin >> A;
Z.push_back(A);
}
vector<int> X(1, Z[0]), Y(1, Z[N - 1]);
int b = Z[0];
for (int i = 1; i < N - 1; i++) {
int a = Z[i], c = a % b;
while (c != 0) {
... | [
"expression.operation.binary.remove"
] | 873,921 | 873,922 | u071282706 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
cin... | #include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
cin... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,929 | 873,930 | u159663513 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#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;
vector<int> a(n), l(n), r(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n), l(n), r(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
... | [
"expression.operation.binary.remove",
"identifier.change",
"function.return_value.change"
] | 873,945 | 873,946 | u633402865 | cpp |
p03061 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
int gcd(int a, int b) { return b ? gcd(b, a % b) ... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
int gcd(int a, int b) { return b ? gcd(b, a % b) ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,947 | 873,948 | u492030100 | cpp |
p03061 | // Created by conan1024hao on 2019/11/23.
// Copyright © 2019 conan1024hao. All rights reserved.
// 専用ライブラリです、自由にコピーして構いません。
// 感谢看我的代码！Wechat:conan1024hao QQ:810396815
#pragma GCC optimize("O3")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include... | // Created by conan1024hao on 2019/11/23.
// Copyright © 2019 conan1024hao. All rights reserved.
// 専用ライブラリです、自由にコピーして構いません。
// 感谢看我的代码！Wechat:conan1024hao QQ:810396815
#pragma GCC optimize("O3")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include... | [
"assignment.change"
] | 873,953 | 873,954 | u220212997 | cpp |
p03061 |
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[n];
vector<int> l(n), r(n);
rep(i, n - 1) l[i + 1] = g... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> l(n), r(n);
rep(i, n - 1) l[i + 1] = gc... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 873,969 | 873,970 | u979078704 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
ll a[n], l[n], r[n];
cin >> a[0];
l[0] = a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
... | #include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
ll a[n], l[n], r[n];
cin >> a[0];
l[0] = a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 873,971 | 873,972 | u850867546 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 873,975 | 873,976 | u666394517 | cpp |
p03061 | #include <iostream>
#include <vector>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long long int> v, l, r;
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
v.push_ba... | #include <iostream>
#include <vector>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long long int> v, l, r;
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
v.push_ba... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 873,977 | 873,978 | u094746828 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y);
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> left(n);
left[0] = a[0];
for (int i = 1; i < n; i++) {
left[i] = gcd(left[i - 1], a[i]);
}
vector<int> right(n);
ri... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y);
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> left(n);
left[0] = a[0];
for (int i = 1; i < n; i++) {
left[i] = gcd(left[i - 1], a[i]);
}
vector<int> right(n);
ri... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,981 | 873,982 | u526708273 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,992 | 873,993 | u216460814 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,994 | 873,993 | u216460814 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace... | [
"call.arguments.change",
"call.arguments.add"
] | 873,995 | 873,996 | u334141868 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
constexpr ll INF = 1000000000;
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
vector<in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
constexpr ll INF = 1000000000;
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
vector<in... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 873,997 | 873,998 | u955534952 | cpp |
p03061 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll l... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll l... | [
"assignment.change"
] | 874,003 | 874,004 | u241367243 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
template <class T> T gcd(T x, T y) {
// 最小公倍数を求める
if (y == 0)
return x;
gcd(y, x % y);
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (auto &&i : A) {
cin >> i;
}
// 前計算
vector<int> l(N), r(N);
l[0] = A[0];
r[N - 1] = A[N - 1];
fo... | #include <bits/stdc++.h>
using namespace std;
template <class T> T gcd(T x, T y) {
// 最小公倍数を求める
if (y == 0)
return x;
gcd(y, x % y);
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (auto &&i : A) {
cin >> i;
}
// 前計算
vector<int> l(N), r(N);
l[0] = A[0];
r[N - 1] = A[N - 1];
fo... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,009 | 874,010 | u324303263 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
unsigned long long GCD(unsigned long long a, unsigned long long b) {
return (b == 0) ? a : GCD(b, a % b);
}
void solve() {
int n;
cin >> n;
int a[100000], b[100000], c[100000];
rep(i, n) { cin >> a[i]; }
b[0] = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
unsigned long long GCD(unsigned long long a, unsigned long long b) {
return (b == 0) ? a : GCD(b, a % b);
}
void solve() {
int n;
cin >> n;
int a[100000], b[100000], c[100000];
rep(i, n) { cin >> a[i]; }
b[0] = ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,037 | 874,038 | u331948661 | cpp |
p03061 | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, n) for (int i = 0; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b,... | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, n) for (int i = 0; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b,... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,044 | 874,045 | u829260400 | cpp |
p03061 | #include <iostream>
#include <vector>
using namespace std;
long long GCD(long long x, long long y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<long long> left(n, 0);
for (int i = ... | #include <iostream>
#include <vector>
using namespace std;
long long GCD(long long x, long long y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<long long> left(n + 1, 0);
for (int... | [
"assignment.change"
] | 874,056 | 874,057 | u912025537 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else if (b % a == 0) {
return a;
} else if (a > b) {
return gcd(b, a % b);
} else {
return gcd(a, b % a);
}
}
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> W(N);
for (i... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else if (b % a == 0) {
return a;
} else if (a > b) {
return gcd(b, a % b);
} else {
return gcd(a, b % a);
}
}
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> W(N);
for (i... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,068 | 874,069 | u042113240 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else if (b % a == 0) {
return a;
} else if (a > b) {
return gcd(a, a % b);
} else {
return gcd(b, b % a);
}
}
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> W(N);
for (i... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else if (b % a == 0) {
return a;
} else if (a > b) {
return gcd(b, a % b);
} else {
return gcd(a, b % a);
}
}
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> W(N);
for (i... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"assignment.value.change"
] | 874,070 | 874,069 | u042113240 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else if (b % a == 0) {
return a;
} else if (a > b) {
return gcd(a, a % b);
} else {
return gcd(b, b % a);
}
}
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> W(N);
for (i... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else if (b % a == 0) {
return a;
} else if (a > b) {
return gcd(b, a % b);
} else {
return gcd(a, b % a);
}
}
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> W(N);
for (i... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,071 | 874,069 | u042113240 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long gcd(long long a, long long b);
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1, 0);
for (long long i = 1; i <= n; ++i)
cin >> a[i];
vector<long long> l(n + 1, 0);
for (long long i = 1; i <= n; ++... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long gcd(long long a, long long b);
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1, 0);
for (long long i = 1; i <= n; ++i)
cin >> a[i];
vector<long long> l(n + 1, 0);
for (long long i = 1; i <= n; ++... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"literal.number.change",
"expression.operation.binary.change"
] | 874,072 | 874,073 | u964185015 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
// 再帰関数による最大公約数
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
vector<int> l(n), r(n); // l.at(i)は左から(i + 1)個の数のgcd，rは右から
l.at(0) =... | #include <bits/stdc++.h>
using namespace std;
// 再帰関数による最大公約数
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
vector<int> l(n), r(n); // l.at(i)は左から(i + 1)個の数のgcd，rは右から
l.at(0) =... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,082 | 874,083 | u979163294 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | [
"assignment.variable.change",
"identifier.change"
] | 874,088 | 874,089 | u052332717 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<char, LL> P;
const LL mod = 998244353;
const LL LINF = 1LL << 62;
c... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<char, LL> P;
const LL mod = 998244353;
const LL LINF = 1LL << 62;
c... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 874,092 | 874,091 | u640323045 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x % y, y);
}
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x % y, y);
}
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
... | [
"assignment.change",
"expression.operation.binary.remove"
] | 874,095 | 874,096 | u942160358 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x % y, y);
}
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x % y, y);
}
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
... | [
"assignment.change",
"expression.operation.binary.remove",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 874,097 | 874,096 | u942160358 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int gcd(long x, long y) {
long tmp, r;
if (x < y) {
tmp = x;
x = y;
y = tmp;
}
r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int main() {
long n;
long long int ans... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int gcd(long x, long y) {
long tmp, r;
if (x < y) {
tmp = x;
x = y;
y = tmp;
}
r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int main() {
long n;
long long int ans... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,101 | 874,102 | u961052574 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int gcd(int x, int y) {
int tmp, r;
if (x < y) {
tmp = x;
x = y;
y = tmp;
}
r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int main() {
long n;
long long int ans = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int gcd(long x, long y) {
long tmp, r;
if (x < y) {
tmp = x;
x = y;
y = tmp;
}
r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int main() {
long n;
long long int ans... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,103 | 874,102 | u961052574 | cpp |
p03061 | #include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
int N;
cin >> N;
long long *A = new long long[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long ... | #include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
int N;
cin >> N;
long long *A = new long long[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long ... | [
"assignment.value.change",
"identifier.change"
] | 874,118 | 874,119 | u951403082 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
//#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
//#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | [
"call.arguments.change"
] | 874,127 | 874,128 | u509680664 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
//#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
//#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | [
"call.arguments.change"
] | 874,129 | 874,130 | u509680664 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#d... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#d... | [
"call.arguments.change",
"call.arguments.add"
] | 874,133 | 874,134 | u509680664 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#d... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#d... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,135 | 874,134 | u509680664 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#d... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#d... | [
"assignment.change"
] | 874,136 | 874,134 | u509680664 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.