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 |
|---|---|---|---|---|---|---|---|
p03073 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
string ans_1 = (""), ans_2 = ("");
int ans1 = 0, ans2 = 0;
for (int i = 1; i < str.size(); i++) {
if (i % 2 == 0) {
ans_1.push_back('0');
ans_2.push_back('1');
} else {
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
string ans_1 = (""), ans_2 = ("");
int ans1 = 0, ans2 = 0;
for (int i = 0; i < str.size(); i++) {
if (i % 2 == 0) {
ans_1.push_back('0');
ans_2.push_back('1');
} else {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,513 | 884,514 | u570417673 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string S;
cin >> S;
char c = '0';
int case1 = 0, case2 = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] != c)
case1++;
if (c == '0')
c = '1';
else
c = '0';
}
c = 1;
for (int i = 0; i < S.size(); i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string S;
cin >> S;
char c = '0';
int case1 = 0, case2 = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] != c)
case1++;
if (c == '0')
c = '1';
else
c = '0';
}
c = '1';
for (int i = 0; i < S.size(); i... | [] | 884,530 | 884,531 | u445628522 | cpp |
p03073 | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 884,532 | 884,533 | u757738907 | cpp |
p03073 | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"literal.string.change"
] | 884,534 | 884,533 | u757738907 | cpp |
p03073 | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
int main() {
int ans1 = 0, ans2 = 0;
string str;
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
int main() {
int ans1 = 0, ans2 = 0;
string str;
... | [
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 884,537 | 884,538 | u064626595 | cpp |
p03073 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
string S;
int main() {
cin >> S;
int N = S.size();
int ans = 0;
string S2 = S;
int ans2 = 0;
rep(i, N - 1) {
if (S[i] == S[i + 1]) {
if ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
string S;
int main() {
cin >> S;
int N = S.size();
int ans = 0;
string S2 = S;
int ans2 = 0;
rep(i, N - 1) {
if (S[i] == S[i + 1]) {
if ... | [
"identifier.change"
] | 884,542 | 884,543 | u281168735 | cpp |
p03073 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#includ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#includ... | [
"variable_declaration.value.change"
] | 884,544 | 884,545 | u698677417 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string T[2];
int main(void) {
string S;
cin >> S;
int N = S.size();
;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
T[0] += "0";
T[1] += "1";
} else {
T[0] + "1";
T[1] += "0";
}
}
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string T[2];
int main(void) {
string S;
cin >> S;
int N = S.size();
;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
T[0] += "0";
T[1] += "1";
} else {
T[0] += "1";
T[1] += "0";
}
}
... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 884,554 | 884,555 | u835297884 | cpp |
p03073 | #include <algorithm>
#include <cstdio>
#include <iostream>
#define SIZE 100100
using namespace std;
char s[SIZE];
int main() {
scanf("%s", s);
int i, total1 = 0;
int total0 = 0;
for (i = 0; s[i]; i++) {
if ((s[i] & 1) ^ 1)
total1++;
else
total0++;
}
printf("%d\n", min(total0, total1))... | #include <algorithm>
#include <cstdio>
#include <iostream>
#define SIZE 100100
using namespace std;
char s[SIZE];
int main() {
scanf("%s", s);
int i, total1 = 0;
int total0 = 0;
for (i = 0; s[i]; i++) {
if ((s[i] & 1) ^ (i & 1))
total1++;
else
total0++;
}
printf("%d\n", min(total0, to... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 884,558 | 884,559 | u074123934 | cpp |
p03073 | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[200005], finv[20... | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[200005], finv[20... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change"
] | 884,562 | 884,563 | u539402331 | cpp |
p03073 | /*#include <iostream>
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#de... | /*#include <iostream>
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#de... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 884,568 | 884,569 | u764234894 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
char p[2] = {'0', '1'};
int a = 0, b = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == p[i % 2])
a++;
}
for (int i = 1; i <= s.size(); i++) {
if (s[i] == p[i % 2])
b++;
}
cout << min(a, b) << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
char p[2] = {'0', '1'};
int a = 0, b = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == p[i % 2])
a++;
}
for (int i = 0; i <= s.size(); i++) {
if (s[i] == p[(i + 1) % 2])
b++;
}
cout << min(a, b)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 884,574 | 884,575 | u565219356 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = int64_t;
using ul = uint64_t;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
const ul MAX = ULONG_MAX;
const char nl = '\n';
#define elif else if
#define def inline auto
#define run __attribute__((constructor)) def _
// Debu... | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = int64_t;
using ul = uint64_t;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
const ul MAX = ULONG_MAX;
const char nl = '\n';
#define elif else if
#define def inline auto
#define run __attribute__((constructor)) def _
// Debu... | [
"expression.unary.arithmetic.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.unary.arithmetic.add"
] | 884,580 | 884,581 | u874039158 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = int64_t;
using ul = uint64_t;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
const ul MAX = ULONG_MAX;
const char nl = '\n';
#define elif else if
#define def inline auto
#define run __attribute__((constructor)) def _
// Debu... | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = int64_t;
using ul = uint64_t;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
const ul MAX = ULONG_MAX;
const char nl = '\n';
#define elif else if
#define def inline auto
#define run __attribute__((constructor)) def _
// Debu... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.change"
] | 884,582 | 884,581 | u874039158 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.length();
int idxOdd0 = 0, idxOdd1 = 0, idxEvn0 = 0, idxEvn1 = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (S[i] == '0') {
idxEvn0++;
} else {
i... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.length();
int idxOdd0 = 0, idxOdd1 = 0, idxEvn0 = 0, idxEvn1 = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (S[i] == '0') {
idxEvn0++;
} else {
i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 884,587 | 884,588 | u239023686 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.length();
int idxOdd0 = 0, idxOdd1 = 0, idxEvn0 = 0, idxEvn1 = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (S[i] == '0') {
idxEvn0++;
} else {
i... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.length();
int idxOdd0 = 0, idxOdd1 = 0, idxEvn0 = 0, idxEvn1 = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (S[i] == '0') {
idxEvn0++;
} else {
i... | [
"identifier.change",
"io.output.change"
] | 884,589 | 884,588 | u239023686 | cpp |
p03073 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
char s[1000001];
cin >> s;
int len = strlen(s);
char tmp[1000001];
strcpy(tmp, s);
int ans1 = 0;
for (int i = 1; i < len; i++) {
if (s[i - 1] == '0' && s[i] == '0') {
s[i] = '1';
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
char s[1000001];
cin >> s;
int len = strlen(s);
char tmp[1000001];
strcpy(tmp, s);
int ans1 = 0;
for (int i = 1; i < len; i++) {
if (s[i - 1] == '0' && s[i] == '0') {
s[i] = '1';
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 884,590 | 884,591 | u905270643 | cpp |
p03073 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
char s[100001];
cin >> s;
int len = strlen(s);
char tmp[100001];
strcpy(tmp, s);
int ans1 = 0;
for (int i = 1; i < len; i++) {
if (s[i - 1] == '0' && s[i] == '0') {
s[i] = '1';
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
char s[1000001];
cin >> s;
int len = strlen(s);
char tmp[1000001];
strcpy(tmp, s);
int ans1 = 0;
for (int i = 1; i < len; i++) {
if (s[i - 1] == '0' && s[i] == '0') {
s[i] = '1';
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 884,592 | 884,591 | u905270643 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define SORT(v, n) sort(v, v + n);
#define SSORT(v, n) sort(v, v + n, greater<int>())
int main() {
string s, s2 = "";
cin >> s;
s2 = s;
int ans1 = 0;
int ans2 = 0;
for (int i = 0; i < s.length(); i++) {
if ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define SORT(v, n) sort(v, v + n);
#define SSORT(v, n) sort(v, v + n, greater<int>())
int main() {
string s, s2 = "";
cin >> s;
s2 = s;
int ans1 = 0;
int ans2 = 0;
for (int i = 0; i < s.length(); i++) {
if ... | [
"control_flow.branch.if.condition.change"
] | 884,618 | 884,619 | u398211442 | cpp |
p03073 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> S;
vector<char> T;
for (int i = 0; i < s.size(); i++) {
S.push_back(s.at(i));
T.push_back(s.at(i));
}
int count_first = 0;
for (int i = 1; i < s.size(); i++) {
if (S[i ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> S;
vector<char> T;
for (int i = 0; i < s.size(); i++) {
S.push_back(s.at(i));
T.push_back(s.at(i));
}
int count_first = 0;
for (int i = 1; i < s.size(); i++) {
if (S[i ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 884,620 | 884,621 | u115819033 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
// const int maxn = 100 + 10;
// int h[maxn];
int main() {
string a, b;
cin >> a;
int len = a.length(), ans = 100000 + 10;
for (int i = 0; i < len; i++) {
a[i] = a[i] - '0';
}
b = a;
// int len = a.length(), ans = 100000 ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
// const int maxn = 100 + 10;
// int h[maxn];
int main() {
string a, b;
cin >> a;
int len = a.length(), ans = 100000 + 10;
for (int i = 0; i < len; i++) {
a[i] = a[i] - '0';
}
b = a;
// int len = a.length(), ans = 100000 ... | [
"assignment.add"
] | 884,629 | 884,630 | u125824817 | cpp |
p03073 | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int a, b;
size_t size = s.length();
a = 0;
b = 0;
for (int j = 0; j < size; j++) {
if (j % 2 == 0) {
if (s[j] == '0') {
a++;
}
}
if (j % 2 == 1) {
if (s[j] ... | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int a, b;
size_t size = s.length();
a = 0;
b = 0;
for (int j = 0; j < size; j++) {
if (j % 2 == 0) {
if (s[j] == '0') {
a++;
}
}
if (j % 2 == 1) {
if (s[j] ... | [
"identifier.change",
"io.output.change"
] | 884,637 | 884,638 | u313043608 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string input;
cin >> input;
string input2;
input2.reserve(input.size());
reverse_copy(input.begin(), input.end(), back_inserter(input2));
int ans1 = 0;
int ans2 = 0;
int ans3 = 0;
int ans4 = 0;
unsigned ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string input;
cin >> input;
string input2;
input2.reserve(input.size());
reverse_copy(input.begin(), input.end(), back_inserter(input2));
int ans1 = 0;
int ans2 = 1;
int ans3 = 0;
int ans4 = 1;
unsigned ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 884,641 | 884,642 | u995475449 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a1, a2;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
if (s[i] == '0')
a1++;
else
a2++;
} else {
if (s[i] == '0')
a2++;
else
a1++;
}
}
cout << min(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a1 = 0, a2 = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
if (s[i] == '0')
a1++;
else
a2++;
} else {
if (s[i] == '0')
a2++;
else
a1++;
}
}
cout... | [
"variable_declaration.value.change"
] | 884,647 | 884,648 | u732571394 | cpp |
p03073 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, i, j, count1 = 0, count2 = 0;
char a[10000];
cin >> a;
for (j = 1; j < strlen(a); j++) {
if (j % 2 == 1) {
if (a[j] == '1')
count1++;
} else {
if (a[j] == '0')
count1++;
}
}
for (j =... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, i, j, count1 = 0, count2 = 0;
char a[100020];
cin >> a;
for (j = 0; j < strlen(a); j++) {
if (j % 2 == 1) {
if (a[j] == '1')
count1++;
} else {
if (a[j] == '0')
count1++;
}
}
for (j ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,663 | 884,662 | u749530685 | cpp |
p03073 | #include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n;
n = s.length();
int r1, r2 = 0;
for (int i = 0; i < n; i++) {
r1 += abs((int)(s[i]) - 48 - i % 2);
r2 += abs((int)(s[i]) - 48 - (i + 1) % 2);
}
cout << min(r1, r2);
} | #include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n;
n = s.length();
int r1 = 0;
int r2 = 0;
// if (n%2==0){
for (int i = 0; i < n; i++) {
r1 += abs((int)(s[i]) - 48 - i % 2);
r2 += abs((int)(s[i]) - 48 - (i + 1) % 2);
}
//}el... | [
"variable_declaration.add"
] | 884,668 | 884,669 | u442039299 | cpp |
p03069 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(obj) \
(obj).begin(), (obj).end() //イテレータの簡略化（コンテナじゃないと使えない）
using namespace std;
typedef long long ll; // long longをllで... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(obj) \
(obj).begin(), (obj).end() //イテレータの簡略化（コンテナじゃないと使えない）
using namespace std;
typedef long long ll; // long longをllで... | [
"identifier.replace.add",
"literal.replace.remove"
] | 884,685 | 884,686 | u369212307 | cpp |
p03069 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,687 | 884,688 | u406158207 | cpp |
p03069 | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_C main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX / 2)
const int ... | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_C main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX / 2)
const int ... | [
"variable_declaration.value.change",
"identifier.change"
] | 884,695 | 884,696 | u404244809 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int white = 0;
for (char &c : S) {
if (c == '.')
white++;
}
int rightWhite = white;
int leftBlack = 0;
int ans = N;
for (int inx = 0; inx < N; inx++) {
if (S[inx... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int white = 0;
for (char &c : S) {
if (c == '.')
white++;
}
int rightWhite = white;
int leftBlack = 0;
int ans = white;
for (int inx = 0; inx < N; inx++) {
if (S... | [
"variable_declaration.value.change",
"identifier.change"
] | 884,721 | 884,722 | u436484848 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int INF = 1e9;
int main() {
int N;
string S;
cin >> N >> S;
int white = 0, black = 0;
for (char &c : S) {
if (c == '.')
white++;
else
black++;
}
int leftWhite = 0, rightWhite = white;
int leftBlack ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int INF = 1e9;
int main() {
int N;
string S;
cin >> N >> S;
int white = 0, black = 0;
for (char &c : S) {
if (c == '.')
white++;
else
black++;
}
int leftWhite = 0, rightWhite = white;
int leftBlack ... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 884,723 | 884,724 | u436484848 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> black(N + 1, 0), white(N + 1, 0);
for (int i = 1; i <= N; i++) {
if (S[i - 1] == '#')
black[i] = black[i - 1] + 1;
else
black[i] = black[i - 1];
}
for (int i = N - 2; i >= -1; i-... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> black(N + 1, 0), white(N + 1, 0);
for (int i = 1; i <= N; i++) {
if (S[i - 1] == '#')
black[i] = black[i - 1] + 1;
else
black[i] = black[i - 1];
}
for (int i = N - 2; i >= -1; i-... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"variable_acc... | 884,774 | 884,775 | u628332144 | cpp |
p03069 | #include <bits/stdc++.h>
#define mkp make_pair
#define pb push_back
#define emb emplace_back
#define em emplace
#define ii pair<int, int>
#define iii pair<int, ii>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define allc(x) x.begin(), x.end(), cmp
#define optimizar_io ... | #include <bits/stdc++.h>
#define mkp make_pair
#define pb push_back
#define emb emplace_back
#define em emplace
#define ii pair<int, int>
#define iii pair<int, ii>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define allc(x) x.begin(), x.end(), cmp
#define optimizar_io ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,784 | 884,785 | u091359364 | cpp |
p03069 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
long N;
cin >> N;
string S;
cin >> S;
long count_white = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
long N;
cin >> N;
string S;
cin >> S;
long count_white = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 884,798 | 884,799 | u027284591 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define loop(i, a, b) for (int i = a; i < (int)(b); i++)
int main() {
int N;
string S;
cin >> N;
cin >> S;
N = S.length();
int totalWhite = 0;
int totalBlack = 0;
int black[N];
int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define loop(i, a, b) for (int i = a; i < (int)(b); i++)
int main() {
int N;
string S;
cin >> N;
cin >> S;
N = S.length();
int totalWhite = 0;
int totalBlack = 0;
int black[N];
int... | [
"expression.operation.binary.remove"
] | 884,804 | 884,805 | u129315407 | cpp |
p03069 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 2000000000;
// const ll MOD = 1000000007;
int N;
string S;
int ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 2000000000;
// const ll MOD = 1000000007;
int N;
string S;
int ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 884,806 | 884,807 | u751964641 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define bug cout << "AIkahne aise" << endl
ll A[5000001];
vector<ll> v;
vector<pair<ll, ll>> v2;
/*void sieve()
{
for(ll i=3; i<=2000; i+=2)
{
for(ll j=i*i; j<=4000000; j+=i)
A[j]=1;
}
v.push_back(2);
for(ll i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define bug cout << "AIkahne aise" << endl
ll A[5000001];
vector<ll> v;
vector<pair<ll, ll>> v2;
/*void sieve()
{
for(ll i=3; i<=2000; i+=2)
{
for(ll j=i*i; j<=4000000; j+=i)
A[j]=1;
}
v.push_back(2);
for(ll i... | [
"assignment.add"
] | 884,808 | 884,809 | u313033295 | cpp |
p03069 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 21474... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 21474... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 884,810 | 884,811 | u901561754 | cpp |
p03069 | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
// 境界を探索
int c_b = 0, c_w = 0;
for (int i = 0; i < n; i++) {
string t = s.substr(i, 1);
if (s == ".")
c_w++;
}
int min = c_w;
for (int i = 0; i < n; i++) {
... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
// 境界を探索
int c_b = 0, c_w = 0;
for (int i = 0; i < n; i++) {
string t = s.substr(i, 1);
if (t == ".")
c_w++;
}
int min = c_w;
for (int i = 0; i < n; i++) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 884,821 | 884,822 | u491550356 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
//白白...黒黒...
vector<int> b(n + 1);
vector<int> w(n + 1);
for (int i = 1; i <= n; i++) {
if (a[i - 1] == '.') {
w[i] = w[i - 1] + 1;
b[i] = b[i - 1];
} else {
w[i] = w[i - 1];
b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
//白白...黒黒...
vector<int> b(n + 1);
vector<int> w(n + 1);
for (int i = 1; i <= n; i++) {
if (a[i - 1] == '.') {
w[i] = w[i - 1] + 1;
b[i] = b[i - 1];
} else {
w[i] = w[i - 1];
b... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,829 | 884,830 | u280114218 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
//白白...黒黒...
vector<int> b(n + 1);
vector<int> w(n + 1);
for (int i = 1; i <= n; i++) {
if (a[i - 1] == '.') {
w[i] = w[i - 1] + 1;
b[i] = b[i - 1];
} else {
w[i] = w[i - 1];
b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
//白白...黒黒...
vector<int> b(n + 1);
vector<int> w(n + 1);
for (int i = 1; i <= n; i++) {
if (a[i - 1] == '.') {
w[i] = w[i - 1] + 1;
b[i] = b[i - 1];
} else {
w[i] = w[i - 1];
b... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,831 | 884,830 | u280114218 | cpp |
p03073 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 884,843 | 884,844 | u930898631 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | [
"control_flow.branch.if.condition.change"
] | 884,847 | 884,848 | u874644572 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | [
"control_flow.branch.if.condition.change"
] | 884,849 | 884,848 | u874644572 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
i... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
i... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 884,854 | 884,855 | u418810472 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
i... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
i... | [
"control_flow.loop.for.update.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 884,856 | 884,855 | u418810472 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
i... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
i... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.loop.for.update.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 884,857 | 884,855 | u418810472 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
... | [
"literal.number.change",
"call.arguments.change"
] | 884,858 | 884,859 | u084949493 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 884,860 | 884,861 | u084949493 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.... | [
"expression.unary.arithmetic.add"
] | 884,866 | 884,867 | u617826263 | cpp |
p03074 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | [
"control_flow.branch.if.condition.change"
] | 884,885 | 884,886 | u153390822 | cpp |
p03074 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | [
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 884,887 | 884,886 | u153390822 | cpp |
p03074 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | [
"control_flow.branch.if.condition.change"
] | 884,884 | 884,886 | u153390822 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
r... | #include <bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
r... | [
"control_flow.branch.if.condition.change"
] | 884,892 | 884,893 | u720447689 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
r... | #include <bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
r... | [
"control_flow.branch.if.condition.change"
] | 884,894 | 884,893 | u720447689 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <se... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <se... | [
"control_flow.branch.if.condition.change"
] | 884,895 | 884,896 | u118225776 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> num;
if (s[0] == '0')
num.push_back(0);
for (int i = 0; i < n; ++i) {
int ren = i;
while (ren < n && s[i] == s[ren])
++ren;
num.push_back(ren - i);
i = ren;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> num;
if (s[0] == '0')
num.push_back(0);
for (int i = 0; i < n;) {
int ren = i;
while (ren < n && s[i] == s[ren])
++ren;
num.push_back(ren - i);
i = ren;
}
if (... | [
"control_flow.loop.for.update.change"
] | 884,897 | 884,898 | u144029820 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void s... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 884,899 | 884,900 | u280175105 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> x;
int count = 1;
for (int i = 1; i < N; i++) {
if (S.at(i) == S.at(i - 1))
count++;
else {
x.push_back(count);
count = 1;
}
}
x.p... | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> x;
int count = 1;
for (int i = 1; i < N; i++) {
if (S.at(i) == S.at(i - 1))
count++;
else {
x.push_back(count);
count = 1;
}
}
x.p... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 884,904 | 884,905 | u618649215 | cpp |
p03074 | #ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
#define eb emplace_back
#define SZ(x) ((ll)(x).size())
#define all(x) (... | #ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
#define eb emplace_back
#define SZ(x) ((ll)(x).size())
#define all(x) (... | [
"control_flow.branch.if.condition.change"
] | 884,906 | 884,907 | u614128939 | cpp |
p03074 | /*
Converted from Scratch by scratch2cpp
(https://github.com/yos1up/scratch2cpp).
*/
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "-... | /*
Converted from Scratch by scratch2cpp
(https://github.com/yos1up/scratch2cpp).
*/
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "-... | [
"literal.number.change",
"call.arguments.change"
] | 884,908 | 884,909 | u141768747 | cpp |
p03074 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) fo... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) fo... | [
"literal.number.change",
"call.arguments.change",
"assignment.change"
] | 884,910 | 884,911 | u965730380 | cpp |
p03073 | #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 maxs(x, y) (x = ma... | #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 maxs(x, y) (x = ma... | [
"control_flow.branch.if.condition.change"
] | 884,926 | 884,927 | u791593901 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int ans1 = 0;
int ans2 = 0;
int length = S.size();
for (int i = 0; i < length; ++i) {
if (i % 2 == S[i] - '0') {
ans1++;
} else if (i & 2 != S[i] - '0') {
ans2++;
}
}
cout << min(ans1, ans2) << endl;
}
| #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int ans1 = 0;
int ans2 = 0;
int length = S.size();
for (int i = 0; i < length; ++i) {
if (i % 2 == S[i] - '0') {
ans1++;
} else if (i % 2 != S[i] - '0') {
ans2++;
}
}
cout << min(ans1, ans2) << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 884,941 | 884,942 | u600743332 | cpp |
p03073 | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define N_MAX (100000)
#define LL_MAX_NUM (1LL << 60)
#define INF... | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define N_MAX (100000)
#define LL_MAX_NUM (1LL << 60)
#define INF... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 884,943 | 884,944 | u221174888 | cpp |
p03073 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#pragma GCC target("avx2")
#pragma ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#pragma GCC target("avx2")
#pragma ... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 884,948 | 884,949 | u992394626 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
string s;
cin >> s;
int l = s.size();
if (l == 1) {
a++;
cout << a << endl;
} else {
for (int i = 1; i < l; i++) {
if (s[i - 1] == s[i]) {
a++;
if (s[i] == '0') {
s[i] = '1';
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
string s;
cin >> s;
int l = s.size();
if (l == 1) {
cout << a << endl;
} else {
for (int i = 1; i < l; i++) {
if (s[i - 1] == s[i]) {
a++;
if (s[i] == '0') {
s[i] = '1';
} else {
... | [
"expression.unary.arithmetic.remove"
] | 884,952 | 884,953 | u671802527 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
string c, s1, s2;
cin >> c;
bool b = false;
for (int i = 0; i < c.size(); i++) {
s1.push_back(b ? '1' : '0');
s2.push_back(b ? '0' : '1');
b != b;
}
int ans1, ans2 = 0;
for (int i = 0; i < c.size(); i++) {
if (s1[i] != c[i]) {
a... | #include <iostream>
using namespace std;
int main() {
string c, s1, s2;
cin >> c;
bool b = false;
for (int i = 0; i < c.size(); i++) {
s1.push_back(b ? '1' : '0');
s2.push_back(b ? '0' : '1');
b = !b;
}
int ans1 = 0, ans2 = 0;
for (int i = 0; i < c.size(); i++) {
if (s1[i] != c[i]) {
... | [
"expression.operation.binary.change",
"expression.operation.unary.add",
"variable_declaration.value.change"
] | 884,954 | 884,955 | u234531758 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
string c, s1, s2;
cin >> c;
bool b = false;
for (int i = 0; i < c.size(); i++) {
s1.push_back(b ? '1' : '0');
s2.push_back(b ? '0' : '1');
b != b;
}
int ans1, ans2 = 0;
for (int i = 1; i < c.size(); i++) {
if (s1[i] != c[i]) {
a... | #include <iostream>
using namespace std;
int main() {
string c, s1, s2;
cin >> c;
bool b = false;
for (int i = 0; i < c.size(); i++) {
s1.push_back(b ? '1' : '0');
s2.push_back(b ? '0' : '1');
b = !b;
}
int ans1 = 0, ans2 = 0;
for (int i = 0; i < c.size(); i++) {
if (s1[i] != c[i]) {
... | [
"expression.operation.binary.change",
"expression.operation.unary.add",
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,956 | 884,955 | u234531758 | cpp |
p03073 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int count = 0;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] != (i % 2))
count++;
}
if (count > S.size() / 2)
cout << S.size() - count << endl;
else
cout << count << endl;
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int count = 0;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] != (i % 2) + '0')
count++;
}
if (count > S.size() / 2)
cout << S.size() - count << endl;
else
cout << count << end... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 884,959 | 884,960 | u225891650 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
int i, ans1 = 0, ans2 = 0;
char s[111111];
for (i = 0; i < 111111; i++)
s[i] = '2';
cin >> s;
for (i = 0; s[i] != '2'; i++) {
if (s[i] == '0') {
if (i % 2 == 0)
ans1++;
else
ans2++;
} else {
if (i % 2 == 1)
... | #include <iostream>
using namespace std;
int main() {
int i, ans1 = 0, ans2 = 0;
char s[111111];
for (i = 0; i < 111111; i++)
s[i] = '\0';
cin >> s;
for (i = 0; s[i] != '\0'; i++) {
if (s[i] == '0') {
if (i % 2 == 0)
ans1++;
else
ans2++;
} else {
if (i % 2 == 1)
... | [
"literal.string.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 884,961 | 884,962 | u933068010 | cpp |
p03073 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int ans = 999999999;
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
int count = 0;
for (int j = 0; j < s.size(); j++) {
if ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int ans = 999999999;
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
int count = 0;
for (int j = 0; j < s.size(); j++) {
if ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 884,982 | 884,983 | u114838227 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s1, s2;
cin >> s1;
int i, sum1 = 0, sum2 = 1;
s2 = s1;
if (s2[0] == '0')
s2[0] = '1';
else
s2[0] = '0';
for (i = 0; i < s1.size() - 1; i++) {
if (s1[i] == s1[i + 1]) {
sum1++;
if (s... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s1, s2;
cin >> s1;
int i, sum1 = 0, sum2 = 1;
s2 = s1;
if (s2[0] == '0')
s2[0] = '1';
else
s2[0] = '0';
for (i = 0; i < s1.size() - 1; i++) {
if (s1[i] == s1[i + 1]) {
sum1++;
if (s... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 884,984 | 884,985 | u543120093 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s1, s2;
cin >> s1;
int i, sum1 = 0, sum2 = 0;
s2 = s1;
if (s2[0] == '0')
s2[0] = '1';
else
s2[0] = '0';
for (i = 0; i < s1.size() - 1; i++) {
if (s1[i] == s1[i + 1]) {
sum1++;
if (s1... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s1, s2;
cin >> s1;
int i, sum1 = 0, sum2 = 1;
s2 = s1;
if (s2[0] == '0')
s2[0] = '1';
else
s2[0] = '0';
for (i = 0; i < s1.size() - 1; i++) {
if (s1[i] == s1[i + 1]) {
sum1++;
if (s... | [
"literal.number.change",
"variable_declaration.value.change"
] | 884,986 | 884,985 | u543120093 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = S.size();
for (int i = 0; i < 2; i++) {
int cnt = 0;
for (int j = 0; j < S.size(); j++) {
if (j % 2 == 0 && S[j] != (char)(i + '0'))
cnt++;
if (j % 2 == 1 && S[j] == (char)(i + '0'))
cn... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = S.size();
for (int i = 0; i < 2; i++) {
int cnt = 0;
for (int j = 0; j < S.size(); j++) {
if (j % 2 == 0 && S[j] != (char)(i + '0'))
cnt++;
if (j % 2 == 1 && S[j] == (char)(i + '0'))
cn... | [] | 884,998 | 884,999 | u568419568 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int cnt0, cnt1;
for (int i = 0; i < S.length(); i++) {
if ((i % 2 == 0 && S[i] == '0') || (i % 2 == 1 && S[i] == '1')) {
cnt0++;
}
if ((i % 2 == 0 && S[i] == '1') || (i % 2 == 1 && S[i] == '0')) {
cnt1++;
}
... | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int cnt0 = 0, cnt1 = 0;
for (int i = 0; i < S.length(); i++) {
if ((i % 2 == 0 && S[i] == '0') || (i % 2 == 1 && S[i] == '1')) {
cnt0++;
}
if ((i % 2 == 0 && S[i] == '1') || (i % 2 == 1 && S[i] == '0')) {
cnt1++;
... | [
"variable_declaration.value.change"
] | 885,004 | 885,005 | u864667985 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
string S1;
string S2;
cin >> S;
S1 = S;
S2 = S;
int answer1 = 0;
int answer2 = 0;
for (int j = 0; j < S1.size() - 1; j++) {
if (S1.at(j) == S1.at(j + 1)) {
if (S1.at(j + 1) == '0') {
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
string S1;
string S2;
cin >> S;
S1 = S;
S2 = S;
int answer1 = 0;
int answer2 = 0;
for (int j = 0; j < S1.size() - 1; j++) {
if (S1.at(j) == S1.at(j + 1)) {
if (S1.at(j + 1) == '0') {
... | [
"call.remove",
"call.arguments.change"
] | 885,010 | 885,011 | u895225176 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
string s;
cin >> s;
int l = s.length();
int a = 0, b = 0;
rep(i, l) {
if (i % 2) {
if (s[i] != '0')
a++;
if (s[i] != '1')
b++;
} else if (s[i] != '1')
a++;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
string s;
cin >> s;
int l = s.length();
int a = 0, b = 0;
rep(i, l) {
if (i % 2) {
if (s[i] != '0')
a++;
if (s[i] != '1')
b++;
} else {
if (s[i] != '1')
... | [] | 885,012 | 885,013 | u970690920 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, s1 = "", s2 = "";
cin >> s;
int ans1 = 0, ans2 = 0;
int size = s.size();
s1 += '0';
s2 += '1';
for (int i = 0; i < size; i++) {
if (s1[i - 1] == '0') {
s1 += '1';
} else {
s1 += '0';
}
if (s2[i - 1] == '0') {... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, s1 = "", s2 = "";
cin >> s;
int ans1 = 0, ans2 = 0;
int size = s.size();
s1 += '0';
s2 += '1';
for (int i = 1; i < size; i++) {
if (s1[i - 1] == '0') {
s1 += '1';
} else {
s1 += '0';
}
if (s2[i - 1] == '0') {... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 885,018 | 885,019 | u422827820 | cpp |
p03073 | #include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
int main() {
std::string S;
std::vector<char> S1;
std::vector<char> S2;
long long s = 0;
long long s1 = 0;
long long s2 = 0;
long long scale = 1;
int count = 0;
int count2 = 0;
std::cin >> S;
S1.reserve(S.size());
S2.res... | #include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
int main() {
std::string S;
std::vector<char> S1;
std::vector<char> S2;
long long s = 0;
long long s1 = 0;
long long s2 = 0;
long long scale = 1;
int count = 0;
int count2 = 0;
std::cin >> S;
S1.reserve(S.size());
S2.res... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 885,026 | 885,027 | u329794618 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
ll c = 0, cnt = 0, f = 0, b = 0;
string s;
cin >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) {
c++;
if (s[i] == '1')
s[i] = '0';
else
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
ll c = 0, cnt = 0, f = 0, b = 0;
string s;
cin >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] == s[i - 1]) {
c++;
if (s[i] == '1')
s[i] = '0';
else
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 885,030 | 885,031 | u987476436 | cpp |
p03073 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
//#include <math.h>
//#include <istream>
//#include <sstream>
using namespace std;
int main() {
int ANS1 = 0;
int ANS2 = 0;
int ANS = 0;
string str;
vector<char> H;
getline(cin, str);
for (int i = 0; i < str.... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
//#include <math.h>
//#include <istream>
//#include <sstream>
using namespace std;
int main() {
int ANS1 = 0;
int ANS2 = 0;
int ANS = 0;
string str;
vector<char> H;
getline(cin, str);
for (int i = 0; i < str.... | [
"assignment.value.change",
"identifier.change"
] | 885,047 | 885,048 | u230139835 | cpp |
p03073 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rrep(i, a, n) for (ll i = n; i >= a; i--)
#define elif else if
typedef long long... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rrep(i, a, n) for (ll i = n; i >= a; i--)
#define elif else if
typedef long long... | [
"call.arguments.change"
] | 885,056 | 885,057 | u119345557 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 885,061 | 885,062 | u308463793 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
// 累積和
//... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
// 累積和
//... | [
"control_flow.loop.for.update.change"
] | 885,067 | 885,068 | u651235280 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | [
"expression.unary.arithmetic.add"
] | 885,069 | 885,070 | u628332144 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int ans = 0;
int right = 0;
int cn = 0;
if (s[0] == '0')
cn++;
for (int left = 0; left < n; ++lef... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int ans = 0;
int right = 0;
int cn = 0;
if (s[0] == '0')
cn++;
for (int left = 0; left < n; ++lef... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 885,073 | 885,074 | u233586402 | cpp |
p03074 |
// D - Handstand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> T;
if (S[0] == '0') {
T.push_back(0);
}
in... |
// D - Handstand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> T;
if (S[0] == '0') {
T.push_back(0);
}
in... | [
"assignment.change"
] | 885,080 | 885,081 | u790272146 | cpp |
p03074 | // C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (int i = 0; i < v.size(); ++i) {
os << v[i];
if (i != v.size() - 1)
os << ", ";
}
os << "]" << endl;
return os;
}
#define ll long long
#define loop(... | // C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (int i = 0; i < v.size(); ++i) {
os << v[i];
if (i != v.size() - 1)
os << ", ";
}
os << "]" << endl;
return os;
}
#define ll long long
#define loop(... | [
"call.add",
"call.arguments.add"
] | 885,082 | 885,083 | u823862638 | cpp |
p03074 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inclu... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inclu... | [
"control_flow.loop.for.condition.change",
"call.add"
] | 885,099 | 885,100 | u221285045 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
str... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
str... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 885,103 | 885,104 | u116774833 | cpp |
p03074 |
#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;
}
int main() {
int n, k;
cin >> n >> k;
string ... |
#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;
}
int main() {
int n, k;
cin >> n >> k;
string ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 885,112 | 885,113 | u412057008 | cpp |
p03074 |
#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;
}
int main() {
int n, k;
cin >> n >> k;
string ... |
#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;
}
int main() {
int n, k;
cin >> n >> k;
string ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 885,114 | 885,113 | u412057008 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
#define vvi vector<vi>
#define read(a) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define print(a) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
#define vvi vector<vi>
#define read(a) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define print(a) ... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 885,117 | 885,118 | u246401216 | cpp |
p03074 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
string ru... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
string ru... | [
"control_flow.branch.if.condition.change"
] | 885,119 | 885,120 | u135626132 | cpp |
p03074 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
string ru... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
string ru... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 885,122 | 885,120 | u135626132 | cpp |
p03074 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
string S;
cin >> S;
vector<long long> raw;
raw.push_back(0);
for (int i = 1; i < N; i++) {
if (S[i] != S[i - 1])
raw.push_back(i);
}
raw.push_back(N);
long long siz = ra... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
string S;
cin >> S;
vector<long long> raw;
raw.push_back(0);
for (int i = 1; i < N; i++) {
if (S[i] != S[i - 1])
raw.push_back(i);
}
raw.push_back(N);
long long siz = ra... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 885,123 | 885,124 | u503221936 | cpp |
p03074 | #include <iostream>
using namespace std;
int main() {
// D
int n, k;
string s;
cin >> n >> k;
cin >> s;
int seq[100001];
int i;
for (i = 0; i < 100001; i++) {
seq[i] = 0;
}
int seqnum = 0;
if (s[0] == '0') {
seq[0] = 0;
seqnum++;
}
i = 0;
int counter = 0;
int maxcounter;
cha... | #include <iostream>
using namespace std;
int main() {
// D
int n, k;
string s;
cin >> n >> k;
cin >> s;
int seq[100001];
int i;
for (i = 0; i < 100001; i++) {
seq[i] = 0;
}
int seqnum = 0;
if (s[0] == '0') {
seq[0] = 0;
seqnum++;
}
i = 0;
int counter = 0;
int maxcounter;
cha... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 885,125 | 885,126 | u073015397 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int ... | [
"expression.operation.binary.remove"
] | 885,127 | 885,128 | u615662061 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) \
fo... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) \
fo... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,129 | 885,130 | u071036035 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.