problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03106 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
int ans = 0;
for (int i = 1; i < 101; ++i) {
if (A % i == 0 && B % i == 0) {
--K;
if (K == 0) {
ans = i;
}
}
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
int ans = 0;
for (int i = 100; i > 0; --i) {
if (A % i == 0 && B % i == 0) {
--K;
if (K == 0) {
ans = i;
}
}
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 916,483 | 916,484 | u134576652 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
#define REP(n) for (LL i = 0; i < (n); i++)
#define COUT(val) cout << (val) << endl
#define CIN(val) cin >> (val)
#define SORT(vec) sort(vec.begin(), vec.end())
#define SORT_GRE(vec) sort(vec.begin(), vec.end(), greater<LL>())
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
ans.clear();
for (int i = 1; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0)
ans.push_back(i);
}
cout << ans[k - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
#define REP(n) for (LL i = 0; i < (n); i++)
#define COUT(val) cout << (val) << endl
#define CIN(val) cin >> (val)
#define SORT(vec) sort(vec.begin(), vec.end())
#define SORT_GRE(vec) sort(vec.begin(), vec.end(), greater<LL>())
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
ans.clear();
for (int i = 1; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0)
ans.push_back(i);
}
cout << ans[ans.size() - k] << endl;
return 0;
}
| [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 916,485 | 916,486 | u319491032 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); ++i)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); --i)
#define DEBUG(x) cout << #x << ": " << x << endl
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << " " << v[i]; \
cout << endl
#define ALL(a) (a).begin(), (a).end()
#define CHMIN(a, b) a = min((a), (b))
#define CHMAX(a, b) a = max((a), (b))
// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x) < EPS)
#define EQ(a, b) (abs(a - b) < EPS)
typedef complex<Real> P;
int main() {
int a, b, k;
cin >> a >> b >> k;
FOR(x, 1, a + 1) {
if (a % x == 0 && b % x == 0) {
k--;
if (k == 0) {
printf("%d\n", x);
return 0;
}
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); ++i)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); --i)
#define DEBUG(x) cout << #x << ": " << x << endl
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << " " << v[i]; \
cout << endl
#define ALL(a) (a).begin(), (a).end()
#define CHMIN(a, b) a = min((a), (b))
#define CHMAX(a, b) a = max((a), (b))
// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x) < EPS)
#define EQ(a, b) (abs(a - b) < EPS)
typedef complex<Real> P;
int main() {
int a, b, k;
cin >> a >> b >> k;
FORR(x, 1, a + 1) {
if (a % x == 0 && b % x == 0) {
k--;
// DEBUG(x);
if (k == 0) {
printf("%d\n", x);
return 0;
}
}
}
return 0;
}
| [
"identifier.change",
"call.function.change"
] | 916,489 | 916,490 | u462560753 | cpp |
p03106 | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
#define ll long long
#define MAX 100005
#define pb push_back
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const double PI = 3.141592653589793238463;
long long MOD = 1000000007;
vector<int> adj[100005];
int stringToInteger(string x) {
int gg = 0;
stringstream geek(x);
geek >> gg;
return gg;
}
ll powmod(ll a, ll b, ll m) {
ll ans = 1;
while (b > 0) {
if (b % 2) {
ans *= a;
ans %= m;
}
b /= 2;
a = a * a;
a = a % m;
}
return ans % m;
}
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll mulmod(ll a, ll b, ll m) {
ll ans = 0;
a %= m;
while (b > 0) {
if (b & 1)
ans = (ans + a) % m;
a = (a * 2) % m;
b /= 2;
}
return ans % m;
}
ll pow(ll a, ll b, ll MOD) {
ll x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y);
if (x > MOD)
x %= MOD;
}
y = (y * y);
if (y > MOD)
y %= MOD;
b /= 2;
}
return x;
}
int main() {
int a, b, k;
cin >> a >> b >> k;
int p = __gcd(a, b);
vector<int> divisors;
for (int i = 1; i <= sqrt(p); i++) {
if (p % i == 0) {
divisors.pb(i);
if (i * i != p)
divisors.pb(p / i);
}
}
sort(divisors.begin(), divisors.end());
cout << divisors[k - 1] << "\n";
}
| #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
#define ll long long
#define MAX 100005
#define pb push_back
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const double PI = 3.141592653589793238463;
long long MOD = 1000000007;
vector<int> adj[100005];
int stringToInteger(string x) {
int gg = 0;
stringstream geek(x);
geek >> gg;
return gg;
}
ll powmod(ll a, ll b, ll m) {
ll ans = 1;
while (b > 0) {
if (b % 2) {
ans *= a;
ans %= m;
}
b /= 2;
a = a * a;
a = a % m;
}
return ans % m;
}
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll mulmod(ll a, ll b, ll m) {
ll ans = 0;
a %= m;
while (b > 0) {
if (b & 1)
ans = (ans + a) % m;
a = (a * 2) % m;
b /= 2;
}
return ans % m;
}
ll pow(ll a, ll b, ll MOD) {
ll x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y);
if (x > MOD)
x %= MOD;
}
y = (y * y);
if (y > MOD)
y %= MOD;
b /= 2;
}
return x;
}
int main() {
int a, b, k;
cin >> a >> b >> k;
int p = __gcd(a, b);
vector<int> divisors;
for (int i = 1; i <= sqrt(p); i++) {
if (p % i == 0) {
divisors.pb(i);
if (i * i != p)
divisors.pb(p / i);
}
}
sort(divisors.rbegin(), divisors.rend());
// int nn = divisors.size();
cout << divisors[k - 1] << "\n";
}
| [
"call.function.change",
"call.arguments.change"
] | 916,491 | 916,492 | u069935888 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define fore(i, a) for (auto &i : a)
typedef pair<int, int> P;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1 << 25;
const ll INFL = 1223372036854775807;
const ll mod = 1000000007;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int a, b, c;
cin >> a >> b >> c;
int n = gcd(a, b);
int i;
for (i = n; i >= 0; i--)
;
{
if (n % i == 0) {
c--;
if (c == 0) {
cout << i << endl;
return 0;
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define fore(i, a) for (auto &i : a)
typedef pair<int, int> P;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = 1 << 25;
const ll INFL = 1223372036854775807;
const ll mod = 1000000007;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int a, b, c;
cin >> a >> b >> c;
int n = gcd(a, b);
int i;
for (i = n; i >= 0; i--) {
if (n % i == 0) {
c--;
if (c == 0) {
cout << i << endl;
return 0;
}
}
}
return 0;
} | [] | 916,496 | 916,497 | u856232850 | cpp |
p03106 | #include <bits/stdc++.h>
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;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = a * b;; i--) {
if (a % i == 0 && b % i == 0) {
k--;
}
if (k == 0) {
cout << i << endl;
return 0;
}
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 916,504 | 916,505 | u283229916 | cpp |
p03106 | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = (ll)1e9 + 7;
int main() {
ll a, b, k;
cin >> a >> b >> k;
ll count = 0;
for (ll i = 100; i >= 2; i--) {
if (a % i == 0 && b % i == 0) {
count++;
if (count == k) {
cout << i;
break;
}
}
}
return 0;
}
| #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = (ll)1e9 + 7;
int main() {
ll a, b, k;
cin >> a >> b >> k;
ll count = 0;
for (ll i = 100; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
count++;
if (count == k) {
cout << i;
break;
}
}
}
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,510 | 916,511 | u525672296 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int a, b, c;
vector<int> s(10000);
cin >> a >> b >> c;
int n;
n = gcd(a, b);
int factor;
factor = 1;
int i = 0;
while (factor <= n) {
if (n % factor == 0) {
i = i + 1;
s[i] = factor;
}
factor = factor + 1;
}
cout << s[c];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int a, b, c;
vector<int> s(10000);
cin >> a >> b >> c;
int n;
n = gcd(a, b);
int factor;
factor = 1;
int i = 0;
while (factor <= n) {
if (n % factor == 0) {
i = i + 1;
s[i] = factor;
}
factor = factor + 1;
}
cout << s[i - c + 1];
return 0;
} | [
"expression.operation.binary.add"
] | 916,520 | 916,521 | u614970814 | cpp |
p03106 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
bool cmp(const int &a, const int &b) { return a > b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> vec;
for (int i = 2; i <= min(a, b); ++i)
if (a % i == 0 && b % i == 0)
vec.push_back(i);
sort(vec.begin(), vec.end(), cmp);
cout << vec[c - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
bool cmp(const int &a, const int &b) { return a > b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> vec;
for (int i = 1; i <= min(a, b); ++i)
if (a % i == 0 && b % i == 0)
vec.push_back(i);
sort(vec.begin(), vec.end(), cmp);
cout << vec[c - 1] << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 916,526 | 916,527 | u216160112 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[a] = {0};
int j = 0;
int x = 0;
int y = 0;
for (int i = 1; i < a; i++) {
x = a % i;
y = b % i;
if ((x == 0) && (y == 0)) {
ans[j] = i;
j += 1;
}
}
cout << ans[j - k] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[a + b] = {0};
int j = 0;
int x = 0;
int y = 0;
for (int i = 1; i <= a; i++) {
x = a % i;
y = b % i;
if ((x == 0) && (y == 0)) {
ans[j] = i;
j += 1;
}
}
cout << ans[j - k] << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,535 | 916,536 | u481856377 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[] = {0};
int j = 0;
int x = 0;
int y = 0;
for (int i = 1; i < a; i++) {
x = a % i;
y = b % i;
if ((x == 0) && (y == 0)) {
ans[j] = i;
j += 1;
}
}
cout << ans[j - k] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[a + b] = {0};
int j = 0;
int x = 0;
int y = 0;
for (int i = 1; i <= a; i++) {
x = a % i;
y = b % i;
if ((x == 0) && (y == 0)) {
ans[j] = i;
j += 1;
}
}
cout << ans[j - k] << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,537 | 916,536 | u481856377 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[256] = {0};
int j = 0;
int x = 0;
int y = 0;
for (int i = 1; i < a; i++) {
x = a % i;
y = b % i;
if ((x == 0) && (y == 0)) {
ans[j] = i;
j += 1;
}
}
cout << ans[j - k] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int ans[a + b] = {0};
int j = 0;
int x = 0;
int y = 0;
for (int i = 1; i <= a; i++) {
x = a % i;
y = b % i;
if ((x == 0) && (y == 0)) {
ans[j] = i;
j += 1;
}
}
cout << ans[j - k] << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,538 | 916,536 | u481856377 | cpp |
p03106 | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) for (int i = (a); i > (b); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR_EQ(i, 0, n)
#define rep_re(i, n) FOR_RE(i, n, 0)
#define DEBUG_VARIABLE(variable) cout << #variable << ":" << variable << endl
#define WHITE 1 //（未訪問）
#define GRAY \
2 //（訪問）未だに訪問していない頂点への辺を持っている。スタックに退避。
#define BLACK 3 //（訪問完了）未訪問への頂点への辺を持たない
#define N 100
#define INFTY (1 << 21) // 10^21
#define INF (1 << 9)
int M[N][N]; //隣接行列
int color[N];
// 1個上から時計周り
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//上右下左
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1, 0, 1, 0};
static const int NIL = -1;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> Vector;
typedef vector<Vector> DVector;
int n;
void printArray(int *array, int);
void printVector(Vector &v);
void printDimention(DVector &dv);
// nCr方式で組み合わせの数を求める
int combination(int, int);
// nPrで階乗を求める
int factorial(int, int);
//桁数を返す
int find_digits(int);
// 各桁の和を計算する関数
int findSumOfDigits(int);
//次数を得る
int degree(int);
//四捨五入
int shishagonyu(double);
//切り上げ
int roundUp(double);
//切り捨て
int roundDown(double);
//四捨五入
int roundOff(double);
//最大公約数(Greatest Common Divisor)
int gcd(int, int);
//最小公倍数(Least Common Multiple)
int lcm(int, int);
//素因数分解
void prime_factorization(int);
//エラトステネスの篩
int Eratosthenes(int);
//偶奇判定。奇数ならtrue。
bool odd_even(int);
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
Vector a_div;
Vector b_div;
FOR_EQ(i, 1, a) {
if (a % i == 0) {
a_div.push_back(i);
}
}
FOR_EQ(i, 1, b) {
if (b % i == 0) {
b_div.push_back(i);
}
}
// printVector(a_div);
// printVector(b_div);
Vector common;
int j = 0;
rep(i, a_div.size()) {
while (1) {
if (a_div[i] < b_div[j])
break;
if (a_div[i] == b_div[j]) {
common.push_back(a_div[i]);
break;
}
j++;
if (j >= b_div.size())
break;
}
}
// printVector(common);
cout << common[k - 1] << endl;
}
//配列の表示
void printArray(int array[], int n) {
rep(i, n) {
if (i)
cout << " ";
cout << array[i];
}
cout << endl;
}
// Vectorの表示
void printVector(Vector &v) {
rep(i, (int)v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
//二次元配列の表示
void printDimention(DVector &dv) {
rep(i, (int)dv.size()) {
rep(j, (int)dv[i].size()) {
if (j)
cout << " ";
cout << dv[i][j];
}
cout << endl;
}
}
// numの中に何個2がかかってるか
int factor2(int num) {
int cnt = 0;
while (num % 2 == 0) {
num /= 2;
cnt++;
}
return cnt;
}
// nCr方式で組み合わせの数を求める
int combination(int n, int r) {
int up = 1, down = 1;
rep(i, n) up *= (i + 1);
rep(i, n - r) down *= (i + 1);
rep(i, r) down *= (i + 1);
return up / down;
}
// nPr方式で階乗を求める
int factorial(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
} else {
int res = 1;
while (r) {
r--;
res *= n;
n--;
}
return res;
}
}
//桁数を返す
int find_digits(int n) {
int digit = 0;
while (n) {
n /= 10;
digit++;
}
return digit;
}
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
//次数を得る
int degree(int n) {
int count = 0;
while (1) {
if (count <= 0)
break;
count /= 2;
count++;
}
return count;
}
//四捨五入
int shishagonyu(double x) { return (int)(x < 0.0 ? x - 0.5 : x + 0.5); }
//切り上げ
int roundUp(double n) {
if (n >= 0) {
return (int)n + 1;
} else {
return (int)n - 1;
}
}
//切り捨て
int roundDown(double n) { return (int)n; }
//四捨五入
int roundOff(double n) {
double decimal = 0;
decimal = n - (int)n;
if (decimal >= 0.5 || decimal <= -0.5) {
return roundUp(n);
} else {
return roundDown(n);
}
}
//最大公約数(Greatest Common Divisor)
int gcd(int m, int n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
//ユークリッドの互除法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
//最小公倍数(Least Common Multiple)
int lcm(int m, int n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
// lcm = m * n / gcd(m, n)
return ((m / gcd(m, n)) * n);
}
//素因数分解
void prime_factorization(int n) {
int a = 2, res;
while (n >= a * a) {
if (n % a == 0) {
res = a;
// resをグローバルな配列に代入すれば記録できる。
n /= a;
} else {
a++;
}
}
//ラス1の素因数
res = n;
}
//エラトステネスの篩
int Eratosthenes(int n) {
bool prime[n];
// prime[0]が1、prime[n - 1]がn。
rep(i, n) prime[i] = true;
for (int i = 2; i < sqrt(n); i++) {
if (prime[i]) {
for (int j = 0; i * (j + 2) < n; j++) {
prime[i * (j + 2)] = false;
}
}
}
int cnt = 0;
for (int i = 2; i < n; i++) {
if (prime[i]) {
cnt++;
}
}
return cnt;
}
//偶奇判定。奇数ならtrue。
bool odd_even(int num) {
bool judge;
if (num % 2) {
judge = true;
} else {
judge = false;
}
return judge;
} | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) for (int i = (a); i > (b); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR_EQ(i, 0, n)
#define rep_re(i, n) FOR_RE(i, n, 0)
#define DEBUG_VARIABLE(variable) cout << #variable << ":" << variable << endl
#define WHITE 1 //（未訪問）
#define GRAY \
2 //（訪問）未だに訪問していない頂点への辺を持っている。スタックに退避。
#define BLACK 3 //（訪問完了）未訪問への頂点への辺を持たない
#define N 100
#define INFTY (1 << 21) // 10^21
#define INF (1 << 9)
int M[N][N]; //隣接行列
int color[N];
// 1個上から時計周り
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//上右下左
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1, 0, 1, 0};
static const int NIL = -1;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> Vector;
typedef vector<Vector> DVector;
int n;
void printArray(int *array, int);
void printVector(Vector &v);
void printDimention(DVector &dv);
// nCr方式で組み合わせの数を求める
int combination(int, int);
// nPrで階乗を求める
int factorial(int, int);
//桁数を返す
int find_digits(int);
// 各桁の和を計算する関数
int findSumOfDigits(int);
//次数を得る
int degree(int);
//四捨五入
int shishagonyu(double);
//切り上げ
int roundUp(double);
//切り捨て
int roundDown(double);
//四捨五入
int roundOff(double);
//最大公約数(Greatest Common Divisor)
int gcd(int, int);
//最小公倍数(Least Common Multiple)
int lcm(int, int);
//素因数分解
void prime_factorization(int);
//エラトステネスの篩
int Eratosthenes(int);
//偶奇判定。奇数ならtrue。
bool odd_even(int);
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
Vector a_div;
Vector b_div;
FOR_EQ(i, 1, a) {
if (a % i == 0) {
a_div.push_back(i);
}
}
FOR_EQ(i, 1, b) {
if (b % i == 0) {
b_div.push_back(i);
}
}
// printVector(a_div);
// printVector(b_div);
Vector common;
int j = 0;
rep(i, a_div.size()) {
while (1) {
if (a_div[i] < b_div[j])
break;
if (a_div[i] == b_div[j]) {
common.push_back(a_div[i]);
break;
}
j++;
if (j >= b_div.size())
break;
}
}
// printVector(common);
cout << common[common.size() - k] << endl;
}
//配列の表示
void printArray(int array[], int n) {
rep(i, n) {
if (i)
cout << " ";
cout << array[i];
}
cout << endl;
}
// Vectorの表示
void printVector(Vector &v) {
rep(i, (int)v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
//二次元配列の表示
void printDimention(DVector &dv) {
rep(i, (int)dv.size()) {
rep(j, (int)dv[i].size()) {
if (j)
cout << " ";
cout << dv[i][j];
}
cout << endl;
}
}
// numの中に何個2がかかってるか
int factor2(int num) {
int cnt = 0;
while (num % 2 == 0) {
num /= 2;
cnt++;
}
return cnt;
}
// nCr方式で組み合わせの数を求める
int combination(int n, int r) {
int up = 1, down = 1;
rep(i, n) up *= (i + 1);
rep(i, n - r) down *= (i + 1);
rep(i, r) down *= (i + 1);
return up / down;
}
// nPr方式で階乗を求める
int factorial(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
} else {
int res = 1;
while (r) {
r--;
res *= n;
n--;
}
return res;
}
}
//桁数を返す
int find_digits(int n) {
int digit = 0;
while (n) {
n /= 10;
digit++;
}
return digit;
}
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
//次数を得る
int degree(int n) {
int count = 0;
while (1) {
if (count <= 0)
break;
count /= 2;
count++;
}
return count;
}
//四捨五入
int shishagonyu(double x) { return (int)(x < 0.0 ? x - 0.5 : x + 0.5); }
//切り上げ
int roundUp(double n) {
if (n >= 0) {
return (int)n + 1;
} else {
return (int)n - 1;
}
}
//切り捨て
int roundDown(double n) { return (int)n; }
//四捨五入
int roundOff(double n) {
double decimal = 0;
decimal = n - (int)n;
if (decimal >= 0.5 || decimal <= -0.5) {
return roundUp(n);
} else {
return roundDown(n);
}
}
//最大公約数(Greatest Common Divisor)
int gcd(int m, int n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
//ユークリッドの互除法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
//最小公倍数(Least Common Multiple)
int lcm(int m, int n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
// lcm = m * n / gcd(m, n)
return ((m / gcd(m, n)) * n);
}
//素因数分解
void prime_factorization(int n) {
int a = 2, res;
while (n >= a * a) {
if (n % a == 0) {
res = a;
// resをグローバルな配列に代入すれば記録できる。
n /= a;
} else {
a++;
}
}
//ラス1の素因数
res = n;
}
//エラトステネスの篩
int Eratosthenes(int n) {
bool prime[n];
// prime[0]が1、prime[n - 1]がn。
rep(i, n) prime[i] = true;
for (int i = 2; i < sqrt(n); i++) {
if (prime[i]) {
for (int j = 0; i * (j + 2) < n; j++) {
prime[i * (j + 2)] = false;
}
}
}
int cnt = 0;
for (int i = 2; i < n; i++) {
if (prime[i]) {
cnt++;
}
}
return cnt;
}
//偶奇判定。奇数ならtrue。
bool odd_even(int num) {
bool judge;
if (num % 2) {
judge = true;
} else {
judge = false;
}
return judge;
} | [
"variable_access.subscript.index.change",
"io.output.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove"
] | 916,541 | 916,542 | u669551866 | cpp |
p03106 | #include <iostream>
using namespace std;
int stack[1000], top = -1;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < 1000; i++)
stack[i] = 0;
int min = (a < b) ? a : b;
for (int i = 1; i <= min; i++)
if (a % i == 0 and b % i == 0)
stack[++top] = i;
cout << stack[k - 1];
return 0;
} | #include <iostream>
using namespace std;
int stack[1000], top = -1;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < 1000; i++)
stack[i] = 0;
int min = (a < b) ? a : b;
for (int i = 1; i <= min; i++)
if (a % i == 0 and b % i == 0)
stack[++top] = i;
cout << stack[top - k + 1];
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 916,543 | 916,544 | u624867468 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int count = 0;
int kouyaku = 1;
for (int i = 0; i < 100; ++i) {
if (A % kouyaku == 0 && B % kouyaku == 0)
++count;
if (count == K)
break;
++kouyaku;
}
cout << kouyaku << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int count = 0;
int kouyaku = 100;
for (int i = 0; i < 100; ++i) {
if (A % kouyaku == 0 && B % kouyaku == 0)
++count;
if (count == K)
break;
--kouyaku;
}
cout << kouyaku << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 916,566 | 916,567 | u684556267 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> d;
d.push_back(0);
int denominator = 2;
do {
if (A % denominator == 0 && B % denominator == 0) {
d.insert(d.begin(), denominator);
}
denominator++;
} while (denominator <= A && denominator <= B);
cout << d[K - 1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> d;
d.push_back(0);
int denominator = 1;
do {
if (A % denominator == 0 && B % denominator == 0) {
d.insert(d.begin(), denominator);
}
denominator++;
} while (denominator <= A && denominator <= B);
cout << d[K - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 916,601 | 916,602 | u689011083 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int A, B, K;
cin >> A >> B >> K;
int cnt = 0;
for (int i = 1; i < 101; ++i) {
// cout << A % i << B % i << endl;
if ((A % i == 0) && (B % i == 0)) {
// cout << i << endl;
cnt++;
}
if (cnt == K) {
cout << i << endl;
return 0;
}
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int A, B, K;
cin >> A >> B >> K;
int cnt = 0;
for (int i = 100; i > 0; --i) {
// cout << A % i << B % i << endl;
if ((A % i == 0) && (B % i == 0)) {
// cout << i << endl;
cnt++;
}
if (cnt == K) {
cout << i << endl;
return 0;
}
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 916,608 | 916,609 | u642210599 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
vector<int> s;
cin >> A >> B >> K;
for (int i = 1; i < A; i++) {
if (A % i == 0 and B % i == 0) {
s.push_back(i);
}
}
reverse(s.begin(), s.end());
cout << s[K - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
vector<int> s;
cin >> A >> B >> K;
for (int i = 1; i <= A; i++) {
if (A % i == 0 && B % i == 0) {
s.push_back(i);
}
}
reverse(s.begin(), s.end());
cout << s[K - 1] << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 916,631 | 916,632 | u731175398 | cpp |
p03106 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int a, b, k;
cin >> a >> b >> k;
int x = 1;
int i = 1;
while (x < k) {
i++;
if (a % i == 0 && b % i == 0) {
x++;
}
}
cout << i << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int a, b, k;
cin >> a >> b >> k;
int x = 0;
int i = 101;
while (x < k) {
i--;
if (a % i == 0 && b % i == 0) {
x++;
}
}
cout << i << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 916,638 | 916,639 | u385617244 | cpp |
p03106 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define EACH(begin, end) for (auto itr = (begin); itr != (end); itr++)
/* function */
#define IN(x) cin >> x
#define DEBUG(x) cerr << (x) << " "
#define PRINT(x) cout << (x) << endl
#define BR cout << endl
/* const */
const int INF = 1001001001; // 10^9
const ll LINF = 1001001001001001001; // 10^18
const int MOD = 1e9 + 7;
ll N = 0;
ll ret = 0;
ll A, B, K;
void input() {
IN(A);
IN(B);
IN(K);
}
void solve() {
ll k = 0;
for (ll i = 100; i > 0; i--) {
ll test = i + 1;
if ((A % test == 0) && (B % test == 0)) {
k++;
}
if (k == K) {
ret = test;
break;
}
}
}
int main(void) {
input();
solve();
PRINT(ret);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define EACH(begin, end) for (auto itr = (begin); itr != (end); itr++)
/* function */
#define IN(x) cin >> x
#define DEBUG(x) cerr << (x) << " "
#define PRINT(x) cout << (x) << endl
#define BR cout << endl
/* const */
const int INF = 1001001001; // 10^9
const ll LINF = 1001001001001001001; // 10^18
const int MOD = 1e9 + 7;
ll N = 0;
ll ret = 0;
ll A, B, K;
void input() {
IN(A);
IN(B);
IN(K);
}
void solve() {
ll k = 0;
for (ll i = 100; i > 0; i--) {
ll test = i;
if ((A % test == 0) && (B % test == 0)) {
k++;
}
if (k == K) {
ret = test;
break;
}
}
}
int main(void) {
input();
solve();
PRINT(ret);
}
| [
"expression.operation.binary.remove"
] | 916,646 | 916,647 | u790171360 | cpp |
p03106 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a, b, k;
vector<int> gcd;
int main() {
cin >> a >> b >> k;
for (int i = 1; i < max(a, b); i++) {
if (a % i == 0 && b % i == 0)
gcd.push_back(i);
}
sort(gcd.begin(), gcd.end(), greater<int>());
cout << gcd[k - 1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a, b, k;
vector<int> gcd;
int main() {
cin >> a >> b >> k;
for (int i = 1; i <= max(a, b); i++) {
if (a % i == 0 && b % i == 0)
gcd.push_back(i);
}
sort(gcd.begin(), gcd.end(), greater<int>());
cout << gcd[k - 1] << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,656 | 916,657 | u340049257 | cpp |
p03106 | #include <algorithm>
#include <cstdio>
int main(int argc, char const *argv[]) {
int a = 0, b = 0, k = 0, koubai[100], t = 0, n = 0;
scanf("%d %d %d", &a, &b, &k);
if (a < b) {
n = a;
} else
n = b;
for (int i = 2; i <= n; i++) {
if (a % i == 0 && b % i == 0) {
koubai[t] = i;
t++;
}
}
printf("%d\n", koubai[t - k]);
return 0;
}
| #include <algorithm>
#include <cstdio>
int main(int argc, char const *argv[]) {
int a = 0, b = 0, k = 0, koubai[100], t = 0, n = 0;
scanf("%d %d %d", &a, &b, &k);
if (a < b) {
n = a;
} else
n = b;
for (int i = 1; i <= n; i++) {
if (a % i == 0 && b % i == 0) {
koubai[t] = i;
t++;
}
}
printf("%d\n", koubai[t - k]);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 916,660 | 916,661 | u117345342 | cpp |
p03106 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
typedef long long ll;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define fill(x, y) memset(x, y, sizeof(x))
#define debug1(i) cout << i << '\n'
#define debug2(i, j) cout << i << j << '\n'
#define MAX 1 << 20
using namespace std;
long long N, M, L, r, s;
long long p[MAX], q[MAX];
double d, e, f, g, h;
vector<long long> vec1, vec2;
int main() {
cin >> N >> M >> L;
for (int i = 1; i <= 100; i++) {
if (N % i == 0 && M % i == 0) {
vec1.push_back(i);
}
}
sort(all(vec1));
cout << vec1[L - 1];
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
typedef long long ll;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).rbegin(), (x).rend()
#define fill(x, y) memset(x, y, sizeof(x))
#define debug1(i) cout << i << '\n'
#define debug2(i, j) cout << i << j << '\n'
#define MAX 1 << 20
using namespace std;
long long N, M, L, r, s;
long long p[MAX], q[MAX];
double d, e, f, g, h;
vector<long long> vec1, vec2;
int main() {
cin >> N >> M >> L;
for (int i = 1; i <= 100; i++) {
if (N % i == 0 && M % i == 0) {
vec1.push_back(i);
}
}
sort(all(vec1));
cout << vec1[L - 1];
} | [
"preprocessor.define.value.change"
] | 916,665 | 916,666 | u950603962 | cpp |
p03106 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int d;
if (A > B) {
d = A;
} else {
d = B;
}
int count = 0;
while (count < K) {
if (A % d == 0 && B % d == 0) {
count++;
}
d--;
}
cout << d;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int d;
if (A > B) {
d = A;
} else {
d = B;
}
int count = 0;
while (count < K) {
if (A % d == 0 && B % d == 0) {
count++;
}
d--;
}
cout << (d + 1);
return 0;
} | [] | 916,669 | 916,670 | u100547715 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
int cnt = 0;
cin >> S;
rep(i, S.size() - 1) if (S[i] == '0') cnt++;
cout << min(cnt, int(S.size() - cnt)) * 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
int cnt = 0;
cin >> S;
rep(i, S.size()) if (S[i] == '0') cnt++;
cout << min(cnt, int(S.size() - cnt)) * 2 << endl;
} | [
"expression.operation.binary.remove"
] | 916,673 | 916,674 | u749022615 | cpp |
p03107 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long count = 0;
for (long i = 1; i < S.size(); i++) {
if (S[i] == '0') {
count++;
}
}
long a = S.size() - count;
cout << min(a, count) * 2 << endl;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long count = 0;
for (long i = 0; i < S.size(); i++) {
if (S[i] == '0') {
count++;
}
}
long a = S.size() - count;
cout << min(a, count) * 2 << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 916,677 | 916,678 | u526365587 | cpp |
p03107 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef pair<ll, ll> pairs;
vector<pairs> p;
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
bool pairCompareSecond(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.second < secondElof.second;
}
#define MAX_N 100100
#define MOD 1000000007
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N] = {0};
// 四方向への移動ベクトル
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll fib(ll a) {
if (fibl[a] != 0)
return fibl[a];
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
}
return fibl[a] = fib(a - 1) + fib(a - 2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i = 0; i <= n; ++i)
x[i] = true;
x[0] = x[1] = false;
for (int i = 2; i <= n; ++i) {
if (x[i]) {
p++;
for (int j = 2 * i; j <= n; j += i)
x[j] = false;
}
num[i] = p;
}
return p;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
void base_num(ll data, ll base) {
if (data == 0)
return;
ll next = abs(data) % abs(base);
if (data < 0)
next = (abs(base) - next) % abs(base);
base_num((data - next) / base, base);
cout << next;
}
int main() {
string s;
ll a = 0, b = 0;
cin >> s;
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] - '0') {
a++;
} else {
b++;
}
}
cout << min(a, b) * 2 << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef pair<ll, ll> pairs;
vector<pairs> p;
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
bool pairCompareSecond(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.second < secondElof.second;
}
#define MAX_N 100100
#define MOD 1000000007
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N] = {0};
// 四方向への移動ベクトル
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll fib(ll a) {
if (fibl[a] != 0)
return fibl[a];
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
}
return fibl[a] = fib(a - 1) + fib(a - 2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i = 0; i <= n; ++i)
x[i] = true;
x[0] = x[1] = false;
for (int i = 2; i <= n; ++i) {
if (x[i]) {
p++;
for (int j = 2 * i; j <= n; j += i)
x[j] = false;
}
num[i] = p;
}
return p;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
void base_num(ll data, ll base) {
if (data == 0)
return;
ll next = abs(data) % abs(base);
if (data < 0)
next = (abs(base) - next) % abs(base);
base_num((data - next) / base, base);
cout << next;
}
int main() {
string s;
ll a = 0, b = 0;
cin >> s;
for (ll i = 0; i < s.size(); i++) {
if (s[i] - '0' == 1) {
a++;
} else {
b++;
}
}
cout << min(a, b) * 2 << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 916,681 | 916,682 | u273928723 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int red = 0;
int blue = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 0)
red++;
else
blue++;
}
cout << min(red, blue) * 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int red = 0;
int blue = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
red++;
else
blue++;
}
cout << min(red, blue) * 2 << endl;
} | [
"control_flow.branch.if.condition.change"
] | 916,686 | 916,687 | u297195722 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int count0 = 0;
int count1 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
count0++;
else
count1++;
}
cout << min(count0, count1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int count0 = 0;
int count1 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
count0++;
else
count1++;
}
cout << min(count0, count1) * 2 << endl;
} | [
"expression.operation.binary.add"
] | 916,690 | 916,691 | u955282280 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const ll INF = 1e18;
const int MOD = 1e9 + 7;
const double pi = acos(-1);
int main() {
string s;
cin >> s;
ll n = s.size();
vector<int> vec;
rep(i, n) vec.push_back(s[i] - '0');
ll now = 0;
ll have = n;
while (now <= have - 1 && 0 <= now) {
if (vec[now] != vec[now + 1]) {
vec.erase(vec.begin() + now);
vec.erase(vec.begin() + now);
have -= 2;
if (now != 0)
now--;
} else {
now++;
}
}
cout << n - have << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const ll INF = 1e18;
const int MOD = 1e9 + 7;
const double pi = acos(-1);
int main() {
string s;
cin >> s;
ll n = s.size();
vector<int> vec;
rep(i, n) vec.push_back(s[i] - '0');
ll now = 0;
ll have = n;
while (now <= have - 2 && 0 <= now) {
if (vec[now] != vec[now + 1]) {
vec.erase(vec.begin() + now);
vec.erase(vec.begin() + now);
have -= 2;
if (now != 0)
now--;
} else {
now++;
}
}
cout << n - have << endl;
}
| [
"literal.number.change",
"control_flow.loop.condition.change"
] | 916,692 | 916,693 | u371149954 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const ll INF = 1e18;
const int MOD = 1e9 + 7;
const double pi = acos(-1);
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> vec;
rep(i, n) vec.push_back(s[i] - '0');
int now = 0;
int have = n;
while (now <= have - 1 && 0 <= now) {
if (vec[now] != vec[now + 1]) {
vec.erase(vec.begin() + now);
vec.erase(vec.begin() + now);
have -= 2;
if (now != 0)
now--;
} else {
now++;
}
}
cout << n - have << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const ll INF = 1e18;
const int MOD = 1e9 + 7;
const double pi = acos(-1);
int main() {
string s;
cin >> s;
ll n = s.size();
vector<int> vec;
rep(i, n) vec.push_back(s[i] - '0');
ll now = 0;
ll have = n;
while (now <= have - 2 && 0 <= now) {
if (vec[now] != vec[now + 1]) {
vec.erase(vec.begin() + now);
vec.erase(vec.begin() + now);
have -= 2;
if (now != 0)
now--;
} else {
now++;
}
}
cout << n - have << endl;
}
| [
"variable_declaration.type.change",
"literal.number.change",
"control_flow.loop.condition.change"
] | 916,694 | 916,693 | u371149954 | cpp |
p03107 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) \
SORT(V); \
REV(V) //大きい方からソート
#define NPN(V) next_permutation(ALL(V)) //順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a, b, c) (a) < (b) && (b) < (c)
#define MIDe(a, b, c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define IN4(a, b, c, d) cin >> a >> b >> c >> d
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V)[i] << " "; } \
cout << endl;
#define FIX cout << fixed << setprecision(15)
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); }
string toStrUp(string str) {
char diff = 'A' - 'a';
REP(i, str.size()) str[i] += diff;
return str;
}
string gCh(string str, int key) { return str.substr(key, 1); }
signed main() {
RAPID;
// デフォルト変数定義
int n = 0, m = 0, a = 0, b = 0, c = 0, d = 0, x = 0, y = 0, z = 0;
string s = "", t = "";
//
// ここから
IN(s);
REP(i, n) {
if (s[i] == '0')
x++;
else
y++;
}
OUT(min(x, y) * 2);
} | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) \
SORT(V); \
REV(V) //大きい方からソート
#define NPN(V) next_permutation(ALL(V)) //順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a, b, c) (a) < (b) && (b) < (c)
#define MIDe(a, b, c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define IN4(a, b, c, d) cin >> a >> b >> c >> d
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V)[i] << " "; } \
cout << endl;
#define FIX cout << fixed << setprecision(15)
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); }
string toStrUp(string str) {
char diff = 'A' - 'a';
REP(i, str.size()) str[i] += diff;
return str;
}
string gCh(string str, int key) { return str.substr(key, 1); }
signed main() {
RAPID;
// デフォルト変数定義
int n = 0, m = 0, a = 0, b = 0, c = 0, d = 0, x = 0, y = 0, z = 0;
string s = "", t = "";
//
// ここから
IN(s);
REP(i, s.size()) {
if (s[i] == '0')
x++;
else
y++;
}
OUT(min(x, y) * 2);
} | [
"call.add"
] | 916,698 | 916,699 | u154645927 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
typedef pair<int, int> P;
typedef vector<int> vi;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
ll lc = (a / g) * b;
return lc;
}
int main() {
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
int c0, c1;
rep(i, n) {
if (s[i] == '0')
c0++;
else
c1++;
}
cout << 2 * min(c0, c1) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
typedef pair<int, int> P;
typedef vector<int> vi;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
ll lc = (a / g) * b;
return lc;
}
int main() {
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
int c0 = 0, c1 = 0;
rep(i, n) {
if (s[i] == '0')
c0++;
else
c1++;
}
cout << 2 * min(c0, c1) << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 916,700 | 916,701 | u420130252 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n, t;
for (int i = 0; i < S.size(); ++i) {
if (S.at(i) == '1') {
n++;
} else {
t++;
}
}
cout << 2 * min(n, t) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n = 0, t = 0;
for (int i = 0; i < S.size(); ++i) {
if (S.at(i) == '1') {
n++;
} else {
t++;
}
}
cout << 2 * min(n, t) << endl;
} | [
"variable_declaration.value.change"
] | 916,702 | 916,703 | u629548179 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n, t;
for (int i = 0; i < S.size(); ++i) {
if (S.at(i) == '1') {
n++;
} else {
t++;
}
}
cout << 2 * (n, t) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n = 0, t = 0;
for (int i = 0; i < S.size(); ++i) {
if (S.at(i) == '1') {
n++;
} else {
t++;
}
}
cout << 2 * min(n, t) << endl;
} | [
"variable_declaration.value.change",
"call.add"
] | 916,704 | 916,703 | u629548179 | cpp |
p03107 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<int, int> Pi;
typedef queue<Pi> QPi;
typedef pair<ll, ll> Pll;
typedef queue<Pll> QPll;
typedef vector<vi> Graph;
const int mod = 1000000007;
// 小数点 << fixed << setprecision(0) <<
// sort降順 sort(ALL(),greater<int>());
// 円周率 M_PI
// 文字判定 isupper islower
// 順列 do {} while(next_permutation(ALL(X)));
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
struct edge {
int from; //出発点
int to; //到達点
int cost; //移動コスト
};
typedef struct edge se;
typedef vector<edge> ve;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
char s[100001];
cin >> s;
int n = strlen(s);
int r = 0, b = 0;
REP(i, n) {
if (s[i] == '0')
r++;
if (s[i] == '1')
b++;
}
int ans = 2 * max(r, b);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<int, int> Pi;
typedef queue<Pi> QPi;
typedef pair<ll, ll> Pll;
typedef queue<Pll> QPll;
typedef vector<vi> Graph;
const int mod = 1000000007;
// 小数点 << fixed << setprecision(0) <<
// sort降順 sort(ALL(),greater<int>());
// 円周率 M_PI
// 文字判定 isupper islower
// 順列 do {} while(next_permutation(ALL(X)));
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
struct edge {
int from; //出発点
int to; //到達点
int cost; //移動コスト
};
typedef struct edge se;
typedef vector<edge> ve;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
char s[100001];
cin >> s;
int n = strlen(s);
int r = 0, b = 0;
REP(i, n) {
if (s[i] == '0')
r++;
if (s[i] == '1')
b++;
}
int ans = 2 * min(r, b);
cout << ans << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 916,705 | 916,706 | u281876921 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
cout << abs(count(S.begin(), S.end(), '0') - count(S.begin(), S.end(), '1'))
<< "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
cout << min(count(S.begin(), S.end(), '0'), count(S.begin(), S.end(), '1')) *
2
<< "\n";
} | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 916,709 | 916,710 | u045289115 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt0 = 0, cnt1 = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0')
cnt0++;
else
cnt1++;
}
cout << min(cnt0, cnt1) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt0 = 0, cnt1 = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0')
cnt0++;
else
cnt1++;
}
cout << 2 * min(cnt0, cnt1) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 916,719 | 916,720 | u858670323 | cpp |
p03107 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
string s;
cin >> s;
int sn = s.size(), ze = 0, it = 0;
for (int i = 0; i < sn; i++) {
if (s[i] == '0') {
ze++;
} else {
it++;
}
}
cout << min(ze, it) << endl;
return 0;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
string s;
cin >> s;
int sn = s.size(), ze = 0, it = 0;
for (int i = 0; i < sn; i++) {
if (s[i] == '0') {
ze++;
} else {
it++;
}
}
cout << 2 * min(ze, it) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 916,723 | 916,724 | u261538386 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int counta = 0;
int countb = 0;
for (int i = 0; i < S.length(); i++) {
if (S.at(i) == '0') {
counta++;
} else
countb++;
}
cout << abs(counta - countb) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int counta = 0;
int countb = 0;
for (int i = 0; i < S.length(); i++) {
if (S.at(i) == '0') {
counta++;
} else
countb++;
}
cout << S.length() - abs(counta - countb) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 916,725 | 916,726 | u469315559 | cpp |
p03107 | #include <bits/stdc++.h>
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;
}
| #include <bits/stdc++.h>
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;
}
| [
"expression.operation.binary.add"
] | 916,727 | 916,728 | u340228918 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
int red = 0, blue = 0;
string c;
cin >> c;
for (int i = 0; i <= c.size(); i++) {
if (c[i] == '0')
red++;
else
blue++;
}
cout << 2 * min(red, blue) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int red = 0, blue = 0;
string c;
cin >> c;
for (int i = 0; i < c.size(); i++) {
if (c[i] == '0')
red++;
else
blue++;
}
// cout << red << blue << " ";
cout << 2 * min(red, blue) << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 916,729 | 916,730 | u271153916 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
///////////////////////////
int main() {
string s;
cin >> s;
cout << min(count(s.begin(), s.end(), '0'), count(s.begin(), s.end(), '1'))
<< endl;
}
///////////////////////////
| #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
///////////////////////////
int main() {
string s;
cin >> s;
cout << min(count(s.begin(), s.end(), '0'), count(s.begin(), s.end(), '1')) *
2
<< endl;
}
///////////////////////////
| [] | 916,731 | 916,732 | u264265458 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
string S;
cin >> S;
int zero = 0;
int one = 0;
REP(i, S.size()) { S[i] == '0' ? zero++ : one++; }
cout << min(zero, one) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
string S;
cin >> S;
int zero = 0;
int one = 0;
REP(i, S.size()) { S[i] == '0' ? zero++ : one++; }
cout << min(zero, one) * 2 << endl;
}
| [
"expression.operation.binary.add"
] | 916,733 | 916,734 | u342075214 | cpp |
p03107 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr ll LLINF{1001002003004005006}; // ll = 9*LLINF
constexpr int INTINF{1000000000}; // int = 2*INTINF
#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)
template <typename T> void maxs(T &x, T &&y) { x = std::max(x, y); }
template <typename T> void maxs(T &x, T &y) { x = std::max(x, y); }
template <typename T> void mins(T &x, T &&y) { x = std::min(x, y); }
template <typename T> void mins(T &x, T &y) { x = std::min(x, y); }
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::string S;
cin >> S;
int N = S.size();
vector<char> C(N, '.');
int C_index{};
rep(i, N) {
if (C_index != 0 && S[i] == C[C_index - 1]) {
--C_index; // delete
} else {
C[C_index] = S[i];
++C_index;
}
}
cout << N - C_index << '\n';
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr ll LLINF{1001002003004005006}; // ll = 9*LLINF
constexpr int INTINF{1000000000}; // int = 2*INTINF
#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)
template <typename T> void maxs(T &x, T &&y) { x = std::max(x, y); }
template <typename T> void maxs(T &x, T &y) { x = std::max(x, y); }
template <typename T> void mins(T &x, T &&y) { x = std::min(x, y); }
template <typename T> void mins(T &x, T &y) { x = std::min(x, y); }
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::string S;
cin >> S;
int N = S.size();
vector<char> C(N, '.');
int C_index{};
rep(i, N) {
if (C_index != 0 && S[i] != C[C_index - 1]) {
--C_index; // delete
} else {
C[C_index] = S[i];
++C_index;
}
}
cout << N - C_index << '\n';
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 916,735 | 916,736 | u196786099 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main() {
vector<char> v;
string S;
cin >> S;
int N = S.size();
rep(i, N) { v.push_back(S[i]); }
int removed = 0;
int idx = 0;
int vsize = v.size();
while (idx < vsize) {
// cout << idx << ", " << v.size() << endl;
if (v[idx] != v[idx + 1]) {
v.erase(v.begin() + idx);
v.erase(v.begin() + idx);
idx = 0; //最初からチェックし直し
removed += 2;
} else
idx++;
vsize = v.size();
}
cout << removed << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
Main();
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main() {
vector<char> v;
string S;
cin >> S;
int N = S.size();
rep(i, N) { v.push_back(S[i]); }
int removed = 0;
int idx = 0;
int vsize = v.size();
while (idx < vsize - 1) {
// cout << idx << ", " << v.size() << endl;
if (v[idx] != v[idx + 1]) {
v.erase(v.begin() + idx);
v.erase(v.begin() + idx);
idx = 0; //最初からチェックし直し
removed += 2;
} else
idx++;
vsize = v.size();
}
cout << removed << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
Main();
return 0;
} | [
"control_flow.loop.condition.change"
] | 916,737 | 916,738 | u900523387 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); \
cout << fixed; \
cout << setprecision(12);
#define randomINT \
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout << "\n"
#define DISP(as) \
for (auto it : as) \
cout << it << " "; \
newl;
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x, val, sizeof(x))
#define newl cout << "\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr << "///REACHED///\n";
#define deb1(x) cerr << #x << " = " << x << '\n';
#define deb2(x, y) \
cerr << '[' << #x << ',' << #y << "] = " << '[' << x << ',' << y << ']' \
<< '\n';
#define deb3(x, y, z) \
cerr << '[' << #x << ',' << #y << ',' << #z << "] = " << '[' << x << ',' \
<< y << ',' << z << ']' << '\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e9 + 7;
// <------------- Declare Variables Here ------------> //
ll T = 1;
ll n, x, m, k, u, v;
string s, t;
// <------------- Implement Functions Here ----------> //
// <------------- Start of main() -------------------> //
void MAIN() {
cin >> s;
ll c0 = count(all(s), '0');
ll c1 = count(all(s), '1');
cout << min(c0, c1);
}
int main() {
fastio;
randomINT;
// cin >> T;
while (T--) {
MAIN();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); \
cout << fixed; \
cout << setprecision(12);
#define randomINT \
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout << "\n"
#define DISP(as) \
for (auto it : as) \
cout << it << " "; \
newl;
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x, val, sizeof(x))
#define newl cout << "\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr << "///REACHED///\n";
#define deb1(x) cerr << #x << " = " << x << '\n';
#define deb2(x, y) \
cerr << '[' << #x << ',' << #y << "] = " << '[' << x << ',' << y << ']' \
<< '\n';
#define deb3(x, y, z) \
cerr << '[' << #x << ',' << #y << ',' << #z << "] = " << '[' << x << ',' \
<< y << ',' << z << ']' << '\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e9 + 7;
// <------------- Declare Variables Here ------------> //
ll T = 1;
ll n, x, m, k, u, v;
string s, t;
// <------------- Implement Functions Here ----------> //
// <------------- Start of main() -------------------> //
void MAIN() {
cin >> s;
ll c0 = count(all(s), '0');
ll c1 = count(all(s), '1');
cout << 2 * min(c0, c1);
}
int main() {
fastio;
randomINT;
// cin >> T;
while (T--) {
MAIN();
}
return 0;
} | [
"expression.operation.binary.add"
] | 916,742 | 916,743 | u126859973 | cpp |
p03107 | #include <algorithm> //next_permutation
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007
#define cmax(a, b) a = max(a, b)
#define cmin(a, b) a = min(a, b)
#define vc vector
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
int main() {
string s;
cin >> s;
int n = s.size();
int z = 0, o;
rep(i, n) {
if (s[i] == '0')
z++;
}
o = n - z;
cout << abs(o - z) << endl;
} | #include <algorithm> //next_permutation
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007
#define cmax(a, b) a = max(a, b)
#define cmin(a, b) a = min(a, b)
#define vc vector
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
int main() {
string s;
cin >> s;
int n = s.size();
int z = 0, o;
rep(i, n) {
if (s[i] == '0')
z++;
}
o = n - z;
cout << min(o, z) * 2 << endl;
} | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 916,748 | 916,749 | u937618939 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
ll N = S.length();
stack<ll> s;
REP(i, N) {
if (s.size() > 0 && s.top() == S[i])
s.pop();
else
s.push(S[i]);
}
cout << N - s.size() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
ll N = S.length();
stack<ll> s;
REP(i, N) {
if (s.size() > 0 && s.top() != S[i])
s.pop();
else
s.push(S[i]);
}
cout << N - s.size() << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 916,752 | 916,753 | u340980616 | cpp |
p03107 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
int ans = S.length();
int cnt0 = 0, cnt1 = 1;
rep(i, S.length()) {
if (S[i] == '0')
cnt0++;
else
cnt1++;
}
cout << min(cnt0, cnt1) * 2 << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
int ans = S.length();
int cnt0 = 0, cnt1 = 0;
rep(i, S.length()) {
if (S[i] == '0')
cnt0++;
else
cnt1++;
}
cout << min(cnt0, cnt1) * 2 << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 916,756 | 916,757 | u965730380 | cpp |
p03107 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UINT = unsigned long long;
unsigned gcd(unsigned a, unsigned b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
string s;
cin >> s;
int r = 1;
auto t = s[0];
int d = 1;
for (size_t i = 1; i < s.length(); i++) {
if (s[i] != t) {
d *= -1;
t = s[i];
}
r += d;
}
cout << (s.length() - r) << endl;
return 0;
}
| #include <algorithm>
#include <cstring>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UINT = unsigned long long;
unsigned gcd(unsigned a, unsigned b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
string s;
cin >> s;
INT r = 1;
auto t = s[0];
INT d = 1;
for (size_t i = 1; i < s.length(); i++) {
if (s[i] != t) {
d *= -1;
t = s[i];
}
r += d;
}
cout << (s.length() - abs(r)) << endl;
return 0;
}
| [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 916,760 | 916,761 | u275797573 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ll long long
int main() {
string s;
cin >> s;
stack<char> st;
int ans = 0;
rep(i, s.size()) {
if (st.empty()) {
st.push(s[i]);
}
char t = st.top();
if (t != s[i]) {
ans += 2;
st.pop();
} else {
st.push(s[i]);
}
}
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ll long long
int main() {
string s;
cin >> s;
stack<char> st;
int ans = 0;
rep(i, s.size()) {
if (st.empty()) {
st.push(s[i]);
continue;
}
char t = st.top();
if (t != s[i]) {
ans += 2;
st.pop();
} else {
st.push(s[i]);
}
}
printf("%d\n", ans);
} | [] | 916,772 | 916,773 | u702686470 | cpp |
p03107 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;
int main() {
string s;
cin >> s;
int red = 0, blue = 0;
for (int i = 0; i < s.size() + 1; i++) {
if (s[i] == '0')
red++;
else
blue++;
}
cout << min(red, blue) * 2 << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;
int main() {
string s;
cin >> s;
int red = 0, blue = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
red++;
else
blue++;
}
cout << min(red, blue) * 2 << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 916,776 | 916,777 | u654240084 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n = (int)s.length();
int i;
int chk[2] = {0, 0};
for (i = 0; i < n; i++) {
if (s[i] == '0')
chk[0]++;
else
chk[1]++;
}
cout << min(chk[0], chk[1]);
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n = (int)s.length();
int i;
int chk[2] = {0, 0};
for (i = 0; i < n; i++) {
if (s[i] == '0')
chk[0]++;
else
chk[1]++;
}
cout << 2 * min(chk[0], chk[1]);
}
| [
"expression.operation.binary.add"
] | 916,778 | 916,779 | u523698212 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (int i = init; i < (int)(n); i++)
#define repd(i, n, init) for (int i = (int)(n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); i++)
int main() {
string S;
cin >> S;
int cnt = 0;
repi(i, S.length(), 0) {
if (S.at(i) == '0') {
cnt++;
}
}
cout << min(cnt, int(S.size()) - cnt) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (int i = init; i < (int)(n); i++)
#define repd(i, n, init) for (int i = (int)(n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); i++)
int main() {
string S;
cin >> S;
int cnt = 0;
repi(i, S.length(), 0) {
if (S.at(i) == '0') {
cnt++;
}
}
cout << 2 * min(cnt, int(S.size()) - cnt) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 916,780 | 916,781 | u187013893 | cpp |
p03107 |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip> //setprecision
#include <iostream>
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define ll long long
#define mod 1000000007
vector<ll> to[1000005];
int main() {
string a;
cin >> a;
ll b = 0, c = 0;
rep(i, a.size()) {
if (a[i] == '0')
b++;
else
c++;
}
cout << min(b, c) << endl;
} |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip> //setprecision
#include <iostream>
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define ll long long
#define mod 1000000007
vector<ll> to[1000005];
int main() {
string a;
cin >> a;
ll b = 0, c = 0;
rep(i, a.size()) {
if (a[i] == '0')
b++;
else
c++;
}
cout << min(b, c) * 2 << endl;
} | [
"expression.operation.binary.add"
] | 916,782 | 916,783 | u683078179 | cpp |
p03107 | #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;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
ll n;
int main() {
string s;
cin >> s;
int a, b;
rep(i, s.size()) {
if (s[i] == '0')
a++;
else
b++;
}
cout << min(a, b) * 2 << endl;
return 0;
} | #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;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
ll n;
int main() {
string s;
cin >> s;
int a = 0, b = 0;
rep(i, s.size()) {
if (s[i] == '0')
a++;
else
b++;
}
cout << min(a, b) * 2 << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 916,784 | 916,785 | u418810472 | cpp |
p03107 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
string s;
std::cin >> s;
int c0 = 0, c1 = 0, ans = 0;
rep(i, s.size()) {
if (s[i] == '0' && c1)
ans += 2, c1--;
else if (s[i] == '1' && c0)
ans += 2, c0++;
else if (s[i] == '0')
c0++;
else if (s[i] == '1')
c1++;
}
std::cout << ans << "\n";
}
| #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
string s;
std::cin >> s;
int c0 = 0, c1 = 0, ans = 0;
rep(i, s.size()) {
if (s[i] == '0' && c1)
ans += 2, c1--;
else if (s[i] == '1' && c0)
ans += 2, c0--;
else if (s[i] == '0')
c0++;
else if (s[i] == '1')
c1++;
}
std::cout << ans << "\n";
}
| [] | 916,786 | 916,787 | u700484101 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace ::std;
typedef long long lint;
typedef long double ldouble;
#define rep(i, n) for (lint i = 0; i < (lint)(n); i++)
#define repi(i, a, b) for (lint i = lint(a); i < lint(b); i++)
#define rep2(i, a, b, c) for (lint i = lint(a); i > lint(b); i += c)
#define all(x) (x).begin(), (x).end()
#define sl(c) (('a') <= (c) && (c) <= ('z'))
#define ll(c) (('A') <= (c) && (c) <= ('Z'))
#define PI 3.141592653589793
#define cout (cout << fixed << setprecision(15))
#define makeupper(t) (transform(all(t), t.begin(), ::toupper))
#define makelower(t) (transform(all(t), t.begin(), ::tolower))
#define dist(x1, y1, x2, y2) (pow(pow(x2 - x1, 2) + pow(y2 - y1, 2), 0.5))
#define sum(a) accumulate(all(a), 0)
#define NEXT_LINE \
string junk; \
getline(cin, junk);
#define output(v, s) \
do { \
rep(i, v.size()) cout << (i ? s : "") << v[i]; \
cout << "\n"; \
} while (0)
inline string replace(string str, string before, std::string after) {
string::size_type Pos(str.find(before));
while (Pos != std::string::npos) {
str.replace(Pos, before.length(), after);
Pos = str.find(before, Pos + after.length());
}
return str;
}
inline vector<string> split(string &s, string delim) {
vector<string> elems;
s = replace(s, "#", "HASH");
s = replace(s, delim, "#");
stringstream ss(s);
string item;
while (getline(ss, item, '#')) {
elems.push_back(replace(item, "HASH", "#"));
}
return elems;
}
inline vector<int> cross(vector<int> a, vector<int> b) {
return {a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2],
a[0] * b[1] - a[1] * b[0]};
}
inline int GCD(int a, int b) {
if (a < b)
swap(a, b);
if (a % b != 0)
GCD(b, a % b);
else
return b;
}
inline vector<lint> primeList(lint n) {
vector<bool> p(n + 1);
vector<lint> list;
repi(i, 1, n + 1) p[i] = true;
repi(i, 2, sqrt(n) + 1) {
if (p[i]) {
repi(j, 2, n / i + 1) { p[i * j] = false; }
}
}
repi(i, 2, n + 1) if (p[i]) list.push_back(i);
return list;
}
inline bool isPrime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0)
return false;
}
return true;
}
template <typename T> class Stack {
vector<T> stack;
public:
void push(T num) { stack.push_back(num); }
T pop() {
T num = stack[stack.size() - 1];
stack.erase(stack.end() - 1);
return num;
}
};
template <typename T> class Queue {
deque<T> queue;
public:
void push(T num) { queue.push_front(num); }
void push_back(T num) { queue.push_back(num); }
T pop() {
T num = queue[queue.size() - 1];
queue.pop_back();
return num;
}
bool empty() { return queue.empty(); }
};
int main() {
string s;
cin >> s;
int a0, a1;
for (char c : s) {
if (c - '0')
a1++;
else
a0++;
}
cout << min(a0, a1) * 2 << "\n";
} | #include <bits/stdc++.h>
using namespace ::std;
typedef long long lint;
typedef long double ldouble;
#define rep(i, n) for (lint i = 0; i < (lint)(n); i++)
#define repi(i, a, b) for (lint i = lint(a); i < lint(b); i++)
#define rep2(i, a, b, c) for (lint i = lint(a); i > lint(b); i += c)
#define all(x) (x).begin(), (x).end()
#define sl(c) (('a') <= (c) && (c) <= ('z'))
#define ll(c) (('A') <= (c) && (c) <= ('Z'))
#define PI 3.141592653589793
#define cout (cout << fixed << setprecision(15))
#define makeupper(t) (transform(all(t), t.begin(), ::toupper))
#define makelower(t) (transform(all(t), t.begin(), ::tolower))
#define dist(x1, y1, x2, y2) (pow(pow(x2 - x1, 2) + pow(y2 - y1, 2), 0.5))
#define sum(a) accumulate(all(a), 0)
#define NEXT_LINE \
string junk; \
getline(cin, junk);
#define output(v, s) \
do { \
rep(i, v.size()) cout << (i ? s : "") << v[i]; \
cout << "\n"; \
} while (0)
inline string replace(string str, string before, std::string after) {
string::size_type Pos(str.find(before));
while (Pos != std::string::npos) {
str.replace(Pos, before.length(), after);
Pos = str.find(before, Pos + after.length());
}
return str;
}
inline vector<string> split(string &s, string delim) {
vector<string> elems;
s = replace(s, "#", "HASH");
s = replace(s, delim, "#");
stringstream ss(s);
string item;
while (getline(ss, item, '#')) {
elems.push_back(replace(item, "HASH", "#"));
}
return elems;
}
inline vector<int> cross(vector<int> a, vector<int> b) {
return {a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2],
a[0] * b[1] - a[1] * b[0]};
}
inline int GCD(int a, int b) {
if (a < b)
swap(a, b);
if (a % b != 0)
GCD(b, a % b);
else
return b;
}
inline vector<lint> primeList(lint n) {
vector<bool> p(n + 1);
vector<lint> list;
repi(i, 1, n + 1) p[i] = true;
repi(i, 2, sqrt(n) + 1) {
if (p[i]) {
repi(j, 2, n / i + 1) { p[i * j] = false; }
}
}
repi(i, 2, n + 1) if (p[i]) list.push_back(i);
return list;
}
inline bool isPrime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0)
return false;
}
return true;
}
template <typename T> class Stack {
vector<T> stack;
public:
void push(T num) { stack.push_back(num); }
T pop() {
T num = stack[stack.size() - 1];
stack.erase(stack.end() - 1);
return num;
}
};
template <typename T> class Queue {
deque<T> queue;
public:
void push(T num) { queue.push_front(num); }
void push_back(T num) { queue.push_back(num); }
T pop() {
T num = queue[queue.size() - 1];
queue.pop_back();
return num;
}
bool empty() { return queue.empty(); }
};
int main() {
string s;
cin >> s;
int a0 = 0, a1 = 0;
for (char c : s) {
if (c - '0')
a1++;
else
a0++;
}
cout << min(a0, a1) * 2 << "\n";
} | [
"variable_declaration.value.change"
] | 916,788 | 916,789 | u168579419 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define itn int
int main(void) {
string t;
cin >> t;
stack<char> s;
int sum = 0;
for (int i = 0; i < t.size(); ++i) {
if (s.empty() || s.top() == t[i])
s.push(t[i]);
else {
sum += 2;
s.top();
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define itn int
int main(void) {
string t;
cin >> t;
stack<char> s;
int sum = 0;
for (int i = 0; i < t.size(); i++) {
if (s.empty() || s.top() == t[i])
s.push(t[i]);
else {
sum += 2;
s.pop();
}
}
cout << sum << endl;
} | [
"call.function.change"
] | 916,790 | 916,791 | u512624048 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define itn int
int main(void) {
string t;
cin >> t;
stack<char> s;
int sum = 0;
for (int i = 0; i < t.size(); i++) {
if (s.empty() || s.top() == t[i])
s.push(t[i]);
else {
sum += 2;
s.top();
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define itn int
int main(void) {
string t;
cin >> t;
stack<char> s;
int sum = 0;
for (int i = 0; i < t.size(); i++) {
if (s.empty() || s.top() == t[i])
s.push(t[i]);
else {
sum += 2;
s.pop();
}
}
cout << sum << endl;
} | [
"call.function.change"
] | 916,792 | 916,791 | u512624048 | cpp |
p03107 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n0, n1 = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '0')
n0++;
else
n1++;
}
int ans = s.size() - abs(n0 - n1);
cout << ans << endl;
return 0;
}
| #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n0 = 0;
int n1 = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '0')
n0++;
else
n1++;
}
int ans = s.size() - abs(n0 - n1);
cout << ans << endl;
return 0;
}
| [
"variable_declaration.add"
] | 916,793 | 916,794 | u649421008 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string N;
cin >> N;
int Z, O;
for (auto c : N) {
if (c == '0')
Z++;
else
O++;
}
cout << min(Z, O) * 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string N;
cin >> N;
int Z = 0, O = 0;
for (auto c : N) {
if (c == '0')
Z++;
else
O++;
}
cout << min(Z, O) * 2 << endl;
}
| [
"variable_declaration.value.change"
] | 916,795 | 916,796 | u889173297 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define INF 1E18
int main() {
string s;
cin >> s;
int n = s.length();
int no0 = 0;
int no1 = 1;
rep(i, n) {
if (s[i] == '0')
no0++;
else
no1++;
}
cout << min(no0, no1) * 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define INF 1E18
int main() {
string s;
cin >> s;
int n = s.length();
int no0 = 0;
int no1 = 0;
rep(i, n) {
if (s[i] == '0')
no0++;
else
no1++;
}
cout << min(no0, no1) * 2 << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 916,797 | 916,798 | u733599187 | cpp |
p03107 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
///////
int ans = 0;
int one = 0;
int zero = 0;
rep(i, n) {
if (s[i] == '0')
zero++;
else
one++;
}
ans = min(zero, one);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
///////
int ans = 0;
int one = 0;
int zero = 0;
rep(i, n) {
if (s[i] == '0')
zero++;
else
one++;
}
ans = min(zero, one);
cout << ans * 2 << endl;
} | [
"expression.operation.binary.add"
] | 916,799 | 916,800 | u531461815 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main(void) {
string s;
cin >> s;
int one = 0, zero = 0;
rep(i, s.size()) {
if (s[i] == 0) {
zero++;
} else
one++;
}
cout << s.size() - abs(one - zero) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main(void) {
string s;
cin >> s;
int one = 0, zero = 0;
rep(i, s.size()) {
if (s[i] == '0') {
zero++;
} else
one++;
}
cout << s.size() - abs(one - zero) << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 916,803 | 916,804 | u917518913 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int b = 0;
int w = 0;
for (int i = 0; i < S.length(); i++) {
if (S[i] == '0')
w++;
else
b++;
}
cout << min(b, w) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int b = 0;
int w = 0;
for (int i = 0; i < S.length(); i++) {
if (S[i] == '0')
w++;
else
b++;
}
cout << min(b, w) * 2 << endl;
} | [
"expression.operation.binary.add"
] | 916,808 | 916,809 | u983681697 | cpp |
p03107 | #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int c[2];
c[0] = c[1] = 0;
string s;
cin >> s;
rep(i, s.size()) { c[s[i] - '0']++; }
cout << min(c[0], c[1]) << endl;
}
| #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int c[2];
c[0] = c[1] = 0;
string s;
cin >> s;
rep(i, s.size()) { c[s[i] - '0']++; }
cout << 2 * min(c[0], c[1]) << endl;
}
| [
"expression.operation.binary.add"
] | 916,810 | 916,811 | u503170128 | cpp |
p03107 | #include <algorithm>
#include <iostream>
#include <string>
int main() {
std::string S;
std::cin >> S;
const int Red = '0';
const int Blue = '1';
int redCount = 0;
int blueCount = 0;
for (auto i = S.crbegin(); i != S.crend(); i++) {
if (*i == Red) {
redCount++;
} else {
blueCount++;
}
}
std::cout << (std::min)(redCount, blueCount) / 2 << std::endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
int main() {
std::string S;
std::cin >> S;
const int Red = '0';
const int Blue = '1';
int redCount = 0;
int blueCount = 0;
for (auto i = S.crbegin(); i != S.crend(); i++) {
if (*i == Red) {
redCount++;
} else {
blueCount++;
}
}
std::cout << (std::min)(redCount, blueCount) * 2 << std::endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 916,812 | 916,813 | u809157683 | cpp |
p03106 | #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<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
const int INF = 0x3fffffff;
const double DINF = numeric_limits<double>::infinity();
const vector<pii> four = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) for (ll i = 0; i < n; ++i)
#define _rep2(i, n) for (ll i = 0; i < n; ++i)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) for (ll i = n - 1; i >= 0; i--)
#define _rrep2(i, n) for (ll i = n - 1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = b - 1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define yes(i) out(i ? "yes" : "no")
#define Yes(i) out(i ? "Yes" : "No")
#define YES(i) out(i ? "YES" : "NO")
#define Possible(i) out(i ? "Possible" : "Impossible")
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
__attribute__((constructor)) void SETTINGS() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
if (a < b) {
ll c = a;
a = b;
b = c;
}
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline constexpr ll intpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr ll modpow(ll a, ll b, ll mod = MOD) {
if (b == 0)
return 1;
ll ans = modpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1) % mod;
}
template <typename T> inline constexpr bool update_min(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool update_max(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
inline void in() {}
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << vec[0];
rep(i, 1, vec.size()) { os << ' ' << vec[i]; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> &deq) {
os << deq[0];
rep(i, 1, deq.size()) { os << ' ' << deq[i]; }
return os;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T, class L> pair<T, L> operator+(pair<T, L> a, pair<T, L> b) {
return {a.first + b.first, a.second + b.second};
}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << endl;
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
template <class Head, class... Tail> inline void err(Head head, Tail... tail) {
cerr << head << ' ';
out(move(tail)...);
}
signed main() {
LL(a, b, k);
rep(i, 1, 1000) if (a % i == 0 && b % i == 0) {
k--;
if (!k)
return out(i);
}
}
| #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<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
const int INF = 0x3fffffff;
const double DINF = numeric_limits<double>::infinity();
const vector<pii> four = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) for (ll i = 0; i < n; ++i)
#define _rep2(i, n) for (ll i = 0; i < n; ++i)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) for (ll i = n - 1; i >= 0; i--)
#define _rrep2(i, n) for (ll i = n - 1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = b - 1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define yes(i) out(i ? "yes" : "no")
#define Yes(i) out(i ? "Yes" : "No")
#define YES(i) out(i ? "YES" : "NO")
#define Possible(i) out(i ? "Possible" : "Impossible")
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
__attribute__((constructor)) void SETTINGS() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
if (a < b) {
ll c = a;
a = b;
b = c;
}
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline constexpr ll intpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr ll modpow(ll a, ll b, ll mod = MOD) {
if (b == 0)
return 1;
ll ans = modpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1) % mod;
}
template <typename T> inline constexpr bool update_min(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool update_max(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
inline void in() {}
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << vec[0];
rep(i, 1, vec.size()) { os << ' ' << vec[i]; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> &deq) {
os << deq[0];
rep(i, 1, deq.size()) { os << ' ' << deq[i]; }
return os;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T, class L> pair<T, L> operator+(pair<T, L> a, pair<T, L> b) {
return {a.first + b.first, a.second + b.second};
}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << endl;
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
template <class Head, class... Tail> inline void err(Head head, Tail... tail) {
cerr << head << ' ';
out(move(tail)...);
}
signed main() {
LL(a, b, k);
rrep(i, 1, 101) if (a % i == 0 && b % i == 0) {
k--;
if (!k)
return out(i);
}
}
| [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change"
] | 916,814 | 916,815 | u874644572 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string a;
cin >> a;
ll b, c;
b = 0;
c = 0;
for (ll i = 0; i < a.size(); i++) {
if (a.at(i) == '0') {
b += 1;
} else {
c += 1;
}
}
cout << min(b, c) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string a;
cin >> a;
ll b, c;
b = 0;
c = 0;
for (ll i = 0; i < a.size(); i++) {
if (a.at(i) == '0') {
b += 1;
} else {
c += 1;
}
}
cout << min(b, c) * 2 << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 916,824 | 916,825 | u883297128 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
string s;
cin >> s;
int zero = 0, one = 0;
int n = s.size();
rep(i, n) {
if (s[i] == '0') {
zero++;
} else {
one++;
}
}
cout << abs(zero - one) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
string s;
cin >> s;
int zero = 0, one = 0;
int n = s.size();
rep(i, n) {
if (s[i] == '0') {
zero++;
} else {
one++;
}
}
cout << n - abs(zero - one) << endl;
} | [
"expression.operation.binary.add"
] | 916,828 | 916,829 | u318661636 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
bool f = true;
while (f) {
f = false;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) {
s.erase(i - 1, 2);
ans += 2;
i -= 2;
f = true;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
bool f = true;
while (f) {
f = false;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) {
s.erase(i - 1, 2);
ans += 2;
i--;
f = true;
}
}
}
cout << ans << endl;
} | [] | 916,830 | 916,831 | u528258842 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
bool f = true;
while (f) {
f = false;
for (int i = 1; i < s.size(); i++) {
if (s[i] == s[i - 1]) {
s.erase(i - 1, 2);
ans += 2;
i -= 2;
f = true;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
bool f = true;
while (f) {
f = false;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) {
s.erase(i - 1, 2);
ans += 2;
i--;
f = true;
}
}
}
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 916,832 | 916,831 | u528258842 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main() {
string s;
cin >> s;
ll o = 0;
ll z = 0;
rep(i, 0, s.size()) {
if (s[i] == '0')
z++;
else if (s[i] == '1')
o++;
}
cout << min(o, z) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main() {
string s;
cin >> s;
ll o = 0;
ll z = 0;
rep(i, 0, s.size()) {
if (s[i] == '0')
z++;
else if (s[i] == '1')
o++;
}
cout << min(o, z) * 2 << endl;
} | [
"expression.operation.binary.add"
] | 916,833 | 916,834 | u829403090 | cpp |
p03107 | #include <bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template <typename T_char> T_char ToUpper(T_char cX) { return toupper(cX); }
int main() {
string s;
cin >> s;
int n = s.size();
int cnt = 0;
bool flag1 = true;
while (flag1) {
flag1 = false;
for (int i = 0; i < n; ++i) {
if (s[i] == '0' && s[i + 1] == '0') {
cnt += 2;
s.erase(i, 2);
flag1 = true;
}
if (s[i] == '1' && s[i + 1] == '1') {
cnt += 2;
s.erase(i, 2);
flag1 = true;
}
}
n = s.size();
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template <typename T_char> T_char ToUpper(T_char cX) { return toupper(cX); }
int main() {
string s;
cin >> s;
int n = s.size();
int cnt = 0;
bool flag1 = true;
while (flag1) {
flag1 = false;
for (int i = 0; i < n; ++i) {
if (s[i] == '1' && s[i + 1] == '0') {
cnt += 2;
s.erase(i, 2);
flag1 = true;
}
if (s[i] == '0' && s[i + 1] == '1') {
cnt += 2;
s.erase(i, 2);
flag1 = true;
}
}
n = s.size();
}
cout << cnt << endl;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 916,837 | 916,838 | u145562832 | cpp |
p03107 | #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <numeric> // accumulate(begin,end,初期値)
#include <vector>
typedef long long ll;
using namespace std;
#define FALSE printf("false\n");
#define TRUE printf("true\n");
#define all(x) (x).begin(), (x).end()
#define print(x) cout << x << endl;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SUM(vec) accumulate(all(vec), 0);
const ll INF = 1e9 + 7;
// 各桁の和
template <typename T> T digit(T num) {
T sum = 0;
while (num) {
sum += num % 10;
num /= 10;
}
return sum;
}
int main() {
string s;
cin >> s;
int zero = 0, one = 0;
rep(i, s.size()) {
zero += s[i] == '0';
one += s[i] == '1';
}
int ans = min(zero, one);
print(ans) return 0;
}
| #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <numeric> // accumulate(begin,end,初期値)
#include <vector>
typedef long long ll;
using namespace std;
#define FALSE printf("false\n");
#define TRUE printf("true\n");
#define all(x) (x).begin(), (x).end()
#define print(x) cout << x << endl;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SUM(vec) accumulate(all(vec), 0);
const ll INF = 1e9 + 7;
// 各桁の和
template <typename T> T digit(T num) {
T sum = 0;
while (num) {
sum += num % 10;
num /= 10;
}
return sum;
}
int main() {
string s;
cin >> s;
int zero = 0, one = 0;
rep(i, s.size()) {
zero += s[i] == '0';
one += s[i] == '1';
}
int ans = min(zero, one) * 2;
print(ans) return 0;
}
| [
"assignment.change"
] | 916,845 | 916,846 | u184572586 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length(), cnt1 = 0, cnt2 = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '0')
cnt1++;
else
cnt2++;
}
cout << min(cnt1, cnt2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length(), cnt1 = 0, cnt2 = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '0')
cnt1++;
else
cnt2++;
}
cout << 2 * min(cnt1, cnt2) << endl;
}
| [
"expression.operation.binary.add"
] | 916,847 | 916,848 | u313403396 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int red, blue = 0;
rep(i, s.length()) {
if (s[i] == '0') {
red++;
} else {
blue++;
}
}
if (red > blue) {
cout << blue * 2 << endl;
} else {
cout << red * 2 << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int red = 0, blue = 0;
rep(i, s.length()) {
if (s[i] == '0') {
red++;
} else {
blue++;
}
}
if (red > blue) {
cout << blue * 2 << endl;
} else {
cout << red * 2 << endl;
}
return 0;
} | [
"variable_declaration.value.change"
] | 916,849 | 916,850 | u532086793 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int red, blue = 0;
rep(i, s.length()) {
if (s[i] == '0') {
red++;
} else {
blue++;
}
}
if (red > blue) {
cout << blue * 2 << endl;
} else {
cout << red * 2 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int red = 0, blue = 0;
rep(i, s.length()) {
if (s[i] == '0') {
red++;
} else {
blue++;
}
}
if (red > blue) {
cout << blue * 2 << endl;
} else {
cout << red * 2 << endl;
}
return 0;
} | [
"variable_declaration.value.change"
] | 916,851 | 916,850 | u532086793 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
struct Edge {
long long to;
long long cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
const long long INF = 1LL << 60;
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < n; i++)
bool is_prime(ll x) {
for (ll i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
long long modpow(long long a, long long n, long long m) {
long long ans = 1;
while (n) {
if (n & 1) {
ans = (ans * a) % m;
}
a = (a * a) % m;
n >>= 1;
}
return ans;
}
long long combi(long long n, long long a) {
long long ans = 1, ans1 = 1;
for (long long i = n - a + 1; i <= n; i++) {
ans *= i % MOD;
ans %= MOD;
}
for (long long i = 2; i <= a; i++)
ans1 = (ans1 * i) % MOD;
ans1 = modpow(ans1, MOD - 2, MOD);
return ((ans % MOD) * ans1) % MOD;
}
template <typename T>
bool next_combination(const T first, const T last, int k) {
const T subset = first + k;
// empty container | k = 0 | k == n
if (first == last || first == subset || last == subset) {
return false;
}
T src = subset;
while (first != src) {
src--;
if (*src < *(last - 1)) {
T dest = subset;
while (*src >= *dest) {
dest++;
}
iter_swap(src, dest);
rotate(src + 1, dest + 1, last);
rotate(subset, subset + (last - dest) - 1, last);
return true;
}
}
// restore
rotate(first, subset, last);
return false;
}
void dfs(vector<ll> s, ll mi, ll mx, ll N, vector<vector<ll>> &arr) {
if (s.size() == (size_t)N) {
// cout << s.c_str() << endl;
arr.push_back(s);
} else {
for (ll c = s.size() > 0 ? s[s.size() - 1] : mi; c <= mx; c++) {
s.push_back(c);
dfs(s, mi, mx, N, arr);
s.pop_back();
}
}
return;
}
int bfs(int sx, int sy, int gx, int gy, int h, int w,
vector<vector<char>> map) {
queue<pair<int, int>> s;
vector<vector<ll>> ans;
for (int i = 0; i < h; i++) {
vector<ll> aa(w);
ans.push_back(aa);
}
s.push(make_pair(sx, sy));
while (s.size() > 0) {
pair<int, int> tmp = s.front();
s.pop();
map[tmp.first][tmp.second] = '#';
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (tmp.first + i < 0 || tmp.first + i >= h) {
continue;
}
if (tmp.second + j < 0 || tmp.second + j >= w) {
continue;
}
if (i != 0 && j != 0) {
continue;
}
if (i == 0 && j == 0) {
continue;
}
if (map[tmp.first + i][tmp.second + j] == '#') {
continue;
}
map[tmp.first + i][tmp.second + j] = '#';
if (ans[tmp.first + i][tmp.second + j] == 0) {
ans[tmp.first + i][tmp.second + j] = ans[tmp.first][tmp.second] + 1;
} else {
ans[tmp.first + i][tmp.second + j] =
min(ans[tmp.first + i][tmp.second + j],
ans[tmp.first][tmp.second] + 1);
}
s.push(make_pair(tmp.first + i, tmp.second + j));
}
}
}
return ans[gy][gx];
}
ll modfactorial(ll a) {
if (a == 1)
return 1;
return (a % MOD) * (modfactorial(a - 1) % MOD);
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
/* dijkstra(G,s,dis)
入力：グラフ G, 開始点 s, 距離を格納する dis
計算量：O(|E|log|V|)
副作用：dis が書き換えられる
*/
void dijkstra(const Graph &G, int s, vector<ll> &dis, vector<ll> &prev) {
int N = G.size();
dis.resize(N, INF);
prev.resize(N, -1); // 初期化
priority_queue<P, vector<P>, greater<P>> pq;
dis[s] = 0;
pq.emplace(dis[s], s);
while (!pq.empty()) {
P p = pq.top();
pq.pop();
int v = p.second;
if (dis[v] < p.first) {
continue;
}
for (auto &e : G[v]) {
if (dis[e.to] > dis[v] + e.cost) {
dis[e.to] = dis[v] + e.cost;
prev[e.to] = v; // 頂点 v を通って e.to にたどり着いた
pq.emplace(dis[e.to], e.to);
}
}
}
}
vector<ll> get_path(const vector<ll> &prev, ll t) {
vector<ll> path;
for (ll cur = t; cur != -1; cur = prev[cur]) {
path.push_back(cur);
}
reverse(path.begin(), path.end()); // 逆順なのでひっくり返す
return path;
}
vector<string> split(string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
while (getline(ss, item, delim)) {
if (!item.empty()) {
elems.push_back(item);
}
}
return elems;
}
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
string s;
cin >> s;
map<ll, ll> m;
rep(i, s.size() - 1) { m[s[i]]++; }
cout << 2 * min(m['1'], m['0']) << endl;
return 0;
}
// cout << std::fixed << std::setprecision(15)
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
struct Edge {
long long to;
long long cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
const long long INF = 1LL << 60;
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < n; i++)
bool is_prime(ll x) {
for (ll i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
long long modpow(long long a, long long n, long long m) {
long long ans = 1;
while (n) {
if (n & 1) {
ans = (ans * a) % m;
}
a = (a * a) % m;
n >>= 1;
}
return ans;
}
long long combi(long long n, long long a) {
long long ans = 1, ans1 = 1;
for (long long i = n - a + 1; i <= n; i++) {
ans *= i % MOD;
ans %= MOD;
}
for (long long i = 2; i <= a; i++)
ans1 = (ans1 * i) % MOD;
ans1 = modpow(ans1, MOD - 2, MOD);
return ((ans % MOD) * ans1) % MOD;
}
template <typename T>
bool next_combination(const T first, const T last, int k) {
const T subset = first + k;
// empty container | k = 0 | k == n
if (first == last || first == subset || last == subset) {
return false;
}
T src = subset;
while (first != src) {
src--;
if (*src < *(last - 1)) {
T dest = subset;
while (*src >= *dest) {
dest++;
}
iter_swap(src, dest);
rotate(src + 1, dest + 1, last);
rotate(subset, subset + (last - dest) - 1, last);
return true;
}
}
// restore
rotate(first, subset, last);
return false;
}
void dfs(vector<ll> s, ll mi, ll mx, ll N, vector<vector<ll>> &arr) {
if (s.size() == (size_t)N) {
// cout << s.c_str() << endl;
arr.push_back(s);
} else {
for (ll c = s.size() > 0 ? s[s.size() - 1] : mi; c <= mx; c++) {
s.push_back(c);
dfs(s, mi, mx, N, arr);
s.pop_back();
}
}
return;
}
int bfs(int sx, int sy, int gx, int gy, int h, int w,
vector<vector<char>> map) {
queue<pair<int, int>> s;
vector<vector<ll>> ans;
for (int i = 0; i < h; i++) {
vector<ll> aa(w);
ans.push_back(aa);
}
s.push(make_pair(sx, sy));
while (s.size() > 0) {
pair<int, int> tmp = s.front();
s.pop();
map[tmp.first][tmp.second] = '#';
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (tmp.first + i < 0 || tmp.first + i >= h) {
continue;
}
if (tmp.second + j < 0 || tmp.second + j >= w) {
continue;
}
if (i != 0 && j != 0) {
continue;
}
if (i == 0 && j == 0) {
continue;
}
if (map[tmp.first + i][tmp.second + j] == '#') {
continue;
}
map[tmp.first + i][tmp.second + j] = '#';
if (ans[tmp.first + i][tmp.second + j] == 0) {
ans[tmp.first + i][tmp.second + j] = ans[tmp.first][tmp.second] + 1;
} else {
ans[tmp.first + i][tmp.second + j] =
min(ans[tmp.first + i][tmp.second + j],
ans[tmp.first][tmp.second] + 1);
}
s.push(make_pair(tmp.first + i, tmp.second + j));
}
}
}
return ans[gy][gx];
}
ll modfactorial(ll a) {
if (a == 1)
return 1;
return (a % MOD) * (modfactorial(a - 1) % MOD);
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
/* dijkstra(G,s,dis)
入力：グラフ G, 開始点 s, 距離を格納する dis
計算量：O(|E|log|V|)
副作用：dis が書き換えられる
*/
void dijkstra(const Graph &G, int s, vector<ll> &dis, vector<ll> &prev) {
int N = G.size();
dis.resize(N, INF);
prev.resize(N, -1); // 初期化
priority_queue<P, vector<P>, greater<P>> pq;
dis[s] = 0;
pq.emplace(dis[s], s);
while (!pq.empty()) {
P p = pq.top();
pq.pop();
int v = p.second;
if (dis[v] < p.first) {
continue;
}
for (auto &e : G[v]) {
if (dis[e.to] > dis[v] + e.cost) {
dis[e.to] = dis[v] + e.cost;
prev[e.to] = v; // 頂点 v を通って e.to にたどり着いた
pq.emplace(dis[e.to], e.to);
}
}
}
}
vector<ll> get_path(const vector<ll> &prev, ll t) {
vector<ll> path;
for (ll cur = t; cur != -1; cur = prev[cur]) {
path.push_back(cur);
}
reverse(path.begin(), path.end()); // 逆順なのでひっくり返す
return path;
}
vector<string> split(string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
while (getline(ss, item, delim)) {
if (!item.empty()) {
elems.push_back(item);
}
}
return elems;
}
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
string s;
cin >> s;
map<ll, ll> m;
rep(i, s.size()) { m[s[i]]++; }
cout << 2 * min(m['1'], m['0']) << endl;
return 0;
}
// cout << std::fixed << std::setprecision(15)
| [
"expression.operation.binary.remove"
] | 916,857 | 916,858 | u303297838 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
} //最大公約数
int lcm(int a, int b) {
int c = gcd(a, b);
a /= c;
return a * b;
} //最小公倍数
int nCr(int a, int b) {
int i, r = 1;
for (i = 1; i <= b; i++) {
r *= (a + 1 - i);
r /= i;
}
return r;
} //コンビネーション
int nHr(int a, int b) { return nCr(a + b - 1, b); } // 重複組み合わせ
int fact(int a) {
int i, r = 1;
for (i = 1; i <= a; i++) {
r *= i;
}
return r;
} //階乗
int pow(int a, int b) {
int i, r = 1;
for (i = 1; i <= b; i++) {
r *= a;
}
return r;
} // a~bまでの階乗
int dsum(int x) {
int r = 0;
while (x) {
r += (x % 10);
x /= 10;
}
return r;
} //数字の各位の和
int dsumb(int x, int b) {
int r = 0;
while (x) {
r += (x % b);
x /= b;
}
return r;
} // b進数の各位の和？
int sankaku(int x) { return ((1 + x) * x) / 2; } //三角数 xまでの和
//以下long long ver
long long llmax(long long a, long long b) {
if (a > b) {
return a;
}
return b;
}
long long llmin(long long a, long long b) {
if (a < b) {
return a;
}
return b;
}
long long llzt(long long a, long long b) { return llmax(a, b) - llmin(a, b); }
long long llround(long long a, long long b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
long long llceil(long long a, long long b) {
if (a % b == 0) {
return a / b;
}
return (a / b) + 1;
}
long long llgcd(long long a, long long b) {
long long c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
long long lllcm(long long a, long long b) {
long long c = llgcd(a, b);
a /= c;
return a * b;
}
long long llnCr(long long a, long long b) {
long long i, r = 1;
for (i = 1; i <= b; i++) {
r *= (a + 1 - i);
r /= i;
}
return r;
}
long long llnHr(long long a, long long b) { return llnCr(a + b - 1, b); }
long long llfact(long long a) {
long long i, r = 1;
for (i = 1; i <= a; i++) {
r *= i;
}
return r;
}
long long llpow(long long a, long long b) {
long long i, r = 1;
for (i = 1; i <= b; i++) {
r *= a;
}
return r;
}
long long lldsum(long long x) {
long long r = 0;
while (x) {
r += (x % 10);
x /= 10;
}
return r;
}
long long lldsumb(long long x, long long b) {
long long r = 0;
while (x) {
r += (x % b);
x /= b;
}
return r;
}
long long llsankaku(long long x) { return ((1 + x) * x) / 2; }
// double
double dbmax(double a, double b) {
if (a > b) {
return a;
}
return b;
}
double dbmin(double a, double b) {
if (a < b) {
return a;
}
return b;
}
double dbzt(double a, double b) { return dbmax(a, b) - dbmin(a, b); }
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define forr(i, a, b) \
; \
for (int i = (a); i < (b); i++)
#define clean(arr, val) memset(arr, val, sizeof(arr))
#define forn(i, n) forr(i, 0, n)
#define PB push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vpll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
bool is_prime(int x) {
if (x <= 1)
return false;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
string alpha = "abcdefghijklmnopqrstuvwxyz";
string ALPHA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
bool chmin(int a, int b) {
if (a > b) {
a = b;
return true;
}
return false;
}
bool chmax(int a, int b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/*CODE START HERE*/
int main() {
string s;
cin >> s;
int count_0 = 0;
int count_1 = 0;
forn(i, s.size()) {
if (s.at(i) = '0') {
count_0++;
} else
count_1++;
}
cout << min(count_1, count_0) * 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
} //最大公約数
int lcm(int a, int b) {
int c = gcd(a, b);
a /= c;
return a * b;
} //最小公倍数
int nCr(int a, int b) {
int i, r = 1;
for (i = 1; i <= b; i++) {
r *= (a + 1 - i);
r /= i;
}
return r;
} //コンビネーション
int nHr(int a, int b) { return nCr(a + b - 1, b); } // 重複組み合わせ
int fact(int a) {
int i, r = 1;
for (i = 1; i <= a; i++) {
r *= i;
}
return r;
} //階乗
int pow(int a, int b) {
int i, r = 1;
for (i = 1; i <= b; i++) {
r *= a;
}
return r;
} // a~bまでの階乗
int dsum(int x) {
int r = 0;
while (x) {
r += (x % 10);
x /= 10;
}
return r;
} //数字の各位の和
int dsumb(int x, int b) {
int r = 0;
while (x) {
r += (x % b);
x /= b;
}
return r;
} // b進数の各位の和？
int sankaku(int x) { return ((1 + x) * x) / 2; } //三角数 xまでの和
//以下long long ver
long long llmax(long long a, long long b) {
if (a > b) {
return a;
}
return b;
}
long long llmin(long long a, long long b) {
if (a < b) {
return a;
}
return b;
}
long long llzt(long long a, long long b) { return llmax(a, b) - llmin(a, b); }
long long llround(long long a, long long b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
long long llceil(long long a, long long b) {
if (a % b == 0) {
return a / b;
}
return (a / b) + 1;
}
long long llgcd(long long a, long long b) {
long long c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
long long lllcm(long long a, long long b) {
long long c = llgcd(a, b);
a /= c;
return a * b;
}
long long llnCr(long long a, long long b) {
long long i, r = 1;
for (i = 1; i <= b; i++) {
r *= (a + 1 - i);
r /= i;
}
return r;
}
long long llnHr(long long a, long long b) { return llnCr(a + b - 1, b); }
long long llfact(long long a) {
long long i, r = 1;
for (i = 1; i <= a; i++) {
r *= i;
}
return r;
}
long long llpow(long long a, long long b) {
long long i, r = 1;
for (i = 1; i <= b; i++) {
r *= a;
}
return r;
}
long long lldsum(long long x) {
long long r = 0;
while (x) {
r += (x % 10);
x /= 10;
}
return r;
}
long long lldsumb(long long x, long long b) {
long long r = 0;
while (x) {
r += (x % b);
x /= b;
}
return r;
}
long long llsankaku(long long x) { return ((1 + x) * x) / 2; }
// double
double dbmax(double a, double b) {
if (a > b) {
return a;
}
return b;
}
double dbmin(double a, double b) {
if (a < b) {
return a;
}
return b;
}
double dbzt(double a, double b) { return dbmax(a, b) - dbmin(a, b); }
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define forr(i, a, b) \
; \
for (int i = (a); i < (b); i++)
#define clean(arr, val) memset(arr, val, sizeof(arr))
#define forn(i, n) forr(i, 0, n)
#define PB push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vpll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
bool is_prime(int x) {
if (x <= 1)
return false;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
string alpha = "abcdefghijklmnopqrstuvwxyz";
string ALPHA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
bool chmin(int a, int b) {
if (a > b) {
a = b;
return true;
}
return false;
}
bool chmax(int a, int b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/*CODE START HERE*/
int main() {
string s;
cin >> s;
int count_0 = 0;
int count_1 = 0;
forn(i, s.size()) {
if (s.at(i) == '0') {
count_0++;
} else
count_1++;
}
cout << min(count_1, count_0) * 2 << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 916,859 | 916,860 | u946082956 | cpp |
p03107 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
string S;
cin >> S;
int s_size = S.size();
int one_count = 0;
int zero_count = 0;
for (int i = 0; i < s_size; i++) {
if (S[i] == '0') {
zero_count += 1;
} else {
one_count += 1;
}
}
cout << min(one_count, zero_count) << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
string S;
cin >> S;
int s_size = S.size();
int one_count = 0;
int zero_count = 0;
for (int i = 0; i < s_size; i++) {
if (S[i] == '0') {
zero_count += 1;
} else {
one_count += 1;
}
}
cout << 2 * min(one_count, zero_count) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 916,861 | 916,862 | u651314218 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main() {
int zero = 0, one = 0;
string s;
cin >> s;
rep(i, s.size()) {
if (s[i] == '0')
zero++;
else
one++;
}
cout << abs(one - zero) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main() {
int zero = 0, one = 0;
string s;
cin >> s;
rep(i, s.size()) {
if (s[i] == '0')
zero++;
else
one++;
}
cout << zero + one - abs(zero - one) << endl;
return 0;
} | [
"call.add",
"expression.operation.binary.add"
] | 916,863 | 916,864 | u033937898 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
// const int MOD = 1e9+7;
int main() {
string s;
cin >> s;
int c0 = 0, c1 = 1;
for (int i = 0; i < s.length(); ++i) {
if (s[i] == '0')
c0++;
else
c1++;
}
cout << 2 * min(c0, c1);
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
// const int MOD = 1e9+7;
int main() {
string s;
cin >> s;
int c0 = 0, c1 = 0;
for (int i = 0; i < (int)s.length(); ++i) {
if (s[i] == '0')
c0++;
else
c1++;
}
cout << 2 * min(c0, c1);
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change"
] | 916,867 | 916,868 | u324973749 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a, b, c;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '0') {
a++;
} else if (s.at(i) == '1') {
b++;
}
}
c = min(a, b);
cout << c * 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0, b = 0, c = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == '0') {
a++;
} else if (s.at(i) == '1') {
b++;
}
}
c = min(a, b);
cout << c * 2 << endl;
}
| [
"variable_declaration.value.change"
] | 916,869 | 916,870 | u856957535 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, start, end) for (uint64_t i = start; i < end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0) {
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) { return (m * n) / gcd(m, n); }
// vector<vector<uint64_t> > v(n+1, vector<uint64_t>(n+1, 0))
// v[n][k]に組み合わせ数が入る。
void comb(vector<vector<uint64_t>> &v) {
for (uint64_t i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (uint64_t k = 1; k < v.size(); k++) {
for (uint64_t j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
// 掛け算オーバーフロー判定
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
//素因数分解
void primeFactorization(
uint64_t a, list<uint64_t> &factors) { //素因数分解を出力するプログラム
long i, sq;
if (a % 2 == 0) { //偶数の場合
factors.push_back(2);
primeFactorization(a / 2, factors); // 2で割った値で再帰
return;
}
sq = sqrt(a);
for (i = 3; i <= sq; i += 2) { // 3以上√a以下の奇数の場合
if (a % i == 0) {
factors.push_back(i);
primeFactorization(a / i, factors); //割れた値で再帰
return;
}
}
//偶数でも3以上√a以下の奇数の場合でも割り切れない場合
if (a != 1) { // aが1でないなら、a自身は素数
factors.push_back(a);
}
}
// フェルマーの小定理
// mod. m での a の逆元 a^{-1} を計算する
// (a/b)%m = a*movinv(b,m)%m
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// 円周率
// M_PI
// #include <iomanip> // setprecisionを使用するのに必要
// cout << std::fixed << std::setprecision(15) << y << endl;
// 昇順
// priority_queue<int, vector<int>, greater<int> > queue;
signed main() {
string s;
cin >> s;
int zeroCount = 0;
for (auto c : s) {
if (c == '0') {
zeroCount++;
}
}
int n = s.length();
if (n / 2 > zeroCount) {
cout << zeroCount * 2 << endl;
} else {
cout << (n - zeroCount) * 2 << endl;
}
#if 0
int count = 0;
int pos = string::npos;
while(true){
pos = s.find("01");
if(pos!=string::npos){
s.erase(pos,2);
count += 2;
}
else{
pos = s.find("10");
if(pos!=string::npos){
s.erase(pos,2);
count += 2;
}
else{
break;
}
}
}
cout << count << endl;
#endif
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, start, end) for (uint64_t i = start; i < end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0) {
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) { return (m * n) / gcd(m, n); }
// vector<vector<uint64_t> > v(n+1, vector<uint64_t>(n+1, 0))
// v[n][k]に組み合わせ数が入る。
void comb(vector<vector<uint64_t>> &v) {
for (uint64_t i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (uint64_t k = 1; k < v.size(); k++) {
for (uint64_t j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
// 掛け算オーバーフロー判定
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
//素因数分解
void primeFactorization(
uint64_t a, list<uint64_t> &factors) { //素因数分解を出力するプログラム
long i, sq;
if (a % 2 == 0) { //偶数の場合
factors.push_back(2);
primeFactorization(a / 2, factors); // 2で割った値で再帰
return;
}
sq = sqrt(a);
for (i = 3; i <= sq; i += 2) { // 3以上√a以下の奇数の場合
if (a % i == 0) {
factors.push_back(i);
primeFactorization(a / i, factors); //割れた値で再帰
return;
}
}
//偶数でも3以上√a以下の奇数の場合でも割り切れない場合
if (a != 1) { // aが1でないなら、a自身は素数
factors.push_back(a);
}
}
// フェルマーの小定理
// mod. m での a の逆元 a^{-1} を計算する
// (a/b)%m = a*movinv(b,m)%m
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// 円周率
// M_PI
// #include <iomanip> // setprecisionを使用するのに必要
// cout << std::fixed << std::setprecision(15) << y << endl;
// 昇順
// priority_queue<int, vector<int>, greater<int> > queue;
signed main() {
string s;
cin >> s;
int zeroCount = 0;
for (auto c : s) {
if (c == '0') {
zeroCount++;
}
}
int n = s.length();
if (n - zeroCount > zeroCount) {
cout << zeroCount * 2 << endl;
} else {
cout << (n - zeroCount) * 2 << endl;
}
#if 0
int count = 0;
int pos = string::npos;
while(true){
pos = s.find("01");
if(pos!=string::npos){
s.erase(pos,2);
count += 2;
}
else{
pos = s.find("10");
if(pos!=string::npos){
s.erase(pos,2);
count += 2;
}
else{
break;
}
}
}
cout << count << endl;
#endif
return 0;
}
| [] | 916,871 | 916,872 | u925478083 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
str s;
cin >> s;
int cnta = 0;
int cntb = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
cnta++;
else
cntb++;
}
cout << min(cnta, cntb) << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
str s;
cin >> s;
int cnta = 0;
int cntb = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')
cnta++;
else
cntb++;
}
cout << min(cnta, cntb) * 2 << "\n";
return 0;
}
| [
"expression.operation.binary.add"
] | 916,876 | 916,877 | u288035794 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
int main() {
FAST;
stack<char> stck;
string s;
cin >> s;
// string ans="";
for (int i = 0; i < s.size(); i++) {
char ch;
if (stck.empty()) {
ch = s[0];
} else {
ch = stck.top();
}
if (ch != s[i]) {
stck.pop();
} else {
stck.push(s[i]);
}
}
cout << s.size() - stck.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
int main() {
FAST;
stack<char> stck;
string s;
cin >> s;
// string ans="";
for (int i = 0; i < s.size(); i++) {
char ch;
if (stck.empty()) {
ch = s[i];
} else {
ch = stck.top();
}
if (ch != s[i]) {
stck.pop();
} else {
stck.push(s[i]);
}
}
/*
while(!stck.empty()){
char c=stck.top();
ans+=c;
stck.pop();
}*/
// reverse(ans.begin(),ans.end());
cout << s.size() - stck.size() << endl;
// 11111000000000
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 916,886 | 916,887 | u089230684 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
stack<char> sc;
sc.push(s[0]);
int ans = 0;
for (size_t i = 0; i < s.size(); ++i) {
if (sc.empty())
sc.push(s[i]);
else {
if (sc.top() == s[i]) {
sc.push(s[i]);
} else {
sc.pop();
ans += 2;
}
}
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
stack<char> sc;
sc.push(s[0]);
int ans = 0;
for (size_t i = 1; i < s.size(); ++i) {
if (sc.empty())
sc.push(s[i]);
else {
if (sc.top() == s[i]) {
sc.push(s[i]);
} else {
sc.pop();
ans += 2;
}
}
}
cout << ans << "\n";
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 916,888 | 916,889 | u863370423 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
string s;
int main() {
cin >> s;
int cnt = 0;
int n = s.length();
for (auto c : s) {
if (c == '1')
++cnt;
}
cout << min(cnt, n - cnt) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
string s;
int main() {
cin >> s;
int cnt = 0;
int n = s.length();
for (auto c : s) {
if (c == '1')
++cnt;
}
cout << min(cnt, n - cnt) * 2 << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 916,890 | 916,891 | u063318293 | cpp |
p03107 |
// C - Unification
// スタックを用いた解法
#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() {
string S;
cin >> S;
int ans = 0;
stack<char> stk;
for (int i = 0; i < S.size(); i++) {
char c = S[i];
if (stk.empty())
stk.push(c);
if (c == '0') {
if (stk.top() == '1') {
stk.pop();
ans += 2;
} else {
stk.push(c);
}
}
if (c == '1') {
if (stk.top() == '0') {
stk.pop();
ans += 2;
} else {
stk.push(c);
}
}
}
cout << ans << endl;
return 0;
} |
// C - Unification
// スタックを用いた解法
#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() {
string S;
cin >> S;
int ans = 0;
stack<char> stk;
for (int i = 0; i < S.size(); i++) {
char c = S[i];
if (stk.empty()) {
stk.push(c);
continue;
}
if (c == '0') {
if (stk.top() == '1') {
stk.pop();
ans += 2;
} else {
stk.push(c);
}
}
if (c == '1') {
if (stk.top() == '0') {
stk.pop();
ans += 2;
} else {
stk.push(c);
}
}
}
cout << ans << endl;
return 0;
} | [] | 916,937 | 916,938 | u790272146 | cpp |
p03107 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main() {
string s, t = "";
cin >> s;
int a, b;
rep(i, s.size()) {
if (s[i] == '0')
a++;
else
b++;
}
cout << min(a, b) * 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main() {
string s, t = "";
cin >> s;
int a = 0, b = 0;
rep(i, s.size()) {
if (s[i] == '0')
a++;
else
b++;
}
cout << min(a, b) * 2 << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 916,939 | 916,940 | u534923072 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string tumiki;
cin >> tumiki;
int count1 = 0;
int count2 = 0;
for (int i = 0; i < tumiki.size(); ++i) {
if (tumiki.at(i) == 0) {
count1++;
} else {
count2++;
}
}
int ans = min(count1, count2);
cout << ans * 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string tumiki;
cin >> tumiki;
int count1 = 0;
int count2 = 0;
for (int i = 0; i < tumiki.size(); ++i) {
if (tumiki.at(i) == '0') {
count1++;
} else {
count2++;
}
}
int ans = min(count1, count2);
cout << ans * 2 << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 916,951 | 916,952 | u605833494 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string tumiki;
cin >> tumiki;
int count1 = 0;
int count2 = 0;
for (int i = 0; i < tumiki.size(); ++i) {
if (tumiki[i] == 0) {
count1++;
} else {
count2++;
}
}
int ans = min(count1, count2);
cout << ans * 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string tumiki;
cin >> tumiki;
int count1 = 0;
int count2 = 0;
for (int i = 0; i < tumiki.size(); ++i) {
if (tumiki.at(i) == '0') {
count1++;
} else {
count2++;
}
}
int ans = min(count1, count2);
cout << ans * 2 << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 916,953 | 916,952 | u605833494 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0;
int b = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == '0') {
a++;
} else {
b++;
}
}
cout << min(a, b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0;
int b = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == '0') {
a++;
} else {
b++;
}
}
cout << min(a, b) * 2 << endl;
}
| [
"expression.operation.binary.add"
] | 916,954 | 916,955 | u991713078 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
int aka = 0;
int ao = 0;
string S;
cin >> S;
for (int X = 0; X < S.size(); X++) {
if (S.at(X) == 0) {
aka++;
} else {
ao++;
}
}
int tou = min(ao, aka);
cout << tou * 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int aka = 0;
int ao = 0;
string S;
cin >> S;
for (int X = 0; X < S.size(); X++) {
if (S.at(X) == '0') {
aka++;
} else {
ao++;
}
}
int tou = min(ao, aka);
cout << tou * 2 << endl;
} | [
"control_flow.branch.if.condition.change"
] | 916,956 | 916,957 | u740002394 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
int main() {
int aka = 0;
int ao = 0;
string S;
cin >> S;
for (int X = 0; X < S.size(); X++) {
if (S.at(X) = 0) {
aka++;
} else {
ao++;
}
}
int tou = min(ao, aka);
cout << tou * 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int aka = 0;
int ao = 0;
string S;
cin >> S;
for (int X = 0; X < S.size(); X++) {
if (S.at(X) == '0') {
aka++;
} else {
ao++;
}
}
int tou = min(ao, aka);
cout << tou * 2 << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 916,958 | 916,957 | u740002394 | cpp |
p03107 |
#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()
const ll INF = 1LL << 60;
int main() {
string s;
cin >> s;
int count0 = 0;
int count1 = 0;
int n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] == 0)
count0++;
else
count1++;
}
int ans = 2 * min(count0, count1);
cout << ans << endl;
} |
#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()
const ll INF = 1LL << 60;
int main() {
string s;
cin >> s;
int count0 = 0;
int count1 = 0;
int n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] == '0')
count0++;
else
count1++;
}
int ans = 2 * min(count0, count1);
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 916,963 | 916,964 | u412057008 | cpp |
p03107 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ll long long
#define pii pair<int, int>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
int inf = 1000001000;
ll INF = 100000000000000000;
ll MOD = 1000000007;
// g++ code.cpp ./a.out
int main() {
string s;
cin >> s;
int k1 = 0, k2 = 0;
rep(i, s.size()) {
if (s[i] == 0)
k1++;
else
k2++;
}
int ans = min(k1, k2);
cout << 2 * ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ll long long
#define pii pair<int, int>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
int inf = 1000001000;
ll INF = 100000000000000000;
ll MOD = 1000000007;
// g++ code.cpp ./a.out
int main() {
string s;
cin >> s;
int k1 = 0, k2 = 0;
rep(i, s.size()) {
if (s[i] == '0')
k1++;
else
k2++;
}
int ans = min(k1, k2);
cout << 2 * ans << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 916,971 | 916,972 | u510383220 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.