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 |
|---|---|---|---|---|---|---|---|
p03138 | #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, K, A[101010];
ll Kp;
ll i, j, xa[100], xan, ans;
bool grdy(ll k, ll... | #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, K, A[101010];
ll Kp;
ll i, j, xa[100], xan, ans;
bool grdy(ll k, ll... | [
"expression.operation.binary.remove"
] | 944,426 | 944,427 | u259396003 | cpp |
p03138 | #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, K, A[101010];
ll Kp;
ll i, j, x, ans;
int main() {
scanf("%lld%lld... | #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, K, A[101010];
ll Kp;
ll i, j, x, ans;
int main() {
scanf("%lld%lld... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 944,428 | 944,429 | u259396003 | cpp |
p03138 | #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, K, A[101010];
ll Kp;
ll i, j, x, ans;
int main() {
scanf("%lld%lld... | #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, K, A[101010];
ll Kp;
ll i, j, x, ans;
int main() {
scanf("%lld%lld... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 944,430 | 944,429 | u259396003 | cpp |
p03138 | #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, K, A[101010];
ll Kp;
ll i, j, x, ans;
int main() {
scanf("%lld%lld... | #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, K, A[101010];
ll Kp;
ll i, j, x, ans;
int main() {
scanf("%lld%lld... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 944,431 | 944,432 | u259396003 | cpp |
p03138 | #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, K, A[101010];
ll Kp;
ll i, j, x, ans;
int main() {
scanf("%lld%lld... | #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, K, A[101010];
ll Kp;
ll i, j, x, ans;
int main() {
scanf("%lld%lld... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 944,433 | 944,432 | u259396003 | cpp |
p03138 | #include <bitset>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> A(N);
int bit[40] = {};
for (int i = 0; i < N; ++i) {
cin >> A[i];
bitset<40> B(A[i]);
for (int j = 0; j < 40; ++j) {
bit[j] += !B.test(j);
}
}
long X = 0... | #include <bitset>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> A(N);
int bit[40] = {};
for (int i = 0; i < N; ++i) {
cin >> A[i];
bitset<40> B(A[i]);
for (int j = 0; j < 40; ++j) {
bit[j] += !B.test(j);
}
}
long X = 0... | [] | 944,440 | 944,441 | u031178961 | cpp |
p03138 | #include <bitset>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> A(N);
int bit[40] = {};
for (int i = 0; i < N; ++i) {
cin >> A[i];
bitset<40> B(A[i]);
for (int j = 0; j < 40; ++j) {
bit[j] += !B.test(j);
}
}
long X = 0... | #include <bitset>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> A(N);
int bit[40] = {};
for (int i = 0; i < N; ++i) {
cin >> A[i];
bitset<40> B(A[i]);
for (int j = 0; j < 40; ++j) {
bit[j] += !B.test(j);
}
}
long X = 0... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 944,442 | 944,441 | u031178961 | cpp |
p03138 | #include <iostream>
#include <vector>
using namespace std;
#define MAX_BIT 60
uint64_t f(uint64_t x, const vector<uint64_t> &a) {
uint64_t sum = 0;
for (auto &a_i : a) {
sum += a_i ^ x;
}
return sum;
}
int main() {
uint64_t n, k;
cin >> n >> k;
vector<vector<int>> a_bit(n);
vector<uint64_t> a(n);... | #include <iostream>
#include <vector>
using namespace std;
#define MAX_BIT 60
uint64_t f(uint64_t x, const vector<uint64_t> &a) {
uint64_t sum = 0;
for (auto &a_i : a) {
sum += a_i ^ x;
}
return sum;
}
int main() {
uint64_t n, k;
cin >> n >> k;
vector<vector<int>> a_bit(n);
vector<uint64_t> a(n);... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 944,451 | 944,452 | u841641310 | cpp |
p03138 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[42][2] = {};
for (int i = 0; i < 42; i++)
dp[i][1] = -1;
for (int i = 40; i >= 0; i--) {
int c0 = 0, c1 = 0;
for (... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[42][2] = {};
for (int i = 0; i < 42; i++)
dp[i][1] = -1;
for (int i = 40; i >= 0; i--) {
int c0 = 0, c1 = 0;
for (... | [
"call.add",
"call.arguments.change"
] | 944,453 | 944,454 | u984730891 | cpp |
p03138 | #include <algorithm>
#include <complex>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<... | #include <algorithm>
#include <complex>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 944,455 | 944,456 | u852158538 | cpp |
p03138 | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
int main() {
int n, cnt;
ll k, a[100000], x[40], b[40] = {}, two[40], ans = 0, c;
scanf("%d %lld", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
two[0] = 1;
for (int i = 1; i < 40; i++) {
two[i] = 2 ... | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
int main() {
int n, cnt;
ll k, a[100000], x[40], b[40] = {}, two[40], ans = 0, c;
scanf("%d %lld", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
two[0] = 1;
for (int i = 1; i < 40; i++) {
two[i] = 2 ... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 944,461 | 944,462 | u855429581 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll Solve() {
ll n, k;
cin >> n >> k;
int len = log2(k) + 1;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] != 0)
len = max(len, (int)log2(a[i]) + 1);
}
vector<ll> sum(len + 1);
vector<vector<ll>>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll Solve() {
ll n, k;
cin >> n >> k;
int len = log2(k) + 1;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] != 0)
len = max(len, (int)log2(a[i]) + 1);
}
vector<ll> sum(len + 1);
vector<vector<ll>>... | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 944,463 | 944,464 | u090097090 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll Solve() {
ll n, k;
cin >> n >> k;
int len = log2(k) + 1;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] != 0)
len = max(len, (int)log2(a[i]) + 1);
}
vector<ll> sum(len + 1);
vector<vector<ll>>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll Solve() {
ll n, k;
cin >> n >> k;
int len = log2(k) + 1;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] != 0)
len = max(len, (int)log2(a[i]) + 1);
}
vector<ll> sum(len + 1);
vector<vector<ll>>... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 944,465 | 944,464 | u090097090 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll Solve() {
ll n, k;
cin >> n >> k;
int len = log2(k) + 1;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] != 0)
len = max(len, (int)log2(a[i]) + 1);
}
vector<ll> sum(len + 1);
vector<vector<ll>>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll Solve() {
ll n, k;
cin >> n >> k;
int len = log2(k) + 1;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] != 0)
len = max(len, (int)log2(a[i]) + 1);
}
vector<ll> sum(len + 1);
vector<vector<ll>>... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 944,466 | 944,464 | u090097090 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <... | [
"control_flow.branch.if.condition.change"
] | 944,467 | 944,468 | u516353059 | cpp |
p03138 | #include <bits/stdc++.h>
#define REP(i, a, n) for (int i = (a); i < (int)(n); ++i)
#define REPC(i, a, n) for (int i = (a); i <= (int)(n); ++i)
#define ALL(t) t.begin(), t.end()
#define RALL(t) t.rbegin(), t.rend()
#define MATINIT(type, row, col, init) \
vector<vector<type>>(ro... | #include <bits/stdc++.h>
#define REP(i, a, n) for (int i = (a); i < (int)(n); ++i)
#define REPC(i, a, n) for (int i = (a); i <= (int)(n); ++i)
#define ALL(t) t.begin(), t.end()
#define RALL(t) t.rbegin(), t.rend()
#define MATINIT(type, row, col, init) \
vector<vector<type>>(ro... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 944,471 | 944,472 | u094534482 | cpp |
p03138 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
void read(ll &a) {
a = 0;
int b = 1, c = getchar();
while (c > '9' || c < '0') {
if (c == '-')
b = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
a = (a << 3) + (a << 1) + c - 48, c = getchar();
a *= b;
}
const int N = 1... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
void read(ll &a) {
a = 0;
int b = 1, c = getchar();
while (c > '9' || c < '0') {
if (c == '-')
b = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
a = (a << 3) + (a << 1) + c - 48, c = getchar();
a *= b;
}
const int N = 1... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 944,475 | 944,476 | u955678262 | cpp |
p03138 | #include <stdio.h>
int N;
long long K;
long long A[100000];
long long C[40][2];
long long max(long long x, long long y) { return x > y ? x : y; }
int main() {
scanf("%d %lld", &N, &K);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
for (int j = 0; j < 40; j++) {
C[j][A[i] >> j & 1]++;
}
... | #include <stdio.h>
int N;
long long K;
long long A[100000];
long long C[40][2];
long long max(long long x, long long y) { return x > y ? x : y; }
int main() {
scanf("%d %lld", &N, &K);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
for (int j = 0; j < 40; j++) {
C[j][A[i] >> j & 1]++;
}
... | [
"assignment.change"
] | 944,481 | 944,482 | u006493569 | cpp |
p03138 | #include <iostream>
#include <vector>
using namespace std;
int main() {
long n, k;
cin >> n >> k;
vector<long> a(n);
for (auto &e : a)
cin >> e;
long res = 0;
for (long i; i = k & -k; k -= i) {
long x = k - i;
for (int j = 0; (1L << j) < i; ++j) {
int c = 0;
for (auto &e : a)
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long n, k;
cin >> n >> k;
vector<long> a(n);
for (auto &e : a)
cin >> e;
long res = 0;
++k;
for (long i; i = k & -k; k -= i) {
long x = k - i;
for (int j = 0; (1L << j) < i; ++j) {
int c = 0;
for (auto &e : a... | [
"expression.unary.arithmetic.add"
] | 944,487 | 944,488 | u503549962 | cpp |
p03138 | #include <iostream>
#include <vector>
using namespace std;
int main() {
long n, k;
cin >> n >> k;
vector<long> a(n);
for (auto &e : a)
cin >> e;
long res = 0;
auto t = ++k;
for (int i; i = k & -k; k -= i) {
long x = t - i;
for (int j = 0; (1L << j) < i; ++j) {
int c = 0;
for (aut... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long n, k;
cin >> n >> k;
vector<long> a(n);
for (auto &e : a)
cin >> e;
long res = 0;
++k;
for (long i; i = k & -k; k -= i) {
long x = k - i;
for (int j = 0; (1L << j) < i; ++j) {
int c = 0;
for (auto &e : a... | [
"variable_declaration.remove",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"identifier.change",
"expression.operation.binary.change"
] | 944,489 | 944,488 | u503549962 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
#define REP(i, n, m) for (int i = n; i < m; i++)
#define REPR(i, n, m) for (int i = n; i >= m; i--)
#define LREP(i, n, m) for (ll i = n; i < m; i++)
#define LREPR(i, n, m) for (ll i = n; i >= m; i--)
#define P pair<int, int>
const int INF =... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
#define REP(i, n, m) for (int i = n; i < m; i++)
#define REPR(i, n, m) for (int i = n; i >= m; i--)
#define LREP(i, n, m) for (ll i = n; i < m; i++)
#define LREPR(i, n, m) for (ll i = n; i >= m; i--)
#define P pair<int, int>
const int INF =... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 944,493 | 944,494 | u052746401 | cpp |
p03138 | // need
#include <algorithm>
#include <iostream>
// data structure
#include <bitset>
#include <complex>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <deque>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <v... | // need
#include <algorithm>
#include <iostream>
// data structure
#include <bitset>
#include <complex>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <deque>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <v... | [
"identifier.change",
"call.function.change"
] | 944,495 | 944,496 | u591343832 | cpp |
p03138 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const double EPS = 1e-10;
int main() {
ll n, k;
ll an = 0;
ll an2 = 0;
cin >> n >> k;
vec... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const double EPS = 1e-10;
int main() {
ll n, k;
ll an = 0;
ll an2 = 0;
cin >> n >> k;
vec... | [
"assignment.add"
] | 944,497 | 944,498 | u569367525 | cpp |
p03138 | #include <iostream>
using namespace std;
long foo[50] = {0};
void count(long num, long pos) {
if (num == 0)
return;
if (num % 2 == 1)
foo[pos]++;
count(num / 2, pos + 1);
}
long shift(long K, long keta) {
if (keta == 0)
return K;
return shift(K * 2, keta - 1);
}
long unshift(long K, long keta... | #include <iostream>
using namespace std;
long foo[50] = {0};
void count(long num, long pos) {
if (num == 0)
return;
if (num % 2 == 1)
foo[pos]++;
count(num / 2, pos + 1);
}
long shift(long K, long keta) {
if (keta == 0)
return K;
return shift(K * 2, keta - 1);
}
long unshift(long K, long keta... | [
"control_flow.branch.if.condition.change"
] | 944,502 | 944,503 | u995792346 | cpp |
p03138 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define INF 1e+18
#define MOD 1000000007
using namespace std... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define INF 1e+18
#define MOD 1000000007
using namespace std... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 944,504 | 944,505 | u251433890 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
typedef pair<P, int> PI;
void solve() {
long long int N, K;
cin >> N >> K;
vector<long long int> A(N);
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
typedef pair<P, int> PI;
void solve() {
long long int N, K;
cin >> N >> K;
vector<long long int> A(N);
... | [
"variable_declaration.value.change"
] | 944,509 | 944,510 | u057619905 | cpp |
p03138 | #include "bits/stdc++.h"
using namespace std;
long long dp[45], NoCond[45];
void PreProcess(long long Num) {
int pos = 0;
while (Num) {
if (Num % 2LL == 1LL)
++dp[pos];
++pos;
Num = Num / 2LL;
}
}
int MostSignificant(long long Num) {
int pos = -1;
while (Num) {
++pos;
Num = Num /... | #include "bits/stdc++.h"
using namespace std;
long long dp[45], NoCond[45];
void PreProcess(long long Num) {
int pos = 0;
while (Num) {
if (Num % 2LL == 1LL)
++dp[pos];
++pos;
Num = Num / 2LL;
}
}
int MostSignificant(long long Num) {
int pos = -1;
while (Num) {
++pos;
Num = Num /... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove"
] | 944,511 | 944,512 | u843106258 | cpp |
p03138 |
#include "bits/stdc++.h"
using namespace std;
long long dp[45], NoCond[45];
void PreProcess(long long Num) {
int pos = 0;
while (Num) {
if (Num % 2LL == 1LL)
++dp[pos];
++pos;
Num = Num / 2LL;
}
}
int MostSignificant(long long Num) {
int pos = -1;
while (Num) {
++pos;
Num = Num ... | #include "bits/stdc++.h"
using namespace std;
long long dp[45], NoCond[45];
void PreProcess(long long Num) {
int pos = 0;
while (Num) {
if (Num % 2LL == 1LL)
++dp[pos];
++pos;
Num = Num / 2LL;
}
}
int MostSignificant(long long Num) {
int pos = -1;
while (Num) {
++pos;
Num = Num /... | [
"expression.operation.binary.remove"
] | 944,513 | 944,512 | u843106258 | cpp |
p03138 | /*
Author: @karngyan
Team: BlundersPride
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef std::vector<ll> vll;
typedef std::pair<ll, ll> pll;
typedef std::vector<vll> vvll;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define end... | /*
Author: @karngyan
Team: BlundersPride
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef std::vector<ll> vll;
typedef std::pair<ll, ll> pll;
typedef std::vector<vll> vvll;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define end... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.unary.arithmetic.add"
] | 944,517 | 944,518 | u863090510 | cpp |
p03138 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"literal.number.type.widen.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 944,519 | 944,520 | u898651494 | cpp |
p03138 | #include <cstdint>
#include <iostream>
using namespace std; // 575
const int MAX = 100000;
const int64_t MAX2 = 1099511627776; // 2^40
int main() {
int N;
int64_t K, A[MAX];
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> A[i];
int64_t
dp1 = 0,
dp2 =
0; // bitDP,
// d... | #include <cstdint>
#include <iostream>
using namespace std; // 575
const int MAX = 100000;
const int64_t MAX2 = 1099511627776; // 2^40
int main() {
int N;
int64_t K, A[MAX];
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> A[i];
int64_t
dp1 = 0,
dp2 =
0; // bitDP,
// d... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 944,523 | 944,524 | u550314572 | cpp |
p03138 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> an;
for (long i = 0; i < N; i++) {
long tmp = 0;
cin >> tmp;
an.push_back(tmp);
}
long bitCount[65] = {};
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> an;
for (long i = 0; i < N; i++) {
long tmp = 0;
cin >> tmp;
an.push_back(tmp);
}
long bitCount[65] = {};
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 944,538 | 944,539 | u751964641 | cpp |
p03138 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> an;
for (long i = 0; i < N; i++) {
long tmp = 0;
cin >> tmp;
an.push_back(tmp);
}
long bitCount[65] = {};
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> an;
for (long i = 0; i < N; i++) {
long tmp = 0;
cin >> tmp;
an.push_back(tmp);
}
long bitCount[65] = {};
... | [
"control_flow.branch.if.condition.change"
] | 944,540 | 944,539 | u751964641 | cpp |
p03138 | #include <iostream>
#include <stdio.h>
#define Re register int
#define LL long long
int N, M, cnt[45][2];
LL K, X, A[100005], ans;
template <typename T> inline void read(T &var) {
T x = 0;
int w = 0;
char ch = 0;
while (!isdigit(ch))
w |= ch == '-', ch = getchar();
while (isdigit(ch))
x = x * 10 + c... | #include <iostream>
#include <stdio.h>
#define Re register int
#define LL long long
int N, M, cnt[45][2];
LL K, X, A[100005], ans;
template <typename T> inline void read(T &var) {
T x = 0;
int w = 0;
char ch = 0;
while (!isdigit(ch))
w |= ch == '-', ch = getchar();
while (isdigit(ch))
x = x * 10 + c... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 944,543 | 944,544 | u394337458 | cpp |
p03138 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
using usize = unsigned int;
using u64 = unsigned long long;
static constexpr u64 Max = static_cast<u64>(1) << 40;
usize n;
u64 k;
::std::cin >> n >> k;
::std::vector<u64> a(n);
for (auto &e : a)
::std::cin >> e;
u64 x = 0, ... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
using usize = unsigned int;
using u64 = unsigned long long;
static constexpr u64 Max = static_cast<u64>(1) << 40;
usize n;
u64 k;
::std::cin >> n >> k;
::std::vector<u64> a(n);
for (auto &e : a)
::std::cin >> e;
u64 x = 0, ... | [] | 944,553 | 944,554 | u708618797 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265359
int main() {
int N = 100;
vector<int> a(N, 0);
cin >> a[0];
int mini = 10000000;
for (int i = 1; i < N; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
} else {
a[i] = 3 * a[i - 1] + 1;
}
for (int j = 0; j ... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265359
int main() {
int N = 10000;
vector<int> a(N, 0);
cin >> a[0];
int mini = 10000000;
for (int i = 1; i < N; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
} else {
a[i] = 3 * a[i - 1] + 1;
}
for (int j = 0; ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 944,561 | 944,562 | u231455327 | cpp |
p03146 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int f(int m) {
if (m % 2 == 0)
return m / 2;
else
return 3 * m + 1;
}
int main() {
int s, a[1000000];
cin >> s;
a[0] = s;
for (int i = 1; i < 1000000; i++) {
a[i]... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int f(int m) {
if (m % 2 == 0)
return m / 2;
else
return 3 * m + 1;
}
int main() {
int s, a[1000000];
cin >> s;
a[0] = s;
for (int i = 1; i < 1000000; i++) {
a[i]... | [
"expression.operation.binary.add"
] | 944,563 | 944,564 | u120050685 | cpp |
p03146 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int f(int m) {
if (m % 2 == 0)
return m / 2;
else
return 3 * m + 1;
}
int main() {
int s, a[1000000];
cin >> s;
a[0] = s;
for (int i = 1; i < 1000000; i++) {
a[i]... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int f(int m) {
if (m % 2 == 0)
return m / 2;
else
return 3 * m + 1;
}
int main() {
int s, a[1000000];
cin >> s;
a[0] = s;
for (int i = 1; i < 1000000; i++) {
a[i]... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 944,565 | 944,564 | u120050685 | cpp |
p03146 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int f(int m) {
if (m % 2 == 0)
return m / 2;
else
return 3 * m + 1;
}
int main() {
int s, a[1000000];
cin >> s;
a[0] = s;
for (int i = 1; i < 1000000; i++) {
a[i]... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int f(int m) {
if (m % 2 == 0)
return m / 2;
else
return 3 * m + 1;
}
int main() {
int s, a[1000000];
cin >> s;
a[0] = s;
for (int i = 1; i < 1000000; i++) {
a[i]... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 944,566 | 944,564 | u120050685 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int s;
cin >> s;
set<int> st;
int x = s;
int cnt = 0;
while (st.count(x) == 0) {
cnt++;
st.insert(x);
if (x % 2 == 0)
x /= 2;
else
x = 3 * x + 1;
}
cout << cnt << endl;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int s;
cin >> s;
set<int> st;
int x = s;
int cnt = 1;
while (st.count(x) == 0) {
cnt++;
st.insert(x);
if (x % 2 == 0)
x /= 2;
else
x = 3 * x + 1;
}
cout << cnt << endl;... | [
"literal.number.change",
"variable_declaration.value.change"
] | 944,569 | 944,570 | u726957641 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int s;
cin >> s;
vector<int> f(1000000);
f.at(0) = s;
rep(i, 1000000) {
if (f.at(i) % 2 == 0)
f.at(i + 1) = f.at(i) / 2;
else
f.at(i + 1) = 3 * f.at(i) + 1;
}
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int s;
cin >> s;
vector<int> f(1000000);
f.at(0) = s;
rep(i, 1000000 - 1) {
if (f.at(i) % 2 == 0)
f.at(i + 1) = f.at(i) / 2;
else
f.at(i + 1) = 3 * f.at(i) + 1;
}
for (int i = 0; ... | [
"expression.operation.binary.add"
] | 944,571 | 944,572 | u726957641 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
int counter = 0;
if (A == 1 || A == 2) {
cout << 4 << endl;
} else {
while (A != 4) {
if (A % 2 == 0) {
A /= 2;
} else {
A = A * 3 + 1;
}
counter++;
}
}
cout << (counter + 4) <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
int counter = 0;
if (A == 1 || A == 2) {
cout << 4 << endl;
} else {
while (A != 4) {
if (A % 2 == 0) {
A /= 2;
} else {
A = A * 3 + 1;
}
counter++;
}
cout << (counter + 4) << e... | [] | 944,577 | 944,578 | u325294447 | cpp |
p03146 | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
int main(void) {
int s;
cin >> s;
vector<int> a(1000000);
a[0] = s;
for (int i = 1; i < 1000000; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
} else {
a[i] = 3 * a[i - 1] + 1;
}
}... | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
int main(void) {
int s;
cin >> s;
vector<int> a(1000000);
a[0] = s;
for (int i = 1; i <= 1000000; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
} else {
a[i] = 3 * a[i - 1] + 1;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_declaration.value.change",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change"
] | 944,591 | 944,592 | u027946359 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int fff(int a) {
int rt;
if (a % 2 == 1) {
rt = 3 * a + 1;
} else {
rt = a / 2;
}
return rt;
}
int main() {
int s;
cin >> s;
int bb = 0;
vector<int> m(10000, 0);
m.at(0) = s;
for (int i = 1; i < 10001; i++) {
m.at(i) = fff(m.at(i - 1));
... | #include <bits/stdc++.h>
using namespace std;
int fff(int a) {
int rt;
if (a % 2 == 1) {
rt = 3 * a + 1;
} else {
rt = a / 2;
}
return rt;
}
int main() {
int s;
cin >> s;
int bb = 0;
vector<int> m(10000, 0);
m.at(0) = s;
for (int i = 1; i < 10001; i++) {
m.at(i) = fff(m.at(i - 1));
... | [
"expression.operation.binary.add"
] | 944,595 | 944,596 | u323864528 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int count = 0;
while (s > 4 || s == 3) {
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
count++;
}
cout << count + 3 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int count = 1;
while (s > 4 || s == 3) {
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
count++;
}
cout << count + 3 << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 944,599 | 944,600 | u629548179 | cpp |
p03146 | #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 + 1; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof... | #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 + 1; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof... | [
"literal.number.change",
"variable_declaration.value.change"
] | 944,601 | 944,602 | u635381086 | cpp |
p03146 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a;
a.push_back(s);
for (int i = 1;; i++) {
if (a.at(i - 1) % 2 == 0)
a.push_back(a.at(i - 1) / 2);
else
a.push_back(3 * a.at(i - 1) + 1);
for (int j = 0; j < i; j++) {
if (a.at(... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a;
a.push_back(s);
for (int i = 1;; i++) {
if (a.at(i - 1) % 2 == 0)
a.push_back(a.at(i - 1) / 2);
else
a.push_back(3 * a.at(i - 1) + 1);
for (int j = 0; j < i; j++) {
if (a.at(... | [
"expression.operation.binary.add"
] | 944,605 | 944,606 | u660112829 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
set<int> st;
while (st.count(a) != 0) {
st.insert(a);
if (a % 2 == 0)
a /= 2;
else {
a = a * 3 + 1;
}
}
cout << st.size() + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
set<int> st;
while (st.count(a) == 0) {
st.insert(a);
if (a % 2 == 0)
a /= 2;
else {
a = a * 3 + 1;
}
}
cout << st.size() + 1 << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 944,616 | 944,617 | u613960672 | cpp |
p03146 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | [
"literal.number.change",
"io.output.change"
] | 944,632 | 944,633 | u978109511 | cpp |
p03146 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | [
"literal.number.change",
"io.output.change",
"control_flow.return.add"
] | 944,634 | 944,633 | u978109511 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int curr;
cin >> curr;
map<int, int> m;
m[curr] = 1;
int i = 0;
while (true) {
i++;
if (curr & 1)
curr = (3 * curr) + 1;
else
curr *= 2;
m[curr]++;
if (m[curr] == 2)
return cout << i, 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int curr;
cin >> curr;
map<int, int> m;
m[curr] = 1;
int i = 1;
while (true) {
i++;
if (curr & 1)
curr = (3 * curr) + 1;
else
curr /= 2;
m[curr]++;
if (m[curr] == 2)
return cout << i, 0;
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.change"
] | 944,671 | 944,672 | u901813121 | cpp |
p03146 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
void solve() {
int s;
cin >> s;
int i = 1;
vector<int> a;
a.push_back(s);
while (true) {
int tmp;
if (a[i - 1] % 2 == 0) {
tmp = a[i - 1] / 2;
} else {
tmp = 3 * a[... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
void solve() {
int s;
cin >> s;
int i = 1;
vector<int> a;
a.push_back(s);
// cout << "0: " << s << endl;
while (true) {
int tmp;
if (a[i - 1] % 2 == 0) {
tmp = a[i - 1] / 2... | [
"identifier.change",
"io.output.change"
] | 944,681 | 944,682 | u008078348 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"literal.number.change"
] | 944,691 | 944,692 | u347057617 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"literal.number.change"
] | 944,693 | 944,692 | u347057617 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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() {
int N;
cin >> N;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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() {
int N;
cin >> N;
... | [
"expression.operation.binary.remove"
] | 944,694 | 944,695 | u822169805 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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() {
int N;
cin >> N;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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() {
int N;
cin >> N;
... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 944,696 | 944,695 | u822169805 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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() {
int N;
cin >> N;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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() {
int N;
cin >> N;
... | [
"literal.number.change",
"call.arguments.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 944,697 | 944,695 | u822169805 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll INF = 1LL << 60;
const ll MOD = (ll)1e9 + 7;
int main() {
int n;
cin >> n;
map<int, int> m;
m[n] = 1;
for (int i = 2;; i++) {
if (n % 2 == 0)
n /= 2;
else
n = n * 3 + 1;
if (m[n] > 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll INF = 1LL << 60;
const ll MOD = (ll)1e9 + 7;
int main() {
int n;
cin >> n;
map<int, int> m;
m[n] = 1;
for (int i = 2;; i++) {
if (n % 2 == 0)
n /= 2;
else
n = n * 3 + 1;
if (m[n] > 0... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 944,698 | 944,699 | u422029490 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int num;
vector<int> a(10000005);
a[0] = S;
int num2;
if (S == 2) {
num = 3;
} else if (S == 1) {
num = 3;
} else {
for (int i = 0; i < 1000005; ++i) {
if (a[i] % 2 == 0) {
a[i + 1] = a[i] / 2;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int num;
vector<int> a(10000005);
a[0] = S;
int num2;
if (S == 2) {
num = 4;
} else if (S == 1) {
num = 4;
} else {
for (int i = 0; i < 1000005; ++i) {
if (a[i] % 2 == 0) {
a[i + 1] = a[i] / 2;
... | [
"literal.number.change",
"assignment.value.change"
] | 944,706 | 944,707 | u091026689 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | [
"literal.number.change",
"call.arguments.change"
] | 944,716 | 944,717 | u530107518 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | [
"literal.number.change",
"call.arguments.change"
] | 944,718 | 944,717 | u530107518 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int s;
cin >> s;
int ans;
int v[100] = {0};
v[s]++;
for (int i = 1;; i++) {
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
if (v[s] == 0)
v[s]++;
else {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int s;
cin >> s;
int ans;
int v[1000000] = {0};
v[s]++;
for (int i = 1;; i++) {
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
if (v[s] == 0)
v[s]++;
else {... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 944,721 | 944,722 | u561143568 | cpp |
p03146 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int s;
cin >> s;
vector<ll> sv(101);
unordered_set<ll> us;
sv[1] = s;
us.emplace(s);
ll ans = 0;
for (ll i = 2; i <= 1000000; ++i) {
if (sv[i - 1] %... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int s;
cin >> s;
vector<ll> sv(1000005);
unordered_set<ll> us;
sv[1] = s;
us.emplace(s);
ll ans = 0;
for (ll i = 2; i <= 1000000; ++i) {
if (sv[i - ... | [
"literal.number.change",
"call.arguments.change"
] | 944,723 | 944,724 | u620269708 | cpp |
p03146 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int s;
cin >> s;
vector<int> sv(101);
unordered_set<int> us;
sv[1] = s;
us.emplace(s);
ll ans = 0;
for (ll i = 2; i <= 1000000; ++i) {
if (sv[i - 1]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int s;
cin >> s;
vector<ll> sv(1000005);
unordered_set<ll> us;
sv[1] = s;
us.emplace(s);
ll ans = 0;
for (ll i = 2; i <= 1000000; ++i) {
if (sv[i - ... | [
"literal.number.change",
"call.arguments.change"
] | 944,725 | 944,724 | u620269708 | cpp |
p03146 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int s;
cin >> s;
vector<int> sv(101);
unordered_set<int> us;
sv[1] = s;
us.emplace(s);
ll ans = 0;
for (int i = 2; i <= 1000000; ++i) {
if (sv[i - 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int s;
cin >> s;
vector<ll> sv(1000005);
unordered_set<ll> us;
sv[1] = s;
us.emplace(s);
ll ans = 0;
for (ll i = 2; i <= 1000000; ++i) {
if (sv[i - ... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 944,726 | 944,724 | u620269708 | cpp |
p03146 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int s;
cin >> s;
vector<int> sv(101);
unordered_set<int> us;
sv[1] = s;
us.emplace(s);
int ans = 0;
for (int i = 2; i <= 1000000; ++i) {
if (sv[i - ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int s;
cin >> s;
vector<ll> sv(1000005);
unordered_set<ll> us;
sv[1] = s;
us.emplace(s);
ll ans = 0;
for (ll i = 2; i <= 1000000; ++i) {
if (sv[i - ... | [
"literal.number.change",
"call.arguments.change",
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 944,727 | 944,724 | u620269708 | cpp |
p03146 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int s;
cin >> s;
vector<int> sv(101);
unordered_set<int> us;
sv[1] = s;
us.emplace(s);
int ans = 0;
for (int i = 2; i <= 10000000; ++i) {
if (sv[i -... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int s;
cin >> s;
vector<ll> sv(1000005);
unordered_set<ll> us;
sv[1] = s;
us.emplace(s);
ll ans = 0;
for (ll i = 2; i <= 1000000; ++i) {
if (sv[i - ... | [
"literal.number.change",
"call.arguments.change",
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 944,728 | 944,724 | u620269708 | cpp |
p03146 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> ss(1000001);
ss[0] = s;
for (int i = 1; i < 1000001; i++) {
if (ss[i - 1] % 2 == 0) {
ss[i] = ss[i - 1] / 2;
} else if (ss[i - 1] % 2 != 0) {
ss[i] = ss[i - 1] * ... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> ss(1000001);
ss[0] = s;
for (int i = 1; i < 1000001; i++) {
if (ss[i - 1] % 2 == 0) {
ss[i] = ss[i - 1] / 2;
} else if (ss[i - 1] % 2 != 0) {
ss[i] = ss[i - 1] * ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 944,732 | 944,733 | u904995051 | cpp |
p03146 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> ss(1000001);
ss[0] = s;
for (int i = 1; i < 1000001; i++) {
if (ss[i - 1] % 2 == 0) {
ss[i] = ss[i - 1] / 2;
} else if (ss[i - 1] % 2 != 0) {
ss[i] = ss[i - 1] *... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> ss(1000001);
ss[0] = s;
for (int i = 1; i < 1000001; i++) {
if (ss[i - 1] % 2 == 0) {
ss[i] = ss[i - 1] / 2;
} else if (ss[i - 1] % 2 != 0) {
ss[i] = ss[i - 1] * ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 944,734 | 944,733 | u904995051 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> x(10000);
x[0] = n;
for (int i = 1; i < 10000; i++) {
if (n % 2 == 0) {
n /= 2;
} else {
n = 3 * n + 1;
}
for (int j = 0; j < i; j++) {
if (n == x[j]) {
cout << i << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> x(10000);
x[0] = n;
for (int i = 1; i < 10000; i++) {
if (n % 2 == 0) {
n /= 2;
} else {
n = 3 * n + 1;
}
for (int j = 0; j < i; j++) {
if (n == x[j]) {
cout << i + 1 << endl;
... | [
"expression.operation.binary.add"
] | 944,742 | 944,743 | u503170128 | cpp |
p03146 | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ull> vu;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef... | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ull> vu;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef... | [
"literal.number.change"
] | 944,744 | 944,745 | u519883882 | cpp |
p03146 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int findIndex(vector<int> vec, int value) {
vector<int>::iterator iter = std::find(vec.begin(), vec.end(), value);
size_t index = distance(vec.begin(), iter);
if (index == vec.size()) {
return -1;
}
return index;
}
int main... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int findIndex(vector<int> vec, int value) {
vector<int>::iterator iter = std::find(vec.begin(), vec.end(), value);
size_t index = distance(vec.begin(), iter);
if (index == vec.size()) {
return -1;
}
return index;
}
int main... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.add"
] | 944,758 | 944,759 | u900267897 | cpp |
p03146 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int findIndex(vector<int> vec, int value) {
vector<int>::iterator iter = std::find(vec.begin(), vec.end(), value);
size_t index = distance(vec.begin(), iter);
if (index == vec.size()) {
return -1;
}
return index;
}
int main... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int findIndex(vector<int> vec, int value) {
vector<int>::iterator iter = std::find(vec.begin(), vec.end(), value);
size_t index = distance(vec.begin(), iter);
if (index == vec.size()) {
return -1;
}
return index;
}
int main... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.add"
] | 944,760 | 944,759 | u900267897 | cpp |
p03146 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long int __lcm(long long int a, long long int b) {
long long int n;
n = a * b / __gcd(a, b);
return n;
}
//__gcd 最大公約数
//__lcm 最小公倍数
int main() {
int a;
cin >> a;
if (a == 1)
cout << 3;
else if (a == 2)
cout << 3;
else {
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long int __lcm(long long int a, long long int b) {
long long int n;
n = a * b / __gcd(a, b);
return n;
}
//__gcd 最大公約数
//__lcm 最小公倍数
int main() {
int a;
cin >> a;
if (a == 1)
cout << 4;
else if (a == 2)
cout << 4;
else {
... | [
"literal.number.change",
"io.output.change"
] | 944,773 | 944,774 | u191594139 | cpp |
p03146 | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int a = s, ans = 1;
int h[1000000] = {};
while (h[a] == 0) {
h[a] = 1;
if (a % 2 != 0) {
a = a * 3 + 1;
} else {
a = a / 2;
}
ans++;
}
cout << ans + 1 << endl;
}
| #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int a = s, ans = 1;
int h[1000000] = {};
while (h[a] == 0) {
h[a] = 1;
if (a % 2 != 0) {
a = a * 3 + 1;
} else {
a = a / 2;
}
ans++;
}
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 944,779 | 944,780 | u930705402 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, num;
cin >> s;
vector<int> a(101);
int tmp = s;
a[tmp]++;
for (int i = 1;; i++) {
if (tmp % 2 == 0)
tmp /= 2;
else
tmp = 3 * tmp + 1;
a[tmp]++;
if (a[tmp] == 2) {
cout << i + 1;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, num;
cin >> s;
vector<int> a(1000001);
int tmp = s;
a[tmp]++;
for (int i = 1;; i++) {
if (tmp % 2 == 0)
tmp /= 2;
else
tmp = 3 * tmp + 1;
a[tmp]++;
if (a[tmp] == 2) {
cout << i + 1;
return 0;
}
... | [
"literal.number.change",
"call.arguments.change"
] | 944,781 | 944,782 | u710135612 | cpp |
p03146 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int S;
long ANS;
vector<int> A;
cin >> S;
A.push_back(S);
for (long i = 1;; i++) {
if (A[i - 1] % 2 == 0) {
A.push... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int S;
long ANS;
vector<int> A;
cin >> S;
A.push_back(S);
for (long i = 1;; i++) {
if (A[i - 1] % 2 == 0) {
A.push... | [
"assignment.change"
] | 944,783 | 944,784 | u230139835 | cpp |
p03146 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int S, ANS;
vector<int> A;
cin >> S;
A.push_back(S);
for (long i = 1;; i++) {
if (A[i - 1] % 2 == 0) {
A.push_back(A... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int S;
long ANS;
vector<int> A;
cin >> S;
A.push_back(S);
for (long i = 1;; i++) {
if (A[i - 1] % 2 == 0) {
A.push... | [
"variable_declaration.type.widen.change",
"assignment.change"
] | 944,785 | 944,784 | u230139835 | cpp |
p03146 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
... | [] | 944,790 | 944,791 | u700484101 | cpp |
p03146 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
... | [
"call.arguments.add"
] | 944,792 | 944,791 | u700484101 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int s, f, n;
vector<int> a;
cin >> s;
a.push_back(s);
for (int i = 0; i < 100; i++) {
if (a[i] % 2 == 0) {
f = a[i] / 2;
} else {
f = 3 * a[i] + 1;
}
a.push_back(f);
for (i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int s, f, n;
vector<int> a;
cin >> s;
a.push_back(s);
for (int i = 0; i < 1000; i++) {
if (a[i] % 2 == 0) {
f = a[i] / 2;
} else {
f = 3 * a[i] + 1;
}
a.push_back(f);
for (... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 944,795 | 944,796 | u591779169 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a = {s};
while (true) {
int ai;
if (a.back() % 2 == 0) {
ai = a.back() / 2;
} else {
ai = a.back() * 3 + 1;
}
for (int i = 0; i < a.size(); i++) {
if (a.at(i) == ai) {
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a = {s};
while (true) {
int ai;
if (a.back() % 2 == 0) {
ai = a.back() / 2;
} else {
ai = a.back() * 3 + 1;
}
for (int i = 0; i < a.size(); i++) {
if (a.at(i) == ai) {
cout ... | [
"expression.operation.binary.add"
] | 944,811 | 944,812 | u732546570 | cpp |
p03146 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int s;
cin >> s;
int ans;
if (s == 1 || s == 2 || s == 4)
ans = 4;
else {
int cnt = 0;
int tmp = s;
while (tmp != 4) {
if (tmp & 1) {
tmp = tmp * 3 + 1;
cnt++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int s;
cin >> s;
int ans;
if (s == 1 || s == 2 || s == 4)
ans = 4;
else {
int cnt = 0;
int tmp = s;
while (tmp != 4) {
if (tmp & 1) {
tmp = tmp * 3 + 1;
cnt++;
... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 944,822 | 944,823 | u506858457 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, ans = 1;
cin >> s;
while (!(s == 1 || s == 2 || s == 4)) {
if (s % 2 == 0) {
s /= 2;
} else {
s = s * 3 + 1;
}
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, ans = 1;
cin >> s;
while (!(s == 1 || s == 2 || s == 4)) {
if (s % 2 == 0) {
s /= 2;
} else {
s = s * 3 + 1;
}
ans++;
}
cout << ans + 3 << endl;
} | [
"expression.operation.binary.add"
] | 944,824 | 944,825 | u028572059 | cpp |
p03146 | #include <iostream>
#include <vector>
using namespace std;
int F(int n) {
if (n % 2) {
return n / 2;
} else {
return n * 3 + 1;
}
}
int main() {
int s;
cin >> s;
vector<int> vct;
vct.push_back(s);
int i = 1;
while (true) {
vct.push_back(F(vct[i - 1]));
for (int checkI = 0; checkI < i... | #include <iostream>
#include <vector>
using namespace std;
int F(int n) {
if (n % 2 == 0) {
return n / 2;
} else {
return n * 3 + 1;
}
}
int main() {
int s;
cin >> s;
vector<int> vct;
vct.push_back(s);
int i = 1;
while (true) {
vct.push_back(F(vct[i - 1]));
for (int checkI = 0; check... | [
"control_flow.branch.if.condition.change"
] | 944,832 | 944,833 | u460401508 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 944,837 | 944,838 | u322177979 | cpp |
p03146 | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
int main(void) {
int a[100000];
cin >> a[0];
rep(i, 100000) {
if (a[i - 1] % 2 == 0)
a[i] = a[i - 1] / 2;
else
a[i] = 3 * a[i - 1] + 1;
for (int ... | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
int main(void) {
int a[100000];
cin >> a[0];
rep(i, 100000) {
if (a[i - 1] % 2 == 0)
a[i] = a[i - 1] / 2;
else
a[i] = 3 * a[i - 1] + 1;
for (int ... | [
"expression.operation.binary.add"
] | 944,877 | 944,878 | u895536055 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[1000000];
cin >> a[0];
int s;
for (int i = 0; i < 1000000; ++i) {
if (a[i] % 2 == 0)
a[i + 1] = a[i] / 2;
else
a[i + 1] = 3 * a[i] + 1;
bool b = 0;
for (int j = 0; j < i; ++j) {
if (a[j] == a[i + 1]) {
s ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[1000000];
cin >> a[0];
int s;
for (int i = 0; i < 1000000; ++i) {
if (a[i] % 2 == 0)
a[i + 1] = a[i] / 2;
else
a[i + 1] = 3 * a[i] + 1;
bool b = 0;
for (int j = 0; j < i; ++j) {
if (a[j] == a[i + 1]) {
s ... | [
"assignment.add"
] | 944,879 | 944,880 | u757584836 | cpp |
p03146 | #include <iostream>
using namespace std;
int main() {
int a[100000], i, j;
cin >> a[0];
for (i = 0;; i++) {
if (a[i] % 2 == 0)
a[i + 1] = a[i] / 2;
else
a[i + 1] = 3 * a[i] + 1;
for (j = 0; j < i + 1; j++) {
if (a[i + 1] == a[j]) {
cout << i + 1;
return 0;
}
... | #include <iostream>
using namespace std;
int main() {
int a[100000], i, j;
cin >> a[0];
for (i = 0;; i++) {
if (a[i] % 2 == 0)
a[i + 1] = a[i] / 2;
else
a[i + 1] = 3 * a[i] + 1;
for (j = 0; j < i + 1; j++) {
if (a[i + 1] == a[j]) {
cout << i + 2;
return 0;
}
... | [
"literal.number.change",
"io.output.change"
] | 944,902 | 944,903 | u340494803 | cpp |
p03146 | #include <iostream>
using namespace std;
int main() {
int a[100000], i, j;
cin >> a[0];
for (i = 0;; i++) {
if (a[i] % 2 == 0)
a[i + 1] = a[i] / 2;
else
a[i + 1] = 3 * a[i] + 1;
for (j = 0; j < i + 1; j++) {
if (a[i + 1] == a[j]) {
cout << i + 1;
break;
}
}
... | #include <iostream>
using namespace std;
int main() {
int a[100000], i, j;
cin >> a[0];
for (i = 0;; i++) {
if (a[i] % 2 == 0)
a[i + 1] = a[i] / 2;
else
a[i + 1] = 3 * a[i] + 1;
for (j = 0; j < i + 1; j++) {
if (a[i + 1] == a[j]) {
cout << i + 2;
return 0;
}
... | [
"literal.number.change",
"io.output.change",
"control_flow.break.remove",
"control_flow.return.add",
"control_flow.return.0.add"
] | 944,904 | 944,903 | u340494803 | cpp |
p03146 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
long long S;
int cnt = 1;
int flg1 = 2;
int flg2 = 2;
int flg4 = 2;
cin >> S;
do {
if (S == 4) {
flg4--;
}
if (... |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
long long S;
int cnt = 0;
int flg1 = 2;
int flg2 = 2;
int flg4 = 2;
cin >> S;
do {
if (S == 4) {
flg4--;
}
if ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 944,915 | 944,916 | u335104842 | cpp |
p03146 | #include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(), a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORE(i, a, b) for (int i = (a); i >= (b); i--)
#define FORALL(it, a) ... | #include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(), a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORE(i, a, b) for (int i = (a); i >= (b); i--)
#define FORALL(it, a) ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 944,917 | 944,918 | u131020584 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
// input
int s, i = 0;
cin >> s;
while (s > 4) {
if (s % 2 == 0)
s /= 2;
else
s = 3 * s + 1;
i++;
}
cout << i + 4 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// input
int s, i = 0;
cin >> s;
while (s > 4 || s == 3) {
if (s % 2 == 0)
s /= 2;
else
s = 3 * s + 1;
i++;
}
cout << i + 4 << endl;
}
| [
"control_flow.loop.condition.change"
] | 944,919 | 944,920 | u371149954 | cpp |
p03146 | #include <iostream>
using namespace std;
int main(void) {
long long s, ans = 0;
cin >> s;
if (s <= 4)
cout << "4494"[s] << endl;
else {
while (s > 1) {
ans++;
if (s & 1) {
s *= 3;
s++;
} else {
s >>= 1;
}
}
cout << ans + 2 << endl;
}
return 0... | #include <iostream>
using namespace std;
int main(void) {
long long s, ans = 0;
cin >> s;
if (s <= 4)
cout << "04494"[s] << endl;
else {
while (s > 1) {
ans++;
if (s & 1) {
s *= 3;
s++;
} else {
s >>= 1;
}
}
cout << ans + 2 << endl;
}
return ... | [
"literal.string.change",
"io.output.change"
] | 944,925 | 944,926 | u898331860 | cpp |
p03146 | #include <iostream>
using namespace std;
int main(void) {
long long s, ans = 0;
cin >> s;
if (s <= 4)
cout << "4494"[s] << endl;
else {
while (s > 1) {
ans++;
if (s & 1) {
s *= 3;
s++;
} else {
s >>= 1;
}
}
cout << ans + 1 << endl;
}
return 0... | #include <iostream>
using namespace std;
int main(void) {
long long s, ans = 0;
cin >> s;
if (s <= 4)
cout << "04494"[s] << endl;
else {
while (s > 1) {
ans++;
if (s & 1) {
s *= 3;
s++;
} else {
s >>= 1;
}
}
cout << ans + 2 << endl;
}
return ... | [
"literal.string.change",
"io.output.change",
"literal.number.change"
] | 944,927 | 944,926 | u898331860 | cpp |
p03146 | #include <iostream>
using namespace std;
int main(void) {
long long s, ans = 0;
cin >> s;
if (s <= 4)
cout << "4494"[s] << endl;
else {
while (s > 4) {
ans++;
if (s & 1) {
s *= 3;
s++;
} else {
s >>= 1;
}
}
cout << ans + 4 << endl;
}
return 0... | #include <iostream>
using namespace std;
int main(void) {
long long s, ans = 0;
cin >> s;
if (s <= 4)
cout << "04494"[s] << endl;
else {
while (s > 1) {
ans++;
if (s & 1) {
s *= 3;
s++;
} else {
s >>= 1;
}
}
cout << ans + 2 << endl;
}
return ... | [
"literal.string.change",
"io.output.change",
"literal.number.change",
"control_flow.loop.condition.change"
] | 944,928 | 944,926 | u898331860 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 100010;
int main() {
int s;
cin >> s;
vector<int> v(N);
v[0] = s;
for (int i = 1; i <= N; i++) {
if (v[i - 1] & 1)
v[i] = 3 * v[i - 1] + 1;
else
v[i] = v[i - 1] / 2;
}
for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1000010;
int main() {
int s;
cin >> s;
vector<int> v(N);
v[0] = s;
for (int i = 1; i <= N; i++) {
if (v[i - 1] & 1)
v[i] = 3 * v[i - 1] + 1;
else
v[i] = v[i - 1] / 2;
}
for (int i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 944,929 | 944,930 | u459121100 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1000010;
int main() {
int s;
cin >> s;
vector<int> v(N);
v[0] = s;
for (int i = 1; i <= N; i++) {
if (v[i - 1] & 1)
v[i] = 3 * v[i - 1] + 1;
else
v[i] = v[i - 1] / 2;
}
for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1000010;
int main() {
int s;
cin >> s;
vector<int> v(N);
v[0] = s;
for (int i = 1; i <= N; i++) {
if (v[i - 1] & 1)
v[i] = 3 * v[i - 1] + 1;
else
v[i] = v[i - 1] / 2;
}
for (int i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 944,931 | 944,930 | u459121100 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int f(int a) {
if (a % 2 == 0) {
return a / 2;
} else {
return 3 * a + 1;
}
}
int main() {
int s;
cin >> s;
bool found_once = false;
int count = 1;
if (s == 1) {
cout << 4 << endl;
return 0;
} else if (s == 2) {
cout << 5 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int f(int a) {
if (a % 2 == 0) {
return a / 2;
} else {
return 3 * a + 1;
}
}
int main() {
int s;
cin >> s;
bool found_once = false;
int count = 1;
if (s == 1) {
cout << 4 << endl;
return 0;
} else if (s == 2) {
cout << 4 << endl;
... | [
"literal.number.change",
"io.output.change"
] | 944,938 | 944,939 | u866992281 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> ans;
int cnt = 1;
while (1) {
cnt++;
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
auto itr = find(ans.begin(), ans.end(), s);
if (itr == ans.end())
ans.push_back(s);
el... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> ans(1, s);
int cnt = 1;
while (1) {
cnt++;
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
auto itr = find(ans.begin(), ans.end(), s);
if (itr == ans.end())
ans.push_back(s);
... | [
"call.arguments.add"
] | 944,945 | 944,946 | u655975843 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.