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 |
|---|---|---|---|---|---|---|---|
p03107 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int r = 0, b = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 1)
b++;
else
r++;
}
cout << 2 * min(r, b) << endl;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int r = 0, b = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '1')
b++;
else
r++;
}
cout << 2 * min(r, b) << endl;
} | [
"control_flow.branch.if.condition.change"
] | 917,469 | 917,470 | u525137785 | cpp |
p03107 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int r = 0, b = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i])
b++;
else
r++;
}
cout << 2 * min(r, b) << endl;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int r = 0, b = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '1')
b++;
else
r++;
}
cout << 2 * min(r, b) << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 917,471 | 917,470 | u525137785 | cpp |
p03107 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int r = 0, b = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i])
b++;
else
r++;
}
cout << 2 * max(r, b) << endl;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int r = 0, b = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '1')
b++;
else
r++;
}
cout << 2 * min(r, b) << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 917,472 | 917,470 | u525137785 | cpp |
p03107 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 917,473 | 917,474 | u900727536 | cpp |
p03107 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
// vector <int> A;
int count = 0; // the number of 0s
cin >> S;
// A.resize(S.size());
for (int i = 0; i < S.size(); i++) {
// S[i]がoならば0
if (S[i] == '0') {
// A[i] = 0;
count++;
}
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
// vector <int> A;
int count = 0; // the number of 0s
cin >> S;
// A.resize(S.size());
for (int i = 0; i < S.size(); i++) {
// S[i]がoならば0
if (S[i] == '0') {
// A[i] = 0;
count++;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 917,477 | 917,478 | u298413997 | cpp |
p03107 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
// vector <int> A;
int count = 0; // the number of 0s
cin >> S;
// A.resize(S.size());
for (int i = 0; i < S.size(); i++) {
// S[i]がoならば0
if (S[i] == '0') {
// A[i] = 0;
count++;
}
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
// vector <int> A;
int count = 0; // the number of 0s
cin >> S;
// A.resize(S.size());
for (int i = 0; i < S.size(); i++) {
// S[i]がoならば0
if (S[i] == '0') {
// A[i] = 0;
count++;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 917,479 | 917,478 | u298413997 | cpp |
p03107 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
// vector <int> A;
int count = 0; // the number of 0s
cin >> S;
// A.resize(S.size());
for (int i = 0; i < S.size(); i++) {
// S[i]がoならば0
if (S[i] == 'o') {
// A[i] = 0;
count++;
}
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
// vector <int> A;
int count = 0; // the number of 0s
cin >> S;
// A.resize(S.size());
for (int i = 0; i < S.size(); i++) {
// S[i]がoならば0
if (S[i] == '0') {
// A[i] = 0;
count++;
}
... | [
"misc.typo",
"literal.string.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 917,480 | 917,478 | u298413997 | cpp |
p03107 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
// vector <int> A;
int count = 0; // the number of 0s
cin >> S;
// A.resize(S.size());
for (int i = 0; i < S.size(); i++) {
// S[i]がoならば0
if (S[i] == 'o') {
// A[i] = 0;
count++;
}
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
// vector <int> A;
int count = 0; // the number of 0s
cin >> S;
// A.resize(S.size());
for (int i = 0; i < S.size(); i++) {
// S[i]がoならば0
if (S[i] == '0') {
// A[i] = 0;
count++;
}
... | [
"misc.typo",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 917,481 | 917,478 | u298413997 | cpp |
p03107 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int C0, C1;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
C0 += 1;
else if (S[i] == '1')
C1 += 1;
}
cout << 2 * min(C0, C1) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int C0 = 0, C1 = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
C0 += 1;
else if (S[i] == '1')
C1 += 1;
}
cout << 2 * min(C0, C1) << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 917,484 | 917,485 | u456950583 | cpp |
p03107 | #include <iostream>
#include <string>
using namespace std;
int main() {
long long count, i;
count = 0;
string S;
cin >> S;
for (i = 0; i < S.length(); i++) {
if (S[i] == '0')
count += 1;
}
cout << ((count < (S.length() / 2)) ? (2 * count)
: (2 * (S.length() ... | #include <iostream>
#include <string>
using namespace std;
int main() {
int count, i;
count = 0;
string S;
cin >> S;
for (i = 0; i < S.length(); i++) {
if (S[i] == '0')
count += 1;
}
cout << ((count < ((double)S.length() / 2)) ? (2 * count)
: (2 * (S... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 917,489 | 917,490 | u059790365 | cpp |
p03107 | #include <iostream>
#include <string>
using namespace std;
int main() {
int count, i;
count = 0;
string S;
cin >> S;
for (i = 0; i < S.length(); i++) {
if (S[i] == '0')
count += 1;
}
cout << ((count < (S.length() / 2)) ? (2 * count)
: (2 * (S.length() - coun... | #include <iostream>
#include <string>
using namespace std;
int main() {
int count, i;
count = 0;
string S;
cin >> S;
for (i = 0; i < S.length(); i++) {
if (S[i] == '0')
count += 1;
}
cout << ((count < ((double)S.length() / 2)) ? (2 * count)
: (2 * (S... | [
"type_conversion.add"
] | 917,491 | 917,490 | u059790365 | cpp |
p03107 | #include <iostream>
#include <string>
using namespace std;
int main() {
int count, i;
count = 0;
string S;
cin >> S;
for (i = 0; i < S.length(); i++) {
if (S[i] = '0')
count += 1;
}
cout << ((count < (S.length() / 2)) ? (2 * count)
: (2 * (S.length() - count... | #include <iostream>
#include <string>
using namespace std;
int main() {
int count, i;
count = 0;
string S;
cin >> S;
for (i = 0; i < S.length(); i++) {
if (S[i] == '0')
count += 1;
}
cout << ((count < ((double)S.length() / 2)) ? (2 * count)
: (2 * (S... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 917,492 | 917,490 | u059790365 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int red = 0, blue = 0;
string S;
cin >> S;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == '0')
red++;
else
blue++;
}
cout << S.size() - 2 * min(red, blue) << '\n';
cout << f... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int red = 0, blue = 0;
string S;
cin >> S;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == '0')
red++;
else
blue++;
}
cout << 2 * min(red, blue) << '\n';
cout << flush;
// ... | [
"expression.operation.binary.remove"
] | 917,495 | 917,496 | u496254754 | cpp |
p03107 | #include <bits/stdc++.h>
#define ld long double
#define int long long
using namespace std;
const int N = 2e5 + 50;
const int mod = 1e9 + 7;
const int inf = 1e17;
int dx[] = {0, 1, -1, 0, -1, 1, 1, -1};
int dy[] = {1, 0, 0, -1, -1, 1, -1, 1};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(... | #include <bits/stdc++.h>
#define ld long double
#define int long long
using namespace std;
const int N = 2e5 + 50;
const int mod = 1e9 + 7;
const int inf = 1e17;
int dx[] = {0, 1, -1, 0, -1, 1, 1, -1};
int dy[] = {1, 0, 0, -1, -1, 1, -1, 1};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(... | [
"call.add"
] | 917,499 | 917,500 | u715191077 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
int count0 = 0;
int count1 = 1;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
count0++;
else
count1++;
}
cout << min(count0, count1) * 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
int count0 = 0;
int count1 = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
count0++;
else
count1++;
}
cout << min(count0, count1) * 2 << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 917,505 | 917,506 | u503870829 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n, m;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
n++;
else
m++;
}
cout << 2 * min(n, m) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = 0, m = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
n++;
else
m++;
}
cout << 2 * min(n, m) << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 917,509 | 917,510 | u526708273 | cpp |
p03107 | //#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, long long> pl;
long long N, M, k, a, b, c, d, e, H, W, X;
long long A[200001] = {};
long lon... | //#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, long long> pl;
long long N, M, k, a, b, c, d, e, H, W, X;
long long A[200001] = {};
long lon... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 917,521 | 917,522 | u058317639 | cpp |
p03107 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define int64 long long
using namespace std;
int main() {
string s;
cin >> s;
int count0, count1;
rep(i, ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define int64 long long
using namespace std;
int main() {
string s;
cin >> s;
int count0 = 0, count1 = 0;
... | [
"variable_declaration.value.change"
] | 917,527 | 917,528 | u170301438 | cpp |
p03107 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair<int, int>
#define pii pair<pi, pi>
#define vi vec... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair<int, int>
#define pii pair<pi, pi>
#define vi vec... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 917,529 | 917,530 | u392848063 | cpp |
p03107 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define int ll
#define pi pair<int, int>
#define pii pair<pi, pi>... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define int ll
#define pi pair<int, int>
#define pii pair<pi, pi>... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 917,531 | 917,532 | u392848063 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
deque<int> ar;
for (int i = 0; i < s.length(); i++) {
int m = ar.size();
if (!ar.empty() && ar[m] ^ (s[i] - '0')) {
ar.pop_back();
ans += 2;
} else
ar.push_back(s[i] - '0');
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
deque<int> ar;
for (int i = 0; i < s.length(); i++) {
int m = ar.size() - 1;
if (!ar.empty() && (ar[m] ^ (s[i] - '0'))) {
ar.pop_back();
ans += 2;
} else
ar.push_back(s[i] - '0');
}
c... | [
"control_flow.branch.if.condition.change"
] | 917,533 | 917,534 | u723145084 | cpp |
p03107 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
// find_by_order gives kth-largest element
// order_of_key gives the number of items in the set that are... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
// find_by_order gives kth-largest element
// order_of_key gives the number of items in the set that are... | [
"variable_declaration.value.change"
] | 917,535 | 917,536 | u325189601 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int len = s.size();
int i = 0;
while (i < s.size() - 1) {
if (s.at(i) != s.at(i + 1)) {
s.erase(s.begin() + i, s.begin() + i + 2);
if (s.size() != 0)
break;
if (i != 0)
i--;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int len = s.size();
int i = 0;
while (i < s.size() - 1) {
if (s.at(i) != s.at(i + 1)) {
s.erase(s.begin() + i, s.begin() + i + 2);
if (s.size() == 0)
break;
if (i != 0)
i--;
} else {
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 917,543 | 917,544 | u303454114 | cpp |
p03107 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | [
"assignment.change"
] | 917,547 | 917,548 | u896838289 | cpp |
p03107 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int out = 0;
for (int i = 1; i < s.size(); i++) {
if ((s[i - 1] == '0' && s[i] == '1') || (s[i - 1] == '1' && s[i] == '1')) {
s.erase(i - 1, 2);
out += 2;
i -= 2;
}
}
cout << out << endl;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int out = 0;
for (int i = 1; i < s.size(); i++) {
if ((s[i - 1] == '0' && s[i] == '1') || (s[i - 1] == '1' && s[i] == '0')) {
s.erase(i - 1, 2);
out += 2;
i -= 2;
}
}
cout << out << endl;
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 917,553 | 917,554 | u598869726 | cpp |
p03107 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt0 = 0;
int cnt1 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
cnt0++;
if (s[i] == '1')
cnt1++;
}
cout << min(cnt0, cnt1) << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt0 = 0;
int cnt1 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
cnt0++;
if (s[i] == '1')
cnt1++;
}
cout << min(cnt0, cnt1) * 2 << endl;
}
| [
"expression.operation.binary.add"
] | 917,555 | 917,556 | u032189172 | cpp |
p03107 | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
int main() {
std::string S;
LL cnt = 0;
rep(i, S.length()) if (S[i] == '0')++ cnt;
out << std::min<LL>(cnt, S.length() - cnt) * 2 << std::endl;
}
| #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
int main() {
std::string S;
in >> S;
LL cnt = 0;
rep(i, S.length()) if (S[i] == '0')++ cnt;
out << std::min<LL>(cnt, S.length() - cnt) * 2 << std::endl;
}
| [] | 917,557 | 917,558 | u660613376 | cpp |
p03107 | // ABC120_C
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
// input(sunippets: inpv, inpn)
string S;
cin >> S;
// calculation
// 最終的に 0, 1 どちらかだけになる
ll zero = 0, one = 0;
for (ll i = 1; i < S.size(); ++i) {
if (S[i] == '0')
++... | // ABC120_C
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
// input(sunippets: inpv, inpn)
string S;
cin >> S;
// calculation
// 最終的に 0, 1 どちらかだけになる
ll zero = 0, one = 0;
for (ll i = 0; i < S.size(); ++i) {
if (S[i] == '0')
++... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 917,561 | 917,562 | u870998297 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
size_t cnt = count(s.begin(), s.end(), '1');
cout << min(cnt, s.size() - cnt);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
size_t cnt = count(s.begin(), s.end(), '1');
cout << min(cnt, s.size() - cnt) * 2;
}
| [
"expression.operation.binary.add"
] | 917,565 | 917,566 | u873627575 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n_0 = 0, n_1 = 1;
for (char c : s) {
if (c == '0')
n_0 += 1;
else
n_1 += 1;
}
cout << 2 * min(n_0, n_1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n_0 = 0, n_1 = 0;
for (char c : s) {
if (c == '0')
n_0 += 1;
else
n_1 += 1;
}
cout << 2 * min(n_0, n_1) << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 917,575 | 917,576 | u227951688 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int zero = 0, one = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
zero++;
else
one++;
}
cout << min(zero, one) << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int zero = 0, one = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
zero++;
else
one++;
}
cout << min(zero, one) * 2 << endl;
} | [
"expression.operation.binary.add"
] | 917,577 | 917,578 | u879581330 | cpp |
p03107 | #include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
string s;
cin >> s;
int zero = 0, one = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '0') {
zero++;
} else {
one++;
}
cou... | #include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
string s;
cin >> s;
int zero = 0, one = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '0') {
zero++;
} else {
one++;
}
}
c... | [] | 917,581 | 917,582 | u477204532 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll a, b, c, d, e, k, l, m, n, o = 0, p, q, x, y, z, max1 = 0, ans, o0 = 0,
o1 = 0;
string s, t, u;
cin >> s;
for (ll i = 0; i < s.size(); i++) {
if (s[i] == 0) ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll a, b, c, d, e, k, l, m, n, o = 0, p, q, x, y, z, max1 = 0, ans, o0 = 0,
o1 = 0;
string s, t, u;
cin >> s;
for (ll i = 0; i < s.size(); i++) {
if (s[i] == '0'... | [
"control_flow.branch.if.condition.change"
] | 917,589 | 917,590 | u953532675 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll a, b, c, d, e, k, l, m, n, o = 0, p, q, x, y, z, max1 = 0, ans, o0 = 0,
o1 = 0;
string s, t, u;
cin >> s;
for (ll i = 0; i < s.size(); i++) {
if (s[i] == 0) ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll a, b, c, d, e, k, l, m, n, o = 0, p, q, x, y, z, max1 = 0, ans, o0 = 0,
o1 = 0;
string s, t, u;
cin >> s;
for (ll i = 0; i < s.size(); i++) {
if (s[i] == '0'... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 917,591 | 917,590 | u953532675 | cpp |
p03107 | #include <iostream>
#include <string>
using namespace std;
int main() {
char S[100000];
int i, A = 0, B = 0;
cin >> S;
for (i = 0; i < 100000; i++) {
if (S[i] == '1')
A += 1;
else if (S[i] == '0')
B += 1;
}
if (A > B)
cout << B * 2 << endl;
else
cout << A * 2 << endl;
ret... | #include <iostream>
#include <string>
using namespace std;
int main() {
char S[100000];
int i, A = 0, B = 0;
cin >> S;
for (i = 0; i < 100000; i++) {
if (S[i] == '1')
A += 1;
else if (S[i] == '0')
B += 1;
else
break;
}
if (A > B)
cout << B * 2 << endl;
else
cout << ... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 917,597 | 917,598 | u839537391 | cpp |
p03107 | #include <iostream>
using namespace std;
int main() {
char ch;
int c[2] = {0, 0};
while (cin >> ch) {
c[ch - '0']++;
}
cout << (c[0] < c[1] ? c[0] : c[1]) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
char ch;
int c[2] = {0, 0};
while (cin >> ch) {
c[ch - '0']++;
}
cout << 2 * (c[0] < c[1] ? c[0] : c[1]) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 917,602 | 917,603 | u587665681 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.length(), num_0 = 0, num_1 = 0;
for (int i = 0; i < n; i++) {
if (S[i])
num_1++;
else
num_0++;
}
cout << 2 * min(num_1, num_0) << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.length(), num_0 = 0, num_1 = 0;
for (int i = 0; i < n; i++) {
if (S[i] == '1')
num_1++;
else
num_0++;
}
cout << 2 * min(num_1, num_0) << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 917,608 | 917,609 | u124314853 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 917,622 | 917,623 | u685892567 | cpp |
p03107 | #include <iostream>
int main() {
std::string S;
std::cin >> S;
int count0 = 0, count1 = 0;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == '0') {
count0++;
} else {
count1++;
}
}
std::cout << std::min(count0, count1);
return 0;
}
| #include <iostream>
int main() {
std::string S;
std::cin >> S;
int count0 = 0, count1 = 0;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == '0') {
count0++;
} else {
count1++;
}
}
std::cout << std::min(count0, count1) * 2;
return 0;
}
| [
"expression.operation.binary.add"
] | 917,630 | 917,631 | u261279477 | cpp |
p03107 | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string l;
cin >> l;
int a = 0;
int b = 0;
for (int i = 0; i < l.size(); i++) {
if (l[i] == '0') {
a++;
} else {
b++;
}
}
cout << min(a, b) << endl;
return 0;
} | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string l;
cin >> l;
int a = 0;
int b = 0;
for (int i = 0; i < l.size(); i++) {
if (l[i] == '0') {
a++;
} else {
b++;
}
}
cout << 2 * min(a, b) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 917,637 | 917,638 | u023751250 | cpp |
p03107 | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string l;
cin >> l;
int a = 0;
int b = 0;
for (int i = 0; i < l.size(); i++) {
if (l[i] == '0') {
a++;
} else {
b++;
}
}
cout << max(a, b) << endl;
return 0;
} | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string l;
cin >> l;
int a = 0;
int b = 0;
for (int i = 0; i < l.size(); i++) {
if (l[i] == '0') {
a++;
} else {
b++;
}
}
cout << 2 * min(a, b) << endl;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 917,639 | 917,638 | u023751250 | cpp |
p03107 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 917,648 | 917,649 | u957188497 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#define int long long
using namespace std;
signed main() {
string s;
cin >> s;
stack<char> st;
for (int i = 0; i < s.size(); i++) {
if (st.size() == 0 || st.top() != s[i])
st.push(s[i]);
else
st.pop();
}
cout << ... | #include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#define int long long
using namespace std;
signed main() {
string s;
cin >> s;
stack<char> st;
for (int i = 0; i < s.size(); i++) {
if (st.size() == 0 || st.top() == s[i])
st.push(s[i]);
else
st.pop();
}
cout << ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 917,652 | 917,653 | u141968173 | cpp |
p03107 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0, b = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
a++;
else
b++;
}
cout << min(a, b) << endl;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0, b = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '0')
a++;
else
b++;
}
cout << 2 * min(a, b) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 917,660 | 917,661 | u189870205 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n, i;
int x0 = 0; // number of 0
int x1 = 0; // number of 1
string str;
cin >> str;
m = str.size(); // m=str long
for (i = 0; i < m; i++) {
n = str[i]; // n is ascii
// cout << n << " ";
if (n == 48) {
x0 = x0 + 1;
} ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n, i;
int x0 = 0; // number of 0
int x1 = 0; // number of 1
string str;
cin >> str;
m = str.size(); // m=str long
for (i = 0; i < m; i++) {
n = str[i]; // n is ascii
// cout << n << " ";
if (n == 48) {
x0 = x0 + 1;
} ... | [
"expression.operation.binary.add"
] | 917,662 | 917,663 | u312470849 | cpp |
p03107 | #include <iostream>
#include <stack>
using namespace std;
string s;
int sum = 0;
stack<int> sta;
int main() {
cin >> s;
sta.push(s[0]);
for (int i = 1; i < s.length(); i++) {
if (sta.empty() && sta.top() != s[i]) {
sta.pop();
sum += 2;
} else
sta.push(s[i]);
}
cout << sum;
return 0... | #include <iostream>
#include <stack>
using namespace std;
string s;
int sum = 0;
stack<int> sta;
int main() {
cin >> s;
sta.push(s[0]);
for (int i = 1; i < s.length(); i++) {
if (!sta.empty() && sta.top() != s[i]) {
sta.pop();
sum += 2;
} else
sta.push(s[i]);
}
cout << sum;
return ... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 917,664 | 917,665 | u808738521 | cpp |
p03107 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <set>
#include <stdbool.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
string str;
cin >> str;
int c0 = count(str.cbegin(), str.cend(), '0');
int c1 = c... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <set>
#include <stdbool.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
string str;
cin >> str;
int c0 = count(str.cbegin(), str.cend(), '0');
int c1 = c... | [] | 917,666 | 917,667 | u583248280 | cpp |
p03107 | #include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
int main() {
std::stack<char> st;
std::string s;
std::cin >> s;
int cnt = 0;
for (auto &it : s) {
if (st.size() && st.top() == it) {
st.pop();
cnt++;
} else {
st.push(it);... |
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
int main() {
std::stack<char> st;
std::string s;
std::cin >> s;
int cnt = 0;
for (auto &it : s) {
if (st.size() && st.top() != it) {
st.pop();
cnt++;
} else {
st.push(it)... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 917,668 | 917,669 | u228807040 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
int main() {
string S;
cin >> S;
int r = 0, b = 0;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == '0') {
r++;
} else {
b++;
}
}
cout << min(r, b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
int main() {
string S;
cin >> S;
int r = 0, b = 0;
for (int i = 0; i < S.size(); ++i) {
if (S[i] == '0') {
r++;
} else {
b++;
}
}
cout << min(r, b) * 2;
return 0;
} | [
"expression.operation.binary.add"
] | 917,688 | 917,689 | u590088474 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N, count, nocount;
N = S.size();
count = 0, nocount = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '0') {
count++;
} else {
nocount++;
}
}
cout << max(count, nocount) - min(count, nocount) << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N, count, nocount;
N = S.size();
count = 0, nocount = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '0') {
count++;
} else {
nocount++;
}
}
cout << N - (max(count, nocount) - min(count, nocount)) ... | [
"expression.operation.binary.add"
] | 917,693 | 917,694 | u902787159 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i1 = 0, i2 = 0;
for (int i = 0; i < s.length(); i++)
if (s[i] == '1')
i1++;
else
i2++;
cout << 2 * (max(i1, i2));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i1 = 0, i2 = 0;
for (int i = 0; i < s.length(); i++)
if (s[i] == '1')
i1++;
else
i2++;
cout << 2 * (min(i1, i2));
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 917,695 | 917,696 | u803994812 | cpp |
p03107 | #include "bits/stdc++.h"
using namespace std;
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
#define OUT(P) cout << (P) << endl
#define OUT2(P1, P2) cout << (P1) << " " << (P2) << endl
#define PRINT_ARRAY(P) \
for (int i = 0; i < P.size(); i++) ... | #include "bits/stdc++.h"
using namespace std;
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
#define OUT(P) cout << (P) << endl
#define OUT2(P1, P2) cout << (P1) << " " << (P2) << endl
#define PRINT_ARRAY(P) \
for (int i = 0; i < P.size(); i++) ... | [] | 917,711 | 917,712 | u026686258 | cpp |
p03107 | #include <cmath>
#include <iostream>
using namespace std;
int a, b;
string s;
main() {
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
a++;
else
b++;
}
cout << abs(a - b) << endl;
} | #include <cmath>
#include <iostream>
using namespace std;
int a, b;
string s;
main() {
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
a++;
else
b++;
}
cout << s.size() - abs(a - b) << endl;
} | [
"expression.operation.binary.add"
] | 917,723 | 917,724 | u572456887 | cpp |
p03107 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();
int red = 0;
int blue = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 0) {
red++;
} else {
blue++;
}
}
int ans = min(red, blue) * 2;
cout << a... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();
int red = 0;
int blue = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '0') {
red++;
} else {
blue++;
}
}
int ans = min(red, blue) * 2;
cout << ... | [
"control_flow.branch.if.condition.change"
] | 917,730 | 917,731 | u828664775 | cpp |
p03107 | #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",
"control_flow.branch.if.condition.change"
] | 917,732 | 917,733 | u406158207 | cpp |
p03107 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a, n) vector<int>(a)((n))
#define Vec(a, n) vector<string>(a)((n))
#define twovec(a, n, m) vector<vector<int>> a(n, vector<int>(m, 0))
#define Twovec(a, n, m) v... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a, n) vector<int>(a)((n))
#define Vec(a, n) vector<string>(a)((n))
#define twovec(a, n, m) vector<vector<int>> a(n, vector<int>(m, 0))
#define Twovec(a, n, m) v... | [
"literal.number.change",
"variable_declaration.value.change"
] | 917,736 | 917,737 | u607741489 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vec... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vec... | [
"control_flow.branch.if.condition.change"
] | 917,738 | 917,739 | u196798307 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int R_count = 0;
int B_count = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
R_count++;
else
B_count++;
}
int ans = min(R_count, B_count);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int R_count = 0;
int B_count = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
R_count++;
else
B_count++;
}
int ans = min(R_count, B_count);
cout << ans * 2 << endl;
}
| [
"expression.operation.binary.add"
] | 917,740 | 917,741 | u314008046 | cpp |
p03107 | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
using ll = long long int;
... | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
using ll = long long int;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 917,750 | 917,751 | u131340563 | cpp |
p03107 | #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
using name... | #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
using name... | [
"variable_declaration.add"
] | 917,779 | 917,780 | u240031669 | cpp |
p03107 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 1000000007
int main() {
string s;
cin >> s;
int l = s.size();
int c0 = 0, c1 = 0;
for (int i = 0; i < l; i++) {
if (... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 1000000007
int main() {
string s;
cin >> s;
int l = s.size();
int c0 = 0, c1 = 0;
for (int i = 0; i < l; i++) {
if (... | [
"expression.operation.binary.add"
] | 917,784 | 917,785 | u170650966 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define lint long long
#define MAX 100'000
int main() {
string S;
cin >> S;
int one = 0;
int zero = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '1') {
one++;
... |
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define lint long long
#define MAX 100'000
int main() {
string S;
cin >> S;
int one = 0;
int zero = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '1') {
one++;... | [] | 917,786 | 917,787 | u426397594 | cpp |
p03107 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
vector<char> V;
for (int i = 0; i < S.size(); i++) {
V.push_back(S[i]);
}
int ans = 0;
for (int i = 0; i < V.size() - 1; i++) {
if (V[i] != V[i + 1]) {
V.erase(V.begin() + i, V.be... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
vector<char> V;
for (int i = 0; i < S.size(); i++) {
V.push_back(S[i]);
}
int ans = 0;
for (int i = 0; i + 1 < V.size(); i++) {
if (V[i] != V[i + 1]) {
V.erase(V.begin() + i, V.be... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change"
] | 917,797 | 917,798 | u293072892 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int c0 = 0;
int c1 = 1;
for (char c : s) {
if (c == '0')
c0++;
else
c1++;
}
cout << 2 * min(c0, c1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int c0 = 0;
int c1 = 0;
for (char c : s) {
if (c == '0')
c0++;
else
c1++;
}
cout << 2 * min(c0, c1) << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 917,799 | 917,800 | u506320030 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
string s;
cin >> s;
int ans = 0, c0 = 0, c1 = 1;
for (int i = 0; i < s.size... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
string s;
cin >> s;
int ans = 0, c0 = 0, c1 = 0;
for (int i = 0; i < s.size... | [
"literal.number.change",
"variable_declaration.value.change"
] | 917,803 | 917,804 | u480806810 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
string s;
cin >> s;
int ans = 0, c0 = 0, c1 = 1;
for (int i = 0; i < s.size... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
string s;
cin >> s;
int ans = 0, c0 = 0, c1 = 0;
for (int i = 0; i < s.size... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 917,805 | 917,804 | u480806810 | cpp |
p03107 | #include <bits/stdc++.h>
#define lson (o << 1)
#define rson (o << 1 | 1)
#define fi first
#define sc second
#define dbg(x) cout << #x << " = " << (x) << endl;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
using namespace std;
const double pi = acos(-1);
const double eps = 1e-6;
inline... | #include <bits/stdc++.h>
#define lson (o << 1)
#define rson (o << 1 | 1)
#define fi first
#define sc second
#define dbg(x) cout << #x << " = " << (x) << endl;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
using namespace std;
const double pi = acos(-1);
const double eps = 1e-6;
inline... | [] | 917,810 | 917,811 | u302794558 | cpp |
p03107 | #include <bits/stdc++.h>
//↓✟MLE魔、TLE魔✟
#define int long long
//↑✟MLE魔、TLE魔✟
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
signed main() {
string s;
int a, b;
cin >> s;
rep(i, s.size()) {
if (s[i]... | #include <bits/stdc++.h>
//↓✟MLE魔、TLE魔✟
#define int long long
//↑✟MLE魔、TLE魔✟
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
signed main() {
string s;
int a = 0, b = 0;
cin >> s;
rep(i, s.size()) {
... | [
"variable_declaration.value.change"
] | 917,814 | 917,815 | u073057072 | cpp |
p03107 | /*
URL https://
SCORE 0
AC false
WA false
TLE false
MLE false
TASK_TYPE
FAILURE_TYPE
NOTES
*/
#include <algorithm>
#include <cstdint>
#include <experimental/optional>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | /*
URL https://
SCORE 0
AC false
WA false
TLE false
MLE false
TASK_TYPE
FAILURE_TYPE
NOTES
*/
#include <algorithm>
#include <cstdint>
#include <experimental/optional>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.remove"
] | 917,818 | 917,819 | u071730284 | cpp |
p03107 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (long(i) = 0; (i) < (long)(n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, a, b) for (long ... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (long(i) = 0; (i) < (long)(n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, a, b) for (long ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 917,822 | 917,823 | u060896757 | cpp |
p03107 | #include <cmath>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
string S;
stack<int> st;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (st.empty()) {
st.push(S[i]);
continue;
} else if (st.top() != S[i] - '0') {
st.pop();
} else {
... | #include <cmath>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
string S;
stack<int> st;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (st.empty()) {
st.push(S[i] - '0');
continue;
} else if (st.top() != S[i] - '0') {
st.pop();
} el... | [
"expression.operation.binary.add"
] | 917,830 | 917,831 | u601256797 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 6;
typedef long long ll;
const int mod = 1e9 + 7;
char s[maxn];
int q[maxn];
int main() {
scanf("%s", s);
int l = strlen(s);
int cnt = 0;
int ans = 0;
for (int i = 0; i < l; i++) {
if (cnt == 0)
q[cnt++] = s[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 6;
typedef long long ll;
const int mod = 1e9 + 7;
char s[maxn];
int q[maxn];
int main() {
scanf("%s", s);
int l = strlen(s);
int cnt = 0;
int ans = 0;
for (int i = 0; i < l; i++) {
if (cnt == 0)
q[cnt++] = s[i... | [] | 917,832 | 917,833 | u940396739 | cpp |
p03107 | #include <algorithm>
#include <cstdlib> //絶対値利用のため
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
// const int INF = INT_MAX / 2;
int main() {
string S;
cin >> S;
i... | #include <algorithm>
#include <cstdlib> //絶対値利用のため
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
// const int INF = INT_MAX / 2;
int main() {
string S;
cin >> S;
i... | [
"call.arguments.add",
"call.arguments.change"
] | 917,838 | 917,839 | u534417782 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int num_0 = 0, num_1 = 0;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '1')
num_1++;
else
num_0++;
}
cout << min(num_0, num_1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int num_0 = 0, num_1 = 0;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '1')
num_1++;
else
num_0++;
}
cout << 2 * min(num_0, num_1) << endl;
} | [
"expression.operation.binary.add"
] | 917,845 | 917,846 | u738835924 | cpp |
p03107 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("mmx,avx,fma")
//#pragma GCC optimize ("unroll-loops")
using namespace __gnu_pbds;
using namespace std;
template <class T> istream &operator>>(istream &in, vector<T> &v) {
for (a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("mmx,avx,fma")
//#pragma GCC optimize ("unroll-loops")
using namespace __gnu_pbds;
using namespace std;
template <class T> istream &operator>>(istream &in, vector<T> &v) {
for (a... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 917,847 | 917,848 | u283958128 | cpp |
p03107 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("mmx,avx,fma")
//#pragma GCC optimize ("unroll-loops")
using namespace __gnu_pbds;
using namespace std;
template <class T> istream &operator>>(istream &in, vector<T> &v) {
for (a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("mmx,avx,fma")
//#pragma GCC optimize ("unroll-loops")
using namespace __gnu_pbds;
using namespace std;
template <class T> istream &operator>>(istream &in, vector<T> &v) {
for (a... | [
"control_flow.branch.if.condition.change"
] | 917,849 | 917,848 | u283958128 | cpp |
p03107 | #define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define ll long long
#define INF 1000000000000000000
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <sstream>
#include <string>
... | #define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define ll long long
#define INF 1000000000000000000
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <sstream>
#include <string>
... | [
"control_flow.branch.if.condition.change"
] | 917,858 | 917,859 | u489197691 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define vvvel vector<vvel>
int root1(vel &par, int ser, vel &path) {
if (par[ser] == -1) {
for (int i =... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define vvvel vector<vvel>
int root1(vel &par, int ser, vel &path) {
if (par[ser] == -1) {
for (int i =... | [
"literal.number.change",
"variable_declaration.value.change"
] | 917,869 | 917,870 | u021034020 | cpp |
p03107 | #include <iostream>
int main() {
std::string s;
std::cin >> s;
unsigned long count = 0;
for (char c : s) {
if (c == '1') {
count++;
}
}
int t = std::min(count, (s.length() - count));
t /= 2;
std::cout << t * 4 << std::endl;
}
| #include <iostream>
int main() {
std::string s;
std::cin >> s;
unsigned long count = 0;
for (char c : s) {
if (c == '1') {
count++;
}
}
int t = std::min(count, (s.length() - count));
std::cout << t * 2 << std::endl;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 917,875 | 917,876 | u718277423 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K, i;
cin >> A >> B >> K;
for (i = 1; K; ++i)
if ((A % i == 0) && (B % i == 0))
--K;
cout << i;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K, i;
cin >> A >> B >> K;
for (i = B; K; --i)
if ((A % i == 0) && (B % i == 0))
--K;
cout << ++i;
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 917,880 | 917,881 | u550314572 | cpp |
p03106 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >= (b); i--)
#... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >= (b); i--)
#... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 917,882 | 917,883 | u942774736 | cpp |
p03106 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fals... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fals... | [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change"
] | 917,913 | 917,914 | u141378465 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A;
cin >> B;
cin >> K;
int count = 0;
int i = 1;
for (int i = 100; i > 0; i--) {
if (A % i == 0 && B % i == 0)
count++;
}
if (count == K) {
cout << i << endl;
return 0;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A;
cin >> B;
cin >> K;
int count = 0;
int i = 1;
for (int i = 100; i > 0; i--) {
if (A % i == 0 && B % i == 0)
count++;
if (count == K) {
cout << i << endl;
break;
}
}
return 0;
} | [
"control_flow.return.remove",
"control_flow.break.add"
] | 917,915 | 917,916 | u761510695 | cpp |
p03106 | #include <iostream>
using namespace std;
void swap(int &a, int &b) {
int t = a;
a = b;
b = t;
}
int euc(int a, int b) {
if (b < a)
swap(a, b);
while (a) {
b = b % a;
swap(a, b);
}
return b;
}
int main() {
int A, B, K;
cin >> A >> B >> K;
int t = euc(A, B);
int j = t;
for (int i = 0; ... | #include <iostream>
using namespace std;
void swap(int &a, int &b) {
int t = a;
a = b;
b = t;
}
int euc(int a, int b) {
if (b < a)
swap(a, b);
while (a) {
b = b % a;
swap(a, b);
}
return b;
}
int main() {
int A, B, K;
cin >> A >> B >> K;
int t = euc(A, B);
int j = t;
for (int i = 0; ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 917,923 | 917,924 | u058186113 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k, s, l, n, m;
n = 0;
int p[70], q[70];
cin >> a >> b >> k;
if (b >= a) {
s = a;
l = b;
} else {
s = b;
l = a;
}
for (int i = 1; i <= s; i++) {
if ((s % i) == 0) {
p[n] = i;
n++;
}
}
m = 0;
for (in... | #include <iostream>
using namespace std;
int main() {
int a, b, k, s, l, n, m;
n = 0;
int p[100], q[100];
cin >> a >> b >> k;
if (b >= a) {
s = a;
l = b;
} else {
s = b;
l = a;
}
for (int i = 1; i <= s; i++) {
if ((s % i) == 0) {
p[n] = i;
n++;
}
}
m = 0;
for (... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 917,937 | 917,938 | u448058760 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k, s, l, n, m;
n = 0;
int p[100], q[100];
cin >> a >> b >> k;
if (b >= a) {
s = a;
l = b;
} else {
s = b;
l = a;
}
for (int i = 1; i <= s; i++) {
if ((s % i) == 0) {
p[n] = i;
n++;
}
}
m = 0;
for (... | #include <iostream>
using namespace std;
int main() {
int a, b, k, s, l, n, m;
n = 0;
int p[100], q[100];
cin >> a >> b >> k;
if (b >= a) {
s = a;
l = b;
} else {
s = b;
l = a;
}
for (int i = 1; i <= s; i++) {
if ((s % i) == 0) {
p[n] = i;
n++;
}
}
m = 0;
for (... | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 917,939 | 917,938 | u448058760 | cpp |
p03106 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 917,947 | 917,948 | u352642493 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int waru[100], kazu;
kazu = 0;
for (int i = min(a, b); i >= 0; i--) {
if (a % i == 0 && b % i == 0) {
kazu++;
waru[kazu] = i;
}
}
cout << waru[k] << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int waru[100], kazu;
kazu = 0;
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
kazu++;
waru[kazu] = i;
}
}
cout << waru[k] << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 917,953 | 917,954 | u356117208 | cpp |
p03106 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k, r;
cin >> a >> b >> k;
swap(a, b);
while ((r = a % b)) {
a = b;
b = r;
}
vector<int> ans;
for (int i = 1; i < b; i++) {
if (b % i == 0)
ans.push_back(i);
}
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k, r;
cin >> a >> b >> k;
swap(a, b);
while ((r = a % b)) {
a = b;
b = r;
}
vector<int> ans;
for (int i = 1; i <= b; i++) {
if (b % i == 0)
ans.push_back(i);
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 917,964 | 917,965 | u911027648 | cpp |
p03106 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k, r;
cin >> a >> b >> k;
swap(a, b);
while ((r = a % b)) {
a = b;
b = r;
}
vector<int> ans;
for (int i = 1; i < b; i++) {
if (b % i == 0)
ans.push_back(i);
}
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k, r;
cin >> a >> b >> k;
swap(a, b);
while ((r = a % b)) {
a = b;
b = r;
}
vector<int> ans;
for (int i = 1; i <= b; i++) {
if (b % i == 0)
ans.push_back(i);
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 917,966 | 917,965 | u911027648 | cpp |
p03106 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int m = min(A, B);
int c = 0;
for (int i = m; i > 1; --i) {
if (A % i == 0 && B % i == 0)
c++;
if (c == K) {
cout << i;
return 0;
}
}
}
| #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int m = min(A, B);
int c = 0;
for (int i = m; i >= 1; --i) {
if (A % i == 0 && B % i == 0)
c++;
if (c == K) {
cout << i;
return 0;
}
}
cout << 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 917,969 | 917,970 | u208073493 | cpp |
p03106 | // Codeforces: ganariya
// AtCoder: ganariya2525
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM... | // Codeforces: ganariya
// AtCoder: ganariya2525
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM... | [
"identifier.change",
"call.function.change"
] | 917,971 | 917,972 | u259053514 | cpp |
p03106 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#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--)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e+17;
cons... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#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--)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e+17;
cons... | [
"identifier.change",
"call.function.change",
"misc.opposites",
"call.arguments.change"
] | 917,977 | 917,978 | u119345557 | cpp |
p03106 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int a, b, k, sei[1000], num = 0;
cin >> a >> b >> k;
for (int l = 1; l <= min(a, b); l++) {
if (a >= l && b >= l && a % l == 0 && b % l == 0) {
sei[num] = l;
// printf("l=%d\nsei... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int a, b, k, sei[1000], num = 0;
cin >> a >> b >> k;
for (int l = 1; l <= min(a, b); l++) {
if (a >= l && b >= l && a % l == 0 && b % l == 0) {
sei[num] = l;
// printf("l=%d\nsei... | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 917,981 | 917,982 | u217596176 | cpp |
p03106 | #include <iostream>
using namespace std;
int main(void) {
int A, B, K;
cin >> A >> B >> K;
int i = max(A, B);
while (K > 0) {
i--;
if (A % i == 0 && B % i == 0)
K--;
}
cout << i << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int A, B, K;
cin >> A >> B >> K;
int i = max(A, B) + 1;
while (K > 0) {
i--;
if (A % i == 0 && B % i == 0)
K--;
}
cout << i << endl;
return 0;
} | [
"assignment.change"
] | 917,985 | 917,986 | u330913290 | cpp |
p03106 | #include <stdio.h>
int main(void) {
int a, b, k, yaku[1000], su;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &k);
int i, co = 0;
for (i = 1; i <= 100; i++) {
if (a % i == 0) {
if (b % i == 0) {
yaku[co] = i;
co++;
}
}
}
su = yaku[k - 1];
printf("%d\n", su);
retu... | #include <stdio.h>
int main(void) {
int a, b, k, yaku[1000], su;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &k);
int i, co = 0;
for (i = 1; i <= 100; i++) {
if (a % i == 0) {
if (b % i == 0) {
yaku[co] = i;
co++;
}
}
}
su = yaku[co - k];
printf("%d\n", su);
ret... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 917,987 | 917,988 | u180133008 | cpp |
p03106 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typede... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typede... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 917,993 | 917,994 | u294531924 | cpp |
p03106 | #include <iostream>
using namespace std;
int a, b, c, sum = 0;
int main() {
scanf("%d %d %d", &a, &b, &c);
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0 && b % i == 0)
sum++;
if (sum == c)
printf("%d\n", i);
return 0;
}
} | #include <iostream>
using namespace std;
int a, b, c, sum = 0;
int main() {
scanf("%d %d %d", &a, &b, &c);
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0 && b % i == 0)
sum++;
if (sum == c) {
printf("%d\n", i);
return 0;
}
}
} | [] | 918,000 | 918,001 | u601344838 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 1;; i++) {
if (a % i == 0 && b % i == 0) {
k--;
if (k == 0) {
cout << i << endl;
break;
}
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = a;; i--) {
if (a % i == 0 && b % i == 0) {
k--;
if (k == 0) {
cout << i << endl;
break;
}
}
}
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 918,012 | 918,013 | u587665681 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A;
cin >> B;
cin >> K;
int ans[100];
int c = 0;
for (int i = 1; i < 100; i++) {
if (A % i == 0 & B % i == 0) {
ans[c] = i;
c++;
}
}
cout << ans[c - (K - 1)];
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A;
cin >> B;
cin >> K;
int ans[1000];
int c = 0;
for (int i = 1; i < 1000; i++) {
if (A % i == 0 & B % i == 0) {
ans[c] = i;
c++;
}
}
cout << ans[c - (K)];
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 918,032 | 918,031 | u184572586 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.