problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
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);
ll s;
cin >> s;
if (s == 2 || s == 1) {
cout << "3" << endl;
return 0;
}
ll cnt = 1;
while (1) {
if (s == 4) {
cout << cnt + 3 << endl;
return 0;
}
if (s % 2 == 0) {
s /= 2;
}
else {
s *= 3;
s++;
}
cnt++;
}
return 0;
} | #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);
ll s;
cin >> s;
if (s == 2 || s == 1) {
cout << "4" << endl;
return 0;
}
ll cnt = 1;
while (1) {
if (s == 4) {
cout << cnt + 3 << endl;
return 0;
}
if (s % 2 == 0) {
s /= 2;
}
else {
s *= 3;
s++;
}
cnt++;
}
return 0;
} | [
"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] = s;
}
for (int i = 1; i <= 1000000; i++) {
if (count_map[vec[i]] == 0) {
count_map[vec[i]]++;
} else if (count_map[vec[i]] == 1) {
std::cout << i + 1 << std::endl;
return 0;
}
}
}
| #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] = s;
}
for (int i = 1; i <= 1000000; i++) {
if (count_map[vec[i]] == 0) {
count_map[vec[i]]++;
} else if (count_map[vec[i]] == 1) {
std::cout << i << std::endl;
return 0;
}
}
}
| [
"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) {
if (a.at(j) == a.at(i)) {
can = true;
break;
} else
j++;
}
if (can)
break;
i++;
}
cout << i << endl;
}
| #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) {
if (a.at(j) == a.at(i)) {
can = true;
break;
} else
j++;
}
if (can)
break;
i++;
}
cout << i + 1 << endl;
}
| [
"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 int MOD = 1e9 + 7;
const double pi = 3.141592653589793238;
int main() {
long long n, prev;
cin >> n;
set<long long> s;
prev = n;
s.insert(n);
for (int i = 0; i <= 1000000; ++i) {
if (prev % 2 == 0) {
prev /= 2;
} else {
prev = 3 * prev + 1;
}
s.insert(prev);
if (s.size() != i + 1) {
cout << i + 2 << endl;
return 0;
}
}
} | #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 int MOD = 1e9 + 7;
const double pi = 3.141592653589793238;
int main() {
long long n, prev;
cin >> n;
set<long long> s;
prev = n;
s.insert(n);
for (int i = 0; i <= 1000000; ++i) {
if (prev % 2 == 0) {
prev /= 2;
} else {
prev = 3 * prev + 1;
}
s.insert(prev);
if (s.size() != i + 2) {
cout << i + 2 << endl;
return 0;
}
}
} | [
"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 << 4 << endl;
else
cout << p + 4 << endl;
return 0;
} | #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)
cout << 4 << endl;
else
cout << p + 4 << endl;
return 0;
} | [
"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] = 3 * n[i] + 1;
}
if (p[n[i + 1]] == 1) {
b = i;
break;
} else {
p[n[i + 1]]++;
}
}
cout << b << endl;
}
| #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;
} else {
n[i + 1] = 3 * n[i] + 1;
}
if (p[n[i + 1]] == 1) {
b = i + 2;
break;
} else {
p[n[i + 1]]++;
}
}
cout << b << endl;
}
| [
"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--) {
if (i != j && a[i] == a[j]) {
cout << i + 1 << endl;
goto OUT;
}
}
}
OUT:
return 0;
} | #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--) {
if (i != j && a[i] == a[j]) {
cout << i + 1 << endl;
goto OUT;
}
}
}
OUT:
return 0;
} | [
"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 == 0) {
n = n / 2;
} else {
n = n * 3 + 1;
}
}
} | #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 == 0) {
n = n / 2;
} else {
n = n * 3 + 1;
}
}
} | [
"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] % 2 == 0)
a[i + 1] = a[i] / 2;
if (a[i] % 2 == 1)
a[i + 1] = 3 * a[i] + 1;
ans++;
for (int j = 1; j < i - 1; j++) {
if (a[i] == a[j])
w = true;
}
if (w)
break;
}
cout << ans << endl;
return 0;
} | #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] % 2 == 0)
a[i + 1] = a[i] / 2;
if (a[i] % 2 == 1)
a[i + 1] = 3 * a[i] + 1;
ans++;
for (int j = 0; j < i - 1; j++) {
if (a[i] == a[j])
w = true;
}
if (w)
break;
}
cout << ans << endl;
return 0;
} | [
"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 (int j = 0; j < i; j++) {
if (a[i] == a[j]) {
cout << i << "\n";
flag = 1;
break;
}
}
if (flag == 1)
break;
}
} | #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]));
// cout<< a[i-1] << "\n";
for (int j = 0; j < i; j++) {
if (a[i] == a[j]) {
cout << i + 1 << "\n";
flag = 1;
break;
}
}
if (flag == 1)
break;
}
} | [
"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++;
}
cout << i + 1 << endl;
}
} | #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++;
}
cout << i + 1 << endl;
}
}
| [
"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 {
cout << "予期せぬ出力" << endl;
return 0;
}
for (int j = 0; j < i + 1; j++) {
if (a.at(j) == a.at(i + 1)) {
cout << i + 1 << endl;
flag = true; // forから抜け出すフラグ
}
}
}
return 0;
}
| #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 {
cout << "予期せぬ出力" << endl;
return 0;
}
for (int j = 0; j < i + 1; j++) {
if (a.at(j) == a.at(i + 1)) {
cout << i + 1 + 1 << endl; // a.at(i+1)ハi+2バンメノカズ
flag = true; // forから抜け出すフラグ
}
}
}
return 0;
}
| [
"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 {
cout << "予期せぬ出力" << endl;
return 0;
}
for (int j = 0; j < i + 1; j++) {
if (a.at(j) == a.at(i + 1)) {
cout << i + 1 << endl;
flag = true; // forから抜け出すフラグ
}
}
}
return 0;
}
| #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 {
cout << "予期せぬ出力" << endl;
return 0;
}
for (int j = 0; j < i + 1; j++) {
if (a.at(j) == a.at(i + 1)) {
cout << i + 1 + 1 << endl; // a.at(i+1)ハi+2バンメノカズ
flag = true; // forから抜け出すフラグ
}
}
}
return 0;
}
| [
"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() << endl;
return 0;
} | #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() + 1 << endl;
return 0;
} | [
"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 * A[i] + 1;
}
for (int j = 0; j < A.size(); j++) {
if (A[i + 1] == A[j]) {
flag = 1;
}
}
if (flag == 1) {
ans = i + 2;
break;
}
}
cout << ans << endl;
} | #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 * A[i] + 1;
}
for (int j = 0; j < i + 1; j++) {
if (A[i + 1] == A[j]) {
flag = 1;
}
}
if (flag == 1) {
ans = i + 2;
break;
}
}
cout << ans << endl;
}
| [
"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 (c[s]) {
break;
}
c[s] = true;
if (s % 2)
s = 3 * s + 1;
else
s = s / 2;
}
cout << s << endl;
return 0;
} | #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 (c[s]) {
break;
}
c[s] = true;
if (s % 2)
s = 3 * s + 1;
else
s = s / 2;
}
cout << ans << endl;
return 0;
} | [
"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 = 0; s < i; s++) {
if (a[i] == a[s]) {
ans = i + 1;
flag = true;
break;
}
if (flag) {
break;
}
}
}
cout << ans;
return 0;
}
| #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 = 0; j < i; j++) {
if (a[i] == a[j]) {
ans = i + 1;
flag = true;
break;
}
}
if (flag) {
break;
}
}
cout << ans;
return 0;
}
| [
"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) {
a.at(i + 1) = 3 * a.at(i) + 1;
}
if (b.at(a.at(i + 1)) == true) {
cout << (i + 1);
return 0;
} else {
b.at(a.at(i + 1)) = true;
i++;
}
}
} | #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) {
a.at(i + 1) = 3 * a.at(i) + 1;
}
if (b.at(a.at(i + 1)) == true) {
cout << (i + 2);
return 0;
} else {
b.at(a.at(i + 1)) = true;
i++;
}
}
} | [
"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) {
a.at(i + 1) = 3 * a.at(i) + 1;
}
if (b.at(a.at(i + 1)) == true) {
cout << a.at(i + 1);
return 0;
} else {
b.at(a.at(i + 1)) = true;
i++;
}
}
} | #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) {
a.at(i + 1) = 3 * a.at(i) + 1;
}
if (b.at(a.at(i + 1)) == true) {
cout << (i + 2);
return 0;
} else {
b.at(a.at(i + 1)) = true;
i++;
}
}
} | [
"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) {
cout << i << endl;
return 0;
}
}
} | #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).second) {
cout << i << endl;
return 0;
}
}
} | [
"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]) {
cout << i + 1 << endl;
return 0;
}
}
i++;
}
return 0;
}
| #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]) {
cout << i + 1 << endl;
return 0;
}
}
i++;
}
return 0;
}
| [
"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 (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int s;
cin >> s;
int count = 0;
if (s == 1 | 2 | 4)
cout << 4 << endl;
else {
while (true) {
if (s % 2 == 0)
s = s / 2;
else
s = s * 3 + 1;
count += 1;
if (s == 4)
break;
}
cout << count + 4 << endl;
}
return 0;
} | #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 (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int s;
cin >> s;
int count = 0;
if (s == 1 | s == 2 | s == 4)
cout << 4 << endl;
else {
while (true) {
if (s % 2 == 0)
s = s / 2;
else
s = s * 3 + 1;
count += 1;
if (s == 4)
break;
}
cout << count + 4 << endl;
}
return 0;
} | [
"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 <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
bool used[85];
int main() {
int n;
cin >> n;
int ans = 1;
while (!used[n]) {
used[n] = true;
if (n % 2 == 0)
n /= 2;
else
n = 3 * n + 1;
++ans;
}
cout << ans << endl;
return 0;
} | #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 <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
bool used[1010101];
int main() {
int n;
cin >> n;
int ans = 1;
while (!used[n]) {
used[n] = true;
if (n % 2 == 0)
n /= 2;
else
n = 3 * n + 1;
++ans;
}
cout << ans << endl;
return 0;
} | [
"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 <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
bool used[51];
int main() {
int n;
cin >> n;
int ans = 1;
while (!used[n]) {
used[n] = true;
if (n % 2 == 0)
n /= 2;
else
n = 3 * n + 1;
++ans;
}
cout << ans << endl;
return 0;
} | #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 <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
bool used[1010101];
int main() {
int n;
cin >> n;
int ans = 1;
while (!used[n]) {
used[n] = true;
if (n % 2 == 0)
n /= 2;
else
n = 3 * n + 1;
++ans;
}
cout << ans << endl;
return 0;
} | [
"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 (auto i = n; i >= 0; --i)
#define REPI(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define REPIR(itr, v) for (auto itr = v.rbegin(); itr != v.rend(); ++itr)
#define FOR(i, a, b) for (auto i = a; i < b; ++i)
#define SORT(v, n) sort(v, v + n)
#define SORTV(v) sort(v.begin(), v.end())
#define ALL(v) v.begin(), v.end()
#define llong long long
#define ll long long
#define INF 999999999
#define MOD 1000000007
#define pb push_back
#define pf push_front
#define MP make_pair
#define SV(n, v) \
{ \
int tmp; \
for (int i = 0; i < n; ++i) { \
scanf("%d", &tmp); \
v.push_back(tmp); \
} \
}
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
using namespace std;
typedef pair<int, int> pii;
int main() {
int n;
cin >> n;
map<int, int> mp;
int i = 2;
mp[1] = 1;
int val = n;
while (true) {
if (val % 2 == 0) {
val = val / 2;
} else {
val = 3 * val + 1;
}
if (mp[val] == 1) {
cout << i + 1 << endl;
break;
}
mp[val] = 1;
i++;
}
return 0;
}
|
#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 (auto i = n; i >= 0; --i)
#define REPI(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define REPIR(itr, v) for (auto itr = v.rbegin(); itr != v.rend(); ++itr)
#define FOR(i, a, b) for (auto i = a; i < b; ++i)
#define SORT(v, n) sort(v, v + n)
#define SORTV(v) sort(v.begin(), v.end())
#define ALL(v) v.begin(), v.end()
#define llong long long
#define ll long long
#define INF 999999999
#define MOD 1000000007
#define pb push_back
#define pf push_front
#define MP make_pair
#define SV(n, v) \
{ \
int tmp; \
for (int i = 0; i < n; ++i) { \
scanf("%d", &tmp); \
v.push_back(tmp); \
} \
}
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
using namespace std;
typedef pair<int, int> pii;
int main() {
int n;
cin >> n;
map<int, int> mp;
int i = 1;
mp[n] = 1;
int val = n;
while (true) {
if (val % 2 == 0) {
val = val / 2;
} else {
val = 3 * val + 1;
}
if (mp[val] == 1) {
cout << i + 1 << endl;
break;
}
mp[val] = 1;
i++;
}
return 0;
}
| [
"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.push_back(a.at(i) * 3 + 1);
}
if (ans != 0) {
break;
}
i++;
}
cout << ans << endl;
} | #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 {
a.push_back(a.at(i) * 3 + 1);
}
if (ans != 0) {
break;
}
i++;
}
cout << ans << endl;
} | [
"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();
void abc116_b(vector<vector<string>> v) {
int s = atoi(v[0][0].c_str());
int cnt = 1;
if (s == 1) {
s = 4;
}
while (s != 4) {
// cout << s << " ";
if (s % 2 == 0) {
s /= 2;
} else {
s = s * 3 + 1;
}
cnt += 1;
}
// cout << endl;
cout << cnt + 3 << endl;
}
int main() {
vector<vector<string>> vec_arr_result;
// vector<vector<int>> vec_arr_result;
vec_arr_result = getinputdata();
abc116_b(vec_arr_result);
return 0;
}
//関数getinputdata実装
vector<vector<double>> getinputdata3() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<double>> vec_arr;
//標準入力から入力がある間ループ処理でvector配列にデータ格納
while (getline(cin, str)) {
v1.push_back(str);
}
// stringstreamを利用してvector配列v1をスペースで分解処理
for (string s : v1) {
vector<double> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(atof(ret.c_str()));
}
// vector配列に追加
vec_arr.push_back(array_data);
//バッファクリア
ss.str("");
//ストリームクリア
ss.clear(stringstream::goodbit);
}
return vec_arr;
}
//関数getinputdata実装
vector<vector<int>> getinputdata2() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<int>> vec_arr;
//標準入力から入力がある間ループ処理でvector配列にデータ格納
while (getline(cin, str)) {
v1.push_back(str);
}
// stringstreamを利用してvector配列v1をスペースで分解処理
for (string s : v1) {
vector<int> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(atoi(ret.c_str()));
}
// vector配列に追加
vec_arr.push_back(array_data);
//バッファクリア
ss.str("");
//ストリームクリア
ss.clear(stringstream::goodbit);
}
return vec_arr;
}
//関数getinputdata実装
vector<vector<string>> getinputdata() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<string>> vec_arr;
//標準入力から入力がある間ループ処理でvector配列にデータ格納
while (getline(cin, str)) {
v1.push_back(str);
}
// stringstreamを利用してvector配列v1をスペースで分解処理
for (string s : v1) {
vector<string> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(ret);
}
// vector配列に追加
vec_arr.push_back(array_data);
//バッファクリア
ss.str("");
//ストリームクリア
ss.clear(stringstream::goodbit);
}
return vec_arr;
} | #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();
void abc116_b(vector<vector<string>> v) {
int s = atoi(v[0][0].c_str());
int cnt = 1;
if (s == 1 || s == 2) {
s = 4;
}
while (s != 4) {
// cout << s << " ";
if (s % 2 == 0) {
s /= 2;
} else {
s = s * 3 + 1;
}
cnt += 1;
}
// cout << endl;
cout << cnt + 3 << endl;
}
int main() {
vector<vector<string>> vec_arr_result;
// vector<vector<int>> vec_arr_result;
vec_arr_result = getinputdata();
abc116_b(vec_arr_result);
return 0;
}
//関数getinputdata実装
vector<vector<double>> getinputdata3() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<double>> vec_arr;
//標準入力から入力がある間ループ処理でvector配列にデータ格納
while (getline(cin, str)) {
v1.push_back(str);
}
// stringstreamを利用してvector配列v1をスペースで分解処理
for (string s : v1) {
vector<double> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(atof(ret.c_str()));
}
// vector配列に追加
vec_arr.push_back(array_data);
//バッファクリア
ss.str("");
//ストリームクリア
ss.clear(stringstream::goodbit);
}
return vec_arr;
}
//関数getinputdata実装
vector<vector<int>> getinputdata2() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<int>> vec_arr;
//標準入力から入力がある間ループ処理でvector配列にデータ格納
while (getline(cin, str)) {
v1.push_back(str);
}
// stringstreamを利用してvector配列v1をスペースで分解処理
for (string s : v1) {
vector<int> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(atoi(ret.c_str()));
}
// vector配列に追加
vec_arr.push_back(array_data);
//バッファクリア
ss.str("");
//ストリームクリア
ss.clear(stringstream::goodbit);
}
return vec_arr;
}
//関数getinputdata実装
vector<vector<string>> getinputdata() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<string>> vec_arr;
//標準入力から入力がある間ループ処理でvector配列にデータ格納
while (getline(cin, str)) {
v1.push_back(str);
}
// stringstreamを利用してvector配列v1をスペースで分解処理
for (string s : v1) {
vector<string> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(ret);
}
// vector配列に追加
vec_arr.push_back(array_data);
//バッファクリア
ss.str("");
//ストリームクリア
ss.clear(stringstream::goodbit);
}
return vec_arr;
} | [
"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 collatz(pre_result / 2, index + 1);
} else {
return collatz(pre_result * 3 + 1, index + 1);
}
}
int main(int argc, char const *argv[]) {
int s;
cin >> s;
int last_index = 0;
int ans = 0;
last_index = collatz(s, 2);
result_arr[last_index] = 4;
for (int i = 1; i <= last_index; i++) {
for (int j = i + 1; j <= last_index; j++) {
if (result_arr[i] == result_arr[j]) {
ans = j;
goto LABEL;
}
}
}
LABEL:
cout << ans << endl;
return 0;
}
| #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 collatz(pre_result / 2, index + 1);
} else {
return collatz(pre_result * 3 + 1, index + 1);
}
}
int main(int argc, char const *argv[]) {
int s;
cin >> s;
int last_index = 0;
int ans = 0;
last_index = collatz(s, 2);
result_arr[last_index] = 4;
for (int i = 1; i <= last_index; i++) {
for (int j = i + 1; j <= last_index; j++) {
if (result_arr[i] == result_arr[j]) {
ans = j;
goto LABEL;
}
}
}
LABEL:
cout << ans << endl;
return 0;
}
| [
"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 <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LLINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {0, 0, 1, -1, 0};
int dx[5] = {1, -1, 0, 0, 0};
int main(void) {
int s;
int res;
vector<bool> flag(10000001, false);
cin >> s;
flag[s] = true;
FOR(i, 2, INF) {
if (i % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
if (flag[s] == true) {
res = i;
break;
} else {
flag[s] = true;
}
}
cout << res << endl;
return 0;
} | //#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 <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LLINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {0, 0, 1, -1, 0};
int dx[5] = {1, -1, 0, 0, 0};
int main(void) {
int s;
int res;
vector<bool> flag(1000001, false);
cin >> s;
flag[s] = true;
FOR(i, 2, INF) {
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
if (flag[s] == true) {
res = i;
break;
} else {
flag[s] = true;
}
}
cout << res << endl;
return 0;
} | [
"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 <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LLINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {0, 0, 1, -1, 0};
int dx[5] = {1, -1, 0, 0, 0};
int main(void) {
int s;
int res;
vector<bool> flag(1000001, false);
cin >> s;
flag[s] = true;
FOR(i, 2, INF) {
if (i % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
if (flag[s] == true) {
res = i;
break;
} else {
flag[s] = true;
}
}
cout << res << endl;
return 0;
} | //#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 <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LLINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {0, 0, 1, -1, 0};
int dx[5] = {1, -1, 0, 0, 0};
int main(void) {
int s;
int res;
vector<bool> flag(1000001, false);
cin >> s;
flag[s] = true;
FOR(i, 2, INF) {
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
if (flag[s] == true) {
res = i;
break;
} else {
flag[s] = true;
}
}
cout << res << endl;
return 0;
} | [
"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++) {
if (a[i] == a[j]) {
return i;
}
}
}
}
int main() {
int i = solve();
cout << i << endl;
} | #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++) {
if (a[i] == a[j]) {
return i;
}
}
}
}
int main() {
int i = solve();
cout << i + 1 << endl;
} | [
"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++) {
if (a[i] == a[j]) {
return i;
}
}
}
}
int main() {
int i = solve();
cout << i << endl;
} | #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++) {
if (a[i] == a[j]) {
return i;
}
}
}
}
int main() {
int i = solve();
cout << i + 1 << endl;
} | [
"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;
}
}
cout << count + 3 << endl;
}
| #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;
}
cout << count + 3 << endl;
}
}
| [] | 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 == NOT_FOUND; i++) {
int next = f(previous);
if (visited[next]) {
answer = i;
}
visited[next] = true;
previous = next;
}
return 0;
}
| #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 == NOT_FOUND; i++) {
int next = f(previous);
if (visited[next]) {
answer = i;
}
visited[next] = true;
previous = next;
}
cout << answer;
return 0;
}
| [] | 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] == a[i]) {
mn = min(j, mn);
break;
}
}
}
cout << mn << endl;
}
| #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] == a[i]) {
mn = min(j, mn);
break;
}
}
}
cout << mn + 1 << endl;
}
| [
"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 debug(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << x << '\n'
#define itr(it, x) for (__typeof(x.begin()) it = x.begin(); it != x.end(); it++)
#define rep(i, a, b) for (int i = a; i <= (int)b; i++)
#define repr(i, a, b) for (int i = a; i >= (int)b; i--)
#define cas(n) printf("Case %d:", (int)n)
#define mem(x, v) memset(x, v, sizeof(x))
#define read(x) freopen(x, "r", stdin)
#define write(x) freopen(x, "w", stdout)
#define all(x) x.begin(), x.end()
#define aut(x, v) for (auto &x : v)
#define ini(n) scanf("%d", &n)
#define inl(n) scanf("%lld", &n)
#define ind(n) scanf("%lf", &n)
#define ins(n) scanf("%s", n)
#define insn(n) scanf(" %[^\n]", n)
#define outi(n) printf("%d", (int)n)
#define outl(n) printf("%lld", (LL)n)
#define outd(n, p) printf("%.*lf", p, (double)n)
#define outs(n) printf("%s", n)
#define sz(x) (int)x.size()
#define nl printf("\n")
#define sp printf(" ")
#define pb push_back
#define mp make_pair
#define xx first
#define yy second
const int inf = 0x3f3f3f3f;
const int mod = 1000000007;
const int mx = 2000001;
const LL infL = 0xf3f3f3f3f3f3f3f;
const double eps = 1e-9;
const double pi = acos(-1.0);
set<int> st;
int main() {
// read("in.txt"),write("out.txt");
int n, cnt = 1;
ini(n);
st.insert(n);
while (n != 1) {
if (n & 1)
n = 3 * n + 1;
else
n >>= 1;
if (st.find(n) != st.end())
break;
st.insert(n), cnt++;
}
outi(cnt + 1), nl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
#define fast ios_base::sync_with_stdio(0), cin.tie(0)
#define temp template <typename T>
#define debug(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << x << '\n'
#define itr(it, x) for (__typeof(x.begin()) it = x.begin(); it != x.end(); it++)
#define rep(i, a, b) for (int i = a; i <= (int)b; i++)
#define repr(i, a, b) for (int i = a; i >= (int)b; i--)
#define cas(n) printf("Case %d:", (int)n)
#define mem(x, v) memset(x, v, sizeof(x))
#define read(x) freopen(x, "r", stdin)
#define write(x) freopen(x, "w", stdout)
#define all(x) x.begin(), x.end()
#define aut(x, v) for (auto &x : v)
#define ini(n) scanf("%d", &n)
#define inl(n) scanf("%lld", &n)
#define ind(n) scanf("%lf", &n)
#define ins(n) scanf("%s", n)
#define insn(n) scanf(" %[^\n]", n)
#define outi(n) printf("%d", (int)n)
#define outl(n) printf("%lld", (LL)n)
#define outd(n, p) printf("%.*lf", p, (double)n)
#define outs(n) printf("%s", n)
#define sz(x) (int)x.size()
#define nl printf("\n")
#define sp printf(" ")
#define pb push_back
#define mp make_pair
#define xx first
#define yy second
const int inf = 0x3f3f3f3f;
const int mod = 1000000007;
const int mx = 2000001;
const LL infL = 0xf3f3f3f3f3f3f3f;
const double eps = 1e-9;
const double pi = acos(-1.0);
set<int> st;
int main() {
// read("in.txt"),write("out.txt");
int n, cnt = 1;
ini(n);
st.insert(n);
while (1) {
if (n & 1)
n = 3 * n + 1;
else
n >>= 1;
if (st.find(n) != st.end())
break;
st.insert(n), cnt++;
}
outi(cnt + 1), nl;
return 0;
}
| [
"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<long long, long long> m;
cin >> s;
while (1) {
if (!m[s]) {
m[s] = ans++;
if (s % 2 == 0)
s /= 2;
else
s = s * 3 + 1;
} else {
break;
}
}
cout << ans + 1 << endl;
return 0;
} | #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<long long, bool> m;
cin >> s;
while (1) {
if (!m[s]) {
m[s] = true;
++ans;
if (s % 2 == 0)
s /= 2;
else
s = s * 3 + 1;
} else {
break;
}
}
cout << ans + 1 << endl;
return 0;
} | [
"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 = i + 1;
break;
}
}
if (c != 0)
break;
}
cout << c;
return 0;
}
| #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 = i + 1;
break;
}
}
if (c != 0)
break;
}
cout << c;
return 0;
}
| [
"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 rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pint;
typedef pair<ll, int> pli;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
using namespace std;
int main() {
int s;
cin >> s;
vector<int> v;
int now = s;
bool ok = false;
while (!ok) {
for (int i = 0; i < v.size(); i++) {
if (now == v[i]) {
ok = true;
cout << v.size() << endl;
}
}
v.push_back(now);
if (now % 2 == 0) {
now /= 2;
} else
now = 3 * now + 1;
}
return 0;
} | #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 rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pint;
typedef pair<ll, int> pli;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
using namespace std;
int main() {
int s;
cin >> s;
vector<int> v;
int now = s;
bool ok = false;
while (!ok) {
for (int i = 0; i < v.size(); i++) {
if (now == v[i]) {
ok = true;
cout << v.size() + 1 << endl;
}
}
v.push_back(now);
if (now % 2 == 0) {
now /= 2;
} else
now = 3 * now + 1;
}
return 0;
} | [
"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::vector;
#define rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define huge 1000000007
typedef long long int ll;
ll gcd(ll a, ll b);
ll bur(ll N, ll X);
bool IsPrime(int num);
int main(void) {
ll N = 0;
ll A = 0;
ll B = 0;
ll C = 0;
ll D = 0;
ll H = 0;
ll W = 0;
// ll T = 0;
// ll M = 0;
ll h[400][400] = {};
// ll b[100] = {};
// ll c[100] = {};
// ll d[100] = {};
// ll v[3] = {};
// ll *c, *s, *n;
string S, T[50], U[52];
char fi[50], fv[50];
ll count = 0;
ll count2 = 0;
float sum = 0;
ll min = 1000000000000;
ll max = 1;
ll dist1 = 0;
ll dist2 = 0;
ll dist3 = 0;
ll now = 0;
int tmax = 0;
int tmax2 = 0;
// int flag = 0;
char temp, head;
// int is = 0;
bool flag = false;
// char p;
ll all = 0;
ll niku = 0;
ll state = 2;
bool down = true;
cin >> N;
vector<int> ov(105);
// sort(ov.begin(),ov.end());
ov[0] = N;
now++;
A = N;
while (true) {
// cout << A << endl;
if (A % 2 == 0) {
A /= 2;
} else {
A = 3 * A + 1;
}
ov[now] = A;
rep(i, 0, now) {
if (A == ov[i]) {
flag = true;
}
}
if (flag == true)
break;
now++;
}
cout << now + 1 << endl;
/*vector<pair<int,int>> tr(N);
rep(i, 0, N) {
cin >> tr[i].first;
count += tr[i].first;
}
rep(i, 0, N) {
cin >> tr[i].second;
count2 += tr[i].second;
}
if (count < count2) {
cout << -1 << endl;
return 0;
}
rep(i, 0, N) {
if (tr[i].first < tr[i].second) {
sum += tr[i].second - tr[i].first;
niku++;
}
else {
ov[all] += tr[i].first - tr[i].second;
all++;
}
}
sort(ov.begin(), ov.end(), greater<>());
int xx = 0;
while (sum > 0) {
sum -= ov[xx];
xx++;
niku++;
}*/
// cout << niku << endl;
// x = (ll *)malloc((N+1) * sizeof(ll));
// c = (ll *)malloc((N) * sizeof(ll));
// cin >> D >> G;
// vector<pair<int,int>> tr(M);
// vector<pair<int,int>> qes(Q);
// sort(c.begin(), c.end());
// cout << c[2] - c[1] << endl;
/*A = N / 1000;
N %= 1000;
B = N / 100;
N %= 100;
C = N / 10;
N %= 10;
D = N;*/
// cin >> N >> M;
// vector<pair<int,int>> c(M);
////vector<pair<int, int>> e(M);
// vector<ll> d(M);
// rep(i, 0, M) {
// cin >> c[i].first >> c[i].second;
// //e[i].first = c[i].first;
// //e[i].second = c[i].second;
//}
////sort(c.begin(), c.end());
//
// rep(i, 0, M) {
//
//
// rep(j, 0, M) {
// if (c[i].first == c[j].first && c[j].second < c[i].second) {
// d[i]++;
// //cout << j << endl;
// }
// }
// cout << std::setfill('0') << std::right << std::setw(6) << c[i].first;
// cout << std::setfill('0') << std::right << std::setw(6) << d[i]+1 <<
//endl;
//}
return 0;
}
ll bur(ll N, ll X) {
ll pan = 1;
ll pat = 1;
ll burg = 0;
if (X > burg) {
if (N == 0)
return pat;
burg += pan;
burg += bur(N - 1, X);
burg += pat;
burg += bur(N - 1, X);
burg += pan;
}
return burg;
}
ll gcd(ll a, ll b) {
/* 自然数 a > b を確認・入替 */
if (a < b) {
ll tmp = a;
a = b;
b = tmp;
}
ll x = b;
ll y = a;
/* ユークリッドの互除法 */
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return y / b * x;
}
bool IsPrime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
} | #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::vector;
#define rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define huge 1000000007
typedef long long int ll;
ll gcd(ll a, ll b);
ll bur(ll N, ll X);
bool IsPrime(int num);
int main(void) {
ll N = 0;
ll A = 0;
ll B = 0;
ll C = 0;
ll D = 0;
ll H = 0;
ll W = 0;
// ll T = 0;
// ll M = 0;
ll h[400][400] = {};
// ll b[100] = {};
// ll c[100] = {};
// ll d[100] = {};
// ll v[3] = {};
// ll *c, *s, *n;
string S, T[50], U[52];
char fi[50], fv[50];
ll count = 0;
ll count2 = 0;
float sum = 0;
ll min = 1000000000000;
ll max = 1;
ll dist1 = 0;
ll dist2 = 0;
ll dist3 = 0;
ll now = 0;
int tmax = 0;
int tmax2 = 0;
// int flag = 0;
char temp, head;
// int is = 0;
bool flag = false;
// char p;
ll all = 0;
ll niku = 0;
ll state = 2;
bool down = true;
cin >> N;
vector<int> ov(1000000);
// sort(ov.begin(),ov.end());
ov[0] = N;
now++;
A = N;
while (true) {
// cout << A << endl;
if (A % 2 == 0) {
A /= 2;
} else {
A = 3 * A + 1;
}
ov[now] = A;
rep(i, 0, now) {
if (A == ov[i]) {
flag = true;
}
}
if (flag == true)
break;
now++;
}
cout << now + 1 << endl;
/*vector<pair<int,int>> tr(N);
rep(i, 0, N) {
cin >> tr[i].first;
count += tr[i].first;
}
rep(i, 0, N) {
cin >> tr[i].second;
count2 += tr[i].second;
}
if (count < count2) {
cout << -1 << endl;
return 0;
}
rep(i, 0, N) {
if (tr[i].first < tr[i].second) {
sum += tr[i].second - tr[i].first;
niku++;
}
else {
ov[all] += tr[i].first - tr[i].second;
all++;
}
}
sort(ov.begin(), ov.end(), greater<>());
int xx = 0;
while (sum > 0) {
sum -= ov[xx];
xx++;
niku++;
}*/
// cout << niku << endl;
// x = (ll *)malloc((N+1) * sizeof(ll));
// c = (ll *)malloc((N) * sizeof(ll));
// cin >> D >> G;
// vector<pair<int,int>> tr(M);
// vector<pair<int,int>> qes(Q);
// sort(c.begin(), c.end());
// cout << c[2] - c[1] << endl;
/*A = N / 1000;
N %= 1000;
B = N / 100;
N %= 100;
C = N / 10;
N %= 10;
D = N;*/
// cin >> N >> M;
// vector<pair<int,int>> c(M);
////vector<pair<int, int>> e(M);
// vector<ll> d(M);
// rep(i, 0, M) {
// cin >> c[i].first >> c[i].second;
// //e[i].first = c[i].first;
// //e[i].second = c[i].second;
//}
////sort(c.begin(), c.end());
//
// rep(i, 0, M) {
//
//
// rep(j, 0, M) {
// if (c[i].first == c[j].first && c[j].second < c[i].second) {
// d[i]++;
// //cout << j << endl;
// }
// }
// cout << std::setfill('0') << std::right << std::setw(6) << c[i].first;
// cout << std::setfill('0') << std::right << std::setw(6) << d[i]+1 <<
//endl;
//}
return 0;
}
ll bur(ll N, ll X) {
ll pan = 1;
ll pat = 1;
ll burg = 0;
if (X > burg) {
if (N == 0)
return pat;
burg += pan;
burg += bur(N - 1, X);
burg += pat;
burg += bur(N - 1, X);
burg += pan;
}
return burg;
}
ll gcd(ll a, ll b) {
/* 自然数 a > b を確認・入替 */
if (a < b) {
ll tmp = a;
a = b;
b = tmp;
}
ll x = b;
ll y = a;
/* ユークリッドの互除法 */
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return y / b * x;
}
bool IsPrime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
} | [
"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 = vector<int>;
using vi2 = vector<vi>;
using vi3 = vector<vi2>;
using vll = vector<ll>;
using vll2 = vector<vll>;
using vll3 = vector<vll2>;
using vd = vector<db>;
using vd2 = vector<vd>;
using vd3 = vector<vd2>;
#define int long long
#define mp makepair
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define PQ priority_queue
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(i, n) FOR(i, 0, (n)-1)
#define FOR_IN(v, i) for (auto &(i) : (v))
#define ITOA(a, n) iota((a).begin(), (a).end(), n)
#define SORT_ASC(a) sort((a).begin(), (a).end())
#define SORT_DESC(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define PERM(a) next_permutation((a).begin(), (a).end())
#define PERM_DESC(a) prev_permutation((a).begin(), (a).end())
#define BINS(arr, tgt) binary_search((arr).begin(), (arr).end(), (tgt))
#define LB(arr, tgt) \
(lower_bound((arr).begin(), (arr).end(), (tgt)) - (arr).begin())
#define UB(arr, tgt) \
(upper_bound((arr).begin(), (arr).end(), (tgt)) - (arr).begin())
#define CNT(arr, tgt) count((arr).begin(), (arr).end(), (tgt))
#define SUM(arr) accumulate(arr.begin(), arr.end(), 0)
#define say(a) cout << (a);
#define echo(a) cout << (a) << endl;
#define YN(equation, if_t, if_f) echo((equation) ? (if_t) : (if_f))
#define SPACE say(" ")
#define TAB say("\t")
#define LF say("\n")
#define DigN2(a) (llabs(a) == 0 ? 1 : ((ll)(log2(db(llabs(a)))) + 1))
#define DigN10(a) (llabs(a) == 0 ? 1 : ((ll)(log10(db(llabs(a)))) + 1))
#define Dig2(a, b) (((a) >> (b)) & 1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (db)(b))))) % 10)
#define Pow2(n) (1 << (n))
#define Pow10(n) ((ll)(pow(10.0, db(n))))
#define LSB(a) ((a) & (-(a)))
#define iin(a) \
int(a); \
cin >> a;
#define llin(a) \
ll(a); \
cin >> a;
#define strin(s) \
string(s); \
cin >> s;
#define vin(v) \
FOR_IN((v), (i)) { cin >> i; };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
static const ll inf = 1LL << 60;
static const ll MOD = 1e9 + 7;
class BIT {
public:
vll d;
vll v;
ll size;
BIT(ll _size) {
size = _size;
d.assign(size + 1, 0);
v.assign(size, 0);
}
BIT(vll vec) { copy(vec); }
void add(ll idx, ll N) {
v[idx] += N;
idx++;
while (idx <= size) {
d[idx] += N;
idx += LSB(idx);
}
}
ll sum(ll idx = inf) {
idx++;
idx = min(idx, size);
ll ans = 0;
while (idx) {
ans += d[idx];
idx -= LSB(idx);
}
return ans;
}
void copy(vll vec) {
size = vec.size();
d.assign(size + 1, 0);
v.assign(size, 0);
REP(i, size) { add(i, vec[i]); }
}
};
class UnionFind {
public:
vll arr;
UnionFind(ll sz) : arr(sz, -1) {}
ll root(ll node) {
return arr[node] < 0 ? node : arr[node] = root(arr[node]);
}
ll size(ll x) { return -arr[root(x)]; }
bool union_set(ll x, ll y) {
x = root(x);
y = root(y);
if (x != y) {
if (arr[x] < arr[y]) {
swap(x, y);
}
arr[x] += arr[y];
arr[y] = x;
}
return x != y;
}
bool find_set(ll x, ll y) { return root(x) == root(y); }
};
class Vertex {
public:
ll idx;
ll param = -1;
ll dist = inf;
vector<pair<Vertex *, ll> /**/> e;
ll size() { return e.size(); }
bool operator==(const Vertex *o) { return dist == o->dist; }
bool operator!=(const Vertex *o) { return dist != o->dist; }
bool operator>(const Vertex *o) { return dist > o->dist; }
bool operator<(const Vertex *o) { return dist < o->dist; }
bool operator>=(const Vertex *o) { return dist >= o->dist; }
bool operator<=(const Vertex *o) { return dist <= o->dist; }
};
class Graph {
public:
vector<Vertex *> V;
typedef tuple<Vertex *, Vertex *, ll> Edge;
vector<Edge> E;
Graph(ll sz) {
REP(i, sz) {
auto v = new Vertex();
v->idx = i;
V.pb(v);
}
}
static bool comp(const Edge &e1, const Edge &e2) {
return get<2>(e1) < get<2>(e2);
}
Vertex *getVertex(int idx) { return V[idx]; }
void unite(ll from, ll to, ll w = 1, bool digraph = true) {
E.push_back(make_tuple(V[from], V[to], w));
V[from]->e.pb(make_pair(V[to], w));
if (!digraph) {
E.push_back(make_tuple(V[to], V[from], w));
V[to]->e.pb(make_pair(V[from], w));
}
}
void dijkstra(ll start) {
PQ<Vertex *, vector<Vertex *>, greater<Vertex *> /**/> pq;
Vertex *s = getVertex(start);
s->dist = 0;
pq.push(s);
while (!pq.empty()) {
Vertex *v = pq.top();
pq.pop();
for (auto &u : v->e) {
if (u.first->dist > v->dist + u.second) {
u.first->dist = v->dist + u.second;
pq.push(u.first);
}
}
}
}
};
ll isPrime(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n)) {
if (n % i == 0)
return 0;
}
return 1;
}
void vout(vll v) {
say("{");
REP(i, v.size()) {
say(v[i]);
if (i != v.size() - 1) {
say(", ");
}
}
echo("}");
}
ll DigS10(ll n) {
ll m = 0;
REP(i, DigN10(n)) { m += (ll)((llabs(n) % Pow10(i + 1))) / Pow10(i); }
return m;
}
ll PowMod(ll a, ll b) {
ll ans = 1, x = a % MOD;
REP(i, DigN2(b)) {
if (Dig2(b, i) == 1) {
ans = (ans * x) % MOD;
}
if (i != (DigN2(b) - 1)) {
x = (x * x) % MOD;
}
}
return ans;
}
vll FactMod(1, 1);
vll FactModInv(1, 1);
ll Mod(ll n) {
n %= MOD;
n = (n + MOD) % MOD;
return n;
}
ll InvM(ll n) {
n = Mod(n);
n = PowMod(n, MOD - 2);
return n;
}
void CFactMod(ll n) {
if (FactMod.size() <= n) {
FOR(i, FactMod.size(), n) {
FactMod.pb((FactMod[i - 1] * (i % MOD)) % MOD);
}
}
}
void CFactModInv(ll n) {
CFactMod(n);
if (FactModInv.size() < (n + 1)) {
FactModInv.resize(n + 1, -1);
}
if (FactModInv[n] == -1) {
FactModInv[n] = PowMod(FactMod[n], MOD - 2);
}
for (int i = n - 1; i >= 1; i--) {
if (FactModInv[i] != -1)
break;
FactModInv[i] = ((FactModInv[i + 1] * ((i + 1) % MOD)) % MOD);
}
}
ll CombMod(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (n + 1 > FactModInv.size())
CFactModInv(n);
return ((((FactModInv[k] * FactModInv[n - k]) % MOD) * FactMod[n]) % MOD);
}
typedef tuple<long long, long long> Pair;
Pair factor_sub(long long n, long long m) {
long long i = 0;
while (n % m == 0) {
i++;
n /= m;
}
return make_tuple(i, n);
}
vector<Pair> factorization(long long n) {
vector<Pair> a;
long long c, m;
tie(c, m) = factor_sub(n, 2);
if (c > 0)
a.push_back(make_tuple(2, c));
for (long long i = 3; m >= i * i; i += 2) {
tie(c, m) = factor_sub(m, i);
if (c > 0)
a.push_back(make_tuple(i, c));
}
if (m > 1)
a.push_back(make_tuple(m, 1));
return a;
}
signed main() {
ll s;
cin >> s;
if (s == 1 || s == 2 || s == 4) {
echo(4);
return 0;
}
ll ans = 0;
while (s != 4) {
if (s % 2 == 0) {
s = s / 2;
} else {
s = s * 3 + 1;
}
ans++;
}
echo(ans + 3);
} | #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 = vector<int>;
using vi2 = vector<vi>;
using vi3 = vector<vi2>;
using vll = vector<ll>;
using vll2 = vector<vll>;
using vll3 = vector<vll2>;
using vd = vector<db>;
using vd2 = vector<vd>;
using vd3 = vector<vd2>;
#define int long long
#define mp makepair
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define PQ priority_queue
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(i, n) FOR(i, 0, (n)-1)
#define FOR_IN(v, i) for (auto &(i) : (v))
#define ITOA(a, n) iota((a).begin(), (a).end(), n)
#define SORT_ASC(a) sort((a).begin(), (a).end())
#define SORT_DESC(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define PERM(a) next_permutation((a).begin(), (a).end())
#define PERM_DESC(a) prev_permutation((a).begin(), (a).end())
#define BINS(arr, tgt) binary_search((arr).begin(), (arr).end(), (tgt))
#define LB(arr, tgt) \
(lower_bound((arr).begin(), (arr).end(), (tgt)) - (arr).begin())
#define UB(arr, tgt) \
(upper_bound((arr).begin(), (arr).end(), (tgt)) - (arr).begin())
#define CNT(arr, tgt) count((arr).begin(), (arr).end(), (tgt))
#define SUM(arr) accumulate(arr.begin(), arr.end(), 0)
#define say(a) cout << (a);
#define echo(a) cout << (a) << endl;
#define YN(equation, if_t, if_f) echo((equation) ? (if_t) : (if_f))
#define SPACE say(" ")
#define TAB say("\t")
#define LF say("\n")
#define DigN2(a) (llabs(a) == 0 ? 1 : ((ll)(log2(db(llabs(a)))) + 1))
#define DigN10(a) (llabs(a) == 0 ? 1 : ((ll)(log10(db(llabs(a)))) + 1))
#define Dig2(a, b) (((a) >> (b)) & 1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (db)(b))))) % 10)
#define Pow2(n) (1 << (n))
#define Pow10(n) ((ll)(pow(10.0, db(n))))
#define LSB(a) ((a) & (-(a)))
#define iin(a) \
int(a); \
cin >> a;
#define llin(a) \
ll(a); \
cin >> a;
#define strin(s) \
string(s); \
cin >> s;
#define vin(v) \
FOR_IN((v), (i)) { cin >> i; };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
static const ll inf = 1LL << 60;
static const ll MOD = 1e9 + 7;
class BIT {
public:
vll d;
vll v;
ll size;
BIT(ll _size) {
size = _size;
d.assign(size + 1, 0);
v.assign(size, 0);
}
BIT(vll vec) { copy(vec); }
void add(ll idx, ll N) {
v[idx] += N;
idx++;
while (idx <= size) {
d[idx] += N;
idx += LSB(idx);
}
}
ll sum(ll idx = inf) {
idx++;
idx = min(idx, size);
ll ans = 0;
while (idx) {
ans += d[idx];
idx -= LSB(idx);
}
return ans;
}
void copy(vll vec) {
size = vec.size();
d.assign(size + 1, 0);
v.assign(size, 0);
REP(i, size) { add(i, vec[i]); }
}
};
class UnionFind {
public:
vll arr;
UnionFind(ll sz) : arr(sz, -1) {}
ll root(ll node) {
return arr[node] < 0 ? node : arr[node] = root(arr[node]);
}
ll size(ll x) { return -arr[root(x)]; }
bool union_set(ll x, ll y) {
x = root(x);
y = root(y);
if (x != y) {
if (arr[x] < arr[y]) {
swap(x, y);
}
arr[x] += arr[y];
arr[y] = x;
}
return x != y;
}
bool find_set(ll x, ll y) { return root(x) == root(y); }
};
class Vertex {
public:
ll idx;
ll param = -1;
ll dist = inf;
vector<pair<Vertex *, ll> /**/> e;
ll size() { return e.size(); }
bool operator==(const Vertex *o) { return dist == o->dist; }
bool operator!=(const Vertex *o) { return dist != o->dist; }
bool operator>(const Vertex *o) { return dist > o->dist; }
bool operator<(const Vertex *o) { return dist < o->dist; }
bool operator>=(const Vertex *o) { return dist >= o->dist; }
bool operator<=(const Vertex *o) { return dist <= o->dist; }
};
class Graph {
public:
vector<Vertex *> V;
typedef tuple<Vertex *, Vertex *, ll> Edge;
vector<Edge> E;
Graph(ll sz) {
REP(i, sz) {
auto v = new Vertex();
v->idx = i;
V.pb(v);
}
}
static bool comp(const Edge &e1, const Edge &e2) {
return get<2>(e1) < get<2>(e2);
}
Vertex *getVertex(int idx) { return V[idx]; }
void unite(ll from, ll to, ll w = 1, bool digraph = true) {
E.push_back(make_tuple(V[from], V[to], w));
V[from]->e.pb(make_pair(V[to], w));
if (!digraph) {
E.push_back(make_tuple(V[to], V[from], w));
V[to]->e.pb(make_pair(V[from], w));
}
}
void dijkstra(ll start) {
PQ<Vertex *, vector<Vertex *>, greater<Vertex *> /**/> pq;
Vertex *s = getVertex(start);
s->dist = 0;
pq.push(s);
while (!pq.empty()) {
Vertex *v = pq.top();
pq.pop();
for (auto &u : v->e) {
if (u.first->dist > v->dist + u.second) {
u.first->dist = v->dist + u.second;
pq.push(u.first);
}
}
}
}
};
ll isPrime(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n)) {
if (n % i == 0)
return 0;
}
return 1;
}
void vout(vll v) {
say("{");
REP(i, v.size()) {
say(v[i]);
if (i != v.size() - 1) {
say(", ");
}
}
echo("}");
}
ll DigS10(ll n) {
ll m = 0;
REP(i, DigN10(n)) { m += (ll)((llabs(n) % Pow10(i + 1))) / Pow10(i); }
return m;
}
ll PowMod(ll a, ll b) {
ll ans = 1, x = a % MOD;
REP(i, DigN2(b)) {
if (Dig2(b, i) == 1) {
ans = (ans * x) % MOD;
}
if (i != (DigN2(b) - 1)) {
x = (x * x) % MOD;
}
}
return ans;
}
vll FactMod(1, 1);
vll FactModInv(1, 1);
ll Mod(ll n) {
n %= MOD;
n = (n + MOD) % MOD;
return n;
}
ll InvM(ll n) {
n = Mod(n);
n = PowMod(n, MOD - 2);
return n;
}
void CFactMod(ll n) {
if (FactMod.size() <= n) {
FOR(i, FactMod.size(), n) {
FactMod.pb((FactMod[i - 1] * (i % MOD)) % MOD);
}
}
}
void CFactModInv(ll n) {
CFactMod(n);
if (FactModInv.size() < (n + 1)) {
FactModInv.resize(n + 1, -1);
}
if (FactModInv[n] == -1) {
FactModInv[n] = PowMod(FactMod[n], MOD - 2);
}
for (int i = n - 1; i >= 1; i--) {
if (FactModInv[i] != -1)
break;
FactModInv[i] = ((FactModInv[i + 1] * ((i + 1) % MOD)) % MOD);
}
}
ll CombMod(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (n + 1 > FactModInv.size())
CFactModInv(n);
return ((((FactModInv[k] * FactModInv[n - k]) % MOD) * FactMod[n]) % MOD);
}
typedef tuple<long long, long long> Pair;
Pair factor_sub(long long n, long long m) {
long long i = 0;
while (n % m == 0) {
i++;
n /= m;
}
return make_tuple(i, n);
}
vector<Pair> factorization(long long n) {
vector<Pair> a;
long long c, m;
tie(c, m) = factor_sub(n, 2);
if (c > 0)
a.push_back(make_tuple(2, c));
for (long long i = 3; m >= i * i; i += 2) {
tie(c, m) = factor_sub(m, i);
if (c > 0)
a.push_back(make_tuple(i, c));
}
if (m > 1)
a.push_back(make_tuple(m, 1));
return a;
}
signed main() {
ll s;
cin >> s;
if (s == 1 || s == 2 || s == 4) {
echo(4);
return 0;
}
ll ans = 0;
while (s != 4) {
if (s % 2 == 0) {
s = s / 2;
} else {
s = s * 3 + 1;
}
ans++;
}
echo(ans + 4);
} | [
"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, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << x << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
#define CHMIN(a, b) a = min((a), (b))
#define CHMAX(a, b) a = max((a), (b))
const ll MOD = 1000000007ll;
// const ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-11;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
bool used[1252525];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int s;
cin >> s;
int ans = 0;
REP(i, 1252525) {
if (s & 1) {
s = 3 * s + 1;
} else {
s /= 2;
}
if (used[s]) {
cout << i + 2 << '\n';
return 0;
} else {
used[s] = true;
}
}
return 0;
}
| #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, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << x << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
#define CHMIN(a, b) a = min((a), (b))
#define CHMAX(a, b) a = max((a), (b))
const ll MOD = 1000000007ll;
// const ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-11;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
bool used[1252525];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int s;
cin >> s;
used[s] = true;
REP(i, 1252525) {
if (s & 1) {
s = 3 * s + 1;
} else {
s /= 2;
}
if (used[s]) {
cout << i + 2 << '\n';
return 0;
} else {
used[s] = true;
}
}
return 0;
}
| [
"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 tuple<double, double, double> tddd;
static const int giga = pow(10, 9);
int main(void) {
int s;
cin >> s;
vector<int> a;
a.push_back(s);
for (int i = 0;; i++) {
for (int j = 0; j < i; j++) {
if (a[i] == a[j]) {
cout << i << endl;
return 0;
} else {
}
}
int temp;
if (a[i] % 2 == 0) {
temp = a[i] / 2;
a.push_back(temp);
} else {
temp = a[i] * 3 + 1;
a.push_back(temp);
}
}
return 0;
} | #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 tuple<double, double, double> tddd;
static const int giga = pow(10, 9);
int main(void) {
int s;
cin >> s;
vector<int> a;
a.push_back(s);
for (int i = 0;; i++) {
for (int j = 0; j < i; j++) {
if (a[i] == a[j]) {
cout << i + 1 << endl;
return 0;
} else {
}
}
int temp;
if (a[i] % 2 == 0) {
temp = a[i] / 2;
a.push_back(temp);
} else {
temp = a[i] * 3 + 1;
a.push_back(temp);
}
}
return 0;
} | [
"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() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0, height = 200;
rep(i, n) {
if (height < h[i])
ans += h[i] - height;
height = h[i];
}
cout << ans;
} | #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() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0, height = 0;
rep(i, n) {
if (height < h[i])
ans += h[i] - height;
height = h[i];
}
cout << ans;
} | [
"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;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int h[110];
rep(i, N) cin >> h[i];
int ans = 0;
while (true) {
int i = 0;
int cnt = INF;
int first = 0;
while (first < N && h[first] == 0)
first++;
if (first == N)
break;
i = first;
cnt = h[first];
while (i < N && h[i + 1] != 0) {
cnt = min(cnt, h[i]);
i++;
}
ans += cnt;
REP(j, first, i) h[j] -= cnt;
// rep(j, N) cout << h[j] << " ";
// cout << endl;
}
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int h[110];
rep(i, N) cin >> h[i];
int ans = 0;
while (true) {
int i = 0;
int cnt = INF;
int first = 0;
while (first < N && h[first] == 0)
first++;
if (first == N)
break;
i = first;
cnt = h[first];
while (i < N && h[i] != 0) {
cnt = min(cnt, h[i]);
i++;
}
ans += cnt;
REP(j, first, i - 1) h[j] -= cnt;
// rep(j, N) cout << h[j] << " ";
// cout << endl;
}
cout << ans << endl;
return 0;
}
| [
"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;
// 区間が最大になるようにとる
while (1) {
int left = 0, right = 0;
int maxLeft = 0, maxRight = 0;
for (int i = 0; i < n; i++) {
if (h[i] == 0) {
right = i;
int tmpInterVal = right - left;
int maxInterVal = maxRight - maxLeft;
if (tmpInterVal > maxInterVal) {
maxLeft = left, maxRight = right;
}
left = right + 1;
}
}
// 最後用
right = n;
int tmpInterVal = right - left;
int maxInterVal = maxRight - maxLeft;
if (tmpInterVal > maxInterVal) {
maxLeft = left, maxRight = right;
}
// その区間の高さ最小
int minH = 100;
for (int i = maxLeft; i < maxRight; i++) {
minH = std::min(minH, h[i]);
}
if (minH == 100) {
break;
} else {
cost += minH;
for (int i = maxLeft; i < maxRight; i++)
h[i] -= minH;
}
}
std::cout << cost << std::endl;
return 0;
}
| #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;
// 区間が最大になるようにとる
while (1) {
int left = 0, right = 0;
int maxLeft = 0, maxRight = 0;
for (int i = 0; i < n; i++) {
if (h[i] == 0) {
right = i;
int tmpInterVal = right - left;
int maxInterVal = maxRight - maxLeft;
if (tmpInterVal > maxInterVal) {
maxLeft = left, maxRight = right;
}
left = right + 1;
}
}
// 最後用
right = n;
int tmpInterVal = right - left;
int maxInterVal = maxRight - maxLeft;
if (tmpInterVal > maxInterVal) {
maxLeft = left, maxRight = right;
}
// その区間の高さ最小
int minH = 1000;
for (int i = maxLeft; i < maxRight; i++) {
minH = std::min(minH, h[i]);
}
if (minH == 1000) {
break;
} else {
cost += minH;
for (int i = maxLeft; i < maxRight; i++)
h[i] -= minH;
}
}
std::cout << cost << std::endl;
return 0;
}
| [
"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()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define isYes(x) printf("%s\n", (x) ? "Yes" : "No")
#define isPossible(x) printf("%s\n", (x) ? "Possible" : "Impossible")
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define INF (1 << 29)
// const long long INF = 1LL<<60;
#define Sp(p) cout << setprecision(25) << fixed << p << endl
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define X first
#define Y second
#define pie 3.14159265358979323846
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
template <class T> void print(T &x) { cout << x << '\n'; }
const int MOD = (int)1e9 + 7;
const int mod = (int)998244353;
const int MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMint() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll a, ll b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
if (b == 0)
return a;
if (a > b) {
swap(a, b);
}
return gcd(a, b % a);
}
ll lcm(ll a, ll b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
ll g;
g = gcd(a, b);
return b / g * a;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
bool compare_by_a(pair<int, int> a, pair<int, int> b) {
if (a.first != b.first) {
return a.first < b.first;
} else {
return a.second < b.second;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll RS(ll N, ll P, ll m) {
if (P == 0) {
return 1;
} else {
if (P % 2 == 0) {
ll t = RS(N, P / 2, m);
return t * t % m;
} else {
return N * RS(N, P - 1, m) % m;
}
}
}
bool greater_pair(pair<ll, ll> a, pair<ll, ll> b) {
if (a.first != b.first) {
return a.first > b.first;
} else {
return a.second > b.second;
}
}
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} c(2000005);
int main() {
ios::sync_with_stdio(false);
int N = in();
vector<int> h(N);
int ans = 0;
REP(i, N) {
cin >> h[i];
ans += h[i];
}
REP(i, N - 1) ans -= min(h[i], h[i - 1]);
cout << ans << endl;
return 0;
}
| #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()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define isYes(x) printf("%s\n", (x) ? "Yes" : "No")
#define isPossible(x) printf("%s\n", (x) ? "Possible" : "Impossible")
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define INF (1 << 29)
// const long long INF = 1LL<<60;
#define Sp(p) cout << setprecision(25) << fixed << p << endl
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define X first
#define Y second
#define pie 3.14159265358979323846
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
template <class T> void print(T &x) { cout << x << '\n'; }
const int MOD = (int)1e9 + 7;
const int mod = (int)998244353;
const int MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMint() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll a, ll b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
if (b == 0)
return a;
if (a > b) {
swap(a, b);
}
return gcd(a, b % a);
}
ll lcm(ll a, ll b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
ll g;
g = gcd(a, b);
return b / g * a;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
bool compare_by_a(pair<int, int> a, pair<int, int> b) {
if (a.first != b.first) {
return a.first < b.first;
} else {
return a.second < b.second;
}
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll RS(ll N, ll P, ll m) {
if (P == 0) {
return 1;
} else {
if (P % 2 == 0) {
ll t = RS(N, P / 2, m);
return t * t % m;
} else {
return N * RS(N, P - 1, m) % m;
}
}
}
bool greater_pair(pair<ll, ll> a, pair<ll, ll> b) {
if (a.first != b.first) {
return a.first > b.first;
} else {
return a.second > b.second;
}
}
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} c(2000005);
int main() {
ios::sync_with_stdio(false);
int N = in();
vector<int> h(N);
int ans = 0;
REP(i, N) {
cin >> h[i];
ans += h[i];
}
REP(i, N - 1) ans -= min(h[i], h[i + 1]);
cout << ans << endl;
return 0;
}
| [
"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;
for (int i = 1; i <= N; i++) {
if (h[i - 1] < h[i]) {
ans += (h[i] - h[i - 1]);
}
}
cout << ans << endl;
} | #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;
for (int i = 1; i <= N; i++) {
if (h[i - 1] < h[i]) {
ans += (h[i] - h[i - 1]);
}
}
cout << ans << endl;
} | [
"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 (int i = 1; i <= N; i++) {
if (h[i - 1] < h[i]) {
ans += (h[i] - h[i - 1]);
}
}
cout << ans << endl;
} | #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;
for (int i = 1; i <= N; i++) {
if (h[i - 1] < h[i]) {
ans += (h[i] - h[i - 1]);
}
}
cout << ans << endl;
} | [
"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);
} else {
p = a.at(i);
}
}
cout << ans;
} | #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);
} else {
p = a.at(i + 1);
}
}
cout << ans;
} | [
"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 {
p = a.at(i);
}
}
cout << ans;
}
| #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);
} else {
p = a.at(i + 1);
}
}
cout << ans;
} | [
"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);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
int ans = 0;
while (true) {
bool ok = true;
for (auto it : h)
if (it > 0)
ok = false;
if (ok)
break;
int c = 0;
for (int i = 0; i < N; i++) {
bool f = false;
if (i == 0)
f = true;
if (h[i] <= 0) {
while (i + 1 < N && h[i + 1] <= 0)
i++;
if (!f && i != N)
c++;
}
}
for (int i = 0; i < N; i++)
h[i]--;
ans += c + 1;
}
cout << ans << endl;
return 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);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
int ans = 0;
while (true) {
bool ok = true;
for (auto it : h)
if (it > 0)
ok = false;
if (ok)
break;
int c = 0;
for (int i = 0; i < N; i++) {
bool f = false;
if (i == 0)
f = true;
if (h[i] <= 0) {
while (i + 1 < N && h[i + 1] <= 0)
i++;
if (!f && i != N - 1)
c++;
}
}
for (int i = 0; i < N; i++)
h[i]--;
ans += c + 1;
}
cout << ans << endl;
return 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; i++)
cin >> flowers[i];
ll ans = 0;
for (ll i = 1; i < n; i++) {
if (flowers[i] - flowers[i - 1] < 0)
ans += flowers[i] - flowers[i - 1];
}
cout << ans + flowers[n - 1] << endl;
} | #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; i++)
cin >> flowers[i];
ll ans = 0;
for (ll i = 1; i < n; i++) {
if (flowers[i] - flowers[i - 1] < 0)
ans += abs(flowers[i] - flowers[i - 1]);
}
cout << ans + flowers[n - 1] << endl;
} | [
"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] >= h[i - 1] && h[i] > h[i + 1]) {
ans += h[i] - lm;
} else if (h[i] <= h[i - 1] && h[i] < h[i + 1]) {
lm = h[i];
}
}
cout << ans << endl;
} | #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] >= h[i - 1] && h[i] > h[i + 1]) {
ans += h[i] - lm;
} else if (h[i] < h[i - 1] && h[i] <= h[i + 1]) {
lm = h[i];
}
}
cout << ans << endl;
} | [
"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] >= h[i - 1] && h[i] > h[i + 1]) {
ans += h[i] - lm;
} else if (h[i] < h[i - 1] && h[i] < h[i + 1]) {
lm = h[i];
}
}
cout << ans << endl;
} | #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] >= h[i - 1] && h[i] > h[i + 1]) {
ans += h[i] - lm;
} else if (h[i] < h[i - 1] && h[i] <= h[i + 1]) {
lm = h[i];
}
}
cout << ans << endl;
} | [
"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 (flag) {
flag = false;
cnt++;
}
v[j]--;
}
else if (v[j] == 0)
flag = true;
if (j == n - 1) {
flag = true;
max--;
}
}
}
cout << cnt << endl;
return 0;
} | #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 (flag == true) {
flag = false;
cnt++;
}
v[j]--;
}
else if (v[j] == 0)
flag = true;
if (j == n - 1) {
flag = true;
max--;
}
}
}
cout << cnt << endl;
return 0;
} | [
"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++;
for (int i = 0; i < N - 1; i++) {
if (h[i] > 0 && h[i + 1] <= 0)
count++;
}
if (h[N - 1] == 0)
count--;
for (int i = 0; i < N; i++)
h[i]--;
}
cout << count << endl;
}
| #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++;
for (int i = 0; i < N - 1; i++) {
if (h[i] > 0 && h[i + 1] <= 0)
count++;
}
if (h[N - 1] <= 0)
count--;
for (int i = 0; i < N; i++)
h[i]--;
}
cout << count << endl;
}
| [
"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 second
#define pt(num) cout << num << "\n"
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF 1000000000000000000
#define MOD 1000000007LL
#define MAX 101010
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef map<ll, ll> Map;
int main(void) {
ll N;
cin >> N;
ll i;
ll t = 0;
ll ans = 0;
for (i = 0; i < N; i++) {
ll h;
cin >> h;
ans += max(h - t, 0);
}
pt(ans);
}
| #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 second
#define pt(num) cout << num << "\n"
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF 1000000000000000000
#define MOD 1000000007LL
#define MAX 101010
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef map<ll, ll> Map;
int main(void) {
ll N;
cin >> N;
ll i;
ll t = 0;
ll ans = 0;
for (i = 0; i < N; i++) {
ll h;
cin >> h;
ans += max(h - t, 0);
t = h;
}
pt(ans);
}
| [
"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 second
#define pt(num) cout << num << "\n"
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF 1000000000000000000
#define MOD 1000000007LL
#define MAX 101010
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef map<ll, ll> Map;
ll N;
ll h[111];
ll rec(ll l, ll r) {
if (l >= r)
return 0;
ll res = 0;
ll i;
ll min = INF;
for (i = l; i < r; i++)
chmin(min, h[i]);
res += min;
vector<ll> ze;
ze.pb(-1);
for (i = l; i < r; i++) {
h[i] -= min;
if (h[i] == 0)
ze.pb(i);
}
ze.pb(N);
for (i = 0; i < ze.size() - 1; i++)
res += rec(ze[i] + 1, ze[i + 1]);
return res;
}
int main(void) {
cin >> N;
ll i;
for (i = 0; i < N; i++)
cin >> h[i];
pt(rec(0, N));
}
| #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 second
#define pt(num) cout << num << "\n"
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF 1000000000000000000
#define MOD 1000000007LL
#define MAX 101010
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef map<ll, ll> Map;
ll N;
ll h[111];
ll rec(ll l, ll r) {
if (l >= r)
return 0;
ll res = 0;
ll i;
ll min = INF;
for (i = l; i < r; i++)
chmin(min, h[i]);
res += min;
vector<ll> ze;
ze.pb(l - 1);
for (i = l; i < r; i++) {
h[i] -= min;
if (h[i] == 0)
ze.pb(i);
}
ze.pb(N);
for (i = 0; i < ze.size() - 1; i++)
res += rec(ze[i] + 1, ze[i + 1]);
return res;
}
int main(void) {
cin >> N;
ll i;
for (i = 0; i < N; i++)
cin >> h[i];
pt(rec(0, N));
}
| [
"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 = 0;
else if (!b && v[i] > i) {
b = 1;
++t;
}
}
s += t;
}
cout << s << endl;
return 0;
} | #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 = 0;
else if (!b && v[j] > i) {
b = 1;
++t;
}
}
s += t;
}
cout << s << endl;
return 0;
} | [
"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; i < n; i++) {
if (h[i] == mx && i == 0) {
ans++;
} else if (h[i] == mx && h[i - 1] != mx) {
ans++;
}
}
for (int i = 0; i < n; i++) {
if (h[i] == mx)
h[i]--;
}
mx--;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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 < n; i++) {
if (h[i] == mx && i == 0) {
ans++;
} else if (h[i] == mx && h[i - 1] != mx) {
ans++;
}
}
for (int i = 0; i < n; i++) {
if (h[i] == mx)
h[i]--;
}
mx--;
}
cout << ans << endl;
return 0;
}
| [
"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; i < n; i++) {
if (h[i] == mx && i == 0) {
ans++;
} else if (h[i] == mx && h[i - 1] != mx) {
ans++;
}
}
for (int i = 0; i < n; i++) {
if (h[i] == mx)
h[i]--;
}
mx--;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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 < n; i++) {
if (h[i] == mx && i == 0) {
ans++;
} else if (h[i] == mx && h[i - 1] != mx) {
ans++;
}
}
for (int i = 0; i < n; i++) {
if (h[i] == mx)
h[i]--;
}
mx--;
}
cout << ans << endl;
return 0;
}
| [
"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<vll> vvll;
typedef pair<int, int> pi;
typedef queue<pi> qpi;
typedef pair<ll, ll> pll;
typedef queue<pll> qpll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const int mod = 1000000007;
const int INF = 1001001001;
// 小数点 << fixed << setprecision(0) <<
// sort降順 sort(ALL(),greater<int>());
// 円周率 M_PI
// 文字判定 isupper islower
// 順列 do {} while(next_permutation(ALL(X)));
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
struct edge {
int from; //出発点
int to; //到達点
int cost; //移動コスト
};
typedef struct edge se;
typedef vector<edge> ve;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int n;
cin >> n;
vi h(n);
REP(i, n) { cin >> h[i]; }
int ans = h[0];
REP(i, n - 1) {
if (h[i] < h[i + 1])
ans += h[i] - h[i + 1];
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<int, int> pi;
typedef queue<pi> qpi;
typedef pair<ll, ll> pll;
typedef queue<pll> qpll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const int mod = 1000000007;
const int INF = 1001001001;
// 小数点 << fixed << setprecision(0) <<
// sort降順 sort(ALL(),greater<int>());
// 円周率 M_PI
// 文字判定 isupper islower
// 順列 do {} while(next_permutation(ALL(X)));
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
struct edge {
int from; //出発点
int to; //到達点
int cost; //移動コスト
};
typedef struct edge se;
typedef vector<edge> ve;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int n;
cin >> n;
vi h(n);
REP(i, n) { cin >> h[i]; }
int ans = h[0];
REP(i, n - 1) {
if (h[i] < h[i + 1])
ans += h[i + 1] - h[i];
}
cout << ans << endl;
return 0;
}
| [
"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;
rep(i, n) {
if (active >= h[i]) {
active = h[i];
} else {
ans += h[i] - active;
active = h[i];
}
}
cout << endl;
return 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;
rep(i, n) {
if (active >= h[i]) {
active = h[i];
} else {
ans += h[i] - active;
active = h[i];
}
}
cout << ans;
cout << endl;
return 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;
}
template <typename T> inline void print(const std::vector<T> &rhs) {
std::cout << " = [ ";
for (uint i = 0; i < rhs.size(); ++i) {
std::cout << rhs[i] << ' ';
}
std::cout << "]" << std::endl;
}
template <typename T>
inline void print(const std::vector<std::vector<T>> &rhs) {
std::cout << " = " << std::endl;
std::cout << "[[ ";
for (uint p = 0; p < rhs.size(); ++p) {
if (p != 0) {
std::cout << " [ ";
}
for (uint q = 0; q < rhs[p].size(); ++q) {
std::cout << rhs[p][q] << ' ';
}
if (p != rhs.size() - 1) {
std::cout << "]" << std::endl;
}
}
std::cout << "]]" << std::endl;
}
template <typename TL, typename TR>
inline void print(const std::vector<std::pair<TR, TL>> &rhs) {
std::cout << " = [";
uint i = 0;
for (; i < rhs.size() - 1; ++i) {
std::cout << "[f: " << rhs[i].first << ", s: " << rhs[i].second << "], ";
}
std::cout << "[f: " << rhs[i].first << ", s: " << rhs[i].second << "]]"
<< endl;
}
#define printn(var) \
{ \
printf("%s", #var); \
print(var); \
}
#define printn_all(var) \
{ \
printf("%s(%d): ", __func__, __LINE__); \
printf("%s", #var); \
print(var); \
}
//---
int main() {
uint N;
cin >> N;
vector<int> vH(N);
for (uint i = 0; i < N; ++i) {
cin >> vH[i];
}
int64 cnt = 0ll;
for (;;) {
if (*max_element(vH.begin(), vH.end()) == 0) {
break;
}
for (uint i = 0;;) {
bool isUpdate = false;
while (i < vH.size() && vH[i] == 0) {
++i;
} // skip empty
while (i < vH.size() && vH[i] != 0) {
--vH[i];
++i;
isUpdate = true;
}
if (isUpdate) {
++cnt;
}
printn(vH);
if (i == vH.size()) {
break;
}
}
}
cout << cnt << endl;
return 0;
} | // 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;
}
template <typename T> inline void print(const std::vector<T> &rhs) {
std::cout << " = [ ";
for (uint i = 0; i < rhs.size(); ++i) {
std::cout << rhs[i] << ' ';
}
std::cout << "]" << std::endl;
}
template <typename T>
inline void print(const std::vector<std::vector<T>> &rhs) {
std::cout << " = " << std::endl;
std::cout << "[[ ";
for (uint p = 0; p < rhs.size(); ++p) {
if (p != 0) {
std::cout << " [ ";
}
for (uint q = 0; q < rhs[p].size(); ++q) {
std::cout << rhs[p][q] << ' ';
}
if (p != rhs.size() - 1) {
std::cout << "]" << std::endl;
}
}
std::cout << "]]" << std::endl;
}
template <typename TL, typename TR>
inline void print(const std::vector<std::pair<TR, TL>> &rhs) {
std::cout << " = [";
uint i = 0;
for (; i < rhs.size() - 1; ++i) {
std::cout << "[f: " << rhs[i].first << ", s: " << rhs[i].second << "], ";
}
std::cout << "[f: " << rhs[i].first << ", s: " << rhs[i].second << "]]"
<< endl;
}
#define printn(var) \
{ \
printf("%s", #var); \
print(var); \
}
#define printn_all(var) \
{ \
printf("%s(%d): ", __func__, __LINE__); \
printf("%s", #var); \
print(var); \
}
//---
int main() {
uint N;
cin >> N;
vector<int> vH(N);
for (uint i = 0; i < N; ++i) {
cin >> vH[i];
}
int64 cnt = 0ll;
for (;;) {
if (*max_element(vH.begin(), vH.end()) == 0) {
break;
}
for (uint i = 0;;) {
bool isUpdate = false;
while (i < vH.size() && vH[i] == 0) {
++i;
} // skip empty
while (i < vH.size() && vH[i] != 0) {
--vH[i];
++i;
isUpdate = true;
}
if (isUpdate) {
++cnt;
}
if (i == vH.size()) {
break;
}
}
}
cout << cnt << endl;
return 0;
} | [
"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_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
for (int i = 0; i < n;) {
if (h[i] == 0) {
i++;
continue;
}
if (i == n - 1 && h[i] != 0) {
ans += h[i];
h[i] = 0;
break;
}
for (int j = i + 1; j < n; j++) {
if (h[j] <= 0) {
int m = *min_element(next(h.begin(), i), next(h.begin(), j));
for (int k = i; k < j; k++) {
h[k] -= m;
}
ans += m;
break;
} else if (j == n - 1) {
int m = *min_element(next(h.begin(), i), next(h.begin(), n - 1));
for (int k = i; k <= n - 1; k++) {
h[k] -= m;
}
ans += m;
break;
}
}
}
cout << ans << endl;
return 0;
} | #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_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
for (int i = 0; i < n;) {
if (h[i] == 0) {
i++;
continue;
}
if (i == n - 1 && h[i] != 0) {
ans += h[i];
h[i] = 0;
break;
}
for (int j = i + 1; j < n; j++) {
if (h[j] <= 0) {
int m = *min_element(next(h.begin(), i), next(h.begin(), j));
for (int k = i; k < j; k++) {
h[k] -= m;
}
ans += m;
break;
} else if (j == n - 1) {
int m = *min_element(next(h.begin(), i), next(h.begin(), n));
for (int k = i; k <= n - 1; k++) {
h[k] -= m;
}
ans += m;
break;
}
}
}
cout << ans << endl;
return 0;
} | [
"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).end()
#define Sort(a) sort(ALL(a))
#define Rev(a) reverse(ALL(a))
using namespace std;
// using ll=long long;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pi;
const long double PI = 3.14159265358979323846;
template <class T> bool contain(const std::string &s, const T &v) {
return s.find(v) != std::string::npos;
}
int main() {
ll n;
cin >> n;
vector<ll> h(n + 1);
rep(i, n) { cin >> h[i]; }
h[n] = 0;
ll ans = 10000000000;
ll i = 0;
ll j = 0;
while (h[j] == 0)
j++;
i = j;
while (j < n) {
// cout<<j<<h[i]<<endl;
if (i > n - 1 || h[i] == 0) {
// cout<<"#"<<ans<<" "<<i<<" "<<j<<endl;
while (h[j] == 0)
j++;
i = j;
ans++;
}
if (h[i] > 0) {
h[i]--;
// cout<<i<<endl;
i++;
}
}
cout << ans << endl;
}
| #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).end()
#define Sort(a) sort(ALL(a))
#define Rev(a) reverse(ALL(a))
using namespace std;
// using ll=long long;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pi;
const long double PI = 3.14159265358979323846;
template <class T> bool contain(const std::string &s, const T &v) {
return s.find(v) != std::string::npos;
}
int main() {
ll n;
cin >> n;
vector<ll> h(n + 1);
rep(i, n) { cin >> h[i]; }
h[n] = 100000000000;
ll ans = 0;
ll i = 0;
ll j = 0;
while (h[j] == 0)
j++;
i = j;
while (j < n) {
// cout<<j<<h[i]<<endl;
if (i > n - 1 || h[i] == 0) {
// cout<<"#"<<ans<<" "<<i<<" "<<j<<endl;
while (h[j] == 0)
j++;
i = j;
ans++;
}
if (h[i] > 0) {
h[i]--;
// cout<<i<<endl;
i++;
}
}
cout << ans << endl;
}
| [
"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 = 0; j < N; j++) {
if (garden[j] < i)
swi = true;
else {
if (swi)
ans++;
swi = false;
}
}
}
cout << ans << endl;
} | #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 = 0; j < N; j++) {
if (garden[j] < i)
swi = true;
else {
if (swi)
ans++;
swi = false;
}
}
}
cout << ans << endl;
} | [
"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) {
for (int i = 0; i < n; ++i) { // all 0 ?
if (h[i] != 0) {
break;
}
if (i == n - 1) {
cout << Sum << endl;
return 0;
}
}
for (int i = 0; i < n; ++i) {
if (h[i] != 0 && flg == 0) {
flg = 1;
st = i;
}
if (h[i] != 0 && h[i + 1] == 0) {
end = i;
flg = 0;
Min = 100;
for (int j = st; j <= end; ++j) {
if (Min > h[j]) {
Min = h[j];
}
}
for (int j = st; j <= end; ++j) {
h[j] -= Min;
}
Sum += Min;
break;
}
}
}
}
| #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 (1) {
for (int i = 0; i < n; ++i) { // all 0 ?
if (h[i] != 0) {
break;
}
if (i == n - 1) {
cout << Sum << endl;
return 0;
}
}
for (int i = 0; i < n; ++i) {
if (h[i] != 0 && flg == 0) {
flg = 1;
st = i;
}
if (h[i] != 0 && h[i + 1] == 0) {
end = i;
flg = 0;
Min = 100;
for (int j = st; j <= end; ++j) {
if (Min > h[j]) {
Min = h[j];
}
}
for (int j = st; j <= end; ++j) {
h[j] -= Min;
}
Sum += Min;
break;
}
}
}
}
| [
"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];
}
int result = 0;
while (true) {
bool dec = false;
for (int i = 0; i < vNum.size(); i++) {
if (vNum[i] != 0) {
--vNum[i];
dec = true;
} else if (dec) {
break;
}
}
++result;
bool isContinue = false;
for (int i = 0; i < vNum.size(); i++) {
if (vNum[i] != 0) {
isContinue = true;
break;
}
}
if (isContinue) {
continue;
}
break;
};
cout << result;
} | #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];
}
int result = 0;
while (true) {
bool dec = false;
for (int i = 0; i < vNum.size(); i++) {
if (vNum[i] != 0) {
--vNum[i];
dec = true;
} else if (dec) {
break;
}
}
if (dec) {
++result;
}
bool isContinue = false;
for (int i = 0; i < vNum.size(); i++) {
if (vNum[i] != 0) {
isContinue = true;
break;
}
}
if (isContinue) {
continue;
}
break;
};
cout << result;
} | [
"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;
rep(i, n) {
if (active >= h[i]) {
active = h[i];
} else {
ans += h[i] - active;
active = h[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
int active = 0;
rep(i, n) {
if (active >= h[i]) {
active = h[i];
} else {
ans += h[i] - active;
active = h[i];
}
}
cout << ans << endl;
return 0;
} | [] | 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(n + 10, 0);
vector<int> a(n + 10, 0);
rep(i, n) {
int x;
cin >> x;
h[i] = x;
}
ll ans = 0;
bool f = true;
while (f) {
int l = -1;
int r = -1;
rep(i, n) {
if (a[i] != h[i] && l == -1) {
l = i;
for (int j = i + 1; j < n; j++) {
if (a[j] == h[j] && r == -1) {
r = j - 1;
break;
}
}
}
if (r != -1)
break;
}
if (l == -1 && r == -1) {
f = false;
break;
} else if (l != -1 && r == -1)
r = n - 1;
for (int i = l; i <= r; i++) {
a[i]++;
}
ans++;
}
return 0;
}
| #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(n + 10, 0);
vector<int> a(n + 10, 0);
rep(i, n) {
int x;
cin >> x;
h[i] = x;
}
ll ans = 0;
bool f = true;
while (f) {
int l = -1;
int r = -1;
rep(i, n) {
if (a[i] != h[i] && l == -1) {
l = i;
for (int j = i + 1; j < n; j++) {
if (a[j] == h[j] && r == -1) {
r = j - 1;
break;
}
}
}
if (r != -1)
break;
}
if (l == -1 && r == -1) {
f = false;
break;
} else if (l != -1 && r == -1)
r = n - 1;
for (int i = l; i <= r; i++) {
a[i]++;
}
ans++;
}
cout << ans;
return 0;
}
| [] | 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 < n; j++) {
if (h[j] > 0) {
flag.push_back(1);
} else {
flag.push_back(0);
}
h[j]--;
}
flag.push_back(0);
}
int count = 0;
for (int i = 0; i < flag.size() - 1; i++) {
if (flag[i] == 1 && flag[i + 1] == 0) {
count++;
}
}
std::cout << count << std::endl;
return 0;
} | #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 < n; j++) {
if (h[j] > 0) {
flag.push_back(1);
} else {
flag.push_back(0);
}
h[j]--;
}
flag.push_back(0);
}
int count = 0;
for (int i = 0; i < (int)flag.size() - 1; i++) {
if (flag[i] == 1 && flag[i + 1] == 0) {
count++;
}
}
std::cout << count << std::endl;
return 0;
} | [
"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>
#include <iomanip> //setprecision
#include <iostream>
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define ll long long
#define mod 1000000007
vector<ll> to[1000005];
int main() {
ll a, b, c = 0, d = 0;
cin >> a;
rep(i, a) {
cin >> b;
d += b - c;
c = b;
}
cout << d;
} | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip> //setprecision
#include <iostream>
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define ll long long
#define mod 1000000007
vector<ll> to[1000005];
int main() {
int a, b, c = 0, d = 0;
cin >> a;
rep(i, a) {
cin >> b;
d += max(b - c, 0);
c = b;
}
cout << d;
}
| [
"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) scanf("%I64d", &n)
#define pf(n) printf("%I64d\n", n)
#define loop for (long long i = 0; i < n; i++)
#define lp(b, n) for (long long i = b; i <= n; i++)
#define pb(n) push_back(n)
#define srt(v) sort(v.begin(), v.end())
#define rvs(v) sort(v.begin(), v.end(), greater<long long>());
#define F first
#define S second
#define mp(a, b) make_pair(a, b);
#define fio \
ios::sync_with_stdio(false); \
cin.tie(), cout.tie();
ll llmax = numeric_limits<long long>::max();
ll llmin = numeric_limits<long long>::min();
ll mark[5010];
int main() {
ios::sync_with_stdio(false);
cin.tie(), cout.tie();
ll n;
cin >> n;
ll a[n + 10], b = 0, c = 0, d = 0;
loop { cin >> a[i]; }
for (ll i = 0; i < n; i++) {
c = c + a[i];
b = a[i];
for (ll j = i + 1; j < n; j++) {
b = min(b, a[j]);
if (a[j] == 0) {
break;
} else if (a[j] >= a[i]) {
a[j] -= b;
} else {
a[j] = 0;
}
}
// cout<<c<<endl;
}
cout << c << endl;
}
| #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) scanf("%I64d", &n)
#define pf(n) printf("%I64d\n", n)
#define loop for (long long i = 0; i < n; i++)
#define lp(b, n) for (long long i = b; i <= n; i++)
#define pb(n) push_back(n)
#define srt(v) sort(v.begin(), v.end())
#define rvs(v) sort(v.begin(), v.end(), greater<long long>());
#define F first
#define S second
#define mp(a, b) make_pair(a, b);
#define fio \
ios::sync_with_stdio(false); \
cin.tie(), cout.tie();
ll llmax = numeric_limits<long long>::max();
ll llmin = numeric_limits<long long>::min();
ll mark[5010];
int main() {
ios::sync_with_stdio(false);
cin.tie(), cout.tie();
ll n;
cin >> n;
ll a[n + 10], b = 0, c = 0, d = 0;
loop { cin >> a[i]; }
for (ll i = 0; i < n; i++) {
c = c + a[i];
b = a[i];
for (ll j = i + 1; j < n; j++) {
b = min(b, a[j]);
if (a[j] == 0) {
break;
} else if (a[j] >= b) {
a[j] -= b;
} else {
a[j] = 0;
}
}
// cout<<c<<endl;
}
cout << c << endl;
}
| [
"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 long
#define pb push_back
#define PF push_front // deque
#define mp make_pair
#define pq priority_queue
#define mod 1000000007
#define f first
#define s second
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pii>
#define debug(v) \
for (auto i : v) \
cout << i << " ";
#define tc \
int t; \
cin >> t; \
while (t--)
const int INF = 1e9;
using namespace std;
string repeat(string s, int n) {
string s1 = "";
for (int i = 0; i < n; i++)
s1 += s;
return s1;
}
string getString(char x) {
string s(1, x);
return s;
}
void optimizeIO() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
vector<int> h(101);
int solve1(int st, int en, int curr) {
if (st > en)
return 0;
int idx = min_element(h.begin() + st, h.begin() + en) - h.begin();
vector<int> v;
rep(i, st, en + 1) if (h[i] == h[idx]) v.pb(i);
int ans = solve1(st, v[0] - 1, h[idx]) + h[idx] - curr;
rep(i, 1, v.size()) ans += solve1(v[i - 1] + 1, v[i] - 1, h[idx]);
ans += solve1(v[v.size() - 1] + 1, en, h[idx]);
return ans;
}
void solve() {
int n;
cin >> n;
rep(i, 0, n) cin >> h[i];
int idx = min_element(h.begin(), h.begin() + n) - h.begin();
vector<int> v;
rep(i, 0, n) if (h[i] == h[idx]) v.pb(i);
int ans = solve1(0, v[0] - 1, h[idx]) + h[idx];
rep(i, 1, v.size()) ans += solve1(v[i - 1] + 1, v[i] - 1, h[idx]);
ans += solve1(v[v.size() - 1] + 1, n - 1, h[idx]);
cout << ans << endl;
}
int main() {
optimizeIO();
// tc
{ solve(); }
}
| #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 long
#define pb push_back
#define PF push_front // deque
#define mp make_pair
#define pq priority_queue
#define mod 1000000007
#define f first
#define s second
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pii>
#define debug(v) \
for (auto i : v) \
cout << i << " ";
#define tc \
int t; \
cin >> t; \
while (t--)
const int INF = 1e9;
using namespace std;
string repeat(string s, int n) {
string s1 = "";
for (int i = 0; i < n; i++)
s1 += s;
return s1;
}
string getString(char x) {
string s(1, x);
return s;
}
void optimizeIO() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
vector<int> h(101);
int solve1(int st, int en, int curr) {
if (st > en)
return 0;
int idx = min_element(h.begin() + st, h.begin() + en + 1) - h.begin();
vector<int> v;
rep(i, st, en + 1) if (h[i] == h[idx]) v.pb(i);
int ans = solve1(st, v[0] - 1, h[idx]) + h[idx] - curr;
rep(i, 1, v.size()) ans += solve1(v[i - 1] + 1, v[i] - 1, h[idx]);
ans += solve1(v[v.size() - 1] + 1, en, h[idx]);
return ans;
}
void solve() {
int n;
cin >> n;
rep(i, 0, n) cin >> h[i];
int idx = min_element(h.begin(), h.begin() + n) - h.begin();
vector<int> v;
rep(i, 0, n) if (h[i] == h[idx]) v.pb(i);
int ans = solve1(0, v[0] - 1, h[idx]) + h[idx];
rep(i, 1, v.size()) ans += solve1(v[i - 1] + 1, v[i] - 1, h[idx]);
ans += solve1(v[v.size() - 1] + 1, n - 1, h[idx]);
cout << ans << endl;
}
int main() {
optimizeIO();
// tc
{ solve(); }
}
//
// int main(){
//
// int N, i, j, cnt = 0; cin >> N;
// vector<int> h(N);
// for(i=0; i<N; i++) cin >> h[i];
//
// while(true){
//
// j = 0;
// while(h[j] == 0) j++;
//
// for(i = j; i < N; i++){
//
// if(h[i] == 0){
// cnt++;
// break;
// }
// h[i]--;
// if(i == N - 1) cnt++;
// }
//
// bool flag = true;
// for(i = 0; i < N; i++){
// if(h[i] != 0) flag = false;
// }
// if(flag){
// cout << cnt << endl;
// return 0;
// }
// }
// return -1;
// }
| [
"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() {
ll n;
cin >> n;
vector<ll> h(n + 2);
h.at(0) = -1;
h.at(n + 1) = -1;
rep(i, n) cin >> h.at(i + 1);
ll ans = 0;
while (h.size() > 2) {
rep(i, h.size() - 2) {
if (h[i] < h[i + 1] && h[i + 1] > h[i + 2]) {
ans += h[i + 1] - max(h[i], h[i + 2]);
h.erase(h.begin() + i + 1);
break;
}
}
rep(i, h.size() - 1) {
if (h.at(i) == h.at(i + 1)) {
h.erase(h.begin() + i);
break;
}
}
}
cout << ans << endl;
} | #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() {
ll n;
cin >> n;
vector<ll> h(n + 2);
h.at(0) = 0;
h.at(n + 1) = 0;
rep(i, n) cin >> h.at(i + 1);
ll ans = 0;
while (h.size() > 2) {
rep(i, h.size() - 2) {
if (h[i] < h[i + 1] && h[i + 1] > h[i + 2]) {
ans += h[i + 1] - max(h[i], h[i + 2]);
h.erase(h.begin() + i + 1);
break;
}
}
rep(i, h.size() - 1) {
if (h.at(i) == h.at(i + 1)) {
h.erase(h.begin() + i);
break;
}
}
}
cout << ans << endl;
} | [
"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]) {
MAX[j] = a[i];
flag = 1;
} else {
if (flag == 1) {
flag = 0;
j++;
}
MIN[j] = MAX[j] = a[i];
}
now = a[i];
}
ll ans = 0;
for (int i = 0; i < 102; i++) {
ans += MAX[i] - MIN[i];
}
cout << ans;
return 0;
} | #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]) {
MAX[j] = a[i];
flag = 1;
} else {
if (flag == 1) {
flag = 0;
j++;
}
MIN[j] = MAX[j] = a[i];
}
now = a[i];
}
ll ans = 0;
for (int i = 0; i < 102; i++) {
ans += MAX[i] - MIN[i];
}
cout << ans;
return 0;
} | [
"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
#define P pair<int, int>
#define PLL pair<LL, LL>
const int MAX = 1e5 + 5;
const int inf = 0x3f3f3f3f;
using namespace std;
int main() {
stack<int> s;
int n, cnt = 0;
cin >> n;
vector<int> a(n);
rep(i, 0, n) { cin >> a[i]; }
rep(i, 0, n) {
if (s.empty()) {
s.push(a[i]);
continue;
}
while (a[i] < s.top()) {
int t = s.top();
s.pop();
if (s.empty()) {
cnt += t;
break;
}
cnt += t - max(s.top(), a[i]);
}
s.push(a[i]);
}
while (1) {
int t = s.top();
s.pop();
if (s.empty()) {
cnt += t;
break;
}
cnt += t - s.top();
}
cout << cnt << endl;
return 0;
}
| #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
#define P pair<int, int>
#define PLL pair<LL, LL>
const int MAX = 1e5 + 5;
const int inf = 0x3f3f3f3f;
using namespace std;
int main() {
stack<int> s;
int n, cnt = 0;
cin >> n;
vector<int> a(n);
rep(i, 0, n) { cin >> a[i]; }
rep(i, 0, n) {
if (s.empty()) {
s.push(a[i]);
continue;
}
while (a[i] < s.top()) {
int t = s.top();
s.pop();
if (s.empty()) {
cnt += t - a[i];
break;
}
cnt += t - max(s.top(), a[i]);
}
s.push(a[i]);
}
while (1) {
int t = s.top();
s.pop();
if (s.empty()) {
cnt += t;
break;
}
cnt += t - s.top();
}
cout << cnt << endl;
return 0;
}
| [
"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) {
cin >> H[i];
}
int ans = 0;
while (*max_element(H.begin(), H.end()) > 0) {
for (int i = 0; i < N; ++i) {
if (H[i] > 0) {
int pc = H[i];
int j;
for (j = i; j < N; ++j) {
if (H[j] == 0)
break;
pc = min(pc, H[j]);
}
ans += pc;
for (int k = i; k < j; ++k) {
H[k] -= pc;
}
}
}
}
cout << ans << endl;
return 0;
} | #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) {
cin >> H[i];
}
int ans = 0;
while (*max_element(H.begin(), H.end()) > 0) {
for (int i = 0; i < N; ++i) {
if (H[i] > 0) {
int pc = H[i];
int j;
for (j = i; j < N; ++j) {
if (H[j] == 0)
break;
pc = min(pc, H[j]);
}
ans += pc;
for (int k = i; k < j; ++k) {
H[k] -= pc;
}
i = j;
}
}
}
cout << ans << endl;
return 0;
} | [
"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()
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
inline void fastio() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); }
int main() {
fastio();
int N;
cin >> N;
int pre_a = 0, ans = 0;
rep(i, N - 1) {
int a;
cin >> a;
ans += max(0, a - pre_a);
pre_a = a;
}
co(ans);
} | #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()
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
inline void fastio() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); }
int main() {
fastio();
int N;
cin >> N;
int pre_a = 0, ans = 0;
rep(i, N) {
int a;
cin >> a;
ans += max(0, a - pre_a);
pre_a = a;
}
co(ans);
} | [
"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];
mi = h[i];
}
} else if (h[i - 1] <= h[i] && h[i] >= h[i + 1]) {
count += h[i] - mi;
mi = h[i];
} else {
mi = min(mi, h[i]);
}
}
cout << count << endl;
return 0;
}
| #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];
mi = h[i];
}
} else if (h[i - 1] <= h[i] && h[i] >= h[i + 1]) {
count += h[i] - mi;
mi = h[i];
} else {
mi = min(mi, h[i]);
}
}
cout << count << endl;
return 0;
}
| [
"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.