problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03145 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, value;
cin >> a >> b;
value = (a + b) / 2;
cout << value << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, value;
cin >> a >> b;
value = a * b / 2;
cout << value << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 943,253 | 943,254 | u415865011 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << A * B << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << A * B / 2 << endl;
}
| [
"expression.operation.binary.add"
] | 943,257 | 943,258 | u348914050 | cpp |
p03145 | #include <stdio.h>
int main(int atgc, char *argv[]) {
int c, a, b;
scanf("%d%d%d", &c, &a, &b);
printf("%d", c * a);
return 0;
}
| #include <stdio.h>
int main(int atgc, char *argv[]) {
int c, a, b;
scanf("%d%d%d", &c, &a, &b);
printf("%d", c * a / 2);
return 0;
}
| [
"expression.operation.binary.add"
] | 943,276 | 943,277 | u801102476 | cpp |
p03145 | #include <stdio.h>
int main() {
int c, a, b;
scanf("%d%d%d", &c, &a, &b);
printf("%d", c * a);
return 0;
} | #include <stdio.h>
int main() {
int c, a, b;
scanf("%d%d%d", &c, &a, &b);
printf("%d", c * a / 2);
return 0;
}
| [
"expression.operation.binary.add"
] | 943,279 | 943,280 | u801102476 | cpp |
p03145 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef long long unsigned int ll;
int main() {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
cout << cbrt(a * b * c) / 2 << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef long long unsigned int ll;
int main() {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
cout << (a * b) / 2 << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 943,289 | 943,290 | u032337012 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/*
// 配列の最大値を取得
int max = *max_element(vec.begin(), vec.end());
// 配列の最大値のイテレータを取得
vector<int>::iterator maxIt = max_element(vec.begin(), vec.end());
// 配列の最大値までの距離を取得
int maxIndex = distance(vec.begin(), maxIt);
// 隣り合う重複要素... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/*
// 配列の最大値を取得
int max = *max_element(vec.begin(), vec.end());
// 配列の最大値のイテレータを取得
vector<int>::iterator maxIt = max_element(vec.begin(), vec.end());
// 配列の最大値までの距離を取得
int maxIndex = distance(vec.begin(), maxIt);
// 隣り合う重複要素... | [
"call.remove",
"call.arguments.change"
] | 943,305 | 943,306 | u319234342 | cpp |
p03145 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / c << endl;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 943,307 | 943,308 | u394033362 | cpp |
p03145 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
return (a * b / 2);
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * b / 2);
return 0;
}
| [
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 943,335 | 943,336 | u051493691 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << (a + b) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 943,355 | 943,356 | u787972656 | cpp |
p03145 | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%d", a * b);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%d", a * b / 2);
return 0;
} | [
"expression.operation.binary.add"
] | 943,365 | 943,366 | u644100188 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 943,377 | 943,378 | u902428263 | cpp |
p03145 | #include <iostream>
int main() {
int ab, bc, ca;
std::cin >> ab >> bc >> ca;
std::cout << ab * bc << '\n';
return 0;
}
| #include <iostream>
int main() {
int ab, bc, ca;
std::cin >> ab >> bc >> ca;
std::cout << ab * bc / 2 << '\n';
return 0;
}
| [
"expression.operation.binary.add"
] | 943,384 | 943,385 | u901295506 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, AC, i;
cin >> AB >> BC >> AC;
i = AB * AC / 2;
cout << i;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, AC, i;
cin >> AB >> BC >> AC;
i = AB * BC / 2;
cout << i;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 943,478 | 943,479 | u810066979 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
int answer = a * b % 2;
cout << answer << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
int answer = a * b / 2;
cout << answer << endl;
} | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 943,535 | 943,536 | u068896454 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
int answer = a * b;
cout << answer << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
int answer = a * b / 2;
cout << answer << endl;
} | [
"assignment.change"
] | 943,537 | 943,536 | u068896454 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC << endl;
} | #include <iostream>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
} | [
"expression.operation.binary.add"
] | 943,542 | 943,543 | u448367673 | cpp |
p03145 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << (ab + bc) / 2 << endl;
} | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 943,554 | 943,555 | u170650966 | cpp |
p03145 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n;... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n;... | [
"expression.operation.binary.add"
] | 943,567 | 943,568 | u859396346 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * ca / 2;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 943,578 | 943,579 | u896807328 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
int S = ab * bc;
cout << S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
int S = (ab * bc) / 2;
cout << S << endl;
}
| [
"assignment.change"
] | 943,612 | 943,613 | u916256067 | cpp |
p03145 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int ab;
int bc;
int ca;
int ans;
cin >> ab;
cin >> bc;
cin >> ca;
ans = ab * bc;
cout << ans;
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int ab;
int bc;
int ca;
int ans;
cin >> ab;
cin >> bc;
cin >> ca;
ans = ab * bc / 2;
cout << ans;
return 0;
} | [
"assignment.change"
] | 943,616 | 943,617 | u231282396 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
// 整数の入力
int a, b, c;
cin >> a >> b >> c;
// スペース区切りの整数の入力
// 文字列の入力
cout << (a + b) / 2 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
// 整数の入力
int a, b, c;
cin >> a >> b >> c;
// スペース区切りの整数の入力
// 文字列の入力
cout << (a * b) / 2 << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 943,620 | 943,621 | u989274743 | cpp |
p03145 |
#include <cstdio>
int main() {
int c, a, b;
scanf("%d %d %d", &c, &a, &b);
printf("%d\n", c * b / 2);
return 0;
} |
#include <cstdio>
int main() {
int c, a, b;
scanf("%d %d %d", &c, &a, &b);
printf("%d\n", c * a / 2);
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 943,643 | 943,644 | u289709148 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| [
"expression.operation.binary.add"
] | 943,655 | 943,656 | u791146764 | cpp |
p03145 | #include <bits/stdc++.h>
/*
g++ -std=c++11 -Wall -g -fsanitize=undefined -D_GLIBCXX_DEBUG abc/abc116/a.cpp
*/
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SZ(x) ((int)(x).size())
#define INF (1e16)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false); //おま... | #include <bits/stdc++.h>
/*
g++ -std=c++11 -Wall -g -fsanitize=undefined -D_GLIBCXX_DEBUG abc/abc116/a.cpp
*/
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SZ(x) ((int)(x).size())
#define INF (1e16)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false); //おま... | [
"identifier.change",
"io.output.change"
] | 943,663 | 943,664 | u811561461 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
const int INF = 1 << 30, MOD = 1000000007;
const ll LINF = 1ll << 60;
#define _overload3(_1, _2, _3, name... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
const int INF = 1 << 30, MOD = 1000000007;
const ll LINF = 1ll << 60;
#define _overload3(_1, _2, _3, name... | [
"identifier.change",
"io.output.change"
] | 943,731 | 943,732 | u502709453 | cpp |
p03145 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a + b) / 2 << std::endl;
return 0;
} | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (a * b) / 2 << std::endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 943,749 | 943,750 | u108171020 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b / 2 << endl;
} | [
"expression.operation.binary.add"
] | 943,780 | 943,781 | u739259290 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
int S = ab * bc;
cout << S << endl;
} | #include <iostream>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
int S = ab * bc / 2;
cout << S << endl;
} | [
"assignment.change"
] | 943,801 | 943,802 | u000623733 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a, b, c;
cout << (a * b / 2);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b / 2);
return 0;
} | [] | 943,836 | 943,837 | u190462847 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a, b, c;
cout << a * b / 2;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b / 2);
return 0;
} | [] | 943,838 | 943,837 | u190462847 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << ((a + b) / 2) << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << ((a * b) / 2) << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 943,892 | 943,893 | u708117547 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int c, a, b;
cin >> c >> a >> b;
cout << c * a << endl;
}
| #include <iostream>
using namespace std;
int main() {
int c, a, b;
cin >> c >> a >> b;
cout << c * a / 2 << endl;
}
| [
"expression.operation.binary.add"
] | 943,900 | 943,901 | u468811760 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
ans = 1 / 2 * a * b;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
ans = a * b / 2;
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 943,913 | 943,914 | u018434698 | cpp |
p03145 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) % 2 << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 943,964 | 943,965 | u133142920 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (int I = int(A); I < int(B); ++I)
#define FORR(I, A, B) for (int I = int((B)-1); I >= int(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (int I = int(A); I < int(B); ++I)
#define FORR(I, A, B) for (int I = int((B)-1); I >= int(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#defi... | [
"identifier.change",
"io.output.change"
] | 943,976 | 943,977 | u780122303 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
if (N == 1 || N == 2 || N == 4) {
cout << 4 << endl;
}
int i = 1;
while (true) {
if (N % 2 == 1) {
N = 3 * N + 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
if (N == 1 || N == 2 || N == 4) {
cout << 4 << endl;
} else {
int i = 1;
while (true) {
if (N % 2 == 1) {
N = ... | [
"control_flow.branch.else.add"
] | 943,982 | 943,983 | u298972557 | cpp |
p03146 | /*
abc168 double dots
int main() {
int n,m;
cin >> n >> m;
Graph G(n);
rep(i,m){
int a,b;
cin >> a >> b;
--a;--b;
G[a].push_back(b);
G[b].push_back(a);
}
//BFSのためのデータ構造
vector<int>dist(n,-1);
queue<int>q;
vector<int>prev(n,-1);
//初期条件（頂点０を初期ノードとする
dist[0] = 0;
q.push(0);
... | /*
abc168 double dots
int main() {
int n,m;
cin >> n >> m;
Graph G(n);
rep(i,m){
int a,b;
cin >> a >> b;
--a;--b;
G[a].push_back(b);
G[b].push_back(a);
}
//BFSのためのデータ構造
vector<int>dist(n,-1);
queue<int>q;
vector<int>prev(n,-1);
//初期条件（頂点０を初期ノードとする
dist[0] = 0;
q.push(0);
... | [
"literal.number.change",
"io.output.change"
] | 943,994 | 943,995 | u037563046 | cpp |
p03146 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
const int INF = 1e9 + 1;
const int MOD = 2e9 + 9;
const ll LINF = 1e18;
using namespace std;
int main() {
int s;
int cnt = 0;
cin >> s;
vector<int> a(1000001);
a.at(0) = s;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
const int INF = 1e9 + 1;
const int MOD = 2e9 + 9;
const ll LINF = 1e18;
using namespace std;
int main() {
int s;
int cnt = 0;
cin >> s;
vector<int> a(1000001);
a.at(s) = 1;
... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 944,026 | 944,027 | u912678856 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
bool chk = false;
int A;
cin >> A;
vector<int> B(1000000);
B.at(0) = A;
int count = 0;
for (int i = 1; i < 10000001; i++) {
if (A % 2 == 0) {
A = A / 2;
B.at(i) = A;
count++;
} else {
A = 3 * A + 1;
B.at(i) = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
bool chk = false;
int A;
cin >> A;
vector<int> B(1000000);
B.at(0) = A;
int count = 0;
for (int i = 1; i < 10000001; i++) {
if (A % 2 == 0) {
A = A / 2;
B.at(i) = A;
count++;
} else {
A = 3 * A + 1;
B.at(i) = ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 944,028 | 944,029 | u977547071 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define _FastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define _FastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 944,030 | 944,031 | u958323734 | cpp |
p03146 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... | [
"assignment.change"
] | 944,040 | 944,041 | u983547593 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
set<int> s;
int now = n, cnt = 0;
while (!s.count(now)) {
cnt++;
s.insert(now);
if (now % 2)
now = 3 * now + 1;
else
now /= 2;
}
printf("%d\n", cnt);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
set<int> s;
int now = n, cnt = 0;
while (!s.count(now)) {
cnt++;
s.insert(now);
if (now % 2)
now = 3 * now + 1;
else
now /= 2;
}
printf("%d\n", cnt + 1);
}
return 0;
... | [
"expression.operation.binary.add"
] | 944,044 | 944,045 | u516708338 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
int main() {
int MAX_M = 1000003;
int s;
cin >> s;
int a[MAX_M];
rep(i, MAX_M) a[i] = 0;
a[s] = 1;
int ans;
rep(i, MAX_M) {
if (s % 2 == 1)
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
int main() {
int MAX_M = 1000003;
int s;
cin >> s;
int a[MAX_M];
rep(i, MAX_M) a[i] = 0;
a[s] = 1;
int ans;
rep(i, MAX_M) {
if (s % 2 == 1)
... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 944,049 | 944,050 | u933962236 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int X;
vector<int> A;
X = s;
A.push_back(s);
for (int i = 0; i < 100000000; i++) {
if (X % 2 == 0) {
X = X / 2;
A.push_back(X);
for (int j = 0; j < i; j++) {
if (A.at(j) == A.at(i + 1)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int X;
vector<int> A;
X = s;
A.push_back(s);
for (int i = 0; i < 100000000; i++) {
if (X % 2 == 0) {
X = X / 2;
A.push_back(X);
for (int j = 0; j < i; j++) {
if (A.at(j) == A.at(i)) {
cou... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 944,053 | 944,054 | u187417007 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int X;
vector<int> A;
X = s;
A.push_back(s);
for (int i = 0; i < 100000000; i++) {
if (X % 2 == 0) {
X = X / 2;
A.push_back(X);
for (int j = 0; j < X; j++) {
if (A.at(j) == A.at(i + 1)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int X;
vector<int> A;
X = s;
A.push_back(s);
for (int i = 0; i < 100000000; i++) {
if (X % 2 == 0) {
X = X / 2;
A.push_back(X);
for (int j = 0; j < i; j++) {
if (A.at(j) == A.at(i)) {
cou... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 944,055 | 944,054 | u187417007 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int X;
vector<int> A;
X = s;
A.push_back(s);
for (int i = 0; i < 100000000; i++) {
if (X % 2 == 0) {
X = X / 2;
A.push_back(X);
for (int j = 0; j < X; j++) {
if (A.at(j) == A.at(i)) {
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int X;
vector<int> A;
X = s;
A.push_back(s);
for (int i = 0; i < 100000000; i++) {
if (X % 2 == 0) {
X = X / 2;
A.push_back(X);
for (int j = 0; j < i; j++) {
if (A.at(j) == A.at(i)) {
cou... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"io.output.change"
] | 944,056 | 944,054 | u187417007 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int X;
vector<int> A;
X = s;
A.push_back(s);
for (int i = 0; i < 100000000; i++) {
if (X % 2 == 0) {
X = X / 2;
A.push_back(X);
for (int j = 0; j < X; j++) {
if (A.at(j) == A.at(i)) {
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int X;
vector<int> A;
X = s;
A.push_back(s);
for (int i = 0; i < 100000000; i++) {
if (X % 2 == 0) {
X = X / 2;
A.push_back(X);
for (int j = 0; j < i; j++) {
if (A.at(j) == A.at(i)) {
cou... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 944,057 | 944,054 | u187417007 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
if (s == 2 || s == 1) {
cout << 4 << endl;
return 0;
}
int i = 1;
while (s != 4) {
if (s % 2 == 0)
s /= 2;
else
s = s * 3 + 1;
i++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
if (s == 2 || s == 1) {
cout << 4 << endl;
return 0;
}
int i = 4;
while (s != 4) {
if (s % 2 == 0)
s /= 2;
else
s = s * 3 + 1;
i++;
}
cout << i << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 944,058 | 944,059 | u306482197 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int a[1000005];
int b[1000005];
int main() {
cin >> a[0];
int ans;
for (int i = 1; i < 1e6 + 1; i++) {
if (a[i - 1] % 2 == 0)
a[i] = a[i - 1] / 2;
else
a[i] = 3 * a[i - 1] + 1;
if (b[a[i]] > 0 || a[i] == a[0]) {
ans = i;
break;
... | #include <bits/stdc++.h>
using namespace std;
int a[1000005];
int b[1000005];
int main() {
cin >> a[0];
int ans;
for (int i = 1; i < 1e6 + 1; i++) {
if (a[i - 1] % 2 == 0)
a[i] = a[i - 1] / 2;
else
a[i] = 3 * a[i - 1] + 1;
if (b[a[i]] > 0 || a[i] == a[0]) {
ans = i;
break;
... | [
"expression.operation.binary.add"
] | 944,067 | 944,068 | u983681697 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
map<int, int> Map;
for (int i = 0; i < 1000000; i++) {
if (Map[s] > 0) {
cout << i + 1 << endl;
return 0;
}
Map[s]++;
if (s % 2 == 0) {
s /= 2;
} else {
s += s * 3 + 1;
}
}
cout << s <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
map<int, int> Map;
for (int i = 0; i < 1000000; i++) {
if (Map[s] > 0) {
cout << i + 1 << endl;
return 0;
}
Map[s]++;
if (s % 2 == 0) {
s /= 2;
} else {
s += s * 2 + 1;
}
}
cout << s <... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 944,075 | 944,076 | u237390401 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long i = 1;
if (n == 1 || n == 2)
cout << 4;
while (1) {
if (n == 4) {
cout << i + 3;
return 0;
}
if (n % 2 == 0)
n /= 2;
else
n = n * 3 + 1;
i++;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long i = 1;
if (n == 1 || n == 2) {
cout << 4;
return 0
;
}
while (1) {
if (n == 4) {
cout << i + 3;
return 0;
}
if (n % 2 == 0)
n /= 2;
else
n = n * 3 + 1;
i++... | [
"control_flow.return.add",
"function.return_value.change"
] | 944,093 | 944,094 | u222643545 | cpp |
p03146 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
int main() {
int s;
cin >> s;
set<int> a;
a.insert(s);
int n = s;
for (int i = 2; i < 1000001; i++) {
if (n % 2 == 0)
n /= 2;
else
n = 3 * n + 1;
if (a.count(n)) {
cout << n << endl;
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
int main() {
int s;
cin >> s;
set<int> a;
a.insert(s);
int n = s;
for (int i = 2; i < 1000001; i++) {
if (n % 2 == 0)
n /= 2;
else
n = 3 * n + 1;
if (a.count(n)) {
cout << i << endl;
... | [
"identifier.change",
"io.output.change"
] | 944,095 | 944,096 | u109191542 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a(1000000);
a.at(0) = s;
int i = 1;
while (1) {
if (s % 2 == 0) {
s = s / 2;
auto result = find(a.begin() + 1, a.end(), s);
if (result != a.end()) {
cout << i + 1 << endl;
return 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a(1000000);
a.at(0) = s;
int i = 1;
while (1) {
if (s % 2 == 0) {
s = s / 2;
auto result = find(a.begin(), a.end(), s);
if (result != a.end()) {
cout << i + 1 << endl;
return 0;
... | [
"expression.operation.binary.remove"
] | 944,109 | 944,110 | u552331659 | cpp |
p03146 | #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... | #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... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 944,121 | 944,122 | u946082956 | cpp |
p03146 | #include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define per(i, a, b) for (ll i = a; i >= b; i--)
using namespace std;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
int main() {
// ifstream cin("input.txt");
ll n;
cin >> n;
int c = 1;
... | #include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define per(i, a, b) for (ll i = a; i >= b; i--)
using namespace std;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
int main() {
// ifstream cin("input.txt");
ll n;
cin >> n;
int c = 1;
... | [
"control_flow.loop.condition.change"
] | 944,135 | 944,136 | u847929893 | cpp |
p03146 | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int s;
scanf("%d", &s);
vector<int> a = {s};
int m = 2;
while (1) {
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
for (int i = a.size(); i > 0; i--) {
if (a[i] == s) {
... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int s;
scanf("%d", &s);
vector<int> a = {s};
int m = 2;
while (1) {
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
// cout << m << " " << s << endl;
for (int i = a.size(); i > 0... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 944,142 | 944,143 | u684448032 | cpp |
p03146 | //#pragma GCC optimize "trapv"
//-D_GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define ii pair<int, int>
#define Max 100000 + 5
#define IO ... | //#pragma GCC optimize "trapv"
//-D_GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define ii pair<int, int>
#define Max 100000 + 5
#define IO ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 944,163 | 944,164 | u532535081 | cpp |
p03146 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int prev = n;
int cnt = 2;
if (n == 1 or n == 2 or n == 4) {
cout << 3 << '\n';
return 0;
}
while (true) {
int value;
if (pr... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int prev = n;
int cnt = 2;
if (n == 1 or n == 2 or n == 4) {
cout << 4 << '\n';
return 0;
}
while (true) {
int value;
if (pr... | [
"literal.number.change",
"io.output.change"
] | 944,169 | 944,170 | u963667945 | cpp |
p03146 | #include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <vector>
typedef long long ll;
using namespace std;
void saiki(ll &c, int tmp, map<ll, ll> m) {
if (tmp % 2 == 0) {
tmp = tmp / 2;
} else {
tmp = 3 * tmp + 1;
}
if (m.count(tmp))
return;
m[tmp] = 1;
c = c + 1;
sai... | #include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <vector>
typedef long long ll;
using namespace std;
void saiki(ll &c, int tmp, map<ll, ll> m) {
if (tmp % 2 == 0) {
tmp = tmp / 2;
} else {
tmp = 3 * tmp + 1;
}
if (m.count(tmp))
return;
m[tmp] = 1;
c = c + 1;
sai... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 944,171 | 944,172 | u456303471 | cpp |
p03146 | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 944,177 | 944,178 | u931901821 | cpp |
p03146 | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.unary.add",
"expression.operation.binary.remove"
] | 944,177 | 944,179 | u931901821 | cpp |
p03146 | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_m... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 944,180 | 944,181 | u931901821 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
long long m = 1000000;
vector<int> a(m);
a[0] = s;
for (int i = 1; i < m; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
}
if (a[i - 1] % 2 == 1) {
a[i] = 3 * a[i - 1] + 1;
}
for (int j = 0; j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
long long m = 1000001;
vector<int> a(m);
a[0] = s;
for (int i = 1; i < m; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
}
if (a[i - 1] % 2 == 1) {
a[i] = 3 * a[i - 1] + 1;
}
for (int j = 0; j ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 944,192 | 944,193 | u759465878 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
long long m = 1000000;
vector<int> a(m);
a[0] = s;
for (int i = 1; i < m; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
}
if (a[i - 1] % 2 == 1) {
a[i] = 3 * a[i - 1] + 1;
}
for (int j = 0; j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
long long m = 1000001;
vector<int> a(m);
a[0] = s;
for (int i = 1; i < m; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
}
if (a[i - 1] % 2 == 1) {
a[i] = 3 * a[i - 1] + 1;
}
for (int j = 0; j ... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 944,194 | 944,193 | u759465878 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
long long m = 1000000;
vector<int> a(m);
a[0] = s;
for (int i = 1; i < m; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
}
if (a[i - 1] % 2 == 1) {
a[i] = 2 * a[i - 1] + 1;
}
for (int j = 0; j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
long long m = 1000001;
vector<int> a(m);
a[0] = s;
for (int i = 1; i < m; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
}
if (a[i - 1] % 2 == 1) {
a[i] = 3 * a[i - 1] + 1;
}
for (int j = 0; j ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 944,195 | 944,193 | u759465878 | cpp |
p03143 |
#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(), YES, NO))
#define ECHO OUT(solve())
#define three(A, B, C) ((A) ? (B) : (C))
#define FOR(i, a, b) for (LL i = (a); i < (LL)(b); i++)
#define EFOR(i, a, b) for (LL i = (a); i <= (LL)(b); i++)
#define RFOR(i, a, b) for (LL i = (b... |
#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(), YES, NO))
#define ECHO OUT(solve())
#define three(A, B, C) ((A) ? (B) : (C))
#define FOR(i, a, b) for (LL i = (a); i < (LL)(b); i++)
#define EFOR(i, a, b) for (LL i = (a); i <= (LL)(b); i++)
#define RFOR(i, a, b) for (LL i = (b... | [
"call.arguments.add"
] | 944,200 | 944,201 | u295617748 | cpp |
p03143 | #include <algorithm>
#include <functional>
#include <set>
#include <stdio.h>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, k, n, m, h, w, a, b, sum = 0, ans = 0;
scanf("%lld%lld", &n, &m);
ll x[n];
pair<ll, pair<ll, ll>> e[m];
for (i = 0; i < n; ++i... | #include <algorithm>
#include <functional>
#include <set>
#include <stdio.h>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, k, n, m, h, w, a, b, sum = 0, ans = 0;
scanf("%lld%lld", &n, &m);
ll x[n];
pair<ll, pair<ll, ll>> e[m];
for (i = 0; i < n; ++i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 944,202 | 944,203 | u440920318 | cpp |
p03143 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, M;
vector<pair<ll, pll>> jv;
ll ct[101010];
ll i, j, ans;
ll mk[1010... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, M;
vector<pair<ll, pll>> jv;
ll ct[101010];
ll i, j, ans;
ll mk[1010... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 944,209 | 944,210 | u259396003 | cpp |
p03144 | // #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ =
// malloc(size);void * stack_extend_origin_memory_;char *
// stack_extend_dummy_memory_ = (char*)alloca((1+(i... | // #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ =
// malloc(size);void * stack_extend_origin_memory_;char *
// stack_extend_dummy_memory_ = (char*)alloca((1+(i... | [
"expression.operation.binary.add"
] | 944,230 | 944,231 | u648138491 | cpp |
p03144 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define poly vector<ll>
#define sqr(x) ((x) * (x))
#define mp make_pair
inline char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define poly vector<ll>
#define sqr(x) ((x) * (x))
#define mp make_pair
inline char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 944,241 | 944,242 | u910444501 | cpp |
p03144 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define poly vector<ll>
#define sqr(x) ((x) * (x))
#define mp make_pair
inline char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define poly vector<ll>
#define sqr(x) ((x) * (x))
#define mp make_pair
inline char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
... | [
"type_conversion.add"
] | 944,241 | 944,243 | u910444501 | cpp |
p03144 | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef long double ld;
typedef unsigned long long ul... | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef long double ld;
typedef unsigned long long ul... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change",
"call.arguments.change"
] | 944,246 | 944,247 | u953484888 | cpp |
p03144 | // includes {{{
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<bitset>
// #include<cstring>
// #inclu... | // includes {{{
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<bitset>
// #include<cstring>
// #inclu... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 944,248 | 944,249 | u884379688 | cpp |
p03145 | #include <stdio.h>
int main() {
int A;
int B;
int C;
scanf("%d %d %d", &A, &B, &C);
printf("%d", B * C / 2);
return 0;
} | #include <stdio.h>
int main() {
int A;
int B;
int C;
scanf("%d %d %d", &A, &B, &C);
printf("%d", A * B / 2);
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 944,279 | 944,280 | u089230684 | cpp |
p03145 | #include <stdio.h>
int main() {
int a;
int b;
int c;
scanf("%d %d %d", &a, &b, &c);
int l = a * b;
printf("%d", l);
return 0;
} | #include <stdio.h>
int main() {
int a;
int b;
int c;
scanf("%d %d %d", &a, &b, &c);
int l = (a * b) / 2;
printf("%d", l);
return 0;
} | [
"assignment.change"
] | 944,281 | 944,282 | u816631826 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | [
"identifier.change",
"io.output.change"
] | 944,294 | 944,295 | u722640678 | cpp |
p03146 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
int s;
cin >> s;
if (s == 1 or s == 2 or s == 4) {
cout << 3 << endl;
return 0;
}
for (int i = 0;; i++) {
if (s % 2 == 0)
s /= 2;
else... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
int s;
cin >> s;
if (s == 1 or s == 2 or s == 4) {
cout << 4 << endl;
return 0;
}
for (int i = 0;; i++) {
if (s % 2 == 0)
s /= 2;
else... | [
"literal.number.change",
"io.output.change"
] | 944,314 | 944,315 | u201553784 | cpp |
p03146 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
int s;
cin >> s;
if (s == 1 or s == 2 or s == 4) {
cout << 4 << endl;
return 0;
}
for (int i = 0;; i++) {
if (s % 2 == 0)
s /= 2;
else... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
int s;
cin >> s;
if (s == 1 or s == 2 or s == 4) {
cout << 4 << endl;
return 0;
}
for (int i = 0;; i++) {
if (s % 2 == 0)
s /= 2;
else... | [
"literal.number.change",
"io.output.change"
] | 944,316 | 944,315 | u201553784 | cpp |
p03146 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
int s;
cin >> s;
if (s == 1 or s == 2 or s == 4) {
cout << 4 << endl;
return 0;
}
for (int i = 0;; i++) {
if (s % 2 == 0)
s /= 2;
else... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
int s;
cin >> s;
if (s == 1 or s == 2 or s == 4) {
cout << 4 << endl;
return 0;
}
for (int i = 0;; i++) {
if (s % 2 == 0)
s /= 2;
else... | [
"literal.number.change",
"io.output.change"
] | 944,317 | 944,315 | u201553784 | cpp |
p03146 | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int a[1000] = {};
a[0] = s;
for (int i = 1; i < 1000; i++) {
if (a[i] % 2 == 0) {
a[i] = a[i - 1] / 2;
} else {
a[i] = a[i - 1] * 3 + 1;
}
for (int j = 0; j <= i; j++) {
if (a[i] == a[j] && i != j) {
... | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int a[1000] = {};
a[0] = s;
for (int i = 1; i < 1000; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
} else {
a[i] = a[i - 1] * 3 + 1;
}
for (int j = 0; j <= i; j++) {
if (a[i] == a[j] && i != j) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 944,321 | 944,322 | u056912761 | cpp |
p03146 | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int a[10000] = {};
a[0] = s;
for (int i = 1; i < 1000; i++) {
if (a[i] % 2 == 0) {
a[i] = a[i - 1] / 2;
} else {
a[i] = a[i - 1] * 3 + 1;
}
for (int j = 0; j <= i; j++) {
if (a[i] == a[j] && i != j) {
... | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int a[1000] = {};
a[0] = s;
for (int i = 1; i < 1000; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
} else {
a[i] = a[i - 1] * 3 + 1;
}
for (int j = 0; j <= i; j++) {
if (a[i] == a[j] && i != j) {
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 944,323 | 944,322 | u056912761 | cpp |
p03146 | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
long long int a[1000000000] = {};
a[0] = s;
for (int i = 1; i < 1000; i++) {
if (a[i] % 2 == 0) {
a[i] = a[i - 1] / 2;
} else {
a[i] = a[i - 1] * 3 + 1;
}
for (int j = 0; j <= i; j++) {
if (a[i] == a[j] &&... | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int a[1000] = {};
a[0] = s;
for (int i = 1; i < 1000; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
} else {
a[i] = a[i - 1] * 3 + 1;
}
for (int j = 0; j <= i; j++) {
if (a[i] == a[j] && i != j) {
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 944,324 | 944,322 | u056912761 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, k = 0;
cin >> s;
vector<int> t(10000000);
t.at(0) = s;
for (int i = 1; i < 10000000; i++) {
if (t.at(i - 1) % 2 == 0)
t.at(i) = t.at(i - 1) / 2;
else
t.at(i) = 3 * t.at(i - 1) + 1;
for (int j = 0; j < i; j++) {
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, k = 0;
cin >> s;
vector<int> t(10000000);
t.at(0) = s;
for (int i = 1; i < 10000000; i++) {
if (t.at(i - 1) % 2 == 0)
t.at(i) = t.at(i - 1) / 2;
else
t.at(i) = 3 * t.at(i - 1) + 1;
for (int j = 0; j < i; j++) {
i... | [
"expression.operation.binary.add"
] | 944,325 | 944,326 | u646051775 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int count = 0;
while (true) {
count++;
if (s == 1 || s == 2 || s == 4) {
cout << count + 4 << endl;
break;
} else {
if (s % 2 == 0) {
s = s / 2;
} else {
s = 3 * s + 1;
}
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int count = 0;
while (true) {
count++;
if (s == 1 || s == 2 || s == 4) {
cout << count + 3 << endl;
break;
} else {
if (s % 2 == 0) {
s = s / 2;
} else {
s = 3 * s + 1;
}
}... | [
"literal.number.change",
"io.output.change"
] | 944,327 | 944,328 | u646051775 | cpp |
p03146 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
using namespace std;
signed main() {
ll n, i = 1;
cin >> n;
map<ll, ll> mp;
while (true) {
mp[n]++;
if (mp[n] == 2) {
cout << i + 1 << "\n";
return 0;
}
if (n % 2 == 0) {
n /= 2;
} el... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
using namespace std;
signed main() {
ll n, i = 1;
cin >> n;
map<ll, ll> mp;
while (true) {
mp[n]++;
if (mp[n] == 2) {
cout << i << "\n";
return 0;
}
if (n % 2 == 0) {
n /= 2;
} else {... | [
"expression.operation.binary.remove"
] | 944,329 | 944,330 | u652908807 | cpp |
p03146 | #include <iostream>
#include <set>
using namespace std;
int f(int);
int main() {
int s;
set<int> a_s;
a_s.insert(s);
int prev_size = a_s.size();
int curr_size;
int a = s;
int count = 1;
while (1) {
a = f(a);
a_s.insert(a);
count++;
curr_size = a_s.size();
if (prev_size == curr_siz... | #include <iostream>
#include <set>
using namespace std;
int f(int);
int main() {
int s;
cin >> s;
set<int> a_s;
a_s.insert(s);
int prev_size = a_s.size();
int curr_size;
int a = s;
int count = 1;
while (1) {
a = f(a);
a_s.insert(a);
count++;
curr_size = a_s.size();
if (prev_size... | [] | 944,333 | 944,334 | u236540805 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
if (s == 2) {
cout << "5" << endl;
return 0;
}
vector<int> A(1000001);
A.at(0) = s;
for (int i = 0; i < 1000000; i++) {
if (A.at(i) % 2 == 0) {
A.at(i + 1) = A.at(i) / 2;
} else {
A.at(i + 1) = 3 * A.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
if (s == 2) {
cout << "4" << endl;
return 0;
}
vector<int> A(1000001);
A.at(0) = s;
for (int i = 0; i < 1000000; i++) {
if (A.at(i) % 2 == 0) {
A.at(i + 1) = A.at(i) / 2;
} else {
A.at(i + 1) = 3 * A.a... | [
"literal.string.change",
"io.output.change"
] | 944,335 | 944,336 | u776280752 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int a = s, b = 2;
while (a > 1) {
if (a % 2 == 0) {
a /= 2;
} else {
a = 3 * a + 1;
}
b++;
}
if (s == 1 && s == 2 && s == 4) {
cout << "4" << endl;
} else {
cout << b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int a = s, b = 2;
while (a > 1) {
if (a % 2 == 0) {
a /= 2;
} else {
a = 3 * a + 1;
}
b++;
}
if (s == 1 || s == 2 || s == 4) {
cout << "4" << endl;
} else {
cout << b << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 944,341 | 944,342 | u158290747 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
map<int, int> m;
m[s]++;
int count = 0;
while (m[s] < 2) {
if (s % 2 == 0) {
s = s / 2;
} else {
s = 3 * s + 1;
}
count++;
m[s]++;
}
cout << count;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
map<int, int> m;
m[s]++;
int count = 1;
while (m[s] < 2) {
if (s % 2 == 0) {
s = s / 2;
} else {
s = 3 * s + 1;
}
count++;
m[s]++;
}
cout << count;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 944,356 | 944,357 | u203979694 | cpp |
p03146 | #include <iostream>
#include <map>
using namespace std;
int f(int n) {
if (n % 2 == 0)
return n / 2;
else
3 * n + 1;
}
int main() {
map<int, bool> used;
int s;
cin >> s;
used[s] = true;
int n = 1;
while (!used[f(s)]) {
s = f(s);
used[s] = true;
n++;
}
cout << ++n << endl;
} | #include <iostream>
#include <map>
using namespace std;
int f(int n) {
if (n % 2 == 0)
return n / 2;
else
return 3 * n + 1;
}
int main() {
map<int, bool> used;
int s;
cin >> s;
used[s] = true;
int n = 1;
while (!used[f(s)]) {
s = f(s);
used[s] = true;
n++;
}
cout << ++n << endl... | [
"control_flow.return.add"
] | 944,365 | 944,366 | u858670323 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int s;
cin >> s;
int ans = 0;
while (s != 1 && s != 2 && s != 4) {
ans++;
if (s % 2 == 0) {
s = s / 2;
} else {
s = 3 * s + 1;
}
}
cout << ans + 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int s;
cin >> s;
int ans = 0;
while (s != 1 && s != 2 && s != 4) {
ans++;
if (s % 2 == 0) {
s = s / 2;
} else {
s = 3 * s + 1;
}
}
cout << ans + 4 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 944,369 | 944,370 | u093973314 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | [
"expression.operation.binary.remove"
] | 944,379 | 944,380 | u584787460 | cpp |
p03146 | #include <bits/stdc++.h>
#define pb push_back
typedef long long ll;
typedef long double la;
using namespace std;
int main() {
int s;
cin >> s;
vector<int> b;
if (s == 1) {
cout << '4' << endl;
return 0;
}
b.pb(s);
while (1) {
if (s % 2 == 0) {
b.pb(s / 2);
s = s / 2;
} else {
... | #include <bits/stdc++.h>
#define pb push_back
typedef long long ll;
typedef long double la;
using namespace std;
int main() {
int s;
cin >> s;
vector<int> b;
if (s == 1 || s == 2) {
cout << '4' << endl;
return 0;
}
b.pb(s);
while (1) {
if (s % 2 == 0) {
b.pb(s / 2);
s = s / 2;
... | [
"control_flow.branch.if.condition.change"
] | 944,387 | 944,388 | u663075270 | cpp |
p03138 | #include <bits/stdc++.h>
#define re return
#define ll long long
#define ull unsigned ll
#define ld long double
#define f first
#define s second
#define pi acos(-1)
#define oo (ll)1e9
#define OO 1e18
#define EPS 1e-6
#define Endl '\n'
#define FX(n) fixed << setprecision(n)
#define mm(o, k) memset(o, k, sizeof o)
#define... | #include <bits/stdc++.h>
#define re return
#define ll long long
#define ull unsigned ll
#define ld long double
#define f first
#define s second
#define pi acos(-1)
#define oo (ll)1e9
#define OO 1e18
#define EPS 1e-6
#define Endl '\n'
#define FX(n) fixed << setprecision(n)
#define mm(o, k) memset(o, k, sizeof o)
#define... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"misc.off_by_one"
] | 944,401 | 944,402 | u775315680 | cpp |
p03138 | #include <bits/stdc++.h>
#define re return
#define ll long long
#define ull unsigned ll
#define ld long double
#define f first
#define s second
#define pi acos(-1)
#define oo (ll)1e9
#define OO 1e18
#define EPS 1e-6
#define Endl '\n'
#define FX(n) fixed << setprecision(n)
#define mm(o, k) memset(o, k, sizeof o)
#define... | #include <bits/stdc++.h>
#define re return
#define ll long long
#define ull unsigned ll
#define ld long double
#define f first
#define s second
#define pi acos(-1)
#define oo (ll)1e9
#define OO 1e18
#define EPS 1e-6
#define Endl '\n'
#define FX(n) fixed << setprecision(n)
#define mm(o, k) memset(o, k, sizeof o)
#define... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 944,403 | 944,402 | u775315680 | cpp |
p03138 | #include <bits/stdc++.h>
#define re return
#define ll long long
#define ull unsigned ll
#define ld long double
#define f first
#define s second
#define pi acos(-1)
#define oo (ll)1e9
#define OO 1e18
#define EPS 1e-6
#define Endl '\n'
#define FX(n) fixed << setprecision(n)
#define mm(o, k) memset(o, k, sizeof o)
#define... | #include <bits/stdc++.h>
#define re return
#define ll long long
#define ull unsigned ll
#define ld long double
#define f first
#define s second
#define pi acos(-1)
#define oo (ll)1e9
#define OO 1e18
#define EPS 1e-6
#define Endl '\n'
#define FX(n) fixed << setprecision(n)
#define mm(o, k) memset(o, k, sizeof o)
#define... | [
"call.arguments.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 944,404 | 944,402 | u775315680 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, k, a[100008], x, x_modify, ans;
int main() {
cin >> n >> k;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
x = 0;
ll digit = 0;
for (ll j = 0; j <= 40; j++) {
if (k & (1LL <<... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, k, a[100008], x, x_modify, ans;
int main() {
cin >> n >> k;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
x = 0;
ll digit = 0;
for (ll j = 0; j <= 40; j++) {
if (k & (1LL <<... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 944,412 | 944,413 | u388697579 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, k, a[100008], x, x_modify, ans;
int main() {
cin >> n >> k;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
x = 0;
ll digit = 0;
for (ll j = 0; j <= 40; j++) {
if (k & (1LL <<... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, k, a[100008], x, x_modify, ans;
int main() {
cin >> n >> k;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
x = 0;
ll digit = 0;
for (ll j = 0; j <= 40; j++) {
if (k & (1LL <<... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"variable_declaration.value.change... | 944,414 | 944,413 | u388697579 | cpp |
p03138 | /////////////////////////////////////////////////////////
//
// c/temp.cpp file
// Last Updated: 2018-10-23 ...Maybe
//
// I hope you adding this code to the setting file
// alias g++='g++ -std=c++1y -DDEBUG_LOCAL'
//
/////////////////////////////////////////////////////////
#include <bits/stdc++.h>
using nam... | /////////////////////////////////////////////////////////
//
// c/temp.cpp file
// Last Updated: 2018-10-23 ...Maybe
//
// I hope you adding this code to the setting file
// alias g++='g++ -std=c++1y -DDEBUG_LOCAL'
//
/////////////////////////////////////////////////////////
#include <bits/stdc++.h>
using nam... | [
"call.add",
"call.arguments.add"
] | 944,424 | 944,425 | u657913472 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.