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 |
|---|---|---|---|---|---|---|---|
p03013 | #include <algorithm>
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
typedef long long ll;
ll dp[101010];
ll MOD = 1000000007;
bool ban[101010];
int main() {
int N, M;
cin >> N >> M;
ll ans;
for (int i = 0; i < M; i++) {
int x;
cin >> x;
ban[x] = true;
}
dp[0] ... | #include <algorithm>
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
typedef long long ll;
ll dp[101010];
ll MOD = 1000000007;
bool ban[101010];
int main() {
int N, M;
cin >> N >> M;
ll ans;
for (int i = 0; i < M; i++) {
int x;
cin >> x;
ban[x] = true;
}
dp[0] ... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 827,346 | 827,347 | u390901416 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1E9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> A(n + 1, 0);
vector<int> flg(n, 0);
for (int i = 1; i <= m; i++) {
int x;
cin >> x;
A[x] = 1;
}
flg[0] = 1;
for (int i = 1; i <= n; i++) {
if (!A[i])
flg[i]... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1E9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> A(n + 1, 0);
vector<int> flg(n + 1, 0);
for (int i = 1; i <= m; i++) {
int x;
cin >> x;
A[x] = 1;
}
flg[0] = 1;
for (int i = 1; i <= n; i++) {
if (!A[i])
fl... | [
"assignment.change"
] | 827,383 | 827,384 | u577189232 | cpp |
p03013 | #include <stack>
#include <stdio.h>
using namespace std;
#define MAX_N (100000 + 1)
#define MOD (1000000007)
int cannot_step[MAX_N] = {0};
long long num_path[MAX_N] = {0};
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0)
res += m;
return res;
}
int main(void) {
int n, m... | #include <stack>
#include <stdio.h>
using namespace std;
#define MAX_N (100000 + 1)
#define MOD (1000000007)
int cannot_step[MAX_N] = {0};
long long num_path[MAX_N] = {0};
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0)
res += m;
return res;
}
int main(void) {
int n, m... | [] | 827,391 | 827,392 | u546618578 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const ll MOD = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
map<ll, ll> M;
for (int i = 0; i < m; i++) {
cin >> a[i];
M[a[i]] = 1;
}
vector<ll> dp(n + 2);
dp[0] = 0;
dp[1] = 1;
if (M[1] == 1 && ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const ll MOD = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
map<ll, ll> M;
for (int i = 0; i < m; i++) {
cin >> a[i];
M[a[i]] = 1;
}
vector<ll> dp(n + 2);
dp[0] = 0;
dp[1] = 1;
if (M[1] == 1 && ... | [
"assignment.change"
] | 827,438 | 827,439 | u881599732 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,442 | 827,443 | u989306199 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
const int N = 2010;
char C[N][N];
int A[N][N];
int B[N][N];
int X[N][N];
int Y[N][N];
int h, w;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin >> h >> w;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> C[i][j];
}... | #include <bits/stdc++.h>
using namespace std;
const int N = 2010;
char C[N][N];
int A[N][N];
int B[N][N];
int X[N][N];
int Y[N][N];
int h, w;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin >> h >> w;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> C[i][j];
}... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 827,462 | 827,463 | u136869985 | cpp |
p03014 | /*Code by Codercjh*/
#include <bits/stdc++.h>
#define fr(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, a, b) for (int i = (a); i >= (b); --i)
#define min(a, b) (a < b ? a : b)
#define max(a, b) (a > b ? a : b)
using namespace std;
typedef long long ll;
template <typename T> inline void read(T &x) {
char c =... | /*Code by Codercjh*/
#include <bits/stdc++.h>
#define fr(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, a, b) for (int i = (a); i >= (b); --i)
#define min(a, b) (a < b ? a : b)
#define max(a, b) (a > b ? a : b)
using namespace std;
typedef long long ll;
template <typename T> inline void read(T &x) {
char c =... | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change"
] | 827,469 | 827,470 | u132878214 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
int light[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
light[i][j] = 0;
}
}
for (int i = 0; i < h; i++) {
cin >> s[i];
}
for (int i = 0; i < h; i++) {
v... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
int light[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
light[i][j] = 0;
}
}
for (int i = 0; i < h; i++) {
cin >> s[i];
}
for (int i = 0; i < h; i++) {
v... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,476 | 827,477 | u749475370 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
#define collect(arr, size) rep(i, size) cin >> arr[i];
#define i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
#define collect(arr, size) rep(i, size) cin >> arr[i];
#define i... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 827,480 | 827,481 | u979852867 | cpp |
p03014 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> cnt(h, vector<int>(w));
rep(i, h) {
vector<int> done(w);
rep(j, w) {
if (s[i][j] == '#')
co... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> cnt(h, vector<int>(w));
rep(i, h) {
vector<int> done(w);
rep(j, w) {
if (s[i][j] == '#')
co... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 827,482 | 827,483 | u369813073 | cpp |
p03014 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> cnt(h, vector<int>(w));
rep(i, h) {
vector<int> done(w);
rep(j, w) {
if (s[i][j] == '#')
co... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> cnt(h, vector<int>(w));
rep(i, h) {
vector<int> done(w);
rep(j, w) {
if (s[i][j] == '#')
co... | [
"identifier.change",
"control_flow.loop.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 827,484 | 827,483 | u369813073 | cpp |
p03014 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll N, T, W, H, M, C, V;
const int MAX = 510000;
co... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll N, T, W, H, M, C, V;
const int MAX = 510000;
co... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"assignment.value.change"
] | 827,487 | 827,488 | u178618463 | cpp |
p03014 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> cnt(h, vector<int>(w));
rep(i, h) {
vector<int> done(w);
rep(j, w) {
if (s[i][j] == '#')
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> cnt(h, vector<int>(w));
rep(i, h) {
vector<int> done(w);
rep(j, w) {
if (s[i][j] == '#')
c... | [
"control_flow.branch.if.condition.change"
] | 827,496 | 827,497 | u147556624 | cpp |
p03014 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(w);
rep(i, h) cin >> s[i];
vector<vector<int>> cnt(h, vector<int>(w));
rep(i, h) {
vector<int> done(w);
rep(j, w) {
if (s[i][j] == '#')
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> cnt(h, vector<int>(w));
rep(i, h) {
vector<int> done(w);
rep(j, w) {
if (s[i][j] == '#')
c... | [
"control_flow.branch.if.condition.change"
] | 827,498 | 827,497 | u147556624 | cpp |
p03014 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int H, W;
cin >> H >> W;
vector<string> S(H);
for (int i = 0; i < H; i++)
cin >> S[i];
int ans = 0;
vector<vector<int>>... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int H, W;
cin >> H >> W;
vector<string> S(H);
for (int i = 0; i < H; i++)
cin >> S[i];
int ans = 0;
vector<vector<int>>... | [
"identifier.change"
] | 827,503 | 827,504 | u521973174 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 100010
const int MOD = 1000000007;
int getBlock(vector<int> &r, int fd) {
if (r.empty())
return -1;
auto tp = upper_bound(r.begin(), r.end(), fd);
if (tp == r.begin())
return -1;
tp--;
return *tp;
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 100010
const int MOD = 1000000007;
int getBlock(vector<int> &r, int fd) {
if (r.empty())
return -1;
auto tp = upper_bound(r.begin(), r.end(), fd);
if (tp == r.begin())
return -1;
tp--;
return *tp;
}
... | [] | 827,523 | 827,524 | u845356047 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w;
cin >> h >> w;
string s[h];
for (int i = 0; i < h; i++)
cin >> s[i];
int l[h][w]{}, r[h][w]{}, u[h][w]{}, d[h][w]{};
for (int i = 0; i < h; i++)
for (int j = 1; j < w; j++)
if (s[i][j - 1] == '.' && s[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w;
cin >> h >> w;
string s[h];
for (int i = 0; i < h; i++)
cin >> s[i];
int l[h][w]{}, r[h][w]{}, u[h][w]{}, d[h][w]{};
for (int i = 0; i < h; i++)
for (int j = 1; j < w; j++)
if (s[i][j - 1] == '.' && s[i... | [] | 827,538 | 827,539 | u804999113 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w;
cin >> h >> w;
string s[h];
for (int i = 0; i < h; i++)
cin >> s[i];
int l[h][w]{}, r[h][w]{}, u[h][w]{}, d[h][w]{};
for (int i = 0; i < h; i++)
for (int j = 1; j < w; j++)
if (s[i][j - 1] == '.' && s[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w;
cin >> h >> w;
string s[h];
for (int i = 0; i < h; i++)
cin >> s[i];
int l[h][w]{}, r[h][w]{}, u[h][w]{}, d[h][w]{};
for (int i = 0; i < h; i++)
for (int j = 1; j < w; j++)
if (s[i][j - 1] == '.' && s[... | [] | 827,538 | 827,540 | u804999113 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); ++i)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); ++i)
#defi... | [
"literal.number.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 827,547 | 827,548 | u568353080 | cpp |
p03014 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using lint = long long;
int main() {
lint h, w;
scanf("%lld", &h);
scanf("%l... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using lint = long long;
int main() {
lint h, w;
scanf("%lld", &h);
scanf("%l... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 827,549 | 827,550 | u353402627 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll h, w;
cin >> h >> w;
vector<string> s(w);
rep(i, 0, h) cin >> s[i];
vector<vector<int>> pts(h, vector<int>(w, 0));
rep(i, 0, h) {
char pre ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, 0, h) cin >> s[i];
vector<vector<int>> pts(h, vector<int>(w, 0));
rep(i, 0, h) {
char pre =... | [] | 827,573 | 827,574 | u893584578 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll h, w;
cin >> h >> w;
vector<string> s(w);
rep(i, 0, h) cin >> s[i];
vector<vector<ll>> pts(h, vector<ll>(w, 0));
rep(i, 0, h) {
char pre = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, 0, h) cin >> s[i];
vector<vector<int>> pts(h, vector<int>(w, 0));
rep(i, 0, h) {
char pre =... | [
"call.arguments.change",
"variable_declaration.type.change"
] | 827,575 | 827,574 | u893584578 | cpp |
p03014 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
#define cinf(n, x) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
#define cinf(n, x) ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 827,576 | 827,577 | u139300044 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> s(h, vector<char>(w));
vector<vector<int>> yoko(h, vector<int>(1));
vector<vector<int>> tate(w, vector<int>(1));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> s[i][j];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> s(h, vector<char>(w));
vector<vector<int>> yoko(h, vector<int>(1));
vector<vector<int>> tate(w, vector<int>(1));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> s[i][j];
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 827,582 | 827,583 | u507850687 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.... | [
"assignment.variable.change",
"identifier.change"
] | 827,584 | 827,585 | u021108615 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N) {
v[N - 1] += 1;
int ind = N - 1;
int j = N - 1;
for (j = N - 1; j >= 1; j--) {
if (v[j] > 1) {
v[j - 1] += 1;
v[j] = 0;
}
}
return v;
}
/*フィボナッチ*/
long long fibonatti(long long d) {
long... | #include <bits/stdc++.h>
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N) {
v[N - 1] += 1;
int ind = N - 1;
int j = N - 1;
for (j = N - 1; j >= 1; j--) {
if (v[j] > 1) {
v[j - 1] += 1;
v[j] = 0;
}
}
return v;
}
/*フィボナッチ*/
long long fibonatti(long long d) {
long... | [
"control_flow.loop.for.condition.change"
] | 827,586 | 827,587 | u770067864 | cpp |
p03014 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#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;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vecto... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#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;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vecto... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 827,588 | 827,589 | u637220270 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
ll mod = 1000000007;
ll inf = 1e18;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
ll mod = 1000000007;
ll inf = 1e18;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin... | [
"assignment.change"
] | 827,596 | 827,597 | u291332466 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int, int>
char grid[2020][2020];
vector<int> bh[2020], bw[2020];
bool isOK(int index, int i, vector<int> &vec) {
if (vec[index] < i)
return 1;
else
return 0;
}
int nibut... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int, int>
char grid[2020][2020];
vector<int> bh[2020], bw[2020];
bool isOK(int index, int i, vector<int> &vec) {
if (vec[index] < i)
return 1;
else
return 0;
}
int nibut... | [
"identifier.change",
"call.arguments.change"
] | 827,598 | 827,599 | u692550512 | cpp |
p03014 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
const int MOD = 1000000007;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) { cin >> s[i]; }
vector<vector<int>> l(h + 2, vector<int>(w + 2, 0));
vector<vector<int>> r(h +... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
const int MOD = 1000000007;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) { cin >> s[i]; }
vector<vector<int>> l(h + 2, vector<int>(w + 2, 0));
vector<vector<int>> r(h +... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 827,606 | 827,607 | u289381123 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define ll long long
#define fastIO \
cout << fixed << setprecision(12), ios::sync_with_stdio(false), \
cin.tie(nullptr), cout.tie(nullptr)
double ... | #include <bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define ll long long
#define fastIO \
cout << fixed << setprecision(12), ios::sync_with_stdio(false), \
cin.tie(nullptr), cout.tie(nullptr)
double ... | [
"assignment.change"
] | 827,622 | 827,623 | u863370423 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
#define FOR(i, start, end) for (uint64_t i = start; i < end; i++)
#define REP(i, n) FOR(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
#define FOR(i, start, end) for (uint64_t i = start; i < end; i++)
#define REP(i, n) FOR(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,630 | 827,629 | u925478083 | cpp |
p03014 | // ABC 129 D Lamp
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int solve(int H, int W, vector<vector<char>> masu) {
vector<vector<int>> ue(H, vector<int>(W));
for (int j = 0; j < W; j++) {
for (int i = H - 1; i >= 0; i--) {
if (masu.at(i).at(j) == '#') {
ue.at(i).at(j) = ... | // ABC 129 D Lamp
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int solve(int H, int W, vector<vector<char>> masu) {
vector<vector<int>> ue(H, vector<int>(W));
for (int j = 0; j < W; j++) {
for (int i = H - 1; i >= 0; i--) {
if (masu.at(i).at(j) == '#') {
ue.at(i).at(j) = ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 827,631 | 827,632 | u947535482 | cpp |
p03014 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
const int siz = 2000;
int top[siz][siz];
int bottom[siz][siz];
int left[siz][siz];
int right[siz][siz];
int center[siz][siz];
long long lamp(std::vector<std::vector<char>> area) {
int h = area.size();
int w = are... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
const int siz = 2000;
int top[siz][siz];
int bottom[siz][siz];
int left[siz][siz];
int right[siz][siz];
int center[siz][siz];
long long lamp(std::vector<std::vector<char>> area) {
int h = area.size();
int w = are... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 827,635 | 827,636 | u570229212 | cpp |
p03014 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"expression.operation.binary.remove"
] | 827,640 | 827,641 | u814715203 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll h, w;
ll H[2010][2010];
ll W[2010][2010];
char ch[2010][2010];
int main() {
cin >> h >> w;
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++) {
cin >> ch[i][j];
}
}
for (ll i = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll h, w;
ll H[2010][2010];
ll W[2010][2010];
char ch[2010][2010];
int main() {
cin >> h >> w;
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++) {
cin >> ch[i][j];
}
}
for (ll i = ... | [
"assignment.variable.change",
"identifier.change"
] | 827,650 | 827,651 | u166378830 | cpp |
p03014 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) ci... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) ci... | [] | 827,654 | 827,655 | u374051158 | cpp |
p03014 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stat... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stat... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 827,656 | 827,657 | u690326065 | cpp |
p03014 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = {31, 28, 31, 30, 31, 30, ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = {31, 28, 31, 30, 31, 30, ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 827,666 | 827,667 | u083910207 | cpp |
p03014 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 827,670 | 827,671 | u070335689 | cpp |
p03014 | #include <bits/stdc++.h>
//#define int long long
#define endl '\n'
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie... | #include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,672 | 827,673 | u392058778 | cpp |
p03014 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
// curという変数に「最後の壁から何マス来たのかを格納しておいて、iが壁なら0に戻し、iが通路なら... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
// curという変数に「最後の壁から何マス来たのかを格納しておいて、iが壁なら0に戻し、iが通路なら... | [
"assignment.change"
] | 827,678 | 827,679 | u412057008 | cpp |
p03013 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define ... | [
"expression.operation.binary.remove"
] | 827,691 | 827,692 | u658899890 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vi a(n + 1, 0);
vi b(n + 1,... | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vi a(n + 1, 0);
vi b(n + 1,... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,695 | 827,696 | u906129425 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define vi vector<int>
#define vl vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define vi vector<int>
#define vl vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
... | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 827,718 | 827,719 | u445922306 | cpp |
p03013 | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 827,748 | 827,749 | u055131803 | cpp |
p03013 | #include <bits/stdc++.h>
using namespace std;
int N, M;
int main() {
cin >> N >> M;
vector<int> a(N + 1, 1);
int c;
for (int j = 0; j < M; j++) {
cin >> c;
a.at(c) = 0;
}
if (N < 3) {
cout << 1 << endl;
return 0;
}
for (int j = N - 2; j >= 0; j--) {
if (a.at(j) == 1)
a.at(j) =... | #include <bits/stdc++.h>
using namespace std;
int N, M;
int main() {
cin >> N >> M;
vector<int> a(N + 1, 1);
int c;
for (int j = 0; j < M; j++) {
cin >> c;
a.at(c) = 0;
}
if (N == 1) {
cout << 1 << endl;
return 0;
}
for (int j = N - 2; j >= 0; j--) {
if (a.at(j) == 1)
a.at(j) ... | [] | 827,828 | 827,829 | u326609687 | cpp |
p03014 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef ... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 827,840 | 827,841 | u845000384 | cpp |
p03014 | /*
** Vishal Raj Roy
** Indian Institute of Technology Kharagpur
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define l... | /*
** Vishal Raj Roy
** Indian Institute of Technology Kharagpur
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define l... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 827,842 | 827,843 | u027266662 | cpp |
p03014 | /*
** Vishal Raj Roy
** Indian Institute of Technology Kharagpur
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define l... | /*
** Vishal Raj Roy
** Indian Institute of Technology Kharagpur
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define l... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change"
] | 827,844 | 827,843 | u027266662 | cpp |
p03014 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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>> cnt(h, vector<int>(w));
for (int i = 0; i < h; ++i) {
vector<int> done(w);
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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>> cnt(h, vector<int>(w));
for (int i = 0; i < h; ++i) {
vector<int> done(w);
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,866 | 827,867 | u707498674 | cpp |
p03014 | #include <iostream>
#include <string>
#include <vector>
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>> cnt(h, vector<int>(w));
for (int i = 0; i < h; ++i) {
vector<int> done(w);
for (int j = 0; j < w; ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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>> cnt(h, vector<int>(w));
for (int i = 0; i < h; ++i) {
vector<int> done(w);
... | [
"import.add",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,869 | 827,867 | u707498674 | cpp |
p03014 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<uns... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<uns... | [] | 827,889 | 827,890 | u493750228 | cpp |
p03014 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
o... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
o... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,899 | 827,900 | u450096124 | cpp |
p03014 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
o... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
o... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,899 | 827,901 | u450096124 | cpp |
p03014 |
#include <iostream>
#include <string>
#include <vector>
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>> cnt(H, vector<int>(W));
for (int i = 0; i < H; i++) {
vector<int> done(W, 0);
for (int j ... |
#include <iostream>
#include <string>
#include <vector>
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>> cnt(H, vector<int>(W));
for (int i = 0; i < H; i++) {
vector<int> done(W, 0);
for (int j ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change"
] | 827,906 | 827,907 | u289709148 | cpp |
p03014 |
#include <iostream>
#include <string>
#include <vector>
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>> cnt(H, vector<int>(W));
for (int i = 0; i < H; i++) {
vector<int> done(W, 0);
for (int j ... |
#include <iostream>
#include <string>
#include <vector>
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>> cnt(H, vector<int>(W));
for (int i = 0; i < H; i++) {
vector<int> done(W, 0);
for (int j ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,908 | 827,907 | u289709148 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
// order statistics tree
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
tree_... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
// order statistics tree
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
tree_... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 827,917 | 827,918 | u625416773 | cpp |
p03014 | #include <iostream>
using namespace std;
const int N = 2050;
char s[N][N];
int dp[N][N][5], ans;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i <= n - 1; ++i)
cin >> s[i];
for (int i = 0; i <= n - 1; ++i)
for (int j = 0; j <= m - 1; ++j) {
if (s[i][j] == '.') {
dp[i][j][1] = dp... | #include <iostream>
using namespace std;
const int N = 2050;
char s[N][N];
int dp[N][N][5], ans;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i <= n - 1; ++i)
cin >> s[i];
for (int i = 0; i <= n - 1; ++i)
for (int j = 0; j <= m - 1; ++j) {
if (s[i][j] == '.') {
dp[i][j][1] = dp... | [
"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"
] | 827,922 | 827,923 | u180882510 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 827,938 | 827,939 | u019780057 | cpp |
p03014 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author alireza_kaviani
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree =
tree<T, n... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author alireza_kaviani
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree =
tree<T, n... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,940 | 827,941 | u631674931 | cpp |
p03014 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<int>> s(h, vector<int>(w, 0));
vector<vector<int>> cnt(h, vector<int>(w, 0));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
char c;
cin >> c;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<int>> s(h, vector<int>(w, 0));
vector<vector<int>> cnt(h, vector<int>(w, 0));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
char c;
cin >> c;
... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 827,946 | 827,947 | u056123277 | cpp |
p03014 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> c(2 * h, vector<char>(2 * w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> c[i][j];
}
}
vector<vector<int>> l(2 * h, vector<int>(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> c(2 * h, vector<char>(2 * w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> c[i][j];
}
}
vector<vector<int>> l(2 * h, vector<int>(... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 827,950 | 827,951 | u240685518 | cpp |
p03014 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> c(2 * h, vector<char>(2 * w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> c[i][j];
}
}
vector<vector<int>> l(2 * h, vector<int>(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> c(2 * h, vector<char>(2 * w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> c[i][j];
}
}
vector<vector<int>> l(2 * h, vector<int>(... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,952 | 827,951 | u240685518 | cpp |
p03014 | #include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
int main() {
int H, W;
int i, j;
cin >> H >> W;
vector<string> s(H * 2);
int L[H * 2][W * 2];
int R[H * 2][W * 2];
int D[H * 2][W * 2];
int U[H * 2][W * 2];
for (i = 0; i < H; i++) {
cin >> s[i];
}
for (i = 0; i < H; ... | #include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
int main() {
int H, W;
int i, j;
cin >> H >> W;
vector<string> s(H * 2);
int L[H * 2][W * 2];
int R[H * 2][W * 2];
int D[H * 2][W * 2];
int U[H * 2][W * 2];
for (i = 0; i < H; i++) {
cin >> s[i];
}
for (i = 0; i < H; ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 827,953 | 827,954 | u209053759 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(ALL(x)), (x).end())
#define SORT(x) sort(ALL(x))
#define REV(x) reverse(ALL(x))
#define foreach(it, x) \
for (__typeof((x).begin()) it = (x).begi... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(ALL(x)), (x).end())
#define SORT(x) sort(ALL(x))
#define REV(x) reverse(ALL(x))
#define foreach(it, x) \
for (__typeof((x).begin()) it = (x).begi... | [
"identifier.change",
"call.arguments.change"
] | 827,955 | 827,956 | u313427116 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
int N, M;
int pre[2005][2005], suf[2005][2005], up[2005][2005], down[2005][2005];
int main() {
cin >> N >> M;
for (int i = 1; i <= N; i++) {
string s;
cin >> s;
for (int j = 1; j <= M; j++) {
suf[i][j] = down[i][j] = N * M;
if (s[j - 1] == '#'... | #include <bits/stdc++.h>
using namespace std;
int N, M;
int pre[2005][2005], suf[2005][2005], up[2005][2005], down[2005][2005];
int main() {
cin >> N >> M;
for (int i = 1; i <= N; i++) {
string s;
cin >> s;
for (int j = 1; j <= M; j++) {
suf[i][j] = down[i][j] = N * M + 100;
if (s[j - 1] ... | [
"assignment.change"
] | 827,959 | 827,960 | u937063359 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
int main() {
int h, w;
int x = 0;
cin >> h >> w;
string kari[h];
int tate[h + 2][w + 2];
int yoko[h + 2][w + 2];
int max = 0;
int r = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
int main() {
int h, w;
int x = 0;
cin >> h >> w;
string kari[h];
int tate[h + 2][w + 2];
int yoko[h + 2][w + 2];
int max = 0;
int r = 0;
... | [
"expression.operation.binary.add"
] | 827,965 | 827,966 | u806159048 | cpp |
p03014 | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll md = mod;
constexpr ll inf = 1e15;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (auto &a : s)
cin >> a;
vector<vector<int>> l(h, vector<int>... | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll md = mod;
constexpr ll inf = 1e15;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (auto &a : s)
cin >> a;
vector<vector<int>> l(h, vector<int>... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change"
] | 827,973 | 827,974 | u699193595 | cpp |
p03014 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 827,980 | 827,981 | u679071005 | cpp |
p03014 | #define FOR_IDE
#define REP(i, t, n) for (int i = t; i < n; i++)
#define ALL(n) (n).begin(), (n).end()
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <... | #define REP(i, t, n) for (int i = t; i < n; i++)
#define ALL(n) (n).begin(), (n).end()
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <stdio.h>
#include... | [] | 827,991 | 827,992 | u717315282 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define N 2019
int n, m;
char s[N][N];
int a[N][N];
int ans, cnt;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
scanf("%s", &s[i]);
ans = 1;
for (int i = 0; i < n; i++)
for (int j = 0; j <= m; j++)
if (j == n || s[i][j] == '#') {
... | #include <bits/stdc++.h>
using namespace std;
#define N 2019
int n, m;
char s[N][N];
int a[N][N];
int ans, cnt;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
scanf("%s", &s[i]);
ans = 1;
for (int i = 0; i < n; i++)
for (int j = 0; j <= m; j++)
if (j == m || s[i][j] == '#') {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 827,993 | 827,994 | u095721761 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define N 2019
int n, m;
char s[N][N];
int a[N][N];
int ans, cnt;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
scanf("%s", &s[i]);
for (int i = 0; i < n; i++)
for (int j = 0; j <= m; j++)
if (j == n || s[i][j] == '#') {
for... | #include <bits/stdc++.h>
using namespace std;
#define N 2019
int n, m;
char s[N][N];
int a[N][N];
int ans, cnt;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
scanf("%s", &s[i]);
ans = 1;
for (int i = 0; i < n; i++)
for (int j = 0; j <= m; j++)
if (j == m || s[i][j] == '#') {
... | [
"assignment.add",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 827,995 | 827,994 | u095721761 | cpp |
p03014 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (long long i ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (long long i ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 828,000 | 828,001 | u614063956 | cpp |
p03014 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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>> L(H, vector<int>(W, 0));
vector<vector<int>> R(H, vector<int>(W, 0));
vecto... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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>> L(H, vector<int>(W, 0));
vector<vector<int>> R(H, vector<int>(W, 0));
vecto... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 828,014 | 828,015 | u904123392 | cpp |
p03014 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
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>> L(H, vector<int>(W));
vector<vector<int>> R(H, vector<int>... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
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>> L(H, vector<int>(W));
vector<vector<int>> R(H, vector<int>... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 828,016 | 828,017 | u904123392 | cpp |
p03014 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (ll i = (j); i < (n); ++i)
#define all(x) (x).... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (ll i = (j); i < (n); ++i)
#define all(x) (x).... | [
"assignment.change"
] | 828,023 | 828,024 | u702582248 | cpp |
p03014 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 828,025 | 828,026 | u255001744 | cpp |
p03014 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 828,027 | 828,028 | u255001744 | cpp |
p03014 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int solve(int h, int w, vector<string> s) {
vector<vector<int>> L(h, vector<int>(w));
for (int i = 0; i < h; ++i) {
int prev = -1;
for (int j = 0; j < w; ++j) {
if (s[i][j] == '#') {
prev = j;
}
L[i][j] =... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int solve(int h, int w, vector<string> s) {
vector<vector<int>> L(h, vector<int>(w));
for (int i = 0; i < h; ++i) {
int prev = -1;
for (int j = 0; j < w; ++j) {
if (s[i][j] == '#') {
prev = j;
}
L[i][j] =... | [
"assignment.value.change",
"identifier.change"
] | 828,029 | 828,030 | u879309973 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(... | [
"expression.operation.binary.add"
] | 828,031 | 828,032 | u334351654 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e3 + 10;
char s[maxn][maxn];
int dp1[maxn][maxn], dp2[maxn][maxn], dp3[maxn][maxn], dp4[maxn][maxn];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%s", &s[i]);
}
for (int i = 1; i <= n; i++) {
for (in... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e3 + 10;
char s[maxn][maxn];
int dp1[maxn][maxn], dp2[maxn][maxn], dp3[maxn][maxn], dp4[maxn][maxn];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%s", s[i] + 1);
}
for (int i = 1; i <= n; i++) {
for ... | [
"call.arguments.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 828,049 | 828,050 | u573035837 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
int32_t main() ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 828,052 | 828,053 | u124992729 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#define mt make_... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#define mt make_... | [] | 828,054 | 828,055 | u635484372 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, i, j;
scanf("%d%d", &H, &W);
vector<string> S(H + 2, string(W + 2, '#'));
for (i = 1; i <= H; i++) {
string sub;
cin >> sub;
for (j = 1; j <= W; j++) {
S[i][j] = sub[j - 1];
}
}
vector<vector<int>> L(H + 2, vector<in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, i, j;
scanf("%d%d", &H, &W);
vector<string> S(H + 2, string(W + 2, '#'));
for (i = 1; i <= H; i++) {
string sub;
cin >> sub;
for (j = 1; j <= W; j++) {
S[i][j] = sub[j - 1];
}
}
vector<vector<int>> L(H + 2, vector<in... | [
"assignment.change"
] | 828,056 | 828,057 | u208608367 | cpp |
p03014 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;... | [
"expression.operation.binary.add"
] | 828,058 | 828,059 | u304318875 | cpp |
p03014 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 828,060 | 828,059 | u304318875 | cpp |
p03014 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
#define rd() abs((int)... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
#define rd() abs((int)... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"literal.number.change"
] | 828,064 | 828,065 | u710999236 | cpp |
p03014 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
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>> cnt(h, vector<int>(w));
for (int i = 0; i < h; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
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>> cnt(h, vector<int>(w));
for (int i = 0; i < h; i++) {
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change"
] | 828,088 | 828,089 | u272395350 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2005;
ll a[maxn][maxn];
ll b[maxn][maxn];
string s[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2005;
ll a[maxn][maxn];
ll b[maxn][maxn];
string s[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
for (int i = 0; i < ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 828,101 | 828,102 | u976418120 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) begin(a), end(a)
#define TPL template
#define TNM typename
using ll = long long;
using ull = unsigned long long;
TPL<TNM T> using vec = vector<T>;
TPL<TNM T> using vec2 = vec<vec<T>>;
TPL<TNM T> using vec3 = vec<vec2<T>>;
TPL<TNM T> using vec4 = vec<vec3<T... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) begin(a), end(a)
#define TPL template
#define TNM typename
using ll = long long;
using ull = unsigned long long;
TPL<TNM T> using vec = vector<T>;
TPL<TNM T> using vec2 = vec<vec<T>>;
TPL<TNM T> using vec3 = vec<vec2<T>>;
TPL<TNM T> using vec4 = vec<vec3<T... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 828,107 | 828,108 | u582351638 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) { cin >> s[i]; }
vector<vector<int>> r(h, vector<int>(w, 0)), l(h, vector<int>(w, 0));
vector<vector<int>> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) { cin >> s[i]; }
vector<vector<int>> r(h, vector<int>(w, 0)), l(h, vector<int>(w, 0));
vector<vector<int>> ... | [
"identifier.change",
"call.arguments.change"
] | 828,109 | 828,110 | u376817785 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) { cin >> s[i]; }
vector<vector<int>> r(w, vector<int>(w, 0)), l(w, vector<int>(w, 0));
vector<vector<int>> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) { cin >> s[i]; }
vector<vector<int>> r(h, vector<int>(w, 0)), l(h, vector<int>(w, 0));
vector<vector<int>> ... | [
"identifier.change",
"call.arguments.change"
] | 828,111 | 828,110 | u376817785 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) { cin >> s[i]; }
vector<vector<int>> x(w), y(h);
rep(i, h) {
rep(j, w) {
if (s[i][j] == '#') {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) { cin >> s[i]; }
vector<vector<int>> x(w), y(h);
rep(i, h) {
rep(j, w) {
if (s[i][j] == '#') {
... | [
"assignment.change"
] | 828,112 | 828,113 | u376817785 | cpp |
p03014 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> cnt(h, vector<int>(w));
rep(i, h) {
vector<int> done(w);
rep(j, w) {
if (s[i][j] == '#')
co... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> cnt(h, vector<int>(w));
rep(i, h) {
vector<int> done(w);
rep(j, w) {
if (s[i][j] == '#')
co... | [
"identifier.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 828,131 | 828,132 | u187491596 | cpp |
p03014 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#includ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#includ... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 828,143 | 828,144 | u711985352 | cpp |
p03014 | //=template==================================================================//
// include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <sstream>
#include <string>
#include <vector>
// namespace
using namespace std;
// define
#define FOR(i, a, b) for (int(i) = (... | //=template==================================================================//
// include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <sstream>
#include <string>
#include <vector>
// namespace
using namespace std;
// define
#define FOR(i, a, b) for (int(i) = (... | [] | 828,145 | 828,146 | u585181206 | cpp |
p03014 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
string grid[2001];
int vert[2001][2001];
int hori[2001][2001];
int main() {
int h, w;
cin >> h >> w;
for (int i = 0; i < h; i++) {
cin >> grid[i];
}
// vertical
for (int x = 0; x < w; x++) {
int range... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
string grid[2001];
int vert[2001][2001];
int hori[2001][2001];
int main() {
int h, w;
cin >> h >> w;
for (int i = 0; i < h; i++) {
cin >> grid[i];
}
// vertical
for (int x = 0; x < w; x++) {
int range... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 828,147 | 828,148 | u911446944 | cpp |
p03014 | #include <iostream>
using namespace std;
typedef struct pointT {
int *h;
int *v;
int sho;
} point;
int main() {
int h, w;
cin >> h >> w;
point *map = new point[h * w];
int *tmp = new int[2 * h * w];
tmp[0] = 0;
int tmp_cnt = 1;
char c;
for (int i = 0; i < h * w; i++) {
cin >> c;
map[i]... | #include <iostream>
using namespace std;
typedef struct pointT {
int *h;
int *v;
int sho;
} point;
int main() {
int h, w;
cin >> h >> w;
point *map = new point[h * w];
int *tmp = new int[2 * h * w];
tmp[0] = 0;
int tmp_cnt = 1;
char c;
for (int i = 0; i < h * w; i++) {
cin >> c;
map[i]... | [
"assignment.add"
] | 828,149 | 828,150 | u199912250 | cpp |
p03014 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 828,162 | 828,163 | u762703573 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.