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 9
values |
|---|---|---|---|---|---|---|---|
p03014 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int h, w, cnt = 0, ind = 0, max = 0;
cin >> h >> w;
string s[h];
vector<int> row_light[2000], col_light[2000];
for (int i = 0; i < 2000; i++) {
for (int j = 0; j < 2000; j++) {
row_light[i]... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int h, w, cnt = 0, ind = 0, max = 0;
cin >> h >> w;
string s[h];
vector<int> row_light[2001], col_light[2001];
for (int i = 0; i < 2001; i++) {
for (int j = 0; j < 2001; j++) {
row_light[i]... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"call.arguments.change"
] | 828,164 | 828,165 | u352248517 | cpp |
p03014 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int H, W;
cin >> H >> W;
string S[H];
rep(i, H) { cin >> S[i]; }
int T[H][W];
int Y[H][W];
rep(i, H) rep(j, W) {
T[i][j] = -1;
Y[i][j] = -1;
}
rep(i, H) rep(j, W) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int H, W;
cin >> H >> W;
string S[H];
rep(i, H) { cin >> S[i]; }
int T[H][W];
int Y[H][W];
rep(i, H) rep(j, W) {
T[i][j] = -1;
Y[i][j] = -1;
}
rep(i, H) rep(j, W) {
... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 828,170 | 828,171 | u944316525 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) {
cin >> s[i];
}
vector<vector<int>> hor(h, vector<int>(w));
for (int i = 0; i < h; i++) {
vector<int> rock;
for (int j = 0; j < w; j++) {
if (s[i][j] == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) {
cin >> s[i];
}
vector<vector<int>> hor(h, vector<int>(w));
for (int i = 0; i < h; i++) {
vector<int> rock;
for (int j = 0; j < w; j++) {
if (s[i][j] == ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 828,176 | 828,177 | u158758819 | cpp |
p03014 | #include <algorithm>
#include <cstdio>
using namespace std;
const int N = 2e3 + 10;
char s[N][N];
int l[N][N], r[N][N], u[N][N], d[N][N];
int n, m;
int main() {
int i, j, res = 0;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++)
scanf(" %s ", s[i] + 1);
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++... | #include <algorithm>
#include <cstdio>
using namespace std;
const int N = 2e3 + 10;
char s[N][N];
int l[N][N], r[N][N], u[N][N], d[N][N];
int n, m;
int main() {
int i, j, res = 0;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++)
scanf(" %s ", s[i] + 1);
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 828,178 | 828,179 | u052620579 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int long long
typedef vector<int> vi;
typedef pair<int, int> pi;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define pb push_back
#define mp make_pair
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, b, e) for (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int long long
typedef vector<int> vi;
typedef pair<int, int> pi;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define pb push_back
#define mp make_pair
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, b, e) for (i... | [] | 828,180 | 828,181 | u703272444 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define MX LLONG_MAX
#define MN LLONG_MIN
const int N = 1e5 + 5;
const ll mod = 1e9 + 7;
ll po... | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define MX LLONG_MAX
#define MN LLONG_MIN
const int N = 1e5 + 5;
const ll mod = 1e9 + 7;
ll po... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 828,188 | 828,189 | u015252678 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
vector<vector<int>> l(n, vector<int>(m));
vector<vector<int>> r(n, vector<int>(m));
vector<vector<... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
vector<vector<int>> l(n, vector<int>(m));
vector<vector<int>> r(n, vector<int>(m));
vector<vector<... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 828,192 | 828,193 | u387147192 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define why(n, x) \
int n; \
while (cin >> n, n != x)
#define iFOR(i, x, n) for (int i = x; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define why(n, x) \
int n; \
while (cin >> n, n != x)
#define iFOR(i, x, n) for (int i = x; i... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 828,196 | 828,197 | u678146855 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
// typedef tuple<int, int, int> T;
#define FOR(i, s, x) for (int i = s; i < (int)(x); i++)
#define REP(i, x) FOR(i, 0, x)
#define ALL(c) c.begin(), c.end()
#define DUMP(x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
// typedef tuple<int, int, int> T;
#define FOR(i, s, x) for (int i = s; i < (int)(x); i++)
#define REP(i, x) FOR(i, 0, x)
#define ALL(c) c.begin(), c.end()
#define DUMP(x)... | [
"assignment.variable.change",
"identifier.change"
] | 828,198 | 828,199 | u315078622 | cpp |
p03014 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (auto i = 0; i < n; ++i)
#define REPR(i, n) for ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (auto i = 0; i < n; ++i)
#define REPR(i, n) for ... | [
"variable_declaration.type.primitive.change",
"call.arguments.change",
"call.arguments.add"
] | 828,206 | 828,207 | u479953984 | cpp |
p03014 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vvvvll = vector<vector<vector<vector<ll>>>>;
using pl4 = pair<ll, ll>;
using str = string;
using vpl4 = vector<pair<ll, ll>>;
#define sz size()
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vvvvll = vector<vector<vector<vector<ll>>>>;
using pl4 = pair<ll, ll>;
using str = string;
using vpl4 = vector<pair<ll, ll>>;
#define sz size()
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 828,210 | 828,211 | u614421689 | cpp |
p03014 | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef _MSC_VER
using ll = __int64;
using ull = unsigned ... | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef _MSC_VER
using ll = __int64;
using ull = unsigned ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 828,220 | 828,221 | u609688888 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
const int N = 2050;
char g[N][N];
int n, m;
int le[N][N], ri[N][N], up[N][N], dw[N][N];
int main(void) {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%s", g[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (g[i][j] =... | #include <bits/stdc++.h>
using namespace std;
const int N = 2050;
char g[N][N];
int n, m;
int le[N][N], ri[N][N], up[N][N], dw[N][N];
int main(void) {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%s", g[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (g[i][j] =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 828,224 | 828,225 | u978172081 | cpp |
p03014 | #include <bits/stdc++.h>
#ifdef DEBUG
#define PRINT(x) \
cout << "func " << __func__ << ": line " << __LINE__ << ": " << #x << " = " \
<< (x) << endl;
#define PRINTA(a, first, last) \
cout << "func... | #include <bits/stdc++.h>
#ifdef DEBUG
#define PRINT(x) \
cout << "func " << __func__ << ": line " << __LINE__ << ": " << #x << " = " \
<< (x) << endl;
#define PRINTA(a, first, last) \
cout << "func... | [] | 828,228 | 828,229 | u537859408 | cpp |
p03014 | #include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define PB push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
#define pri 1000000007
#define nonod 1000001
#define pr pair<ll, ll>
#define mnx 1000001
#define inf 100000000000000001
#define prin(x) cout << setprecision(9) << ... | #include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define PB push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
#define pri 1000000007
#define nonod 1000001
#define pr pair<ll, ll>
#define mnx 1000001
#define inf 100000000000000001
#define prin(x) cout << setprecision(9) << ... | [
"identifier.change",
"call.arguments.change"
] | 828,232 | 828,233 | u874786170 | cpp |
p03014 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const long INF = 1e8;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const long INF = 1e5;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int... | [
"literal.number.change",
"variable_declaration.value.change"
] | 828,234 | 828,235 | u467826805 | cpp |
p03014 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#... | [
"expression.operation.binary.add"
] | 828,238 | 828,239 | u800551451 | cpp |
p03014 | #include <cstdio>
#include <cstring>
using namespace std;
const int N = 2'009;
char a[N][N];
int f[N][N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) {
scanf("%s", a[i]);
}
memset(f, 0, sizeof f);
for (int i = 0; i < n; ++i) {
{
int cnt = 0;
for (int j =... | #include <cstdio>
#include <cstring>
using namespace std;
const int N = 2'009;
char a[N][N];
int f[N][N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) {
scanf("%s", a[i]);
}
memset(f, 0, sizeof f);
for (int i = 0; i < n; ++i) {
{
int cnt = 0;
for (int j =... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 828,242 | 828,243 | u127130661 | cpp |
p03014 | #include <bits/stdc++.h>
#define mxn 2010
using namespace std;
int n, m, sl, fh, ans, l[mxn][mxn], r[mxn][mxn], u[mxn][mxn], d[mxn][mxn];
char s[mxn][mxn];
int rd() {
sl = 0;
fh = 1;
char ch = getchar();
while (ch < '0' || '9' < ch) {
if (ch == '-')
fh = -1;
ch = getchar();
}
while ('0' <= ch ... | #include <bits/stdc++.h>
#define mxn 2010
using namespace std;
int n, m, sl, fh, ans, l[mxn][mxn], r[mxn][mxn], u[mxn][mxn], d[mxn][mxn];
char s[mxn][mxn];
int rd() {
sl = 0;
fh = 1;
char ch = getchar();
while (ch < '0' || '9' < ch) {
if (ch == '-')
fh = -1;
ch = getchar();
}
while ('0' <= ch ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 828,246 | 828,247 | u938301018 | cpp |
p03014 | #include <iostream>
int main() {
int H, W;
scanf("%d %d", &H, &W);
char S[H][W + 1];
for (int i = 0; i < H; i++)
scanf(" %s", S[i]);
int count_v[H][W];
for (int i = 0; i < H; i++) {
int mode = 0;
int start = 0;
for (int j = 0; j < W; j++) {
if (S[i][j] == '#')
count_v[i][j] =... | #include <iostream>
int main() {
int H, W;
scanf("%d %d", &H, &W);
char S[H][W + 1];
for (int i = 0; i < H; i++)
scanf(" %s", S[i]);
int count_v[H][W];
for (int i = 0; i < H; i++) {
int mode = 0;
int start = 0;
for (int j = 0; j < W; j++) {
if (S[i][j] == '#')
count_v[i][j] =... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 828,262 | 828,263 | u440312135 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int h, w;
string s[2000];
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int h, w;
string s[2000];
cin >... | [
"identifier.change",
"call.arguments.change"
] | 828,264 | 828,265 | u218759384 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int h, w;
string s[2000];
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int h, w;
string s[2000];
cin >... | [
"identifier.change",
"call.arguments.change"
] | 828,266 | 828,265 | u218759384 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int h, w;
string s[2000];
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int h, w;
string s[2000];
cin >... | [
"identifier.change",
"call.arguments.change"
] | 828,267 | 828,268 | u218759384 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int h, w;
string s[2000];
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int h, w;
string s[2000];
cin >... | [
"identifier.change",
"call.arguments.change",
"assignment.change"
] | 828,269 | 828,268 | u218759384 | cpp |
p03014 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int grid[2000 + 1 + 1][2000 + 1 + 1];
int L[2000 + 1 + 1][2000 + 1 + 1];
int R[2000 + 1 + 1][2000 + 1 + 1];
int U[2000 + 1 + 1][2000 + 1 + 1];
int D[2000 + 1 + 1][2000 + 1 + 1];
in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int grid[2000 + 1 + 1][2000 + 1 + 1];
int L[2000 + 1 + 1][2000 + 1 + 1];
int R[2000 + 1 + 1][2000 + 1 + 1];
int U[2000 + 1 + 1][2000 + 1 + 1];
int D[2000 + 1 + 1][2000 + 1 + 1];
in... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 828,272 | 828,273 | u577747009 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int L[2000][2000], R[2000][2000];
int D[2000][2000], U[2000][2000];
int main() {
int h, w;
cin >> h >> w;
string s[h];
for (int i = 0; i < h; i++) {
cin >> s[i];
}
for (int i = 0; i < h; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int L[2000][2000], R[2000][2000];
int D[2000][2000], U[2000][2000];
int main() {
int h, w;
cin >> h >> w;
string s[h];
for (int i = 0; i < h; i++) {
cin >> s[i];
}
for (int i = 0; i < h; i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 828,274 | 828,275 | u708258059 | cpp |
p03014 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
string s[2000];
int ans = 0, h, w;
int L[2000][2000] = {0};
int R[2000][2000] = {0};
int D[2000][2000] = {0};
int U[2000][2000] = {0};
int main() {
cin >> h >> w;
for (int i = 0; i < h; i++) {
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
string s[2000];
int ans = 0, h, w;
int L[2000][2000] = {0};
int R[2000][2000] = {0};
int D[2000][2000] = {0};
int U[2000][2000] = {0};
int main() {
cin >> h >> w;
for (int i = 0; i < h; i++) {
... | [
"assignment.variable.change",
"identifier.change"
] | 828,278 | 828,279 | u261245192 | cpp |
p03014 | #include <bits/stdc++.h>
#define REP(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define RREP(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define ALL(x) (x).begin(), (x).end()
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
using namespace std;
typedef long long ll;
int H, W;
string S[2010];... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define RREP(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define ALL(x) (x).begin(), (x).end()
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
using namespace std;
typedef long long ll;
int H, W;
string S[2010];... | [
"expression.operation.binary.remove"
] | 828,288 | 828,289 | u803116068 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE se... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE se... | [
"assignment.change"
] | 828,292 | 828,293 | u297590902 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
int H, W;
int h1[2009], h2[2009];
int main() {
cin >> H >> W;
vector<string> S(H);
for (int i = 0; i < H; i++)
cin >> S[i];
int ans = 1;
for (int i = 0; i < W; i++) {
h1[i] = -1;
h2[i] = H;
}
for (int i = 0; i < H; i++) {
//ๆๅใฏใในๅคใซ้ๅฎณ็ฉใใใใจใใ
... | #include <bits/stdc++.h>
using namespace std;
int H, W;
int h1[2009], h2[2009];
int main() {
cin >> H >> W;
vector<string> S(H);
for (int i = 0; i < H; i++)
cin >> S[i];
int ans = 1;
for (int i = 0; i < W; i++) {
h1[i] = -1;
h2[i] = H;
}
for (int i = 0; i < H; i++) {
//ๆๅใฏใในๅคใซ้ๅฎณ็ฉใใใใจใใ
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 828,297 | 828,298 | u302870145 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define re return
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> pii;
int h, w;
string s[2010];
int mxh[2010][2010], mxw[2010][2010];
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt",... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define re return
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> pii;
int h, w;
string s[2010];
int mxh[2010][2010], mxw[2010][2010];
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt",... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 828,307 | 828,308 | u247996218 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < n; i++)
#define REP(n) FOR(i, 0, n)
#define ALL(n) (n).b... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < n; i++)
#define REP(n) FOR(i, 0, n)
#define ALL(n) (n).b... | [
"identifier.change",
"call.arguments.change"
] | 828,309 | 828,310 | u330661451 | cpp |
p03014 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
#define rep(i, n) for (int i = 0; i < (n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
#define rep(i, n) for (int i = 0; i < (n... | [
"control_flow.branch.if.condition.change"
] | 828,320 | 828,321 | u823451365 | cpp |
p03014 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
char s[2001][2001];
int a[2001][2001] = {0};
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%s", s[i]);
}
int j;
for (int i = 0; i < n; ++i) {
int num = 0;
for (j = 1; j < m; ++j) ... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
char s[2001][2001];
int a[2001][2001] = {0};
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%s", s[i]);
}
int j;
for (int i = 0; i < n; ++i) {
int num = 0;
for (j = 1; j < m; ++j) ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 828,322 | 828,323 | u812003342 | cpp |
p03014 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int H, W;
string tmp;
cin >> H >> W;
vector<vector<int>> obsv;
vector<vector<int>> obsh;
vector<string> grid;
for (int i = 0; i < W; i++) {
obsv.emplace_back(vector<int>({-... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int H, W;
string tmp;
cin >> H >> W;
vector<vector<int>> obsv;
vector<vector<int>> obsh;
vector<string> grid;
for (int i = 0; i < W; i++) {
obsv.emplace_back(vector<int>({-... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 828,326 | 828,327 | u816580121 | cpp |
p03014 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define mp make_pair
#define IOS ios_base::sync_with_stdio(false), cin.tie(0);
using namespace std;
typedef long long ll;
ll a, b, k, n, m, sum, h, w;
const ll maxn = 100005;
const... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define mp make_pair
#define IOS ios_base::sync_with_stdio(false), cin.tie(0);
using namespace std;
typedef long long ll;
ll a, b, k, n, m, sum, h, w;
const ll maxn = 100005;
const... | [
"assignment.value.change",
"identifier.change"
] | 828,337 | 828,338 | u856205835 | cpp |
p03014 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 828,339 | 828,340 | u656771711 | cpp |
p03014 | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | [
"assignment.value.change",
"identifier.change"
] | 828,347 | 828,348 | u579152247 | cpp |
p03014 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int H, W;
cin >> H >> W;
vector<string> field(H);
for (int i = 0; i < H; i++)
cin >> field[i];
vector<vector<int>> dis_tate(W, vector<int>(0));
vector<vector<int>> dis_yoko(H, vector<int>(0));
vector<vector<int>> tate... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int H, W;
cin >> H >> W;
vector<string> field(H);
for (int i = 0; i < H; i++)
cin >> field[i];
vector<vector<int>> dis_tate(W, vector<int>(0));
vector<vector<int>> dis_yoko(H, vector<int>(0));
vector<vector<int>> tate... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 829,032 | 829,033 | u176979814 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pint = pair<int, int>;
ll mod = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
void chmin(long long &a, long long b) {
if (a > b)
a = b;
}
const long long INF = 1LL << 60;
ll gcd(ll a, ll b) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pint = pair<int, int>;
ll mod = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
void chmin(long long &a, long long b) {
if (a > b)
a = b;
}
const long long INF = 1LL << 60;
ll gcd(ll a, ll b) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 829,036 | 829,037 | u542670845 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
#define all(v) v.begin(), v.end()
#define sortAl(v) sort(all(v))
#define sortAlr(v) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
#define all(v) v.begin(), v.end()
#define sortAl(v) sort(all(v))
#define sortAlr(v) ... | [
"identifier.change"
] | 829,038 | 829,039 | u324825702 | cpp |
p03014 | #include <algorithm>
#include <iostream>
#include <vector>
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;
}
... | #include <algorithm>
#include <iostream>
#include <vector>
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;
}
... | [
"expression.operation.binary.remove"
] | 829,044 | 829,045 | u644332191 | cpp |
p03014 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using... | [
"assignment.add"
] | 829,048 | 829,049 | u698883164 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 829,059 | 829,058 | u347057617 | cpp |
p03014 | /* Author : Aaryan Srivastava ^__^ */
#include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
#define pb push_back
#define popb pop_back
#define mt make_tuple
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss secon... | /* Author : Aaryan Srivastava ^__^ */
#include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
#define pb push_back
#define popb pop_back
#define mt make_tuple
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss secon... | [
"call.arguments.add",
"assignment.value.change",
"identifier.change"
] | 829,068 | 829,069 | u774189121 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
/* ใกใใใจ่ใใฆๅฎ่ฃ
ใใฆๅ้กใชใACใงใใๆๅฌใใใ๏ผ๏ผ */
int main(void) {
int h, w;
cin >> h >> w;
vector<string> s;
for (int i = 0; i < h; i++) {
string tmp_s;
cin >> tmp_s;
s.push_back(tmp_s);
}
int L[h]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
/* ใกใใใจ่ใใฆๅฎ่ฃ
ใใฆๅ้กใชใACใงใใๆๅฌใใใ๏ผ๏ผ */
int main(void) {
int h, w;
cin >> h >> w;
vector<string> s;
for (int i = 0; i < h; i++) {
string tmp_s;
cin >> tmp_s;
s.push_back(tmp_s);
}
int L[h]... | [
"assignment.value.change"
] | 829,072 | 829,073 | u900688325 | cpp |
p03014 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0;... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 829,090 | 829,091 | u654115433 | cpp |
p03014 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0;... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"expression.operation.binary.change",
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 829,092 | 829,091 | u654115433 | cpp |
p03014 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0;... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"expression.operation.binary.change"
] | 829,093 | 829,091 | u654115433 | cpp |
p03014 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int h, w;
std::cin >> h >> w;
std::vector<std::string> s(h);
for (int i = 0; i < h; i++) {
std::cin >> s[i];
}
std::vector<std::vector<int>> cnt(h, std::vector<int>(w));
for (int i = 0; i < h; i++) {
// w... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int h, w;
std::cin >> h >> w;
std::vector<std::string> s(h);
for (int i = 0; i < h; i++) {
std::cin >> s[i];
}
std::vector<std::vector<int>> cnt(h, std::vector<int>(w));
for (int i = 0; i < h; i++) {
// w... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 829,103 | 829,104 | u477343425 | cpp |
p03014 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 829,107 | 829,108 | u941028483 | cpp |
p03008 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | [
"call.add"
] | 829,124 | 829,125 | u756088996 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll... | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll... | [
"variable_declaration.type.change",
"assignment.change"
] | 829,132 | 829,131 | u336011173 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 829,137 | 829,138 | u334351654 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 829,139 | 829,138 | u334351654 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
const ll MOD = 1e9 + 7;
const ll N = 2e5 + 5;
const ld pi = 3.14159265359;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define pb push_back
#define mp mak... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
const ll MOD = 1e9 + 7;
const ll N = 5000 * 5000 + 5;
const ld pi = 3.14159265359;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define pb push_back
#defin... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 829,145 | 829,144 | u028302014 | cpp |
p03008 | #include <bits/stdc++.h>
#define int long long
#define lint long long
#define pii pair<int, int>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MINF(a) m... | #include <bits/stdc++.h>
#define int long long
#define lint long long
#define pii pair<int, int>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MINF(a) m... | [] | 829,164 | 829,165 | u141642872 | cpp |
p03008 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
const ll MAX_N = 5000, MAX_GSB = 5000;
ll N, gsb[3][2], dp[MAX_N * MAX_GSB + 1];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
const ll MAX_N = 5000, MAX_GSB = 5000;
ll N, gsb[3][2], dp[MAX_N * MAX_GSB + 1];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin... | [
"assignment.change"
] | 829,174 | 829,175 | u533920479 | cpp |
p03008 | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rFor(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef pair<int, int> ... | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rFor(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef pair<int, int> ... | [
"assignment.change"
] | 829,184 | 829,185 | u643840641 | cpp |
p03008 | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd... | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 829,194 | 829,195 | u434747175 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
vector<vector<int>> rate(2, vector<int>(3, 0));
int solve(int n, int pre, int post) {
vector<int> dp(n + 1, 0);
rep(i, n) dp[i] = i;
rep(i, n + 1) rep(j, 3) if (i >= rate[pre][j] && rate[pre][j] <... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
vector<vector<int>> rate(2, vector<int>(3, 0));
int solve(int n, int pre, int post) {
vector<int> dp(n + 1, 0);
rep(i, n + 1) dp[i] = i;
rep(i, n + 1) rep(j, 3) if (i >= rate[pre][j] && rate[pre][... | [
"assignment.change"
] | 829,236 | 829,237 | u731175398 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
long long n;
vector<int> ok;
long long a[4], b[4];
long long dp[6000], pd[26000000];
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> a[1] >> a[2] >> a[3]... | #include <bits/stdc++.h>
using namespace std;
long long n;
vector<int> ok;
long long a[4], b[4];
long long dp[6000], pd[26000000];
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> a[1] >> a[2] >> a[3]... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"assignment.change"
] | 829,238 | 829,239 | u313427116 | cpp |
p03008 | #include <iostream>
using namespace std;
const long long MAXN = 5e5 + 5;
long long a[5][5];
long long dp[MAXN];
long long m, ans;
int main() {
long long n;
cin >> n;
for (long long i = 0; i < 2; i++) {
for (long long j = 1; j <= 3; j++) {
cin >> a[i][j];
}
}
for (long long i = 0; i <= n; i++) {... | #include <iostream>
using namespace std;
const long long MAXN = 5e7 + 5;
long long a[5][5];
long long dp[MAXN];
long long m, ans;
int main() {
long long n;
cin >> n;
for (long long i = 0; i < 2; i++) {
for (long long j = 1; j <= 3; j++) {
cin >> a[i][j];
}
}
for (long long i = 0; i <= n; i++) {... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.add",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 829,299 | 829,297 | u487618988 | cpp |
p03008 | // encoding:utf-8
//#include <iostream> //c++
//#include<stack> //ในใฟใใฏใซ้ขใใฆใๆๆฐใฎใใผใฟใใๆจใฆใ
//#include<queue> //ใญใฅใผใซ้ขใใฆใๆๅคใฎใใผใฟใใๆจใฆใ
//#include<math.h>
//#include<vector>
//#include<algorithm> //sort ใจใใซใใ
#include <bits/stdc++.h> //vector,algorithm,que
#include <time.h> //ๆ้ใซใใใใฆ
#define ll long long
#define MOD 100... | // encoding:utf-8
//#include <iostream> //c++
//#include<stack> //ในใฟใใฏใซ้ขใใฆใๆๆฐใฎใใผใฟใใๆจใฆใ
//#include<queue> //ใญใฅใผใซ้ขใใฆใๆๅคใฎใใผใฟใใๆจใฆใ
//#include<math.h>
//#include<vector>
//#include<algorithm> //sort ใจใใซใใ
#include <bits/stdc++.h> //vector,algorithm,que
#include <time.h> //ๆ้ใซใใใใฆ
#define ll long long
#define MOD 100... | [
"assignment.variable.change",
"identifier.change"
] | 829,300 | 829,301 | u059210959 | cpp |
p03008 | #include <bits/stdc++.h>
#define ll long long
#define xx first
#define yy second
using namespace std;
ll a[5], b[5];
ll dp[60000000 + 5];
ll n;
inline ll calc(ll *x, ll *y, ll t) {
for (int i = 0; i <= t; ++i) {
dp[i] = 0;
for (int j = 1; j <= 3; ++j) {
if (i >= x[j]) {
dp[i] = max(dp[i], dp[... | #include <bits/stdc++.h>
#define ll long long
#define xx first
#define yy second
using namespace std;
ll a[5], b[5];
ll dp[50000000 + 5];
ll n;
inline ll calc(ll *x, ll *y, ll t) {
for (int i = 0; i <= t; ++i) {
dp[i] = 0;
for (int j = 1; j <= 3; ++j) {
if (i >= x[j]) {
dp[i] = max(dp[i], dp[... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.change"
] | 829,302 | 829,303 | u497614346 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll f(ll n, ll g1, ll s1, ll b1, ll g2, ll s2, ll b2) {
vector<ll> dp(n + max({g1, s1, b1}) + 1);
for (ll i = 0; i < n; i++) {
dp[i + g1] = max(dp[i + g1], dp[i] - g1 + g2);
dp[i + s1] = max(dp[i + s1], dp[i] - s1 + s2);
dp[i + b1] = ma... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll f(ll n, ll g1, ll s1, ll b1, ll g2, ll s2, ll b2) {
vector<ll> dp(n + max({g1, s1, b1}));
for (ll i = 0; i < n; i++) {
dp[i + g1] = max(dp[i + g1], dp[i] - g1 + g2);
dp[i + s1] = max(dp[i + s1], dp[i] - s1 + s2);
dp[i + b1] = max(dp... | [
"expression.operation.binary.remove"
] | 829,335 | 829,336 | u848737670 | cpp |
p03008 | #include <bits/stdc++.h>
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define IFOR(i, m, n) for (int i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) (v).begin(), (v)... | #include <bits/stdc++.h>
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define IFOR(i, m, n) for (int i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) (v).begin(), (v)... | [
"call.remove"
] | 829,337 | 829,338 | u708550576 | cpp |
p03008 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<ll> a(3), b(3);
for (int i = 0; i < 3; i++) {
c... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<ll> a(3), b(3);
for (int i = 0; i < 3; i++) {
c... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 829,358 | 829,359 | u480806810 | cpp |
p03008 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<int> a(3), b(3);
for (int i = 0; i < 3; i++) {
... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<ll> a(3), b(3);
for (int i = 0; i < 3; i++) {
c... | [
"variable_declaration.type.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 829,360 | 829,359 | u480806810 | cpp |
p03016 | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define PP pair<P, P>
#define all(v) v.begin(), v.end()
#define mkp... | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define PP pair<P, P>
#define all(v) v.begin(), v.end()
#define mkp... | [
"assignment.change"
] | 829,603 | 829,604 | u147049801 | cpp |
p03016 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// template {{{ 0
// using {{{ 1
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
// }}} 1
// definition {{{ 1
// scan... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// template {{{ 0
// using {{{ 1
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
// }}} 1
// definition {{{ 1
// scan... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 829,607 | 829,608 | u550398291 | cpp |
p03016 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// template {{{ 0
// using {{{ 1
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
// }}} 1
// definition {{{ 1
// scan... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// template {{{ 0
// using {{{ 1
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
// }}} 1
// definition {{{ 1
// scan... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 829,609 | 829,608 | u550398291 | cpp |
p03016 | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
temp... | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
temp... | [
"assignment.change"
] | 829,625 | 829,626 | u581122825 | cpp |
p03016 | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
temp... | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
temp... | [
"literal.number.change",
"call.arguments.change"
] | 829,627 | 829,626 | u581122825 | cpp |
p03016 | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
temp... | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
temp... | [
"literal.number.change",
"call.arguments.change",
"variable_declaration.value.change"
] | 829,628 | 829,626 | u581122825 | cpp |
p03016 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <deque>
#include <functional>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath>
#include <cstd... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <deque>
#include <functional>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#include <cctype>
#include <cmath>
#include <cstd... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 829,635 | 829,634 | u331542638 | cpp |
p03016 | #include <algorithm>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#... | #include <algorithm>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 829,640 | 829,641 | u379822620 | cpp |
p03016 | #include <bits/stdc++.h>
#define IO_OP \
std::ios::sync_with_stdio(0); \
std::cin.tie(0);
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define int ll
... | #include <bits/stdc++.h>
#define IO_OP \
std::ios::sync_with_stdio(0); \
std::cin.tie(0);
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define int ll
... | [
"assignment.change"
] | 829,645 | 829,646 | u454290303 | cpp |
p03016 | // warm heart, wagging tail,and a smile just for you!
// โโโโโโโโโโโ
// โโโโฌโฌโฌโฌโฌโฌโฌโฌโฌโฌโโโ
// โโโโฌโฌโฌโฌโฌโโโโโฌโฌโฌโฌโฌโฌโโโ
// ... | // warm heart, wagging tail,and a smile just for you!
// โโโโโโโโโโโ
// โโโโฌโฌโฌโฌโฌโฌโฌโฌโฌโฌโโโ
// โโโโฌโฌโฌโฌโฌโโโโโฌโฌโฌโฌโฌโฌโโโ
// ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 829,657 | 829,658 | u239493918 | cpp |
p03016 | // warm heart, wagging tail,and a smile just for you!
// โโโโโโโโโโโ
// โโโโฌโฌโฌโฌโฌโฌโฌโฌโฌโฌโโโ
// โโโโฌโฌโฌโฌโฌโโโโโฌโฌโฌโฌโฌโฌโโโ
// ... | // warm heart, wagging tail,and a smile just for you!
// โโโโโโโโโโโ
// โโโโฌโฌโฌโฌโฌโฌโฌโฌโฌโฌโโโ
// โโโโฌโฌโฌโฌโฌโโโโโฌโฌโฌโฌโฌโฌโโโ
// ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 829,659 | 829,660 | u239493918 | cpp |
p03016 | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | [
"call.remove"
] | 829,673 | 829,674 | u283869437 | cpp |
p03016 | #include <bits/stdc++.h>
#define dbug(x) cout << #x << "=" << x << endl
using namespace std;
template <typename T> void read(T &t) {
t = 0;
char ch = getchar();
int f = 1;
while ('0' > ch || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
do {
(t *= 10) += ch - '0';
ch = getchar()... | #include <bits/stdc++.h>
#define dbug(x) cout << #x << "=" << x << endl
using namespace std;
template <typename T> void read(T &t) {
t = 0;
char ch = getchar();
int f = 1;
while ('0' > ch || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
do {
(t *= 10) += ch - '0';
ch = getchar()... | [
"assignment.add"
] | 829,693 | 829,694 | u880862257 | cpp |
p03016 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll INFLL = (1ll << 60);
const ll MOD = (ll)(1e9 + 7);
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a = (a < MOD) ? a : (a - MOD);
b = (b < MOD) ? b : (b - M... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll INFLL = (1ll << 60);
const ll MOD = (ll)(1e9 + 7);
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a = (a < MOD) ? a : (a - MOD);
b = (b < MOD) ? b : (b - M... | [
"assignment.change"
] | 829,701 | 829,702 | u548624367 | cpp |
p03016 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cINF ((... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cINF ((... | [
"call.arguments.change",
"identifier.change"
] | 829,705 | 829,706 | u627427672 | cpp |
p03016 | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) ... | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) ... | [
"assignment.change"
] | 829,707 | 829,708 | u278868910 | cpp |
p03016 | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) ... | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) ... | [
"assignment.change"
] | 829,707 | 829,709 | u278868910 | cpp |
p03016 | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) ... | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) ... | [
"variable_declaration.type.change"
] | 829,712 | 829,711 | u278868910 | cpp |
p03016 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = long long;
constexpr int MAXDC = 19;
ll mod; // to be scanf'ed
ll modexp(ll b, ull e) {
return (e == 0 ? 1 : (e % 2 == 1 ? b : 1) * modexp(b * b % mod, e / 2) % mod);
}
int digCount(ll x) {
if (x <= 9)
return 1;
else
return... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = long long;
constexpr int MAXDC = 19;
ll mod; // to be scanf'ed
ll modexp(ll b, ull e) {
return (e == 0 ? 1 : (e % 2 == 1 ? b : 1) * modexp(b * b % mod, e / 2) % mod);
}
int digCount(ll x) {
if (x <= 9)
return 1;
else
return... | [
"expression.operation.binary.remove"
] | 829,715 | 829,716 | u904217313 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool flag1 = 0;
for (int i = A - 1; i <= max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No";
return 0;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool flag1 = 0;
for (int i = A - 1; i <= max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No";
return 0;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 829,728 | 829,729 | u328530240 | cpp |
p03017 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool flag1 = 0;
for (int i = A - 1; i <= max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No";
return 0;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
string S;
cin >> S;
bool flag1 = 0;
for (int i = A - 1; i <= max(C, D) - 2; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No";
return 0;
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 829,730 | 829,729 | u328530240 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
a--;
b--;
c--;
d--;
if (s[c] == '#' || s[d] == '#')
return cout << "No", 0;
if (c == d)
... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
a--;
b--;
c--;
d--;
if (s[c] == '#' || s[d] == '#')
return cout << "No", 0;
if (c == d)
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 829,731 | 829,732 | u764378605 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
string s;
bool f1(ll a, ll b) {
for (ll i = a; i < b; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
return false;
}
return true;
}
bool f2(ll a, ll b) {
for (ll i = a + 1; i < b; ++i) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
string s;
bool f1(ll a, ll b) {
for (ll i = a; i < b; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
return false;
}
return true;
}
bool f2(ll a, ll b) {
for (ll i = a; i <= b; ++i) {
if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 829,736 | 829,737 | u698760125 | cpp |
p03017 | #include <bits/stdc++.h>
//#define int long long
using namespace std;
string s;
bool chk_block(int a, int b) {
for (int i = a; i < b - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
return false;
}
return true;
}
bool chk_jump(int a, int b) {
for (int i = a; i < b; ++i) {
if (s[i - 1] == '.' && ... | #include <bits/stdc++.h>
//#define int long long
using namespace std;
string s;
bool chk_block(int a, int b) {
for (int i = a; i <= b - 1; ++i) {
if (s[i] == '#' && s[i + 1] == '#')
return false;
}
return true;
}
bool chk_jump(int a, int b) {
for (int i = a; i <= b; ++i) {
if (s[i - 1] == '.' &... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 829,738 | 829,739 | u698760125 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <math.h>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
// ็นๅฎใฎๆๅญๅใๆฐใใ้ขๆฐ
size_t count(const string &str, const string &sub, const size_t ini = 0,
const size... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <math.h>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
// ็นๅฎใฎๆๅญๅใๆฐใใ้ขๆฐ
size_t count(const string &str, const string &sub, const size_t ini = 0,
const size... | [
"expression.operation.binary.remove"
] | 829,742 | 829,741 | u605901675 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <math.h>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
// ็นๅฎใฎๆๅญๅใๆฐใใ้ขๆฐ
size_t count(const string &str, const string &sub, const size_t ini = 0,
const size... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <math.h>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
// ็นๅฎใฎๆๅญๅใๆฐใใ้ขๆฐ
size_t count(const string &str, const string &sub, const size_t ini = 0,
const size... | [
"expression.operation.binary.remove"
] | 829,743 | 829,741 | u605901675 | cpp |
p03017 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <math.h>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
// ็นๅฎใฎๆๅญๅใๆฐใใ้ขๆฐ
size_t count(const string &str, const string &sub, const size_t ini = 0,
const size... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <math.h>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
// ็นๅฎใฎๆๅญๅใๆฐใใ้ขๆฐ
size_t count(const string &str, const string &sub, const size_t ini = 0,
const size... | [
"assignment.change"
] | 829,744 | 829,741 | u605901675 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll lcm(ll x, ll y) {
return x / GCD(x, y) *
y; //ๅ
ใซๅฒใ็ฎใใใฆๆใใใใๆฐใๅฐใใใใฆๆใ็ฎใ่กใ
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll lcm(ll x, ll y) {
return x / GCD(x, y) *
y; //ๅ
ใซๅฒใ็ฎใใใฆๆใใใใๆฐใๅฐใใใใฆๆใ็ฎใ่กใ
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 829,748 | 829,749 | u109191542 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll lcm(ll x, ll y) {
return x / GCD(x, y) *
y; //ๅ
ใซๅฒใ็ฎใใใฆๆใใใใๆฐใๅฐใใใใฆๆใ็ฎใ่กใ
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll lcm(ll x, ll y) {
return x / GCD(x, y) *
y; //ๅ
ใซๅฒใ็ฎใใใฆๆใใใใๆฐใๅฐใใใใฆๆใ็ฎใ่กใ
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 829,750 | 829,749 | u109191542 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
bool ans = true;
for (ll i = a; i <= m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
bool ans = true;
for (ll i = a; i <= m... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 829,755 | 829,756 | u659209756 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
bool ans = true;
for (ll i = a; i <= m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, a, b, c, d;
string s;
cin >> n >> a >> b >> c >> d >> s;
a--;
b--;
c--;
d--;
bool ans = true;
for (ll i = a; i <= m... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 829,757 | 829,756 | u659209756 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.