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;
/* #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",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,137 | 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... | [
"call.arguments.change",
"call.arguments.add"
] | 874,133 | 874,138 | 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,138 | 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,138 | 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,139 | 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",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,137 | 874,139 | u509680664 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
#define intv vector<int>
#define llv vector<long long>
#define intvv vec... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
#define intv vector<int>
#define llv vector<long long>
#define intvv vec... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 874,144 | 874,145 | u379440427 | cpp |
p03061 | #include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int temp = a;
a = b;
b = temp;
}
while (a % b != 0) {
int temp = a;
a = b;
b = temp... | #include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int temp = a;
a = b;
b = temp;
}
while (a % b != 0) {
int temp = a;
a = b;
b = temp... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 874,152 | 874,153 | u161609067 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
int a[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int l[100010] = {};
int r[100010] = {};
for (int i = 0; i < n; i++) {
if (l[i] == 0) {
l[i + 1] = a[i];
} else {
l[... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
int a[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int l[100010] = {};
int r[100010] = {};
for (int i = 0; i < n; i++) {
if (l[i] == 0) {
l[i + 1] = a[i];
} else {
l[... | [
"assignment.change"
] | 874,163 | 874,164 | u221119670 | cpp |
p03061 |
// C
#include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
if (a < b)
swap(a, b);
// cout << a << " " << b << endl;
if (b == 0)
return a;
else
return GCD(a % b, b);
}
int main() {
int N;
cin >> N;
int A[N];
int L[N];
int R[N];
for (int i = 0; i < N; i++)
cin >> A[i... |
// C
#include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
if (a < b)
swap(a, b);
// cout << a << " " << b << endl;
if (b == 0)
return a;
else
return GCD(a % b, b);
}
int main() {
int N;
cin >> N;
int A[N];
int L[N];
int R[N];
for (int i = 0; i < N; i++)
cin >> A[i... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 874,167 | 874,168 | u583701239 | 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[i];
vector<int> r(n), l(n);
rep(i, n) l[i + 1] = g... | //#include <bits/stdc++.h>
#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> r(n), l(n);... | [
"assignment.change"
] | 874,169 | 874,170 | u365159808 | cpp |
p03061 | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2... | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2... | [
"identifier.change",
"call.arguments.change"
] | 874,173 | 874,174 | u548768105 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long int gcd(long long int m, long long int n) {
if (n == 0) {
return m;
}
return gcd(n, m % n);
}
long long int lcm(long long int number1, long long int number2) {
return number1 * number2 / gcd(number1, number2);
}
ll max2(ll a, ll... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long int gcd(long long int m, long long int n) {
if (n == 0) {
return m;
}
return gcd(n, m % n);
}
long long int lcm(long long int number1, long long int number2) {
return number1 * number2 / gcd(number1, number2);
}
ll max2(ll a, ... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 874,181 | 874,182 | u096717230 | cpp |
p03061 | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ... | #include "bits/stdc++.h"
#define ed cout << "\n";
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,183 | 874,184 | u662918817 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll euq_gcd(ll a, ll b) { return b ? euq_gcd(b, a % b) : a; }
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
for (ll i = 1; i <= N; i++)
cin >> A[i];
vector<ll> L(N), R(N);
L[0] = R[N +... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll euq_gcd(ll a, ll b) { return b ? euq_gcd(b, a % b) : a; }
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
for (ll i = 1; i <= N; i++)
cin >> A[i];
vector<ll> L(N), R(N + 2);
L[0] = R... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,187 | 874,186 | u703503553 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll euq_gcd(ll a, ll b) { return b ? euq_gcd(b, a % b) : a; }
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
for (ll i = 1; i <= N; i++)
cin >> A[i];
vector<ll> L(N), R(N);
L[0] = R[N +... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll euq_gcd(ll a, ll b) { return b ? euq_gcd(b, a % b) : a; }
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
for (ll i = 1; i <= N; i++)
cin >> A[i];
vector<ll> L(N), R(N + 2);
L[0] = R... | [
"assignment.change"
] | 874,188 | 874,186 | u703503553 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll euq_gcd(ll a, ll b) { return b ? euq_gcd(b, a % b) : a; }
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (int i = 1; i <= N; i++)
cin >> A[i];
vector<ll> L(N), R(N);
L[0] = R[N... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll euq_gcd(ll a, ll b) { return b ? euq_gcd(b, a % b) : a; }
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
for (ll i = 1; i <= N; i++)
cin >> A[i];
vector<ll> L(N), R(N + 2);
L[0] = R... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 874,189 | 874,186 | u703503553 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#incl... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#incl... | [
"identifier.change",
"call.arguments.change"
] | 874,190 | 874,191 | u271719815 | cpp |
p03061 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 874,199 | 874,200 | u062324064 | cpp |
p03061 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | [
"assignment.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 874,201 | 874,200 | u062324064 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
// http://drken1215.hatenablog.com/entry/2019/04/27/224100_1
int n;
ll *A;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
gcd(b, a % b);
}
}
int main(void) {
cin... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
// http://drken1215.hatenablog.com/entry/2019/04/27/224100_1
int n;
ll *A;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
gcd(b, a % b);
}
}
int main(void) {
cin... | [] | 874,214 | 874,215 | u871841829 | cpp |
p03061 | #include <iostream>
#include <vector>
using namespace std;
using ll = long long int;
//拡張ユークリッドの互除法
// ax + by = cとなるようなc=gcd(a,b)をxをペアにして返す
// firstがx,secondがc
template <typename number>
pair<number, number> extended_euclid(number a, number b) {
number r0, r1, a0, a1, b0, b1;
r0 = a;
r1 = b;
a0 = 1;
a1 = 0... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long int;
//拡張ユークリッドの互除法
// ax + by = cとなるようなc=gcd(a,b)をxをペアにして返す
// firstがx,secondがc
template <typename number>
pair<number, number> extended_euclid(number a, number b) {
number r0, r1, a0, a1, b0, b1;
r0 = a;
r1 = b;
a0 = 1;
a1 = 0... | [] | 874,216 | 874,217 | u432897824 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../lib/dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
ll gcd(ll a, ll b) { return (a == 0) ? b ... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../lib/dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
ll gcd(ll a, ll b) { return (a == 0) ? b ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,225 | 874,226 | u147305315 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define ll long long
unsigned euclidean_gcd(unsigned a, unsigned b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define ll long long
unsigned euclidean_gcd(unsigned a, unsigned b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a... | [
"assignment.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,227 | 874,228 | u030848580 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
ll tmp;
ll r;
if (a == 0)
return b;
if (b == 0)
return a;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
ll tmp;
ll r;
if (a == 0)
return b;
if (b == 0)
return a;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.loop.for.initializer.change"
] | 874,235 | 874,236 | u988076584 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
// 0 - indexed
template <typename Monoid> struct Segmenttree {
using F = function<Monoid(Monoid, Monoi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
// 0 - indexed
template <typename Monoid> struct Segmenttree {
using F = function<Monoid(Monoid, Monoi... | [
"assignment.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,241 | 874,242 | u394482932 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
// 0 - indexed
template <typename Monoid> struct Segmenttree {
using F = function<Monoid(Monoid, Monoi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
// 0 - indexed
template <typename Monoid> struct Segmenttree {
using F = function<Monoid(Monoid, Monoi... | [
"assignment.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.function.change"
] | 874,241 | 874,243 | u394482932 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
ll gcd(ll a, ll b) { return (b ? gcd(b, a % b) : a); }
ll lcm(ll a, ll b) { return a / (gcd(a, b)) * b; }
template <typename T> void print(vector<T> vec) {
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
ll gcd(ll a, ll b) { return (b ? gcd(b, a % b) : a); }
ll lcm(ll a, ll b) { return a / (gcd(a, b)) * b; }
template <typename T> void print(vector<T> vec) {
int ... | [
"identifier.replace.add",
"literal.replace.remove"
] | 874,244 | 874,245 | u394482932 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int n;
cin >> n;
VI a(n);
REP(i, n)
cin >> a[i];
VI sb(n);
sb[0] =... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int n;
cin >> n;
VI a(n);
REP(i, n)
cin >> a[i];
VI sb(n);
sb[0] =... | [
"assignment.change"
] | 874,251 | 874,252 | u408650734 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int main() {
int n;
cin >> n;
vector<int> a(n + 2);
for (int i = 1; i <= n; ++i)
cin >> a[i];
vector<int> l(n + 2, 0), r(n + 2, 0);
for (int i = 1; i <= n; ++i)
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int main() {
int n;
cin >> n;
vector<int> a(n + 2);
for (int i = 1; i <= n; ++i)
cin >> a[i];
vector<int> l(n + 2, 0), r(n + 2, 0);
for (int i = 1; i <= n; ++i)
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,258 | 874,259 | u848359007 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int gf[MAXN], ge[MAXN], n, a[MAXN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i], gf[i] = __gcd(a[i], gf[i - 1]);
for (int i = n; i >= 0; i--)
ge[i] = __gcd(ge[i], ge[i + 1]);
int ans = 0;
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int gf[MAXN], ge[MAXN], n, a[MAXN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i], gf[i] = __gcd(a[i], gf[i - 1]);
for (int i = n; i >= 0; i--)
ge[i] = __gcd(a[i], ge[i + 1]);
int ans = 0;
for (int i = 1; i <=... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,260 | 874,261 | u494617175 | cpp |
p03061 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
static const int Max = 100000;
long long gcd(long long a, long long b) {
long long tmp;
while (b != 0) {
tmp = b;
b = a % b;
a = tmp;
}
return a;
}
int main() {
int n;
cin >> n;
vector<long long... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
static const int Max = 100000;
long long gcd(long long a, long long b) {
long long tmp;
while (b != 0) {
tmp = b;
b = a % b;
a = tmp;
}
return a;
}
int main() {
int n;
cin >> n;
vector<long lon... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 874,264 | 874,263 | u839397805 | cpp |
p03061 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n, x) for (int i = n; i < x; i++)
#define SORT(x) sort(x.begin... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n, x) for (int i = n; i < x; i++)
#define SORT(x) sort(x.begin... | [
"expression.operation.binary.add"
] | 874,271 | 874,272 | u526854325 | cpp |
p03061 | #define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#define DIVIDER9 1000000007
#define lli long long int
#include <fstream>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef _WIN32
#pragma warning(disable : 4101)
signe... | #define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#define DIVIDER9 1000000007
#define lli long long int
#include <fstream>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
#ifdef _WIN32
#pragma warning(disable : 4101)
signe... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 874,296 | 874,297 | u575781793 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
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, 0);
REP(i, n) { cin >> a[i];... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
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, 0);
REP(i, n) { cin >> a[i];... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 874,300 | 874,301 | u376859266 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int N;
vector<int> A(N, 0);
vector<int> l(N, 0), r(N, 0);
for (auto &&a : A) {
cin >> a;
}
for (int i = 0; i < N - 1; ++i) {
... | #include <algorithm>
#include <iostream>
#include <vector>
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, 0);
vector<int> l(N, 0), r(N, 0);
for (auto &&a : A) {
cin >> a;
}
for (int i = 0; i < N - 1;... | [] | 874,302 | 874,303 | u894555185 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int N;
vector<int> A(N, 0);
vector<int> l(N, 0), r(N, 0);
for (auto &&a : A) {
cin >> a;
}
for (int i = 0; i < N - 1; ++i) {
... | #include <algorithm>
#include <iostream>
#include <vector>
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, 0);
vector<int> l(N, 0), r(N, 0);
for (auto &&a : A) {
cin >> a;
}
for (int i = 0; i < N - 1;... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,304 | 874,303 | u894555185 | cpp |
p03061 | #include <bits/stdc++.h>
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];
// 累積 GCD (左と右両方)
vector<int> left(N + 1, 0), right(N + 1, 0);
for (int i = 0; i < N; ++i)
left[i + 1] ... | #include <bits/stdc++.h>
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];
// 累積 GCD (左と右両方)
vector<int> left(N + 1, 0), right(N + 1, 0);
for (int i = 0; i < N; ++i)
left[i + 1] ... | [
"assignment.change"
] | 874,310 | 874,311 | u800100718 | cpp |
p03061 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 874,314 | 874,315 | u700484101 | cpp |
p03061 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | [
"call.arguments.change"
] | 874,316 | 874,317 | u700484101 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
ll gcd(ll a, ll b) {
if (b == ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
ll gcd(ll a, ll b) {
if (b == ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,318 | 874,319 | u582848517 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
ll gcd(ll a, ll b) {
if (b == ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
ll gcd(ll a, ll b) {
if (b == ... | [
"expression.operation.binary.remove"
] | 874,320 | 874,319 | u582848517 | cpp |
p03061 | #include <bits/stdc++.h>
using ll = long long;
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;
ll A[100000], g[100000], gr[100000];
cin >> N;
for (int i(0); i < N; i++)
cin >> A[i];
g[0] ... | #include <bits/stdc++.h>
using ll = long long;
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;
ll A[100000], g[100000], gr[100000];
cin >> N;
for (int i(0); i < N; i++)
cin >> A[i];
g[0] ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"assignment.change",
"literal.number.change",
"variable_access.subscript.index.change"
] | 874,321 | 874,322 | u991846372 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x % y, y);
}
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> L(N, 0), R(N, 0);
L[... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x % y, y);
}
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> L(N, 0), R(N, 0);
L[... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 874,328 | 874,329 | u547844563 | cpp |
p03056 | /*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄... | /*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 874,334 | 874,335 | u139147798 | cpp |
p03056 | #include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#include <vector>
#define dibs reserv... | #include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#include <vector>
#define dibs reserv... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 874,340 | 874,341 | u642082255 | cpp |
p03056 | #include <bits/stdc++.h>
#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 MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = 998244353;
int n, m;
char dat[190][190];
int dpr[190][190][190], dpd[190][190... | #include <bits/stdc++.h>
#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 MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = 998244353;
int n, m;
char dat[190][190];
int dpr[190][190][190], dpd[190][190... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 874,348 | 874,349 | u103391254 | cpp |
p03056 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// gp_hash_table<int, int> mapka;
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#defi... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// gp_hash_table<int, int> mapka;
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#defi... | [] | 874,350 | 874,351 | u200679581 | cpp |
p03056 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author izban
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dbl;
#ifdef HOME
#define db(x)... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author izban
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dbl;
#ifdef HOME
#define db(x)... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.primitive.change"
] | 874,356 | 874,357 | u039462798 | cpp |
p03056 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) for (int i = (0); i < (n); i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;
typedef vec... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) for (int i = (0); i < (n); i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;
typedef vec... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 874,358 | 874,359 | u603486542 | cpp |
p03057 | #include <cstdio>
#include <iostream>
#define RI register int
#define CI const int &
using namespace std;
const int N = 200005, mod = 1e9 + 7;
int n, m, c[N], k, lst, f[N], pfx[N], ans;
char s[N];
inline int sum(CI x, CI y) {
int t = x + y;
return t >= mod ? t - mod : t;
}
namespace SP // one char solver
{
int f[N]... | #include <cstdio>
#include <iostream>
#define RI register int
#define CI const int &
using namespace std;
const int N = 200005, mod = 1e9 + 7;
int n, m, c[N], k, lst, f[N], pfx[N], ans;
char s[N];
inline int sum(CI x, CI y) {
int t = x + y;
return t >= mod ? t - mod : t;
}
namespace SP // one char solver
{
int f[N]... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 874,374 | 874,375 | u803115645 | cpp |
p03057 | #include <bits/stdc++.h>
#define rep(i, n) for ((i) = 1; (i) <= (n); (i)++)
using namespace std;
const int mod = 1e9 + 7;
int n, m, i, lst, dp[200005], s[200005], f[200005][2], tmp, mi = 0x3f3f3f3f, l;
string st;
int main() {
cin >> n >> m;
cin >> st;
st = " " + st;
i = 1;
lst = 1;
while (i <= n) {
if (... | #include <bits/stdc++.h>
#define rep(i, n) for ((i) = 1; (i) <= (n); (i)++)
using namespace std;
const int mod = 1e9 + 7;
int n, m, i, lst, dp[200005], s[200005], f[200005][2], tmp, mi = 0x3f3f3f3f, l;
string st;
int main() {
cin >> n >> m;
cin >> st;
st = " " + st;
i = 1;
lst = 1;
while (i <= m) {
if (... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 874,378 | 874,379 | u878185566 | cpp |
p03057 | #include <bits/stdc++.h>
#define rep(i, n) for ((i) = 1; (i) <= (n); (i)++)
using namespace std;
const int mod = 1e9 + 7;
int n, m, i, lst, dp[100005], s[100005], f[100005][2], tmp, mi = 0x3f3f3f3f, l;
string st;
int main() {
cin >> n >> m;
cin >> st;
st = " " + st;
i = 1;
lst = 1;
while (i <= n) {
if (... | #include <bits/stdc++.h>
#define rep(i, n) for ((i) = 1; (i) <= (n); (i)++)
using namespace std;
const int mod = 1e9 + 7;
int n, m, i, lst, dp[200005], s[200005], f[200005][2], tmp, mi = 0x3f3f3f3f, l;
string st;
int main() {
cin >> n >> m;
cin >> st;
st = " " + st;
i = 1;
lst = 1;
while (i <= m) {
if (... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"control_flow.loop.condition.change"
] | 874,380 | 874,379 | u878185566 | cpp |
p03057 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 201000, mod = 1e9 + 7;
char s[N];
int a[N], n, m;
void solve1() {
int f[N][2][2];
memset(f, 0, sizeof(f));
f[1][1][1] = f[1][0][0] = 1;
auto upd = [](int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
};
for (int i ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 501000, mod = 1e9 + 7;
char s[N];
int a[N], n, m;
void solve1() {
int f[N][2][2];
memset(f, 0, sizeof(f));
f[1][1][1] = f[1][0][0] = 1;
auto upd = [](int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
};
for (int i ... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change"
] | 874,410 | 874,411 | u684730254 | cpp |
p03057 | #include <bits/stdc++.h>
#define ll long long
#define mo 1000000007
#define N 200010
using namespace std;
int n, m, a[N], b[N], nb;
ll dp[N], s[N], ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
char ch = getchar();
while (ch != 'R' && ch != 'B')
ch = getchar();
a[i] = (ch == 'R')... | #include <bits/stdc++.h>
#define ll long long
#define mo 1000000007
#define N 200010
using namespace std;
int n, m, a[N], b[N], nb;
ll dp[N], s[N], ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
char ch = getchar();
while (ch != 'R' && ch != 'B')
ch = getchar();
a[i] = (ch == 'R')... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 874,412 | 874,413 | u539443668 | cpp |
p03057 | #include <bits/stdc++.h>
#define ll long long
#define mo 1000000007
#define N 200010
using namespace std;
int n, m, a[N], b[N], nb;
ll dp[N], s[N], ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
char ch = getchar();
while (ch != 'R' && ch != 'B')
ch = getchar();
a[i] = (ch == 'R')... | #include <bits/stdc++.h>
#define ll long long
#define mo 1000000007
#define N 200010
using namespace std;
int n, m, a[N], b[N], nb;
ll dp[N], s[N], ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
char ch = getchar();
while (ch != 'R' && ch != 'B')
ch = getchar();
a[i] = (ch == 'R')... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"assignment.change"
] | 874,414 | 874,413 | u539443668 | cpp |
p03057 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double louble;
template <typename T1, typename T2> inline T1 max(T1 a, T2 b) {
return a < b ? b : a;
}
template <typename T1, typename T2> inline T1 min(T1 a, T2 b) {
return a < b ? a : b;
}
namespace ae86 {
const int bufl = 1 << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double louble;
template <typename T1, typename T2> inline T1 max(T1 a, T2 b) {
return a < b ? b : a;
}
template <typename T1, typename T2> inline T1 min(T1 a, T2 b) {
return a < b ? a : b;
}
namespace ae86 {
const int bufl = 1 << ... | [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 874,418 | 874,419 | u326034736 | cpp |
p03057 | /*
¼ÙÉèS[1] =
R¡£ÄÇôÏÔÈ»£¬»·Éϲ»»á³öÏÖÁ½¸öÁ¬ÐøµÄ±ß¶¼ÊÇB£¬·ñÔòÔÚËüÃǽ»µã´¦µÚÒ»²½ÍùÁ½±ß×߶¼²»ºÏ·¨
ÌØÅеôSÖÐÈ«ÊÇRµÄÇé¿ö£¬¿¼ÂÇÒ»°ãÇé¿ö
Ê×ÏÈ°ÑËùÓÐÊÇBµÄλÖöϿª£¬ÄÇô¾ÍÐγÉÁËÈô¸É¸öRµÄÁ¬Ðø¶Î¡£¿ÉÒÔ·¢ÏÖÕâôһ¸öÐÔÖÊ£ºÃ¿¸öÁ¬Ðø¶ÎµÄ³¤¶È¾ùΪÆæÊý
Ö¤Ã÷¿¼ÂÇ·´Ö¤¡£¼ÙÉèÓÐÒ»¸öżÊýµÄ¶Î£¬¿¼ÂǶþ·Öͼ¿ÉÒÔ·¢ÏÖ£¬ÄÇôÓеĵã×ßµ½ÕâÒ»¶ÎµÄ¶Ëµã¾àÀëÓÀÔ... | /*
¼ÙÉèS[1] =
R¡£ÄÇôÏÔÈ»£¬»·Éϲ»»á³öÏÖÁ½¸öÁ¬ÐøµÄ±ß¶¼ÊÇB£¬·ñÔòÔÚËüÃǽ»µã´¦µÚÒ»²½ÍùÁ½±ß×߶¼²»ºÏ·¨
ÌØÅеôSÖÐÈ«ÊÇRµÄÇé¿ö£¬¿¼ÂÇÒ»°ãÇé¿ö
Ê×ÏÈ°ÑËùÓÐÊÇBµÄλÖöϿª£¬ÄÇô¾ÍÐγÉÁËÈô¸É¸öRµÄÁ¬Ðø¶Î¡£¿ÉÒÔ·¢ÏÖÕâôһ¸öÐÔÖÊ£ºÃ¿¸öÁ¬Ðø¶ÎµÄ³¤¶È¾ùΪÆæÊý
Ö¤Ã÷¿¼ÂÇ·´Ö¤¡£¼ÙÉèÓÐÒ»¸öżÊýµÄ¶Î£¬¿¼ÂǶþ·Öͼ¿ÉÒÔ·¢ÏÖ£¬ÄÇôÓеĵã×ßµ½ÕâÒ»¶ÎµÄ¶Ëµã¾àÀëÓÀÔ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 874,428 | 874,429 | u710399266 | cpp |
p03057 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
int gi() {
int x = 0, o = 1;
char ch = getchar();
while (!isdigit(ch) && ch != '-')
ch = getchar();
if (ch == '-')
o = -1, ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
re... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
int gi() {
int x = 0, o = 1;
char ch = getchar();
while (!isdigit(ch) && ch != '-')
ch = getchar();
if (ch == '-')
o = -1, ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
re... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 874,430 | 874,431 | u030892114 | cpp |
p03057 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const ll N = 2e5 + 10, mo = 1e9 + 7;
ll f[N], n, m, lim, q[N];
char s[N];
void move(ll &a, ll b) { a = (a + b) % mo; }
int main() {
cin >> n >> m;
scanf("%s", s + 1);
if (s[1] == 'B') {
for (ll i = 1; i <= m; i... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const ll N = 2e5 + 10, mo = 1e9 + 7;
ll f[N], n, m, lim, q[N];
char s[N];
void move(ll &a, ll b) { a = (a + b) % mo; }
int main() {
cin >> n >> m;
scanf("%s", s + 1);
if (s[1] == 'B') {
for (ll i = 1; i <= m; i... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change",
"assignment.value.change"
] | 874,434 | 874,435 | u493993074 | cpp |
p03057 | #include <bits/stdc++.h>
using namespace std;
const int P = 1000000007;
int n, m, dp[200005], sum[2][200005];
char s[200005];
int main() {
scanf("%d%d%s", &n, &m, s + 1);
if (count(s + 1, s + 1 + m, s[1]) == m) {
if (n == 1)
return puts("1"), 0;
int ans = 0;
for (int c = 0; c < 2; ++c) {
i... | #include <bits/stdc++.h>
using namespace std;
const int P = 1000000007;
int n, m, dp[200005], sum[2][200005];
char s[200005];
int main() {
scanf("%d%d%s", &n, &m, s + 1);
if (count(s + 1, s + 1 + m, s[1]) == m) {
if (n == 1)
return puts("1"), 0;
int ans = 0;
for (int c = 0; c < 2; ++c) {
i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 874,436 | 874,437 | u760178976 | cpp |
p03057 | #include <bits/stdc++.h>
using namespace std;
const int N = 200100, mod = 1000000007;
typedef long long ll;
int f[N], sum[N], n, m;
char s[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> (s + 1);
int mn = max(n, m) + 1, sz = 0, flag = 0;
for (int i = 1; i <= m; ++i)
... | #include <bits/stdc++.h>
using namespace std;
const int N = 200100, mod = 1000000007;
typedef long long ll;
int f[N], sum[N], n, m;
char s[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> (s + 1);
int mn = max(n, m) + 1, sz = 0, flag = 0;
for (int i = 1; i <= m; ++i)
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 874,440 | 874,441 | u922461964 | cpp |
p03057 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define N (200010)
#define P (1000000007)
#define M ()
#define inf (0x7f7f7f7f)
#define rg register int
#define Label puts("NAIVE")
#define sp... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define N (200010)
#define P (1000000007)
#define M ()
#define inf (0x7f7f7f7f)
#define rg register int
#define Label puts("NAIVE")
#define sp... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 874,442 | 874,443 | u293624543 | cpp |
p03057 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define N (200010)
#define P (1000000007)
#define M ()
#define inf (0x7f7f7f7f)
#define rg register int
#define Label puts("NAIVE")
#define sp... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define N (200010)
#define P (1000000007)
#define M ()
#define inf (0x7f7f7f7f)
#define rg register int
#define Label puts("NAIVE")
#define sp... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 874,444 | 874,443 | u293624543 | cpp |
p03057 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define N (200010)
#define P (1000000007)
#define M ()
#define inf (0x7f7f7f7f)
#define rg register int
#define Label puts("NAIVE")
#define sp... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define N (200010)
#define P (1000000007)
#define M ()
#define inf (0x7f7f7f7f)
#define rg register int
#define Label puts("NAIVE")
#define sp... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.string.change"
] | 874,445 | 874,443 | u293624543 | cpp |
p03057 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#define FILL(a, n, x) memset((a), (x), sizeof((a)[0]) * (n))
#define COPY(a, n, b) memcpy((b), (a), sizeof((a)[0]) * (n))
using namespace std;
typedef long long li;
const int mod = 1e9 + 7;
inline int Add(int x) { return x >= mod ? x - mod : x... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#define FILL(a, n, x) memset((a), (x), sizeof((a)[0]) * (n))
#define COPY(a, n, b) memcpy((b), (a), sizeof((a)[0]) * (n))
using namespace std;
typedef long long li;
const int mod = 1e9 + 7;
inline int Add(int x) { return x >= mod ? x - mod : x... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 874,446 | 874,447 | u264510475 | cpp |
p03057 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#define FILL(a, n, x) memset((a), (x), sizeof((a)[0]) * (n))
#define COPY(a, n, b) memcpy((b), (a), sizeof((a)[0]) * (n))
using namespace std;
typedef long long li;
const int mod = 1e9 + 7;
inline int Add(int x) { return x >= mod ? x - mod : x... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#define FILL(a, n, x) memset((a), (x), sizeof((a)[0]) * (n))
#define COPY(a, n, b) memcpy((b), (a), sizeof((a)[0]) * (n))
using namespace std;
typedef long long li;
const int mod = 1e9 + 7;
inline int Add(int x) { return x >= mod ? x - mod : x... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.add",
"call.arguments.change"
] | 874,448 | 874,447 | u264510475 | cpp |
p03057 | #include <bits/stdc++.h>
#define ll long long
#define mod 998244353
using namespace std;
const int N = 200010;
int n, m, ans, f[N], g[N];
char s[N];
void inc(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
}
void dec(int &x, int y) {
x -= y;
if (x < 0)
x += mod;
}
int main() {
// freopen("E.in","r"... | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
const int N = 200010;
int n, m, ans, f[N], g[N];
char s[N];
void inc(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
}
void dec(int &x, int y) {
x -= y;
if (x < 0)
x += mod;
}
int main() {
// freopen("E.in","... | [
"preprocessor.define.value.change",
"literal.integer.change",
"call.remove",
"call.arguments.change"
] | 874,470 | 874,471 | u323092931 | cpp |
p03057 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T, T MOD = 1000000007> struct Mint {
T ... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T, T MOD = 1000000007> struct Mint {
T ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 874,472 | 874,473 | u687214625 | cpp |
p03057 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"identifier.change",
"control_flow.loop.condition.change",
"misc.opposites"
] | 874,478 | 874,475 | u352642493 | cpp |
p03057 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"identifier.change",
"control_flow.loop.condition.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites"
] | 874,478 | 874,479 | u352642493 | cpp |
p03057 | #include <algorithm>
#include <cstdio>
#define Pr(f, ...) printf(f, ##__VA_ARGS__), fflush(stdout)
#define rep(i, s, t) for (int i = s; i <= (t); ++i)
#define dec(i, s, t) for (int i = s; i >= (t); --i)
#define lop(i, s, t) for (int i = s; i < (t); ++i)
using namespace std;
const int N = 200050, P = 1e9 + 7;
int n, m... | #include <algorithm>
#include <cstdio>
#define Pr(f, ...) printf(f, ##__VA_ARGS__), fflush(stdout)
#define rep(i, s, t) for (int i = s; i <= (t); ++i)
#define dec(i, s, t) for (int i = s; i >= (t); --i)
#define lop(i, s, t) for (int i = s; i < (t); ++i)
using namespace std;
const int N = 200050, P = 1e9 + 7;
int n, m... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 874,480 | 874,481 | u071794493 | cpp |
p03057 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unis... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unis... | [
"control_flow.branch.if.condition.change"
] | 874,484 | 874,485 | u006204672 | cpp |
p03057 | #include <algorithm>
#include <cstdio>
using std::min;
const int MOD = 1000000007;
const int MAXN = 200011, MAXM = 200011;
inline int sum(const int &a, const int &b) {
return (a + b >= MOD) ? (a + b - MOD) : (a + b);
}
inline int mul(const int &a, const int &b) {
return (int)((1LL * a * b) % (long long)(MOD));... | #include <algorithm>
#include <cstdio>
using std::min;
const int MOD = 1000000007;
const int MAXN = 200011, MAXM = 200011;
inline int sum(const int &a, const int &b) {
return (a + b >= MOD) ? (a + b - MOD) : (a + b);
}
inline int mul(const int &a, const int &b) {
return (int)((1LL * a * b) % (long long)(MOD));... | [
"call.add",
"call.arguments.change"
] | 874,486 | 874,487 | u577683651 | cpp |
p03057 | // minamoto
#include <bits/stdc++.h>
#define R register
#define inline __inline__ __attribute__((always_inline))
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
tem... | // minamoto
#include <bits/stdc++.h>
#define R register
#define inline __inline__ __attribute__((always_inline))
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
tem... | [
"identifier.change",
"call.arguments.change"
] | 874,488 | 874,489 | u561765782 | cpp |
p03057 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int Q = 1 << 19;
char s[Q];
int n, m;
const int MOD = 1e9 + 7;
inline int add(int a, int b) {
a += b;
return a >= MOD ? a - MOD : a;
}
inline int sub(int a, int b) {
a -= b;
return a < 0 ? a + MOD : a;
}
inline int mul(int a, ... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int Q = 1 << 19;
char s[Q];
int n, m;
const int MOD = 1e9 + 7;
inline int add(int a, int b) {
a += b;
return a >= MOD ? a - MOD : a;
}
inline int sub(int a, int b) {
a -= b;
return a < 0 ? a + MOD : a;
}
inline int mul(int a, ... | [
"call.remove"
] | 874,494 | 874,495 | u140310696 | cpp |
p03057 | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define lg long long
#define db double
#define lb(x) ((x) & -(x))
#define ft first
#define sd second
#define HII cerr << "HI" << endl
#define LLLINE cerr << "@@@@@@@@@@@@@@@@@@@@" << endl
template <clas... | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define lg long long
#define db double
#define lb(x) ((x) & -(x))
#define ft first
#define sd second
#define HII cerr << "HI" << endl
#define LLLINE cerr << "@@@@@@@@@@@@@@@@@@@@" << endl
template <clas... | [
"assignment.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 874,511 | 874,512 | u236677506 | cpp |
p03057 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 874,519 | 874,520 | u284124505 | cpp |
p03057 | #include <bits/stdc++.h>
#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 MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = 1e9 + 7;
int n, m;
char S[200005];
vector<int> sizs;
int dp[200005], prs[2000... | #include <bits/stdc++.h>
#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 MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = 1e9 + 7;
int n, m;
char S[200005];
vector<int> sizs;
int dp[200005], prs[2000... | [
"control_flow.branch.if.condition.change"
] | 874,524 | 874,525 | u103391254 | cpp |
p03057 | #include <bits/stdc++.h>
using namespace std;
const int md = (int)1e9 + 7;
inline void add(int &x, int y) {
x += y;
if (x >= md) {
x -= md;
}
}
inline void sub(int &x, int y) {
x -= y;
if (x < 0) {
x += md;
}
}
inline int mul(int x, int y) { return (int)((long long)x * y % md); }
int main() {
... | #include <bits/stdc++.h>
using namespace std;
const int md = (int)1e9 + 7;
inline void add(int &x, int y) {
x += y;
if (x >= md) {
x -= md;
}
}
inline void sub(int &x, int y) {
x -= y;
if (x < 0) {
x += md;
}
}
inline int mul(int x, int y) { return (int)((long long)x * y % md); }
int main() {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.update.change",
"assignment.change"
] | 874,532 | 874,533 | u877679608 | cpp |
p03057 | #include <bits/stdc++.h>
#define ll long long
#define inf 1010000000
#define infll 1010000000000000000ll
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mpr make_pair
#define fi first
#define se second
#define vi vector<int>
#define pb push_back
#define mod 1000000007
#define ad(x, y) (x = (x + (y)) % mod)
... | #include <bits/stdc++.h>
#define ll long long
#define inf 1010000000
#define infll 1010000000000000000ll
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mpr make_pair
#define fi first
#define se second
#define vi vector<int>
#define pb push_back
#define mod 1000000007
#define ad(x, y) (x = (x + (y)) % mod)
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change"
] | 874,538 | 874,539 | u070528238 | cpp |
p03058 | #include <bits/stdc++.h>
const int N = 2005;
struct edge {
int to, nxt;
} e[N << 1];
int n, m, head[N], tot;
void link(int x, int y) {
e[++tot] = (edge){y, head[x]}, head[x] = tot;
e[++tot] = (edge){x, head[y]}, head[y] = tot;
}
typedef std::bitset<N> bitset;
int f[N], next[N][N], lca[N][N];
bitset path[N],... | #include <bits/stdc++.h>
const int N = 2005;
struct edge {
int to, nxt;
} e[N << 1];
int n, m, head[N], tot;
void link(int x, int y) {
e[++tot] = (edge){y, head[x]}, head[x] = tot;
e[++tot] = (edge){x, head[y]}, head[y] = tot;
}
typedef std::bitset<N> bitset;
int f[N], next[N][N], lca[N][N];
bitset path[N],... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 874,546 | 874,547 | u561635563 | cpp |
p03061 | #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
long gcd(long a, long b) {
if (a < b)
return gcd(b, a);
else {
if (b =... | #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
long gcd(long a, long b) {
if (a < b)
return gcd(b, a);
else {
if (b =... | [
"expression.operation.binary.remove",
"assignment.change"
] | 874,548 | 874,549 | u714120941 | cpp |
p03061 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 874,551 | 874,552 | u277556971 | cpp |
p03061 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++... | [
"identifier.change",
"call.function.change",
"io.output.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,553 | 874,552 | u277556971 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b != 0) {
return gcd(b, a % b);
}
return a;
}
int main() {
int N, p = 0;
cin >> N;
vector<int> A(N), right(N), left(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
right.at(N - 1) = A.at(N - 1);
left.at(0) = A.... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b != 0) {
return gcd(b, a % b);
}
return a;
}
int main() {
int N, p = 0;
cin >> N;
vector<int> A(N), right(N), left(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
right.at(N - 1) = A.at(N - 1);
left.at(0) = A.... | [
"io.output.change",
"call.remove"
] | 874,567 | 874,568 | u313578168 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b != 0) {
return gcd(b, a % b);
}
return a;
}
int main() {
int N, p = 0;
cin >> N;
vector<int> A(N), right(N), left(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
right.at(N - 1) = A.at(N - 1);
left.at(0) = A.... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b != 0) {
return gcd(b, a % b);
}
return a;
}
int main() {
int N, p = 0;
cin >> N;
vector<int> A(N), right(N), left(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
right.at(N - 1) = A.at(N - 1);
left.at(0) = A.... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 874,569 | 874,568 | u313578168 | cpp |
p03061 | #include <iostream>
#include <vector>
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, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> left(N - 1, 0);
vector<int> right(N - 1, 0);
left[0] = A[0];
r... | #include <iostream>
#include <vector>
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, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> left(N - 1, 0);
vector<int> right(N - 1, 0);
left[0] = A[0];
r... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,570 | 874,571 | u070471279 | cpp |
p03061 | #include <iostream>
#include <vector>
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, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> left(N - 1, 0);
vector<int> right(N - 1, 0);
left[0] = A[0];
r... | #include <iostream>
#include <vector>
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, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> left(N - 1, 0);
vector<int> right(N - 1, 0);
left[0] = A[0];
r... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 874,572 | 874,571 | u070471279 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int n, i;
std::cin >> n;
long long int a[n];
long long int front[n], back[n];
... | #include <bits/stdc++.h>
using namespace std;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int n, i;
std::cin >> n;
long long int a[n];
long long int front[n], back[n];
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,573 | 874,574 | u409569205 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int n, i;
std::cin >> n;
long long int a[n];
long long int front[n], back[n];
... | #include <bits/stdc++.h>
using namespace std;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int n, i;
std::cin >> n;
long long int a[n];
long long int front[n], back[n];
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,575 | 874,574 | u409569205 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int n, i;
std::cin >> n;
long long int a[n];
long long int front[n], back[n];
... | #include <bits/stdc++.h>
using namespace std;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int n, i;
std::cin >> n;
long long int a[n];
long long int front[n], back[n];
... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 874,576 | 874,574 | u409569205 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
}
vector<int> left_gcd(N);
vector<int> right_gcd(N);
left_gcd[0] = data[0];
right_gcd[N - 1] = data[N - 1];
for (i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
}
vector<int> left_gcd(N);
vector<int> right_gcd(N);
left_gcd[0] = data[0];
right_gcd[N - 1] = data[N - 1];
for (i... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 874,581 | 874,582 | u465631492 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a == 0)
return b;
else if (b == 0)
return a;
if (a >= b)
return gcd(a % b, b);
else
return gcd(a, b % a);
}
int main(void) {
int n;
vector<int> a, l, r;
cin >> n;
a.resize(n);
l.resize(n);
r.resize(n);
for ... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a == 0)
return b;
else if (b == 0)
return a;
if (a >= b)
return gcd(a % b, b);
else
return gcd(a, b % a);
}
int main(void) {
int n;
vector<int> a, l, r;
cin >> n;
a.resize(n);
l.resize(n);
r.resize(n);
for ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 874,586 | 874,587 | u688509741 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#de... | [
"literal.number.change",
"call.arguments.change"
] | 874,588 | 874,589 | u355254193 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long
#define pb push_back
#define INF (ll)1e18
#define IINF (int)1e9
#define FASTIO ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long
#define pb push_back
#define INF (ll)1e18
#define IINF (int)1e9
#define FASTIO ... | [
"expression.operation.binary.remove",
"assignment.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,598 | 874,599 | u923177560 | cpp |
p03061 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | [
"assignment.change"
] | 874,600 | 874,601 | u432551953 | cpp |
p03061 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"assignment.change"
] | 874,602 | 874,601 | u432551953 | cpp |
p03061 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | [
"expression.operation.binary.remove",
"assignment.change"
] | 874,603 | 874,601 | u432551953 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int a[100005], n, sum1[100005], sum2[100005], ans;
inline void swap(int x, int y) {
int t = x;
x = y;
y = t;
}
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0) {
return a;
} else
return gcd(b, a % b);
}
int main() {
cin >> n;
for (int ... | #include <bits/stdc++.h>
using namespace std;
int a[100005], n, sum1[100005], sum2[100005], ans;
inline void swap(int x, int y) {
int t = x;
x = y;
y = t;
}
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0) {
return a;
} else
return gcd(b, a % b);
}
int main() {
cin >> n;
for (int ... | [
"assignment.variable.change",
"identifier.change"
] | 874,611 | 874,612 | u858623137 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.