problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03050 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 868,082 | 868,083 | u061978627 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int t = 0, n, i;
cin >> n;
for (i = 1; i * i < n; i++)
if (n % i == 0)
t += n / i - 1;
cout << t;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int t = 0, n, i;
cin >> n;
for (i = 1; i * (i + 1) < n; i++)
if (n % i == 0)
t += n / i - 1;
cout << t;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 868,086 | 868,087 | u565087015 | cpp |
p03050 | #include <cstdint>
#include <iostream>
using namespace std; // 575
int main() {
int64_t N;
cin >> N;
int64_t ans = 0;
for (int64_t i = 1; i * (i + 1) <= N; ++i)
if ((N - i) % i == 0)
ans += (N - i) / i;
cout << ans;
return 0;
}
/*
31536000のコメント解説欄
ここテンプレで用意してるから、A問題とかだとこの先空欄の危険あり
また、コンテスト後に https... | #include <cstdint>
#include <iostream>
using namespace std; // 575
int main() {
int64_t N;
cin >> N;
int64_t ans = 0;
for (int64_t i = 1; i * (i + 2) <= N; ++i)
if ((N - i) % i == 0)
ans += (N - i) / i;
cout << ans;
return 0;
}
/*
31536000のコメント解説欄
ここテンプレで用意してるから、A問題とかだとこの先空欄の危険あり
また、コンテスト後に https... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 868,100 | 868,101 | u550314572 | cpp |
p03050 | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<ll>;
using vvll = vector<vll>;
int main(void) {
ll n;
while (scanf("%lld", &n) == 1) {
ll ans = 0;
for (ll m ... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<ll>;
using vvll = vector<vll>;
int main(void) {
ll n;
while (scanf("%lld", &n) == 1) {
ll ans = 0;
for (ll m ... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 868,106 | 868,107 | u565795452 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#def... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#def... | [
"control_flow.branch.if.add"
] | 868,119 | 868,120 | u114738674 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#def... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#def... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 868,121 | 868,120 | u114738674 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ea = 0, bb = 0, ch = 0, ans = 0, n, i, j;
string s;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
for (j = 0; j < s.size() - 1; j++)
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
if (s[0] == 'B')
bb++;
if (s[s.... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ea = 0, bb = 0, ch = 0, ans = 0, n, i, j;
string s;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
for (j = 0; j < s.size() - 1; j++)
if (s[j] == 'A' && s[j + 1] == 'B')
ans++;
if (s[0] == 'B')
bb++;
if (s[s.... | [
"control_flow.branch.if.condition.change"
] | 868,124 | 868,125 | u038054933 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
string s[10000];
cin >> n;
long long ans = 0;
int a = 0;
int b = 0;
int ba = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].length() -... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
string s[10000];
cin >> n;
long long ans = 0;
int a = 0;
int b = 0;
int ba = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].length() -... | [
"control_flow.branch.if.add"
] | 868,126 | 868,127 | u702906718 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"control_flow.branch.if.condition.change"
] | 868,134 | 868,135 | u155416173 | cpp |
p03049 | #include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
// SA
// BS
// BA
// BABS
// SABABABS
// BABA
// BABABS
// SABABA
int main() {
int N;
ci... | #include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
// AB + AB
// ABAB
// SA BA
int main() {
int N;
cin >> N;
int startB = 0, endA = 0, an... | [
"io.output.change"
] | 868,136 | 868,137 | u326966549 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s[10002];
int ans = 0;
int fb = 0;
int la = 0;
int ba = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
int l = s[i].size();
for (int j = 0; j < l - 1; j++) {
if (s[i][j]... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s[10002];
int ans = 0;
int fb = 0;
int la = 0;
int ba = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
int l = s[i].size();
for (int j = 0; j < l - 1; j++) {
if (s[i][j]... | [
"control_flow.branch.if.condition.change"
] | 868,138 | 868,139 | u681557252 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long llong;
int N, A, B, C, D, ans;
char s[10000][15];
bool flag = false, flagb = false;
int main() {
cin >> N;
for (int i = 0; i < N; i+... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long llong;
int N, A, B, C, D, ans;
char s[10000][15];
bool flag = false, flagb = false;
int main() {
cin >> N;
for (int i = 0; i < N; i+... | [
"control_flow.branch.if.condition.change"
] | 868,140 | 868,141 | u740232619 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans = 0, a = 0, b = 0, c = 0;
string s;
string ab = "AB";
cin >> n;
vector<string> v;
for (int i = 0; i < n; i++) {
cin >> s;
v.emplace_back(s);
}
for (auto i : v) {
auto r... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans = 0, a = 0, b = 0, c = 0;
string s;
string ab = "AB";
cin >> n;
vector<string> v;
for (int i = 0; i < n; i++) {
cin >> s;
v.emplace_back(s);
}
for (auto i : v) {
auto r... | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 868,149 | 868,150 | u324072562 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef DEBUG
std::ifstream in("/home/share/inputf.in");
std::cin.rdbuf(in.rdbuf());
#endif
int N;
int a = 0, b = 0, ab = 0, ans = 0;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S[i];
for (int j = 0; j < S[i].size() ... | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef DEBUG
std::ifstream in("/home/share/inputf.in");
std::cin.rdbuf(in.rdbuf());
#endif
int N;
int a = 0, b = 0, ab = 0, ans = 0;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S[i];
for (int j = 0; j < S[i].size() ... | [
"call.add",
"call.arguments.add"
] | 868,154 | 868,155 | u936555566 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define initdp(a, b) \
for (int i = 0; i <= a; i++) \
for (int j =... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define initdp(a, b) \
for (int i = 0; i <= a; i++) \
for (int j =... | [
"assignment.value.change",
"call.arguments.add"
] | 868,160 | 868,161 | u133630059 | cpp |
p03049 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
template <class T> inline void rd(T &x) {
x = 0;
char c = getchar();
int f = 1;
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdigit(c))
x = x * 10... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
template <class T> inline void rd(T &x) {
x = 0;
char c = getchar();
int f = 1;
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdigit(c))
x = x * 10... | [
"control_flow.branch.if.add"
] | 868,164 | 868,165 | u973935896 | cpp |
p03049 | #include <iostream>
using namespace std;
int find(string s) {
int ans = 0, flag = 0;
for (int i = 0; i < s.size(); i++) {
if (flag) {
if (s[i] == 'B')
ans++;
flag = 0;
}
if (s[i] == 'A')
flag = 1;
}
return ans;
}
int main() {
int n, ans = 0, a, b, c;
string s;
cin ... | #include <iostream>
using namespace std;
int find(string s) {
int ans = 0, flag = 0;
for (int i = 0; i < s.size(); i++) {
if (flag) {
if (s[i] == 'B')
ans++;
flag = 0;
}
if (s[i] == 'A')
flag = 1;
}
return ans;
}
int main() {
int n, ans = 0, a = 0, b = 0, c = 0;
stri... | [
"variable_declaration.value.change"
] | 868,166 | 868,167 | u261245192 | cpp |
p03049 | #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 RUP(a, b) ((a + b - 1) / (b))
#define SORTG(v) sort(v.begin(), v.end(), greater<>())
#define SORT(v) sort(v.begin(), v.end())
#define ALL(v) (v).begin(), (v).end()
#define pb p... | #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 RUP(a, b) ((a + b - 1) / (b))
#define SORTG(v) sort(v.begin(), v.end(), greater<>())
#define SORT(v) sort(v.begin(), v.end())
#define ALL(v) (v).begin(), (v).end()
#define pb p... | [
"call.add",
"call.arguments.change"
] | 868,168 | 868,169 | u635484372 | cpp |
p03049 | // khodaya khodet komak kon
#include <bits/stdc++.h>
#define pb push_back
#define ers erase
#define ins insert
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define kill(x) return cout << x, 0;
#define IOS ... | // khodaya khodet komak kon
#include <bits/stdc++.h>
#define pb push_back
#define ers erase
#define ins insert
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define kill(x) return cout << x, 0;
#define IOS ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 868,170 | 868,171 | u349705898 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define INF 1.0e9
using namespace std;
typedef long long ll;
int N;
const int MAX_N = 10000;
string s[MAX_N];
ll ans = 0;
int hb = 0;
int ta = 0;
int allab = 0;
void count_AB(string str) {
int size = str.len... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define INF 1.0e9
using namespace std;
typedef long long ll;
int N;
const int MAX_N = 10000;
string s[MAX_N];
ll ans = 0;
int hb = 0;
int ta = 0;
int allab = 0;
void count_AB(string str) {
int size = str.len... | [
"control_flow.branch.if.condition.change"
] | 868,172 | 868,173 | u488352661 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
int A = 0;
int B = 0;
int AB = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
if (s[i][s[i].size() - 1] == 'A') {
A++;
}
if (s[i][0] == 'B') {
B++;
}
if (s[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
int A = 0;
int B = 0;
int AB = 0;
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
if (s[i][s[i].size() - 1] == 'A') {
A++;
}
if (s[i][0] == 'B') {
B++;
}
if (s[i]... | [
"control_flow.branch.if.condition.change"
] | 868,174 | 868,175 | u912534104 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
int main() {
int n;
cin >> n;
int a = 0, b = 0, ab = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
st... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
int main() {
int n;
cin >> n;
int a = 0, b = 0, ab = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
s... | [
"control_flow.branch.if.condition.change"
] | 868,180 | 868,181 | u649423108 | cpp |
p03049 | #pragma region _head
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
void Init() {
std::cin.tie(0);
std::ios::sync_with_stdio(fals... | #pragma region _head
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
void Init() {
std::cin.tie(0);
std::ios::sync_with_stdio(fals... | [] | 868,194 | 868,195 | u987267288 | cpp |
p03049 | #pragma region _head
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
void Init() {
std::cin.tie(0);
std::ios::sync_with_stdio(fals... | #pragma region _head
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
void Init() {
std::cin.tie(0);
std::ios::sync_with_stdio(fals... | [] | 868,196 | 868,195 | u987267288 | cpp |
p03049 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int A = 0;
int B = 0;
int count = 0;
int check = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
int M;
M = s.size();
if (s.at(0) == 'B') {
B++;
}
if (s.at(M - 1) == 'A') {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int A = 0;
int B = 0;
int count = 0;
int check = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
int M;
M = s.size();
if (s.at(0) == 'B') {
B++;
}
if (s.at(M - 1) == 'A') {
... | [
"control_flow.branch.if.condition.change"
] | 868,197 | 868,198 | u913104858 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int startb = 0, enda = 0, inab = 0;
bool loop = true;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
int x = s.size();
if (s[0] == 'B') {
++startb;
if (s[x - 1] != 'A')
loop = false;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int startb = 0, enda = 0, inab = 0;
bool loop = true;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
int x = s.size();
if (s[0] == 'B') {
++startb;
if (s[x - 1] != 'A')
loop = false;
}
... | [
"control_flow.branch.if.condition.change"
] | 868,202 | 868,203 | u640800420 | cpp |
p03049 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
struct result {
bool head_b, tail_a;
int count;
result(const std::string &s, int index_)
: head_b{s[0] == 'B'}, tail_a{s.back() == 'A'}, count{} {
auto pos = s.find("AB");
while (pos != std::string::npos) {
++count;... |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
struct result {
bool head_b, tail_a;
int count;
result(const std::string &s, int index_)
: head_b{s[0] == 'B'}, tail_a{s.back() == 'A'}, count{} {
auto pos = s.find("AB");
while (pos != std::string::npos) {
++count;... | [
"assignment.change"
] | 868,206 | 868,207 | u837286475 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define ll long long
#define ld long double
#define fi first
//#define endl "\n"
#define se second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define loop(i, a... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define ll long long
#define ld long double
#define fi first
//#define endl "\n"
#define se second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define loop(i, a... | [
"control_flow.branch.if.condition.change"
] | 868,208 | 868,209 | u851993789 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int ba = 0, a = 0, b = 0, c = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
bool bb = false;
bool aa = false;
for (int j = 0; j < (int)s.size(); j++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int ba = 0, a = 0, b = 0, c = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
bool bb = false;
bool aa = false;
for (int j = 0; j < (int)s.size(); j++) {
... | [
"control_flow.branch.if.condition.change"
] | 868,210 | 868,211 | u036561304 | cpp |
p03049 | #include <iostream>
#include <map>
#include <math.h>
#include <string>
using namespace std;
#define ll long long
int main() {
int N, ans = 0, BA = 0;
cin >> N;
int count[N] = {}, headb[N] = {}, enda[N] = {};
string s[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
if (s[i][0] == 'B')
headb[i] =... | #include <iostream>
#include <map>
#include <math.h>
#include <string>
using namespace std;
#define ll long long
int main() {
int N, ans = 0, BA = 0;
cin >> N;
int count[N] = {}, headb[N] = {}, enda[N] = {};
string s[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
if (s[i][0] == 'B')
headb[i] =... | [
"control_flow.branch.if.condition.change"
] | 868,213 | 868,214 | u668443884 | cpp |
p03049 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 868,219 | 868,220 | u240509821 | cpp |
p03049 | #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 N;
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
rep(i, N) {
string s;
cin >> s;
rep(j, s.size() - 1) if (s[j] == 'A' and s[j + 1] == 'B') ans++;
if (s[0] == '... | #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 N;
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
rep(i, N) {
string s;
cin >> s;
rep(j, s.size() - 1) if (s[j] == 'A' and s[j + 1] == 'B') ans++;
if (s[0] == '... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 868,221 | 868,222 | u944316525 | cpp |
p03049 | #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 N;
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
rep(i, N) {
string s;
cin >> s;
rep(j, s.size() - 1) if (s[j] == 'A' and s[j + 1] == 'B') ans++;
if (s[0] == '... | #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 N;
cin >> N;
int ans = 0;
int A = 0, B = 0, BA = 0;
rep(i, N) {
string s;
cin >> s;
rep(j, s.size() - 1) if (s[j] == 'A' and s[j + 1] == 'B') ans++;
if (s[0] == '... | [
"call.add",
"call.arguments.change"
] | 868,223 | 868,222 | u944316525 | cpp |
p03049 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0, anum = 0, bnum = 0, abnum = 0;
string s[n];
for (int i =... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0, anum = 0, bnum = 0, abnum = 0;
string s[n];
for (int i =... | [
"control_flow.branch.if.condition.change"
] | 868,231 | 868,232 | u461415203 | cpp |
p03049 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string a[n];
int count = 0;
int x = 0, y = 0;
int k = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
int l = a[i].length();
for (int j = 0; j < l - 1; ++j) {
if (a[i][j] == 'A' && a[i][j + 1] == 'B') {
count++;... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string a[n];
int count = 0;
int x = 0, y = 0;
int k = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
int l = a[i].length();
for (int j = 0; j < l - 1; ++j) {
if (a[i][j] == 'A' && a[i][j + 1] == 'B') {
count++;... | [
"control_flow.branch.if.condition.change"
] | 868,233 | 868,234 | u193815565 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, cnt = 0, acnt = 0, bcnt = 0, both = 0;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
bool a = false;
bool topb = (s[0] == 'B');
for (auto c : s) {
if (a && c == 'B')
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, cnt = 0, acnt = 0, bcnt = 0, both = 0;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
bool a = false;
bool topb = (s[0] == 'B');
for (auto c : s) {
if (a && c == 'B')
... | [
"call.add",
"call.arguments.add"
] | 868,235 | 868,236 | u956758464 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, numB = 0, numA = 0, numC = 0, ans = 0;
bool A = false;
cin >> N;
string s[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
if (s[i][0] == 'B')
numB++;
if (s[i][s[i].size() - 1] == 'A')
numA++;
if (s[i][0] == 'B' && s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, numB = 0, numA = 0, numC = 0, ans = 0;
bool A = false;
cin >> N;
string s[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
if (s[i][0] == 'B')
numB++;
if (s[i][s[i].size() - 1] == 'A')
numA++;
if (s[i][0] == 'B' && s... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 868,237 | 868,238 | u912533549 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios::sync_with_stdio(false)
#define pb push_back
#define mp make_pair
#define precision(x, d) cout << fixed << setprecision(d) << x
#define all(x) (x).begin(), (x).end()
#define uint usigned int
typedef vector<pair<char, ll>> vi;
ll MOD = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios::sync_with_stdio(false)
#define pb push_back
#define mp make_pair
#define precision(x, d) cout << fixed << setprecision(d) << x
#define all(x) (x).begin(), (x).end()
#define uint usigned int
typedef vector<pair<char, ll>> vi;
ll MOD = ... | [
"control_flow.branch.if.condition.change"
] | 868,245 | 868,246 | u415518175 | cpp |
p03049 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
int N;
cin >> N;
int AB = 0;
int A_end = 0;
int B_start = 0;
int same = 0;
string S = "AB";
vector<string> s(N);
for (int i = 0; i < N; ++i) {
bool same_flg = false;
cin >> s[i];
for (int j = 0; j < s[i].si... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
int N;
cin >> N;
int AB = 0;
int A_end = 0;
int B_start = 0;
int same = 0;
string S = "AB";
vector<string> s(N);
for (int i = 0; i < N; ++i) {
bool same_flg = false;
cin >> s[i];
for (int j = 0; j < s[i].si... | [
"control_flow.branch.if.condition.change"
] | 868,247 | 868,248 | u701556979 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[10000];
int aa = 0;
int bb = 0;
int ab = 0;
int ba = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
int ss = s[i].size();
if (s[i][0] == 'B') {
bb++;
}
if (s[i][ss - 1] == 'A') {
aa++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[10000];
int aa = 0;
int bb = 0;
int ab = 0;
int ba = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
int ss = s[i].size();
if (s[i][0] == 'B') {
bb++;
}
if (s[i][ss - 1] == 'A') {
aa++;
... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 868,249 | 868,250 | u922602011 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | [] | 868,258 | 868,259 | u366676780 | cpp |
p03049 | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <cstring>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
... | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <cstring>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
... | [
"call.add",
"call.arguments.add"
] | 868,260 | 868,261 | u853132965 | cpp |
p03049 | #include <cstdio>
#include <cstring>
#include <algorithm>
using std::max;
using std::min;
int countAB(char *s) {
int i, res = 0;
for (i = 0; s[i + 1]; i++) {
if (s[i] == 'A' && s[i + 1] == 'B')
res += 1;
}
return res;
}
int main(void) {
int i, N, tailA = 0, headB = 0, res, tailHeadAB = 0;
char m... | #include <cstdio>
#include <cstring>
#include <algorithm>
using std::max;
using std::min;
int countAB(char *s) {
int i, res = 0;
for (i = 0; s[i + 1]; i++) {
if (s[i] == 'A' && s[i + 1] == 'B')
res += 1;
}
return res;
}
int main(void) {
int i, N, tailA = 0, headB = 0, res, tailHeadAB = 0;
char m... | [
"call.add",
"call.arguments.change"
] | 868,262 | 868,263 | u643081547 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int ans = 0, N;
cin >> N;
vector<string> S(N);
vector<string> AB;
int acnt = 0, bcnt = 0, abcnt = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
for (int l = 0; l < S[i].size() - 1; l++) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int ans = 0, N;
cin >> N;
vector<string> S(N);
vector<string> AB;
int acnt = 0, bcnt = 0, abcnt = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
for (int l = 0; l < S[i].size() - 1; l++) {
... | [
"control_flow.branch.if.condition.change"
] | 868,266 | 868,267 | u982721500 | cpp |
p03049 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define FOR(i, x, y) for (ll i = x; i < y; i++)
typedef long long ll;
using namespace std;
deque<string> end_b, reg;
ll ans = 0, indx = 0;
void iter(string i) {
FOR(j, 0, i.size() - 1) if (i[j] == 'A' && i[j + 1] == 'B') ans++;
if (i.back() == 'A' && indx < end_... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define FOR(i, x, y) for (ll i = x; i < y; i++)
typedef long long ll;
using namespace std;
deque<string> end_b, reg;
ll ans = 0, indx = 0;
void iter(string i) {
// cout << i << ' ' << indx << endl;
FOR(j, 0, i.size() - 1) if (i[j] == 'A' && i[j + 1] == 'B') ans+... | [
"control_flow.loop.for.update.change",
"call.arguments.change"
] | 868,268 | 868,269 | u290148197 | cpp |
p03049 | // 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... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 868,272 | 868,273 | u331542638 | cpp |
p03049 | // 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... | [
"call.add",
"call.arguments.add"
] | 868,274 | 868,273 | u331542638 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000000
#define MOD 1000000007
#define ll long long int
using namespace std;
int cntAB(string s, int l, i... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000000
#define MOD 1000000007
#define ll long long int
using namespace std;
int cntAB(string s, int l, i... | [
"control_flow.branch.if.add"
] | 868,281 | 868,282 | u617525345 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int find(const string &word) {
int count = 0;
for (string::size_type pos = 0; (pos = word.find("AB", pos)) != string::npos;
pos += 1) {
++count;
}
return count;
}
int main() {
int N;
cin >> N;
string s[N];
for (int i = 0; i < N; i++)
cin >... | #include <bits/stdc++.h>
using namespace std;
int find(const string &word) {
int count = 0;
for (string::size_type pos = 0; (pos = word.find("AB", pos)) != string::npos;
pos += 1) {
++count;
}
return count;
}
int main() {
int N;
cin >> N;
string s[N];
for (int i = 0; i < N; i++)
cin >... | [
"control_flow.branch.if.condition.change"
] | 868,283 | 868,284 | u917212538 | cpp |
p03049 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define vi vector<in... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define vi vector<in... | [
"control_flow.branch.if.add"
] | 868,287 | 868,288 | u298360432 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define sz(c) (static_cast<int>(c.size()))
#define endl "\n"
#ifdef DEBUG
#define dump(v) cerr << "[" #v << ":" << (v) << "]" << endl;
#else
#define dump(v)
#endif
typedef long double ld;
typedef long long ll;
typedef unsigned long long... | #include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define sz(c) (static_cast<int>(c.size()))
#define endl "\n"
#ifdef DEBUG
#define dump(v) cerr << "[" #v << ":" << (v) << "]" << endl;
#else
#define dump(v)
#endif
typedef long double ld;
typedef long long ll;
typedef unsigned long long... | [
"control_flow.branch.if.condition.change"
] | 868,289 | 868,290 | u346692517 | cpp |
p03053 | #include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex<double>;
typedef pair<int, int> pii;
const int N = 3e3 + 5;
const long long INF = 1e18;
const int mod = 998244353; // 786433;//998244353;
const double Pi = acos(-1);
void Fa... | #include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex<double>;
typedef pair<int, int> pii;
const int N = 3e3 + 5;
const long long INF = 1e18;
const int mod = 998244353; // 786433;//998244353;
const double Pi = acos(-1);
void Fa... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 868,309 | 868,310 | u960469574 | cpp |
p03053 | #include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex<double>;
typedef pair<int, int> pii;
const int N = 3e3 + 5;
const long long INF = 1e18;
const int mod = 998244353; // 786433;//998244353;
const double Pi = acos(-1);
void Fa... | #include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex<double>;
typedef pair<int, int> pii;
const int N = 3e3 + 5;
const long long INF = 1e18;
const int mod = 998244353; // 786433;//998244353;
const double Pi = acos(-1);
void Fa... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 868,311 | 868,310 | u960469574 | cpp |
p03053 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#define REP(_i, _a, _n) for (int _i = _a; _i <= _n; ++_i)
#define PER(_i, _a, _n) f... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#define REP(_i, _a, _n) for (int _i = _a; _i <= _n; ++_i)
#define PER(_i, _a, _n) f... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,323 | 868,324 | u257336998 | cpp |
p03053 | #include "bits/stdc++.h"
using namespace std;
void Main() {
int H, W;
cin >> H >> W;
vector<vector<int>> A(H, vector<int>(W, 0));
int nbBlack = 0;
queue<pair<int, int>> nextQue;
for (int i = 0; i < H; ++i) {
string s;
cin >> s;
for (int j = 0; j < W; ++j) {
if (s[j] == '#') {
A[i... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int H, W;
cin >> H >> W;
vector<vector<int>> A(H, vector<int>(W, 0));
int nbBlack = 0;
queue<pair<int, int>> nextQue;
for (int i = 0; i < H; ++i) {
string s;
cin >> s;
for (int j = 0; j < W; ++j) {
if (s[j] == '#') {
A[i... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 868,325 | 868,326 | u138886316 | cpp |
p03053 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int H, W;
cin >> H >> W;
vector<vector<string>> mat(H);
queue<vector<P>> q;
vector<P> p;
rep(i, W) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int H, W;
cin >> H >> W;
vector<vector<string>> mat(H);
queue<vector<P>> q;
vector<P> p;
// cout << "B"... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,329 | 868,330 | u297738015 | cpp |
p03053 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int H, W;
cin >> H >> W;
vector<vector<string>> mat(H);
queue<vector<P>> q;
vector<P> p;
rep(i, H) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int H, W;
cin >> H >> W;
vector<vector<string>> mat(H);
queue<vector<P>> q;
vector<P> p;
// cout << "B"... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,331 | 868,330 | u297738015 | cpp |
p03053 | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
#define REP(i, n) for (ll i = ... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
#define REP(i, n) for (ll i = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 868,357 | 868,358 | u939401127 | cpp |
p03053 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<int> px = {0, 1, 0, -1};
vector<int> py = {1, 0, -1, 0};
int main() {
int h, w, numPoints = 0, ans = 0;
cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; i++)
cin >> a[i];
vector<vector<bool>> isBlack(h, vector<bool>(w, ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<int> px = {0, 1, 0, -1};
vector<int> py = {1, 0, -1, 0};
int main() {
int h, w, numPoints = 0, ans = 0;
cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; i++)
cin >> a[i];
vector<vector<bool>> isBlack(h, vector<bool>(w, ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,359 | 868,360 | u197206619 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = (1e9) + 7;
using P = pair<ll, ll>;
int main() {
int h, w;
cin >> h >> w;
char a;
vector<vector<ll>> turn(h, vector<ll>(w, INF));
queue<P>... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = (1e9) + 7;
using P = pair<ll, ll>;
int main() {
int h, w;
cin >> h >> w;
char a;
vector<vector<ll>> turn(h, vector<ll>(w, INF));
queue<P>... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,372 | 868,373 | u525008368 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = (1e9) + 7;
using P = pair<ll, ll>;
int main() {
int h, w;
cin >> h >> w;
char a;
vector<vector<ll>> turn(h, vector<ll>(w, INF));
queue<P>... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = (1e9) + 7;
using P = pair<ll, ll>;
int main() {
int h, w;
cin >> h >> w;
char a;
vector<vector<ll>> turn(h, vector<ll>(w, INF));
queue<P>... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 868,374 | 868,373 | u525008368 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int h, w;
cin >> h >> w;
int m[h][w];
queue<pair<int, int>> q;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
char c;
cin >> c;
if (c == '#') {
m[i][j] = 0;
q.push(make_pair(i, ... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int h, w;
cin >> h >> w;
int m[h][w];
queue<pair<int, int>> q;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
char c;
cin >> c;
if (c == '#') {
m[i][j] = 0;
q.push(make_pair(i, ... | [
"control_flow.branch.if.condition.change"
] | 868,389 | 868,390 | u313766957 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
vector<string> A;
int H, W;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int d[1000][1000];
int INF = 1e9 + 7;
int main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> H >> W;
for (int i = 0; i < H; i++)... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
vector<string> A;
int H, W;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int d[1000][1000];
int INF = 1e9 + 7;
int main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> H >> W;
for (int i = 0; i < H; i++)... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,401 | 868,402 | u059904258 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main() {
int h, w;
cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; ++i) {
cin >> a[i];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main() {
int h, w;
cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; ++i) {
cin >> a[i];
}
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 868,405 | 868,406 | u743124029 | cpp |
p03053 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int INF = 100000000;
typedef pair<int, int> P;
char maze[55][55];
int h, w;
vector<P> start;
int d[55][55];
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
void bfs() {
queue<P> que;
for (int i = 0; i < h; ++... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int INF = 100000000;
typedef pair<int, int> P;
char maze[1010][1010];
int h, w;
vector<P> start;
int d[1010][1010];
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
void bfs() {
queue<P> que;
for (int i = 0; i... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 868,409 | 868,408 | u743124029 | cpp |
p03053 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<string> a(H);
vector<vector<char>> A(H, vector<char>(W));
for (... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<string> a(H);
vector<vector<char>> A(H, vector<char>(W));
for (... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 868,420 | 868,421 | u488401358 | cpp |
p03053 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<string> a(H);
vector<vector<char>> A(H, vector<char>(W));
for (... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<string> a(H);
vector<vector<char>> A(H, vector<char>(W));
for (... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.type.widen.change"
] | 868,422 | 868,421 | u488401358 | cpp |
p03053 | #include <bits/stdc++.h>
#define lld long long
#define nmax 1005
#define pii pair<int, int>
#define pb push_back
using namespace std;
int dl[] = {-1, 0, 1, 0};
int dc[] = {0, 1, 0, -1};
int ans, n, m;
queue<pii> q, q2;
bool st[nmax][nmax];
char a[nmax][nmax];
bool interior(int i, int j) { return i >= 1 && j >= 1 && i... | #include <bits/stdc++.h>
#define lld long long
#define nmax 1005
#define pii pair<int, int>
#define pb push_back
using namespace std;
int dl[] = {-1, 0, 1, 0};
int dc[] = {0, 1, 0, -1};
int ans, n, m;
queue<pii> q, q2;
bool st[nmax][nmax];
char a[nmax][nmax];
bool interior(int i, int j) { return i >= 1 && j >= 1 && i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 868,446 | 868,447 | u353919145 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
// O(HW)
int H, W;
char maze[1010][1010];
int d[1010][1010];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
// O(HW)
int H, W;
char maze[1010][1010];
int d[1010][1010];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
... | [] | 868,448 | 868,449 | u633967774 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
int main() {
int h, w;
cin >> h >> w;
bool black[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
black[i][j] = false;
}
}
string s[h];
for (int i = 0; i < w; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
int main() {
int h, w;
cin >> h >> w;
bool black[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
black[i][j] = false;
}
}
string s[h];
for (int i = 0; i < h; i++) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 868,452 | 868,451 | u633967774 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int h, w;
cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; i++)
cin >> a[i];
// 多点スタート
// スタートから0距離で到達できる場合には距離配列に0を格納
vector<vector<int>> dist(h, vector<int>(w, -1));
queue... | #include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int h, w;
cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; i++)
cin >> a[i];
// 多点スタート
// スタートから0距離で到達できる場合には距離配列に0を格納
vector<vector<int>> dist(h, vector<int>(w, -1));
queue... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,453 | 868,454 | u786667376 | cpp |
p03053 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define invrepr(i, a, b) for (int i = b - 1; i >= a; i--)
#define invrep(i, n) invrepr(i, 0, n)
#define repitr(itr, a) for (auto itr = a.begin(); itr != a.e... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define invrepr(i, a, b) for (int i = b - 1; i >= a; i--)
#define invrep(i, n) invrepr(i, 0, n)
#define repitr(itr, a) for (auto itr = a.begin(); itr != a.e... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,459 | 868,460 | u012298376 | cpp |
p03053 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
queue<vector<ll>> bfs;
char a[1010][1010]... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
queue<vector<ll>> bfs;
char a[1010][1010]... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,461 | 868,462 | u012298376 | cpp |
p03053 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
queue<vector<int>> bfs;
char a[1010][1010... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
queue<vector<ll>> bfs;
char a[1010][1010]... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_declaration.type.change"
] | 868,463 | 868,462 | u012298376 | cpp |
p03053 | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define maxn 1005
#define inf 1e9
#define pb push_back
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
inline int read() {
int x = 0, w = 1;
char c = getchar();
while (c ... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ll long long
#define maxn 1005
#define inf 1e9
#define pb push_back
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
inline int read() {
int x = 0, w = 1;
char c = getchar();
while (c ... | [
"identifier.change",
"call.arguments.change"
] | 868,467 | 868,468 | u766349042 | cpp |
p03053 | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i... | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 868,473 | 868,474 | u683769494 | cpp |
p03053 | #include <bits/stdc++.h>
#define Maxn 1007
using namespace std;
int n, m;
char a[Maxn][Maxn];
bool vis[Maxn][Maxn];
int ans = 0, dis[Maxn][Maxn];
int dx[4], dy[4];
pair<int, int> que[Maxn * Maxn * 2];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%s", a[i] + 1);
memset(vis, false, si... | #include <bits/stdc++.h>
#define Maxn 1007
using namespace std;
int n, m;
char a[Maxn][Maxn];
bool vis[Maxn][Maxn];
int ans = 0, dis[Maxn][Maxn];
int dx[4], dy[4];
pair<int, int> que[Maxn * Maxn * 2];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%s", a[i] + 1);
memset(vis, false, si... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,491 | 868,492 | u018679195 | cpp |
p03053 | #include <bits/stdc++.h>
#define st first
#define nd second
using namespace std;
void debug_out() { cerr << endl; }
template <class T> ostream &prnt(ostream &out, T v) {
out << v.size() << '\n';
for (auto e : v)
out << e << ' ';
return out;
}
template <class T> ostream &operator<<(ostream &out, vector<T> v)... | #include <bits/stdc++.h>
#define st first
#define nd second
using namespace std;
void debug_out() { cerr << endl; }
template <class T> ostream &prnt(ostream &out, T v) {
out << v.size() << '\n';
for (auto e : v)
out << e << ' ';
return out;
}
template <class T> ostream &operator<<(ostream &out, vector<T> v)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 868,497 | 868,498 | u089230684 | cpp |
p03053 |
// A - Darker and Darker
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
char field[1000][1000];
bool visited[1000][1000];
struct Loc {
int r;
int c;
int step;
};
// 四方向への移動ベクトル
const int dr[4... |
// A - Darker and Darker
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
char field[1000][1000];
bool visited[1000][1000];
struct Loc {
int r;
int c;
int step;
};
// 四方向への移動ベクトル
const int dr[4... | [
"variable_declaration.value.change"
] | 868,501 | 868,502 | u790272146 | cpp |
p03053 | #include <iostream>
#include <queue>
using namespace std;
int H, W;
char A[1005][1005];
int dist[1005][1005];
bool visited[1005][1005];
int white_cnt = 0;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class Node {
public:
int x, y;
Node(int a, int b) : x(a), y(b) {}
};
void input() {
cin >> H >> W;
... | #include <iostream>
#include <queue>
using namespace std;
int H, W;
char A[1005][1005];
int dist[1005][1005];
bool visited[1005][1005];
int white_cnt = 0;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class Node {
public:
int x, y;
Node(int a, int b) : x(a), y(b) {}
};
void input() {
cin >> H >> W;
... | [] | 868,514 | 868,515 | u159943174 | cpp |
p03053 | // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for (ll i = 0; i < n; ... | // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for (ll i = 0; i < n; ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,518 | 868,519 | u448570453 | cpp |
p03053 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 868,520 | 868,521 | u128572736 | cpp |
p03053 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 868,522 | 868,521 | u128572736 | cpp |
p03053 | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vec... | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vec... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 868,531 | 868,532 | u876953939 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using P = pair<int, int>;
using gr... | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using P = pair<int, int>;
using gr... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,539 | 868,540 | u787139585 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> v... | [
"assignment.change"
] | 868,543 | 868,544 | u852449189 | cpp |
p03053 | #include <bits/stdc++.h>
#define P pair<int, int>
using namespace std;
const int INF = 1e5;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int main() {
int h, w, a[1009][1009];
string s[1009];
cin >> h >> w;
memset(a, -1, sizeof(a));
for (int i = 0; i < h; i++)
cin >> s[i];
queue<P> q;
for (... | #include <bits/stdc++.h>
#define P pair<int, int>
using namespace std;
const int INF = 1e5;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int main() {
int h, w, a[1009][1009];
string s[1009];
cin >> h >> w;
memset(a, -1, sizeof(a));
for (int i = 0; i < h; i++)
cin >> s[i];
queue<P> q;
for (... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 868,559 | 868,560 | u112318601 | cpp |
p03053 | #include <bits/stdc++.h>
#include <cstdint>
#include <vector>
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define RFOR(i, l, r) for (int i = (l); i >= (int)(r); i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n - 1, 0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf... | #include <bits/stdc++.h>
#include <cstdint>
#include <vector>
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define RFOR(i, l, r) for (int i = (l); i >= (int)(r); i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n - 1, 0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf... | [
"assignment.change"
] | 868,561 | 868,562 | u762160119 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
struct xy {
int x;
int y;
} node, top;
const int dx[2] = {-1, 1};
int main() {
int n, m;
cin >> n >> m;
vector<string> s(n);
queue<xy> q;
int cur = 0;
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) ... | #include <bits/stdc++.h>
using namespace std;
struct xy {
int x;
int y;
} node, top;
const int dx[2] = {-1, 1};
int main() {
int n, m;
cin >> n >> m;
vector<string> s(n);
queue<xy> q;
int cur = 0;
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) ... | [
"assignment.change"
] | 868,567 | 868,568 | u633066470 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double louble;
template <typename T1, typename T2> inline T1 max(T1 a, T2 b) {
return a < b ? b : a;
}
template <typename T1, typename T2> inline T1 min(T1 a, T2 b) {
return a < b ? a : b;
}
namespace ae86 {
const int bufl = 1 << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double louble;
template <typename T1, typename T2> inline T1 max(T1 a, T2 b) {
return a < b ? b : a;
}
template <typename T1, typename T2> inline T1 min(T1 a, T2 b) {
return a < b ? a : b;
}
namespace ae86 {
const int bufl = 1 << ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,579 | 868,580 | u326034736 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
ll abs1(ll a) {
if (a >= 0)
return a;
else
return -a;
}
ll gcd1(ll a, ll b) {
if (a == 0 && b == 0)
return 0;
ll n;
while (a % b != 0) {
n = a % b;
a = b;
b = n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
ll abs1(ll a) {
if (a >= 0)
return a;
else
return -a;
}
ll gcd1(ll a, ll b) {
if (a == 0 && b == 0)
return 0;
ll n;
while (a % b != 0) {
n = a % b;
a = b;
b = n;
... | [] | 868,582 | 868,583 | u952130512 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for (int i = s; i < t; i++)
#define pii pair<int, int>
#define MAXNUM 1111
char mat[MAXNUM][MAXNUM];
int isused[MAXNUM][MAXNUM];
pii q[MAXNUM * MAXNUM];
int dir[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
int main() {
int n, m;
scanf("%d%d", &n, &m);
rep(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for (int i = s; i < t; i++)
#define pii pair<int, int>
#define MAXNUM 1111
char mat[MAXNUM][MAXNUM];
int isused[MAXNUM][MAXNUM];
pii q[MAXNUM * MAXNUM];
int dir[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
int main() {
int n, m;
scanf("%d%d", &n, &m);
rep(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 868,584 | 868,585 | u930038564 | cpp |
p03053 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define rep2(i, N) for (int i = 1; i <= N; i++)
using namespace std;
long long INF = 1000000000000000000;
long long mod = 1000000007;
using namespace std;
char maze[1010][1010];
bool checked[1010][1010] = {};
int main() {
int h, w;
cin >> h >... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define rep2(i, N) for (int i = 1; i <= N; i++)
using namespace std;
long long INF = 1000000000000000000;
long long mod = 1000000007;
using namespace std;
char maze[1010][1010];
bool checked[1010][1010] = {};
int main() {
int h, w;
cin >> h >... | [
"call.remove",
"call.add"
] | 868,588 | 868,589 | u120564432 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
f... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
f... | [
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change",
"call.arguments.add"
] | 868,611 | 868,612 | u517411077 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 1000000000;
int main() {
int H, W;
cin >> H >> W;
char info[H][W];
int ans[H][W];
queue<pair<int, int>> point;
rep(i, H) rep(j, W) {
cin >> info[i][j];
if (info[i][j] ==... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 1000000000;
int main() {
int H, W;
cin >> H >> W;
char info[H][W];
int ans[H][W];
queue<pair<int, int>> point;
rep(i, H) rep(j, W) {
cin >> info[i][j];
if (info[i][j] ==... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 868,627 | 868,628 | u936602931 | cpp |
p03053 | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
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>> dist(H, vector<int>(W, -1));
queu... | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
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>> dist(H, vector<int>(W, -1));
queu... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 868,653 | 868,654 | u110383054 | cpp |
p03053 | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
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>> dist(H, vector<int>(W, -1));
queu... | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
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>> dist(H, vector<int>(W, -1));
queu... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 868,653 | 868,655 | u110383054 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define push_back pb
#define print(v) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define push_back pb
#define print(v) ... | [
"variable_declaration.value.change",
"literal.number.change",
"call.arguments.change"
] | 868,674 | 868,675 | u106297876 | cpp |
p03053 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) :... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) :... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 868,686 | 868,687 | u089885969 | cpp |
p03053 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) :... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) :... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 868,688 | 868,689 | u089885969 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.