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 |
|---|---|---|---|---|---|---|---|
p03146 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a.size())
#define endl "\n"
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a.size())
#define endl "\n"
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
... | [
"literal.string.change",
"io.output.change"
] | 944,949 | 944,950 | u616547520 | cpp |
p03146 | #include <iostream>
#include <map>
#include <vector>
int s, t;
std::vector<int> vec(1000000, 0);
std::map<int, int> count_map;
int main() {
std::cin >> t;
vec[0] = t;
for (int i = 1; i <= 1000000; i++) {
s = vec[i - 1];
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
vec[i] = ... | #include <iostream>
#include <map>
#include <vector>
int s, t;
std::vector<int> vec(1000001, 0);
std::map<int, int> count_map;
int main() {
std::cin >> t;
vec[1] = t;
for (int i = 2; i <= 1000000; i++) {
s = vec[i - 1];
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
vec[i] = ... | [
"literal.number.change",
"call.arguments.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove"
] | 944,965 | 944,966 | u537538698 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a(1000001);
a.at(0) = s;
int i = 1;
bool can = false;
while (true) {
if (a.at(i - 1) % 2 == 0)
a.at(i) = a.at(i - 1) / 2;
else
a.at(i) = 3 * a.at(i - 1) + 1;
int j = 0;
while (j < i) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a(1000001);
a.at(0) = s;
int i = 1;
bool can = false;
while (true) {
if (a.at(i - 1) % 2 == 0)
a.at(i) = a.at(i - 1) / 2;
else
a.at(i) = 3 * a.at(i - 1) + 1;
int j = 0;
while (j < i) {
... | [
"expression.operation.binary.add"
] | 944,969 | 944,970 | u665871498 | cpp |
p03146 | #include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Would
#define you
const int INF = 999999999;
const in... | #include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Would
#define you
const int INF = 999999999;
const in... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 944,971 | 944,972 | u539402331 | cpp |
p03146 | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int ans = 0;
if (n == 1 || n == 2)
int ans = 1;
int p = 0;
while (1) {
if (n % 2 == 0) {
n = n / 2;
p++;
} else {
n = n * 3 + 1;
p++;
}
if (n == 4)
break;
}
if (ans)
cout ... | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int ans = 0;
if (n == 1 || n == 2 || n == 4)
ans = 1;
int p = 0;
while (1) {
if (n % 2 == 0) {
n = n / 2;
p++;
} else {
n = n * 3 + 1;
p++;
}
if (n == 4)
break;
}
if (ans)
... | [
"control_flow.branch.if.condition.change"
] | 944,990 | 944,989 | u407416173 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
vector<int> n(1000000), p(1000000);
for (int i = 0; i < 1000000; i++) {
n[i] = 0;
}
n[0] = a;
p[a] = 1;
for (int i = 0; i < 1000000; i++) {
if (n[i] % 2 == 0) {
n[i + i] = n[i] / 2;
} else {
n[i + 1]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
vector<int> n(1000000), p(1000000);
for (int i = 0; i < 1000000; i++) {
n[i] = 0;
}
n[0] = a;
p[a] = 1;
for (int i = 0; i < 1000000; i++) {
// cout<<n[i]<<endl;
if (n[i] % 2 == 0) {
n[i + 1] = n[i] / 2;
... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 944,994 | 944,995 | u902787159 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a(1000001);
a[0] = s;
for (int i = 1; i < 1000001; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
} else if (a[i - 1] % 2 == 1) {
a[i] = 3 * a[i - 1] + 1;
}
for (int j = i; j > 0; j-... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a(1000001);
a[0] = s;
for (int i = 1; i < 1000001; i++) {
if (a[i - 1] % 2 == 0) {
a[i] = a[i - 1] / 2;
} else if (a[i - 1] % 2 == 1) {
a[i] = 3 * a[i - 1] + 1;
}
for (int j = i; j >= 0; j... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 945,008 | 945,009 | u102871988 | cpp |
p03146 | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int a[1000005], n;
for (int i = 0; i < 10000005; i++) {
a[i] = 0;
}
scanf("%d", &n);
for (int i = 1; i < 1000005; i++) {
a[n]++;
if (a[n] == 2) {
printf("%d\n", i);
break;
}
if (n % 2 ==... | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int a[1000005], n;
for (int i = 0; i < 1000005; i++) {
a[i] = 0;
}
scanf("%d", &n);
for (int i = 1; i < 1000005; i++) {
a[n]++;
if (a[n] == 2) {
printf("%d\n", i);
break;
}
if (n % 2 == ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 945,012 | 945,013 | u379288456 | cpp |
p03146 | #include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
int a[1000000];
int ans = 0;
a[0] = s;
bool w = false;
for (int i = 0; i < 10e7; i++) {
if (a[i] ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
int a[1000009];
int ans = 0;
a[0] = s;
bool w = false;
for (int i = 0; i < 10e8; i++) {
if (a[i] ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 945,014 | 945,015 | u139300044 | cpp |
p03146 | #include <iostream>
#include <vector>
using namespace std;
int fn(int n) {
if (n % 2 == 0) {
return n / 2;
} else {
return 3 * n + 1;
}
}
int main() {
int s;
int flag = 0;
vector<int> a(1);
cin >> s;
a[0] = s;
for (int i = 1; i < 1000000; i++) {
a.emplace_back(fn(a[i - 1]));
for ... | #include <iostream>
#include <vector>
using namespace std;
int fn(int n) {
if (n % 2 == 0) {
return n / 2;
} else {
return 3 * n + 1;
}
}
int main() {
int s;
int flag = 0;
vector<int> a(1);
cin >> s;
a[0] = s;
for (int i = 1; i < 1000000; i++) {
a.emplace_back(fn(a[i - 1]));
// c... | [
"expression.operation.binary.add"
] | 945,041 | 945,042 | u672995180 | cpp |
p03146 | #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 = 2 * s + 1;
count++;
}
cout << count + 3;
} | #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;
} | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 945,057 | 945,058 | u959539771 | 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 = 2 * s + 1;
count++;
}
cout << count + 3;
} | #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;
} | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 945,059 | 945,058 | u959539771 | 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 = 2 * s + 1;
count++;
}
cout << count;
} | #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;
} | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 945,060 | 945,058 | u959539771 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, i = 1;
cin >> s;
if (s == 1 || s == 2)
cout << 4 << endl;
else {
while (1) {
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
if (s == 1 && i >= 3) {
break;
}
i++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, i = 2;
cin >> s;
if (s == 1 || s == 2)
cout << 4 << endl;
else {
while (1) {
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
if (s == 1 && i >= 3) {
break;
}
i++;
}
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 945,083 | 945,084 | u445617209 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a(1);
a.at(0) = s;
bool flag = false;
for (int i = 0; flag == false; i++) {
if (a.at(i) % 2 == 0) {
a.push_back(a.at(i) / 2);
} else if (a.at(i) % 2 == 1) {
a.push_back(a.at(i) * 3 + 1);
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a(1);
a.at(0) = s;
bool flag = false;
for (int i = 0; flag == false; i++) {
if (a.at(i) % 2 == 0) {
a.push_back(a.at(i) / 2);
} else if (a.at(i) % 2 == 1) {
a.push_back(a.at(i) * 3 + 1);
} else ... | [
"expression.operation.binary.add"
] | 945,085 | 945,086 | u514429645 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a;
a.at(0) = s;
bool flag = false;
for (int i = 0; flag == false; i++) {
if (a.at(i) % 2 == 0) {
a.push_back(a.at(i) / 2);
} else if (a.at(i) % 2 == 1) {
a.push_back(a.at(i) * 3 + 1);
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a(1);
a.at(0) = s;
bool flag = false;
for (int i = 0; flag == false; i++) {
if (a.at(i) % 2 == 0) {
a.push_back(a.at(i) / 2);
} else if (a.at(i) % 2 == 1) {
a.push_back(a.at(i) * 3 + 1);
} else ... | [
"call.arguments.add"
] | 945,087 | 945,086 | u514429645 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a;
a.push_back(s);
while (1) {
int t = a.back();
t % 2 == 0 ? t = t >> 1 : t = 3 * t + 1;
auto it = find(a.begin(), a.end(), t);
if (it != a.end())
break;
a.push_back(t);
}
cout << a.size() <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a;
a.push_back(s);
while (1) {
int t = a.back();
t % 2 == 0 ? t = t >> 1 : t = 3 * t + 1;
auto it = find(a.begin(), a.end(), t);
if (it != a.end())
break;
a.push_back(t);
}
cout << a.size() + ... | [
"expression.operation.binary.add"
] | 945,088 | 945,089 | u337353034 | cpp |
p03146 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
int ans = 0;
vector<int> A(1000);
A[0] = s;
int flag = 0;
for (int i = 0; i < 1000; i++) {
if (A[i] % 2 == 0) {
A[i + 1] = A[i] / 2;
} else if (A[i] % 2 == 1) {
A[i + 1] = 3 *... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
int ans = 0;
vector<int> A(1000);
A[0] = s;
int flag = 0;
for (int i = 0; i < 1000; i++) {
if (A[i] % 2 == 0) {
A[i + 1] = A[i] / 2;
} else if (A[i] % 2 == 1) {
A[i + 1] = 3 *... | [
"control_flow.loop.for.condition.change",
"call.arguments.change"
] | 945,109 | 945,110 | u240031669 | cpp |
p03146 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
bool c[10000000];
int main() {
int s;
cin >> s;
rep(i, 10000000) c[i] = false;
int ans = 0;
while (1) {
ans++;
if (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
bool c[10000000];
int main() {
int s;
cin >> s;
rep(i, 10000000) c[i] = false;
int ans = 0;
while (1) {
ans++;
if (... | [
"identifier.change",
"io.output.change"
] | 945,113 | 945,114 | u205367115 | cpp |
p03146 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int s;
int a[1000000];
int ans;
bool flag = false;
cin >> s;
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;
}
for (int s =... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int s;
int a[1000000];
int ans;
bool flag = false;
cin >> s;
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;
}
for (int j =... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 945,120 | 945,121 | u231282396 | cpp |
p03146 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s;
int max = 1000000;
vector<int> a(max);
vector<bool> b(max, false);
cin >> s;
a.at(0) = s;
int i = 0;
b.at(s) = true;
while (1) {
if (a.at(i) % 2 == 0) {
a.at(i + 1) = a.at(i) / 2;
} else if (a.at(i) % 2 == 1... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s;
int max = 1000000;
vector<int> a(max);
vector<bool> b(max, false);
cin >> s;
a.at(0) = s;
int i = 0;
b.at(s) = true;
while (1) {
if (a.at(i) % 2 == 0) {
a.at(i + 1) = a.at(i) / 2;
} else if (a.at(i) % 2 == 1... | [
"literal.number.change",
"io.output.change"
] | 945,129 | 945,130 | u160754729 | cpp |
p03146 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s;
int max = 1000000;
vector<int> a(max);
vector<bool> b(max, false);
cin >> s;
a.at(0) = s;
int i = 0;
b.at(s) = true;
while (1) {
if (a.at(i) % 2 == 0) {
a.at(i + 1) = a.at(i) / 2;
} else if (a.at(i) % 2 == 1... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s;
int max = 1000000;
vector<int> a(max);
vector<bool> b(max, false);
cin >> s;
a.at(0) = s;
int i = 0;
b.at(s) = true;
while (1) {
if (a.at(i) % 2 == 0) {
a.at(i + 1) = a.at(i) / 2;
} else if (a.at(i) % 2 == 1... | [
"literal.number.change",
"io.output.change"
] | 945,131 | 945,130 | u160754729 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int s;
cin >> s;
int i = 1;
int a = s;
set<int> hoge;
while (true) {
// cout << "i: " << i << ", a: " << a << endl;
if (a % 2 == 0) {
a = a / 2;
} else {
a = 3 * a + 1;
}
i++;
if (!hoge.insert(a).second) {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int s;
cin >> s;
int i = 1;
int a = s;
set<int> hoge = {s};
while (true) {
// cout << "i: " << i << ", a: " << a << endl;
if (a % 2 == 0) {
a = a / 2;
} else {
a = 3 * a + 1;
}
i++;
if (!hoge.insert(a).seco... | [
"variable_declaration.value.change"
] | 945,132 | 945,133 | u833272463 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int s, i = 1;
cin >> s;
vector<int> a;
a.push_back(s);
while (true) {
if (a[i - 1] % 2 == 1)
a.push_back(3 * a[i - 1] + 1);
else
a.push_back(a[i - 1] / 2);
for (int j = 1; j < i; j++) {
if (a[j] == a[i]) {
c... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int s, i = 1;
cin >> s;
vector<int> a;
a.push_back(s);
while (true) {
if (a[i - 1] % 2 == 1)
a.push_back(3 * a[i - 1] + 1);
else
a.push_back(a[i - 1] / 2);
for (int j = 0; j < i; j++) {
if (a[j] == a[i]) {
c... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 945,159 | 945,160 | u341488930 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, m = 1;
int c[1000001] = {};
cin >> s;
c[s]++;
while (1) {
m++;
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
if (c[s] == 1) {
cout << m;
return 0;
} else {
c[s]++;
}
m++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, m = 1;
int c[1000001] = {};
cin >> s;
c[s]++;
while (1) {
m++;
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
if (c[s] == 1) {
cout << m;
return 0;
} else {
c[s]++;
}
}
} | [
"expression.unary.arithmetic.remove"
] | 945,166 | 945,167 | u058348416 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (... | [
"control_flow.branch.if.condition.change"
] | 945,179 | 945,180 | u033602950 | cpp |
p03146 | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 945,187 | 945,188 | u419390395 | cpp |
p03146 | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 945,189 | 945,188 | u419390395 | cpp |
p03146 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (auto i = 0; i < n; ++i)
#define REPR(i, n) for... |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (auto i = 0; i < n; ++i)
#define REPR(i, n) for... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 945,199 | 945,200 | u479953984 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(1);
cin >> a.at(0);
int i;
int ans = 0;
while (true) {
for (int j = 0; j < i; j++) {
if (a.at(i) == a.at(j)) {
ans = i + 1;
}
}
if (a.at(i) % 2 == 0) {
a.push_back(a.at(i) / 2);
} else {
a... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(1);
cin >> a.at(0);
int i = 0;
int ans = 0;
while (true) {
for (int j = 0; j < i; j++) {
if (a.at(i) == a.at(j)) {
ans = i + 1;
}
}
if (a.at(i) % 2 == 0) {
a.push_back(a.at(i) / 2);
} else {
... | [
"variable_declaration.value.change"
] | 945,210 | 945,211 | u465233477 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int count = 1;
if (s == 1 || s == 2 || s == 4) {
cout << 3;
} else {
while (s != 1) {
if (s % 2 == 0)
s = s / 2;
else
s = 3 * s + 1;
count++;
}
cout << count + 1;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int count = 1;
if (s == 1 || s == 2 || s == 4) {
cout << 4;
} else {
while (s != 1) {
if (s % 2 == 0)
s = s / 2;
else
s = 3 * s + 1;
count++;
}
cout << count + 1;
}
}
| [
"literal.number.change",
"io.output.change"
] | 945,214 | 945,215 | u674896268 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int count = 1;
if (s == 4 || s == 2 || s == 1) {
cout << 3;
} else {
while (s != 8) {
if (s % 2 == 0)
s = s / 2;
else
s = 3 * s + 1;
count++;
}
cout << count + 4;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int count = 1;
if (s == 1 || s == 2 || s == 4) {
cout << 4;
} else {
while (s != 1) {
if (s % 2 == 0)
s = s / 2;
else
s = 3 * s + 1;
count++;
}
cout << count + 1;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"io.output.change",
"control_flow.loop.condition.change"
] | 945,216 | 945,215 | u674896268 | cpp |
p03146 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
//関数getinputdata宣言
vector<vector<string>> getinputdata();
vector<vector<int>> getinputdata2();
vector<vector<double>> getinputdata3(... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
//関数getinputdata宣言
vector<vector<string>> getinputdata();
vector<vector<int>> getinputdata2();
vector<vector<double>> getinputdata3(... | [
"control_flow.branch.if.condition.change"
] | 945,221 | 945,222 | u200239931 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, sum = 1;
cin >> s;
if (s == 1 || s == 2)
cout << 4 << endl;
while (s != 4) {
if (s % 2 == 0) {
s = s / 2;
} else {
s = 3 * s + 1;
}
sum++;
}
cout << sum + 3 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, sum = 1;
cin >> s;
if (s == 1 || s == 2) {
cout << 4 << endl;
} else {
while (s != 4) {
if (s % 2 == 0) {
s = s / 2;
} else {
s = 3 * s + 1;
}
sum++;
}
cout << sum + 3 << endl;
}
} | [
"control_flow.branch.else.add"
] | 945,223 | 945,224 | u110653681 | cpp |
p03146 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int result_arr[10000000];
int collatz(int pre_result, int index) {
result_arr[index - 1] = pre_result;
if (pre_result == 1 && index >= 3) {
return index;
}
if (pre_result % 2 == 0) {
return... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int result_arr[10000000];
int collatz(int pre_result, int index) {
result_arr[index - 1] = pre_result;
if (pre_result == 1 && index >= 4) {
return index;
}
if (pre_result % 2 == 0) {
return... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 945,236 | 945,237 | u280016524 | cpp |
p03146 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | [
"literal.number.change",
"call.arguments.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 945,243 | 945,244 | u057611820 | cpp |
p03146 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 945,245 | 945,244 | u057611820 | cpp |
p03146 | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int c[10 * a];
c[a] = 1;
int t;
for (int i = 0;; i++) {
t = i;
if (a % 2 == 1)
a = 3 * a + 1;
else
a = a / 2;
if (c[a] == 1)
goto end;
else
c[a] = 1;
}
end:
cout << t + 2;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int c[1000000];
c[a] = 1;
int t;
for (int i = 0;; i++) {
t = i;
if (a % 2 == 1)
a = 3 * a + 1;
else
a = a / 2;
if (c[a] == 1)
goto end;
else
c[a] = 1;
}
end:
cout << t + 2;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 945,248 | 945,249 | u029166898 | cpp |
p03146 | #include <algorithm>
#include <iostream>
using namespace std;
const int M_MAX = 1000000;
int f(int n) {
if (n % 2 == 0) {
return n / 2;
} else {
return 3 * n + 1;
}
}
int solve() {
int a[M_MAX];
cin >> a[0];
for (int i = 1; i <= M_MAX; i++) {
a[i] = f(a[i - 1]);
for (int j = 0; j < i; j... | #include <algorithm>
#include <iostream>
using namespace std;
const int M_MAX = 1000000;
int f(int n) {
if (n % 2 == 0) {
return n / 2;
} else {
return 3 * n + 1;
}
}
int solve() {
int a[M_MAX];
cin >> a[0];
for (int i = 1; i <= M_MAX; i++) {
a[i] = f(a[i - 1]);
for (int j = 0; j < i; j... | [
"expression.operation.binary.add"
] | 945,250 | 945,251 | u901098617 | cpp |
p03146 | #include <algorithm>
#include <iostream>
using namespace std;
const int M_MAX = 1000000;
int f(int n) {
if (n % 2) {
return n / 2;
} else {
return 3 * n + 1;
}
}
int solve() {
int a[M_MAX];
cin >> a[0];
for (int i = 1; i <= M_MAX; i++) {
a[i] = f(a[i - 1]);
for (int j = 0; j < i; j++) {... | #include <algorithm>
#include <iostream>
using namespace std;
const int M_MAX = 1000000;
int f(int n) {
if (n % 2 == 0) {
return n / 2;
} else {
return 3 * n + 1;
}
}
int solve() {
int a[M_MAX];
cin >> a[0];
for (int i = 1; i <= M_MAX; i++) {
a[i] = f(a[i - 1]);
for (int j = 0; j < i; j... | [
"control_flow.branch.if.condition.change"
] | 945,252 | 945,251 | u901098617 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
bool vis[2000005];
int main() {
int s;
scanf("%d", &s);
vis[s] = true;
for (int i = 2;; i++) {
if (s % 2 == 0)
s = s / 1;
else
s = s * 3 + 1;
if (!vis[s])
vis[s] = true;
else {
cout << i;
break;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
bool vis[2000005];
int main() {
int s;
scanf("%d", &s);
vis[s] = true;
for (int i = 2;; i++) {
if (s % 2 == 0)
s = s / 2;
else
s = s * 3 + 1;
if (!vis[s])
vis[s] = true;
else {
cout << i;
break;
}
}
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 945,255 | 945,256 | u676323984 | cpp |
p03146 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int count = 1;
if (n == 1) {
cout << 4 << endl;
} else if (n == 2) {
cout << 4 << endl;
} else {
while (n != 4) {
if (n % 2 == 0) {
n /= 2;
} else {
n = n * 3 + 1;
}
++count;
}
}
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int count = 1;
if (n == 1) {
cout << 4 << endl;
} else if (n == 2) {
cout << 4 << endl;
} else {
while (n != 4) {
if (n % 2 == 0) {
n /= 2;
} else {
n = n * 3 + 1;
}
++count;
}
... | [] | 945,266 | 945,267 | u901393905 | cpp |
p03146 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s, i = 0;
cin >> s;
if (s == 1)
cout << 2;
else if (s == 2)
cout << 3;
else {
while (s != 4) {
if (s % 2 == 0)
s = s / 2;
else
s = (3 * s) + 1;
i++;
}
cout << i + 4;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s, i = 0;
cin >> s;
if (s == 1)
cout << 4;
else if (s == 2)
cout << 4;
else {
while (s != 4) {
if (s % 2 == 0)
s = s / 2;
else
s = (3 * s) + 1;
i++;
}
cout << i + 4;
}
} | [
"literal.number.change",
"io.output.change"
] | 945,276 | 945,277 | u193815565 | cpp |
p03146 | #include <iostream>
#include <map>
using namespace std;
int f(int n) { return (n % 2 == 0 ? n / 2 : 3 * n + 1); }
int main() {
int start;
cin >> start;
const int NOT_FOUND = -1;
map<int, int> visited;
int answer = NOT_FOUND;
visited[start] = true;
int previous = start;
for (int i = 2; answer == N... | #include <iostream>
#include <map>
using namespace std;
int f(int n) { return (n % 2 == 0 ? n / 2 : 3 * n + 1); }
int main() {
int start;
cin >> start;
const int NOT_FOUND = -1;
map<int, int> visited;
int answer = NOT_FOUND;
visited[start] = true;
int previous = start;
for (int i = 2; answer == N... | [] | 945,282 | 945,283 | u927253988 | cpp |
p03146 | #include <iostream>
using namespace std;
int main() {
long long s;
cin >> s;
if (s == 1 || s == 2)
cout << 4;
else {
int ans = 0;
while (s != 4) {
if (s % 2 == 0)
s = s / 2;
else
s = s * 3 + 1;
ans++;
}
cout << ans + 3;
}
} | #include <iostream>
using namespace std;
int main() {
long long s;
cin >> s;
if (s == 1 || s == 2)
cout << 4;
else {
int ans = 0;
while (s != 4) {
if (s % 2 == 0)
s = s / 2;
else
s = s * 3 + 1;
ans++;
}
cout << ans + 3 + 1;
}
} | [
"expression.operation.binary.add"
] | 945,285 | 945,286 | u441296840 | cpp |
p03146 | #include <iostream>
using namespace std;
int main() {
int a[1000];
int mn = 1000;
cin >> a[0];
for (int i = 0; i < 1000; ++i) {
if (a[i] % 2 == 0)
a[i + 1] = a[i] / 2;
else
a[i + 1] = 3 * a[i] + 1;
}
for (int i = 0; i < 1000; ++i) {
for (int j = i + 1; j < 1000; ++j) {
if (a[j... | #include <iostream>
using namespace std;
int main() {
int a[1000];
int mn = 1000;
cin >> a[0];
for (int i = 0; i < 1000; ++i) {
if (a[i] % 2 == 0)
a[i + 1] = a[i] / 2;
else
a[i + 1] = 3 * a[i] + 1;
}
for (int i = 0; i < 1000; ++i) {
for (int j = i + 1; j < 1000; ++j) {
if (a[j... | [
"expression.operation.binary.add"
] | 945,295 | 945,296 | u041282550 | cpp |
p03146 | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
#define fast ios_base::sync_with_stdio(0), cin.tie(0)
#define temp template <typename T>
#define de... | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
#define fast ios_base::sync_with_stdio(0), cin.tie(0)
#define temp template <typename T>
#define de... | [
"expression.operation.binary.remove"
] | 945,301 | 945,302 | u941883031 | cpp |
p03146 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
long long s, ans = 0;
map<lon... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
long long s, ans = 0;
map<lon... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"assignment.value.change",
"expression.unary.arithmetic.add"
] | 945,305 | 945,306 | u701891338 | cpp |
p03146 | #include <iostream>
using namespace std;
int main() {
int h[1000005], c = 0;
cin >> h[0];
for (int i = 1; i < 1000005; i++) {
if (h[i - 1] % 2 == 0) {
h[i] = h[i - 1] / 2;
} else {
h[i] = h[i - 1] * 3 + 1;
}
for (int j = 1; j < i; j++) {
if (h[i] == h[j] && c == 0) {
c =... | #include <iostream>
using namespace std;
int main() {
int h[1000005], c = 0;
cin >> h[0];
for (int i = 1; i < 1000005; i++) {
if (h[i - 1] % 2 == 0) {
h[i] = h[i - 1] / 2;
} else {
h[i] = h[i - 1] * 3 + 1;
}
for (int j = 0; j < i; j++) {
if (h[i] == h[j] && c == 0) {
c =... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 945,311 | 945,312 | u088751997 | cpp |
p03146 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | [
"expression.operation.binary.add"
] | 945,321 | 945,322 | u906208439 | cpp |
p03146 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
//#include "bits/stdc++.h"
using namespace std;
// using namespace std::v... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
//#include "bits/stdc++.h"
using namespace std;
// using namespace std::v... | [
"literal.number.change",
"call.arguments.change"
] | 945,323 | 945,324 | u301409936 | cpp |
p03146 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <queue>
#include <regex>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using db = double;
using pi2 = pair<int, int>;
using pll2 = pair<ll, ll>;
using vs = vector<string>;
using vi... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <queue>
#include <regex>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using db = double;
using pi2 = pair<int, int>;
using pll2 = pair<ll, ll>;
using vs = vector<string>;
using vi... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 945,333 | 945,334 | u127844950 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
set<int> ss;
for (int i = 1;; i++) {
if (ss.count(s)) {
cout << i << endl;
return 0;
} else {
ss.insert(s);
if (s & 1)
s = s / 2;
else
s = 3 * s + 1;
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
set<int> ss;
for (int i = 1;; i++) {
if (ss.count(s)) {
cout << i << endl;
return 0;
} else {
ss.insert(s);
if (s % 2 == 0)
s = s / 2;
else
s = 3 * s + 1;
}
}
return 0;
}
| [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 945,335 | 945,336 | u283229916 | cpp |
p03146 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | [
"assignment.value.change"
] | 945,337 | 945,338 | u833393891 | cpp |
p03146 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tup... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tup... | [
"expression.operation.binary.add"
] | 945,345 | 945,346 | u746560455 | cpp |
p03147 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"literal.number.change",
"variable_declaration.value.change"
] | 945,356 | 945,357 | u151236434 | cpp |
p03147 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | [
"expression.operation.binary.remove",
"assignment.change"
] | 945,358 | 945,359 | u965730380 | cpp |
p03147 | #include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> h(n);
int minH = 100;
for (int i = 0; i < n; i++) {
std::cin >> h[i];
minH = std::min(minH, h[i]);
}
int cost = minH;
for (int i = 0; i < n; i++)
h[i] -= minH;
// 区間が最大になるようにとる
w... | #include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> h(n);
int minH = 1000;
for (int i = 0; i < n; i++) {
std::cin >> h[i];
minH = std::min(minH, h[i]);
}
int cost = minH;
for (int i = 0; i < n; i++)
h[i] -= minH;
// 区間が最大になるようにとる
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 945,376 | 945,377 | u390165589 | cpp |
p03147 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#defi... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 945,378 | 945,379 | u311671153 | cpp |
p03147 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
vector<ll> h;
int main() {
cin >> N;
h.resize(N + 1);
rep(i, N) cin >> h[i + 1];
ll ans = 1;
h[0] = 1;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
vector<ll> h;
int main() {
cin >> N;
h.resize(N + 1);
rep(i, N) cin >> h[i + 1];
ll ans = 0;
h[0] = 0;
... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 945,388 | 945,389 | u455366471 | cpp |
p03147 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
vector<ll> h;
int main() {
cin >> N;
h.resize(N);
rep(i, N) cin >> h[i + 1];
ll ans = 1;
h[0] = 1;
for ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
vector<ll> h;
int main() {
cin >> N;
h.resize(N + 1);
rep(i, N) cin >> h[i + 1];
ll ans = 0;
h[0] = 0;
... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 945,390 | 945,389 | u455366471 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
int ans = a.at(0), p = ans;
rep(i, n - 1) {
if (p <= a.at(i + 1)) {
ans += a.at(i + 1) - p;
p = a.at(i + 1);
} ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
int ans = a.at(0), p = ans;
rep(i, n - 1) {
if (p <= a.at(i + 1)) {
ans += a.at(i + 1) - p;
p = a.at(i + 1);
} ... | [
"assignment.change"
] | 945,391 | 945,392 | u130651752 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
int ans = a.at(0), p = ans;
rep(i, n - 1) {
if (p <= a.at(i + 1)) {
ans += a.at(i + 1) - p;
p = a.at(i);
} else... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
int ans = a.at(0), p = ans;
rep(i, n - 1) {
if (p <= a.at(i + 1)) {
ans += a.at(i + 1) - p;
p = a.at(i + 1);
} ... | [
"assignment.change"
] | 945,393 | 945,392 | u130651752 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define endl "\n"
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define endl "\n"
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 945,401 | 945,402 | u864171425 | cpp |
p03147 | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
ll n;
cin >> n;
vector<ll> flowers(n);
for (ll i = 0; i < n;... | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
ll n;
cin >> n;
vector<ll> flowers(n);
for (ll i = 0; i < n; ... | [
"preprocessor.define.value.change",
"call.add",
"call.arguments.change"
] | 945,403 | 945,404 | u962609087 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n + 2, -1);
rep(i, n) cin >> h[i + 1];
int ans = 0;
int lm = 0;
rep2(i, n + 1) {
if (h[i] >... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n + 2, -1);
rep(i, n) cin >> h[i + 1];
int ans = 0;
int lm = 0;
rep2(i, n + 1) {
if (h[i] >... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 945,411 | 945,412 | u187489367 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n + 2, -1);
rep(i, n) cin >> h[i + 1];
int ans = 0;
int lm = 0;
rep2(i, n + 1) {
if (h[i] >... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n + 2, -1);
rep(i, n) cin >> h[i + 1];
int ans = 0;
int lm = 0;
rep2(i, n + 1) {
if (h[i] >... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 945,413 | 945,412 | u187489367 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, max = 0, cnt = 0;
bool flag = true;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
if (v[i] > max)
max = v[i];
}
while (max == 0) {
for (int j = 0; j < n; j++) {
if (v[j] != 0) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, max = 0, cnt = 0;
bool flag = true;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
if (v[i] > max)
max = v[i];
}
while (max > 0) {
for (int j = 0; j < n; j++) {
if (v[j] != 0) {
if ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 945,422 | 945,423 | u228943017 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i]; ///入力完了
int range = 0;
for (int i = 0; i < N; i++)
range = max(range, h[i]); ///範囲取得のための最大値
int count = 0;
for (int j = 0; j < range; j++) {
count++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i]; ///入力完了
int range = 0;
for (int i = 0; i < N; i++)
range = max(range, h[i]); ///範囲取得のための最大値
int count = 0;
for (int j = 0; j < range; j++) {
count++;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 945,436 | 945,437 | u028906014 | cpp |
p03147 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc s... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc s... | [
"assignment.add"
] | 945,444 | 945,445 | u768152935 | cpp |
p03147 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc s... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc s... | [
"call.arguments.change"
] | 945,446 | 945,447 | u768152935 | cpp |
p03147 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, s = 0, m = 0;
cin >> n;
vector<int> v(n);
rep(i, n) {
cin >> v[i];
m = max(m, v[i]);
}
rep(i, m) {
int t = 0;
bool b = 0;
rep(j, n) {
if (b && v[i] < i + 1)
b = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, s = 0, m = 0;
cin >> n;
vector<int> v(n);
rep(i, n) {
cin >> v[i];
m = max(m, v[i]);
}
rep(i, m) {
int t = 0;
bool b = 0;
rep(j, n) {
if (b && v[j] < i + 1)
b = ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 945,458 | 945,459 | u757584836 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h[105], ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++) {
if (h[i] > h[i + 1])
ans += h[i] - h[i + 1];
}
cout << ans + h[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h[105], ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n - 1; i++) {
if (h[i] > h[i + 1])
ans += h[i] - h[i + 1];
}
cout << ans + h[n - 1];
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 945,460 | 945,461 | u873762144 | cpp |
p03147 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
int n;
cin >> n;
int h[n];
int mx = 0;
rep(i, n) {
cin >> h[i];
mx = max(mx, h[i]);
}
ll ans = 0;
while (h[0] != 0) {
for (int i = 0; ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
int n;
cin >> n;
int h[n];
int mx = 0;
rep(i, n) {
cin >> h[i];
mx = max(mx, h[i]);
}
ll ans = 0;
while (mx != 0) {
for (int i = 0; i ... | [
"control_flow.loop.condition.change"
] | 945,485 | 945,486 | u917518913 | cpp |
p03147 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
int n;
cin >> n;
int h[n];
int mx = 0;
rep(i, n) {
cin >> h[i];
mx = max(mx, h[i]);
}
int ans = 0;
while (h[0] != 0) {
for (int i = 0;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
int n;
cin >> n;
int h[n];
int mx = 0;
rep(i, n) {
cin >> h[i];
mx = max(mx, h[i]);
}
ll ans = 0;
while (mx != 0) {
for (int i = 0; i ... | [
"variable_declaration.type.change",
"control_flow.loop.condition.change"
] | 945,487 | 945,486 | u917518913 | cpp |
p03147 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int prev, curr, sum = 0;
cin >> prev;
while (n <= 1) {
cin >> curr;
if (prev > curr) {
sum += prev - curr;
}
prev = curr;
n--;
}
sum += curr;
cout << sum;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int prev, curr, sum = 0;
cin >> prev;
curr = prev;
while (n != 1) {
cin >> curr;
if (prev > curr) {
sum += prev - curr;
}
prev = curr;
n--;
}
sum += curr;
cout << sum;
} | [
"assignment.add",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 945,488 | 945,489 | u554988565 | cpp |
p03147 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vl... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vl... | [
"expression.operation.binary.remove",
"assignment.change"
] | 945,495 | 945,496 | u281876921 | cpp |
p03147 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
int ans = 0;
int active = 0;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
int ans = 0;
int active = 0;... | [] | 945,506 | 945,507 | u828388155 | cpp |
p03147 | // ref: https://drken1215.hatenablog.com/entry/2019/03/03/150200
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
temp... | // ref: https://drken1215.hatenablog.com/entry/2019/03/03/150200
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
temp... | [
"call.remove"
] | 945,510 | 945,511 | u456420540 | cpp |
p03147 | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus >= 201703L
#pragma GCC target("avx2")
#else
#pragma GCC target("avx")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFIN... | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus >= 201703L
#pragma GCC target("avx2")
#else
#pragma GCC target("avx")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFIN... | [
"expression.operation.binary.remove"
] | 945,512 | 945,513 | u261538386 | cpp |
p03147 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define ALL(x) (x).begin(), (x)... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define ALL(x) (x).begin(), (x)... | [
"literal.number.change",
"assignment.value.change",
"variable_declaration.value.change"
] | 945,524 | 945,525 | u442810826 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> garden(0, 0);
int high = 0;
for (int i = 1; i < N; i++) {
int h;
cin >> h;
garden.push_back(h);
high = max(high, h);
}
int ans = 0;
for (int i = high; i > 0; i--) {
bool swi = true;
for (int j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> garden(0, 0);
int high = 0;
for (int i = 0; i < N; i++) {
int h;
cin >> h;
garden.push_back(h);
high = max(high, h);
}
int ans = 0;
for (int i = high; i > 0; i--) {
bool swi = true;
for (int j... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 945,553 | 945,554 | u071282706 | cpp |
p03147 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int h[100] = {0};
int Min = 100;
for (int i = 0; i < n; ++i) {
cin >> h[i];
if (Min > h[i]) {
Min = h[i];
}
}
for (int i = 0; i < n; ++i) {
h[i] -= Min;
}
int Sum = 0;
int st, end;
int flg = 0;
while (1)... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int h[101] = {0};
int Min = 100;
for (int i = 0; i < n; ++i) {
cin >> h[i];
if (Min > h[i]) {
Min = h[i];
}
}
for (int i = 0; i < n; ++i) {
h[i] -= Min;
}
int Sum = Min;
int st, end;
int flg = 0;
while (... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 945,572 | 945,571 | u277556971 | cpp |
p03147 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vNum(N, 0);
for (int i = 0; i < N; i++) {
cin >> vNum[i]... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vNum(N, 0);
for (int i = 0; i < N; i++) {
cin >> vNum[i]... | [
"control_flow.branch.if.add"
] | 945,580 | 945,581 | u376998218 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main() {
int n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
int active = 0;
re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
int acti... | [] | 945,582 | 945,583 | u033937898 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main() {
int n;
cin >> n;
vector<int> h(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main() {
int n;
cin >> n;
vector<int> h(... | [] | 945,584 | 945,585 | u738164318 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N + 1);
for (int X = 1; X <= N; X++) {
cin >> V[X];
}
int I = 0;
for (int X = 1; X <= N; X++) {
if (V[X] > V[X - 1]) {
I += V[X] - V[X];
}
}
cout << I << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N + 1);
for (int X = 1; X <= N; X++) {
cin >> V[X];
}
int I = 0;
for (int X = 1; X <= N; X++) {
if (V[X] > V[X - 1]) {
I += V[X] - V[X - 1];
}
}
cout << I << endl;
}
| [
"assignment.change"
] | 945,586 | 945,587 | u740002394 | cpp |
p03147 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> h(n);
for (int i = 0; i < n; i++) {
std::cin >> h[i];
}
int tmp = *std::max_element(h.begin(), h.end());
std::vector<int> flag(0);
for (int i = 0; i < tmp; i++) {
for (int j = 0; j < ... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> h(n);
for (int i = 0; i < n; i++) {
std::cin >> h[i];
}
int tmp = *std::max_element(h.begin(), h.end());
std::vector<int> flag(0);
for (int i = 0; i < tmp; i++) {
for (int j = 0; j < ... | [
"control_flow.loop.for.condition.change"
] | 945,597 | 945,598 | u121422050 | cpp |
p03147 |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#inc... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#incl... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.add"
] | 945,608 | 945,609 | u683078179 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
#define read \
FILE *fp; \
fp = freopen("testcase.txt", "r", stdin);
#define ll long long
#define ull unsigned long long
#define sf(n) sc... | #include <bits/stdc++.h>
using namespace std;
#define read \
FILE *fp; \
fp = freopen("testcase.txt", "r", stdin);
#define ll long long
#define ull unsigned long long
#define sf(n) sc... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 945,610 | 945,611 | u211401339 | cpp |
p03147 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, b, a) for (int i = b; i >= a; i--)
#define fori(a) for (auto i : a)
#define all(a) begin(a), end(a)
#define set(a, b) memset(a, b, sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, b, a) for (int i = b; i >= a; i--)
#define fori(a) for (auto i : a)
#define all(a) begin(a), end(a)
#define set(a, b) memset(a, b, sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long... | [
"assignment.change"
] | 945,612 | 945,613 | u542376457 | cpp |
p03147 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
... | [
"literal.number.change",
"assignment.value.change"
] | 945,623 | 945,624 | u372550522 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[102], MIN[102], MAX[102];
int main() {
ll n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
ll now = 0, j = 0;
bool flag = 1;
for (int i = 0; i < n; i++) {
if (now < a[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[102], MIN[102], MAX[102];
int main() {
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll now = 0, j = 0;
bool flag = 1;
for (int i = 0; i < n; i++) {
if (now < a[i]... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 945,625 | 945,626 | u166378830 | cpp |
p03147 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <memory.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define mset(a, b) memset(a, b, sizeof(a))
#define LL long long
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <memory.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define mset(a, b) memset(a, b, sizeof(a))
#define LL long long
... | [
"assignment.change"
] | 945,633 | 945,634 | u370963542 | cpp |
p03147 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// inf
const ll infl = 1LL << 60;
const int inf = 1 << 30;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; ++i) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// inf
const ll infl = 1LL << 60;
const int inf = 1 << 30;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; ++i) {
... | [
"assignment.add"
] | 945,643 | 945,644 | u577747009 | cpp |
p03147 | #include <iostream>
using namespace std;
int n, pre, now, ans;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> now;
if (now > pre)
ans++;
pre = now;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int n, pre, now, ans;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> now;
if (now > pre)
ans += now - pre;
pre = now;
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 945,651 | 945,652 | u790515578 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, n) for (int i = (a); i < (n); i++)
#define repb(i, n) for (int i = (n - 1); i >= 0; i--)
#define repb2(i, a, n) for (int i = (n - 1); i >= (a); i--)
#define all(x) x.begin(), x.end()
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, n) for (int i = (a); i < (n); i++)
#define repb(i, n) for (int i = (n - 1); i >= 0; i--)
#define repb2(i, a, n) for (int i = (n - 1); i >= (a); i--)
#define all(x) x.begin(), x.end()
#d... | [
"expression.operation.binary.remove"
] | 945,665 | 945,666 | u075520262 | cpp |
p03147 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int h[N + 1];
for (int i = 0; i < N + 1; i++) {
cin >> h[N];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (h[i] > h[i + 1]) {
ans += h[i] + h[i + 1];
}
}
ans += h[N];
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int h[N];
for (int i = 1; i < N + 1; i++) {
cin >> h[i];
}
int ans = 0;
for (int i = 1; i < N; i++) {
if (h[i] > h[i + 1]) {
ans += h[i] - h[i + 1];
}
}
ans += h[N];
cout << ans << endl;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"misc.opposites",
"expressio... | 945,675 | 945,676 | u843842420 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n;
cin >> n;
int h[n + 1];
rep(i, n) cin >> h[i];
h[n] = 0;
int count = 0, mi = 0;
rep(i, n) {
if (i == 0) {
if (h[i] >> h[i + 1]) {
count += h[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n;
cin >> n;
int h[n + 1];
rep(i, n) cin >> h[i];
h[n] = 0;
int count = 0, mi = 0;
rep(i, n) {
if (i == 0) {
if (h[i] >= h[i + 1]) {
count += h[i];
... | [
"control_flow.branch.if.condition.change"
] | 945,677 | 945,678 | u326152409 | cpp |
p03147 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
ans = a[0];
for (int j = 1; j < n - 1; j++) {
ans += max(0, a[j + 1] - a[j]);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int ans = 0;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
ans = a[0];
for (int j = 0; j < n - 1; j++) {
ans += max(0, a[j + 1] - a[j]);
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 945,689 | 945,690 | u708590262 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.