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 |
|---|---|---|---|---|---|---|---|
p03075 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
cout << "Yay" << endl;
else
cout << ":(" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 890,114 | 890,115 | u728702354 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a > k)
cout << ":(" << endl;
else
cout << "Yay" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 890,116 | 890,115 | u728702354 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, e, k, t;
cin >> a >> t >> t >> t >> e >> k;
// cout << a << e << k << endl;
if (e - a > k) {
cout << ":(" << endl;
} else {
cout << "Yey!" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, e, k, t;
cin >> a >> t >> t >> t >> e >> k;
// cout << a << e << k << endl;
if (e - a > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 890,120 | 890,121 | u343441882 | cpp |
p03075 | #include <iostream>
int main() {
int a, e, k, tmp;
std::cin >> a;
std::cin >> tmp;
std::cin >> tmp;
std::cin >> tmp;
std::cin >> e;
std::cin >> k;
if (e - a < k) {
std::cout << "Yay!" << std::endl;
} else {
std::cout << ":(" << std::endl;
}
} | #include <iostream>
int main() {
int a, e, k, tmp;
std::cin >> a;
std::cin >> tmp;
std::cin >> tmp;
std::cin >> tmp;
std::cin >> e;
std::cin >> k;
if (e - a <= k) {
std::cout << "Yay!" << std::endl;
} else {
std::cout << ":(" << std::endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 890,132 | 890,133 | u480008027 | cpp |
p03075 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int a, b, c, d, e, k;
int MAX, MIN;
int ans;
int main() {
MIN = 1000;
for (int i = 0; i < 5; i++) {
cin >> a;
if (MIN > a) {
MIN = a;
}
if (MAX < a) {
MAX = a;
}
}
cin >> k;
ans = MAX - MIN;
if (ans <= 15) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int a, b, c, d, e, k;
int MAX, MIN;
int ans;
int main() {
MIN = 1000;
for (int i = 0; i < 5; i++) {
cin >> a;
if (MIN > a) {
MIN = a;
}
if (MAX < a) {
MAX = a;
}
}
cin >> k;
ans = MAX - MIN;
if (ans <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 890,134 | 890,135 | u037143188 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> A(5);
for (int i = 0; i < 5; i++)
cin >> A.at(i);
int k;
cin >> k;
bool can = true;
for (int i = 4; i >= 1; i--) {
for (int j = i - 1; j >= 0; j--) {
int dist = A.at(i) - A.at(j);
if (dist > k) {
can = false;
break;
}
}
if (!can)
break;
}
if (can)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> A(5);
for (int i = 0; i < 5; i++)
cin >> A.at(i);
int k;
cin >> k;
bool can = true;
for (int i = 4; i >= 1; i--) {
for (int j = i - 1; j >= 0; j--) {
int dist = A.at(i) - A.at(j);
if (dist > k) {
can = false;
break;
}
}
if (!can)
break;
}
if (can)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
| [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 890,136 | 890,137 | u665871498 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> A(5);
for (int i = 0; i < 5; i++)
cin >> A.at(i);
int k;
cin >> k;
bool can = false;
for (int i = 4; i >= 1; i--) {
for (int j = i - 1; j >= 0; j--) {
int dist = A.at(i) - A.at(j);
if (dist > k) {
can = false;
break;
}
}
if (!can)
break;
}
if (can)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> A(5);
for (int i = 0; i < 5; i++)
cin >> A.at(i);
int k;
cin >> k;
bool can = true;
for (int i = 4; i >= 1; i--) {
for (int j = i - 1; j >= 0; j--) {
int dist = A.at(i) - A.at(j);
if (dist > k) {
can = false;
break;
}
}
if (!can)
break;
}
if (can)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
return 0;
}
| [
"misc.opposites",
"variable_declaration.value.change",
"literal.string.change",
"io.output.change"
] | 890,138 | 890,137 | u665871498 | cpp |
p03075 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define INF (1 << 29)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define uniq(v) v.erase(unique(all(v)), v.end())
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << (e - a <= k ? ":)" : ":(") << endl;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define INF (1 << 29)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define uniq(v) v.erase(unique(all(v)), v.end())
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
cout << (e - a <= k ? "Yay!" : ":(") << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 890,139 | 890,140 | u085110627 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E, K;
cin >> A;
cin >> B;
cin >> C;
cin >> D;
cin >> E;
cin >> K;
if (A - E < K + 1) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E, K;
cin >> A;
cin >> B;
cin >> C;
cin >> D;
cin >> E;
cin >> K;
if (E - A < K + 1) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 890,141 | 890,142 | u041855176 | cpp |
p03075 | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (long long i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) cout << " " << v[_]; \
cout << endl; \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
#define mt make_tuple
typedef tuple<int, int, int> tp;
typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
#define yes \
cout << "YES" \
<< "\n"
#define no \
cout << "NO" \
<< "\n"
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> b >> b >> b, c;
if (b - a <= c)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (long long i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) cout << " " << v[_]; \
cout << endl; \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
#define mt make_tuple
typedef tuple<int, int, int> tp;
typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
#define yes \
cout << "YES" \
<< "\n"
#define no \
cout << "NO" \
<< "\n"
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> b >> b >> b >> c;
if (b - a <= c)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
| [] | 890,143 | 890,144 | u010004797 | cpp |
p03075 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
///////////////////library zone!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(), (a).end()
#define EPS (1e-5)
#define bit(n, k) ((n >> k) & 1)
const ll Mod = 1000000007;
const ll mod = 998244353;
struct H {
ll x, y;
bool operator<(const H &b) const {
if (x != b.x)
return x < b.x;
return y < b.y;
}
bool operator>(const H &b) const {
if (x != b.x)
return x > b.x;
return y > b.y;
}
bool operator==(const H &b) const { return x == b.x && y == b.y; }
bool operator!=(const H &b) const { return (*this) != b; }
};
struct P {
ll pos, cost;
bool operator<(const P &b) const { return cost < b.cost; }
bool operator>(const P &b) const { return cost > b.cost; }
};
struct B {
ll to, cost;
};
struct E {
ll from, to, cost;
bool operator<(const E &b) const { return cost < b.cost; }
bool operator>(const E &b) const { return cost > b.cost; }
};
template <typename T, typename U> void chmin(T &a, U b) {
if (a > b)
a = b;
}
template <typename T, typename U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <typename T> T max_0(T a) {
if (a < 0)
return 0;
return a;
}
template <typename T> T min_0(T a) {
if (a > 0)
return 0;
return a;
}
ll read() {
ll u;
ll k = scanf("%lld", &u);
return u;
}
ll gcd(ll i, ll j) {
if (i > j)
swap(i, j);
if (i == 0)
return j;
return gcd(j % i, i);
}
ll mod_pow(ll x, ll n, ll p) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % p;
x = x * x % p;
n >>= 1;
}
return res;
} // x^n%p
vector<string> split(string s, char c = ' ') {
vector<string> vec;
string h = "";
for (int i = 0; i < s.size();) {
int j = i;
while (j < s.size() && s[j] != ' ') {
h += s[j++];
}
if (h.size() > 0)
vec.push_back(h);
h = "";
i = j + 1;
}
return vec;
}
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
//----------------------------------------------------
int a, b, c;
signed main() {
cin >> a >> b >> b >> b >> b >> c;
if (b - a > c) {
cout << ":)\n";
} else {
cout << "Yay!\n";
}
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
///////////////////library zone!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(), (a).end()
#define EPS (1e-5)
#define bit(n, k) ((n >> k) & 1)
const ll Mod = 1000000007;
const ll mod = 998244353;
struct H {
ll x, y;
bool operator<(const H &b) const {
if (x != b.x)
return x < b.x;
return y < b.y;
}
bool operator>(const H &b) const {
if (x != b.x)
return x > b.x;
return y > b.y;
}
bool operator==(const H &b) const { return x == b.x && y == b.y; }
bool operator!=(const H &b) const { return (*this) != b; }
};
struct P {
ll pos, cost;
bool operator<(const P &b) const { return cost < b.cost; }
bool operator>(const P &b) const { return cost > b.cost; }
};
struct B {
ll to, cost;
};
struct E {
ll from, to, cost;
bool operator<(const E &b) const { return cost < b.cost; }
bool operator>(const E &b) const { return cost > b.cost; }
};
template <typename T, typename U> void chmin(T &a, U b) {
if (a > b)
a = b;
}
template <typename T, typename U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <typename T> T max_0(T a) {
if (a < 0)
return 0;
return a;
}
template <typename T> T min_0(T a) {
if (a > 0)
return 0;
return a;
}
ll read() {
ll u;
ll k = scanf("%lld", &u);
return u;
}
ll gcd(ll i, ll j) {
if (i > j)
swap(i, j);
if (i == 0)
return j;
return gcd(j % i, i);
}
ll mod_pow(ll x, ll n, ll p) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % p;
x = x * x % p;
n >>= 1;
}
return res;
} // x^n%p
vector<string> split(string s, char c = ' ') {
vector<string> vec;
string h = "";
for (int i = 0; i < s.size();) {
int j = i;
while (j < s.size() && s[j] != ' ') {
h += s[j++];
}
if (h.size() > 0)
vec.push_back(h);
h = "";
i = j + 1;
}
return vec;
}
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
//----------------------------------------------------
int a, b, c;
signed main() {
cin >> a >> b >> b >> b >> b >> c;
if (b - a > c) {
cout << ":(\n";
} else {
cout << "Yay!\n";
}
} | [
"literal.string.change",
"io.output.change"
] | 890,149 | 890,150 | u811004127 | cpp |
p03075 | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> A(5);
for (int i = 0; i < 5; i++)
cin >> A[i];
int k = 0;
cin >> k;
bool f = false;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (k < A[i] - A[j])
f = true;
}
}
if (f)
cout << ":(";
else
cout << "Yay!";
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> A(5);
for (int i = 0; i < 5; i++)
cin >> A[i];
int k = 0;
cin >> k;
bool f = false;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (k < A[i] - A[j])
f = true;
}
}
if (f)
cout << ":(";
else
cout << "Yay!";
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 890,153 | 890,154 | u166632863 | cpp |
p03075 | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> A(5);
for (int i = 0; i < 5; i++)
cin >> A[i];
int k = 0;
cin >> k;
bool f = false;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (k > A[i] - A[j])
f = true;
}
}
if (f)
cout << ":(";
else
cout << "Yay!";
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> A(5);
for (int i = 0; i < 5; i++)
cin >> A[i];
int k = 0;
cin >> k;
bool f = false;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (k < A[i] - A[j])
f = true;
}
}
if (f)
cout << ":(";
else
cout << "Yay!";
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 890,155 | 890,154 | u166632863 | cpp |
p03075 | #include <iostream>
#include <string>
#include <time.h>
using namespace std;
int main() {
int a[5];
int k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; i++) {
for (int j = 4; j >= 0; j--) {
if (j == i) {
j--;
} else if (i < j) {
if (a[i] - a[j] >= k) {
cout << ":(";
return 0;
}
} else {
if (a[j] - a[i] >= k) {
cout << ":(";
return 0;
}
}
}
}
cout << "Yay!";
return 0;
}
| #include <iostream>
#include <string>
#include <time.h>
using namespace std;
int main() {
int a[5];
int k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; i++) {
for (int j = 4; j >= 0; j--) {
if (j == i) {
j--;
} else if (i < j) {
if (a[j] - a[i] > k) {
cout << ":(";
return 0;
}
} else {
if (a[i] - a[j] > k) {
cout << ":(";
return 0;
}
}
}
}
cout << "Yay!";
return 0;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 890,159 | 890,160 | u997939999 | cpp |
p03075 | #include <iostream>
#include <string>
#include <time.h>
using namespace std;
int main() {
int a[5];
int k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; i++) {
for (int j = 4; j >= 0; j--) {
if (j == i) {
j--;
} else if (i < j) {
if (a[i] - a[j] > k) {
cout << ":(";
return 0;
}
} else {
if (a[j] - a[i] > k) {
cout << ":(";
return 0;
}
}
}
}
cout << "Yay!";
return 0;
}
| #include <iostream>
#include <string>
#include <time.h>
using namespace std;
int main() {
int a[5];
int k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; i++) {
for (int j = 4; j >= 0; j--) {
if (j == i) {
j--;
} else if (i < j) {
if (a[j] - a[i] > k) {
cout << ":(";
return 0;
}
} else {
if (a[i] - a[j] > k) {
cout << ":(";
return 0;
}
}
}
}
cout << "Yay!";
return 0;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 890,161 | 890,160 | u997939999 | cpp |
p03075 | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int a, b, c, d, e, k;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &k);
if (e - a > k)
printf(":(");
else
printf("Yey!");
} | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int a, b, c, d, e, k;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &k);
if (e - a > k)
printf(":(");
else
printf("Yay!");
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 890,164 | 890,165 | u356991267 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s[10], k, flag = 0;
for (int i = 0; i < 5; i++)
scanf("%d", &s[i]);
scanf("%d", &k);
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (s[j] - s[i] > 15) {
flag = 1;
break;
}
}
if (flag == 1)
break;
}
if (flag == 0)
printf("Yay!\n");
else
printf(":(\n");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int s[10], k, flag = 0;
for (int i = 0; i < 5; i++)
scanf("%d", &s[i]);
scanf("%d", &k);
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (s[j] - s[i] > k) {
flag = 1;
break;
}
}
if (flag == 1)
break;
}
if (flag == 0)
printf("Yay!\n");
else
printf(":(\n");
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 890,166 | 890,167 | u847591010 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> s(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> s.at(i);
}
cin >> k;
string ans = "";
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (s.at(i) - s.at(j) > k) {
ans = ":(";
break;
}
}
ans = "Yay!";
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> s(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> s.at(i);
}
cin >> k;
string ans = "";
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (s.at(i) - s.at(j) > k) {
ans = ":(";
break;
}
ans = "Yay!";
}
}
cout << ans << endl;
} | [] | 890,168 | 890,169 | u422725381 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k, max, min, x;
cin >> a >> b >> c >> d >> e >> k;
if (a > b) {
max = a;
} else {
max = b;
}
if (max < c) {
max = c;
}
if (max < d) {
max = d;
}
if (max < e) {
max = e;
}
if (a < b) {
min = a;
} else {
min = b;
}
if (min > c) {
min = c;
}
if (min > d) {
min = d;
}
if (min > e) {
min = e;
}
x = max - min;
if (x < k) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k, max, min, x;
cin >> a >> b >> c >> d >> e >> k;
if (a > b) {
max = a;
} else {
max = b;
}
if (max < c) {
max = c;
}
if (max < d) {
max = d;
}
if (max < e) {
max = e;
}
if (a < b) {
min = a;
} else {
min = b;
}
if (min > c) {
min = c;
}
if (min > d) {
min = d;
}
if (min > e) {
min = e;
}
x = max - min;
if (x <= k) {
cout << "Yay!";
} else {
cout << ":(";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 890,170 | 890,171 | u282685719 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[5], k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; ++i) {
for (int j = i + 1; j < 5; ++j) {
if (abs(a[i] - a[j]) > 15) {
cout << ":(" << '\n';
return 0;
}
}
}
cout << "Yay!" << '\n';
} | #include <iostream>
using namespace std;
int main() {
int a[5], k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; ++i) {
for (int j = i + 1; j < 5; ++j) {
if (abs(a[i] - a[j]) > k) {
cout << ":(" << '\n';
return 0;
}
}
}
cout << "Yay!" << '\n';
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 890,176 | 890,177 | u021083776 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[5], k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; ++i) {
for (int j = i; j < 5; ++j) {
if (abs(a[i] - a[j]) > 15) {
cout << ":(" << '\n';
return 0;
}
}
}
cout << "Yay!" << '\n';
} | #include <iostream>
using namespace std;
int main() {
int a[5], k;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> k;
for (int i = 0; i < 5; ++i) {
for (int j = i + 1; j < 5; ++j) {
if (abs(a[i] - a[j]) > k) {
cout << ":(" << '\n';
return 0;
}
}
}
cout << "Yay!" << '\n';
}
| [
"control_flow.loop.for.initializer.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 890,178 | 890,177 | u021083776 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int k;
cin >> k;
if ((a.at(4) - a.at(0)) <= k) {
cout << "Yey!" << endl;
} else {
cout << ":(" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int k;
cin >> k;
if ((a.at(4) - a.at(0)) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 890,183 | 890,184 | u339937125 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int k;
cin >> k;
if ((a.at(5) - a.at(0)) <= k) {
cout << "Yey!" << endl;
} else {
cout << ":(" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int k;
cin >> k;
if ((a.at(4) - a.at(0)) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 890,185 | 890,184 | u339937125 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 4 - i; j++) {
if (abs(a[i] - a[j]) > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
} | #include <iostream>
using namespace std;
int main() {
int a[5];
int k;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5 - i; j++) {
if (abs(a[i] - a[j]) > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 890,191 | 890,192 | u622328759 | cpp |
p03075 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int a[10];
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
sort(a, a + 5);
if (a[4] - a[0] > a[5])
cout << ":(";
else
cout << "Yay!";
}
| #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int a[10];
for (int i = 0; i < 6; i++) {
cin >> a[i];
}
sort(a, a + 5);
if (a[4] - a[0] > a[5])
cout << ":(";
else
cout << "Yay!";
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 890,193 | 890,194 | u576740505 | cpp |
p03075 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int a[10];
for (int i = 0; i < 6; i++) {
cin >> a[i];
}
sort(a, a + 6);
if (a[5] - a[0] > 15)
cout << ":(";
else
cout << "Yay!";
}
| #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int a[10];
for (int i = 0; i < 6; i++) {
cin >> a[i];
}
sort(a, a + 5);
if (a[4] - a[0] > a[5])
cout << ":(";
else
cout << "Yay!";
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 890,196 | 890,194 | u576740505 | cpp |
p03075 | #include <stdio.h>
int main(void) {
int a, b, c, d, e, k;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
scanf("%d", &k);
int box[10];
box[0] = a - b;
if (box[0] < 0) {
box[0] = box[0] * (-1);
}
box[1] = a - c;
if (box[1] < 0) {
box[1] = box[1] * (-1);
}
box[2] = a - d;
if (box[2] < 0) {
box[2] = box[2] * (-1);
}
box[3] = a - e;
if (box[3] < 0) {
box[3] = box[3] * (-1);
}
box[4] = b - c;
if (box[4] < 0) {
box[4] = box[4] * (-1);
}
box[5] = b - d;
if (box[5] < 0) {
box[5] = box[5] * (-1);
}
box[6] = b - e;
if (box[6] < 0) {
box[6] = box[6] * (-1);
}
box[7] = c - d;
if (box[7] < 0) {
box[7] = box[7] * (-1);
}
box[8] = c - e;
if (box[3] < 0) {
box[3] = box[3] * (-1);
}
box[9] = d - e;
if (box[9] < 0) {
box[9] = box[9] * (-1);
}
int i;
for (i = 0; i < 10; i++) {
if (box[i] >= k) {
printf(":(\n");
break;
} else if (i == 9 && box[i] <= k) {
printf("Yay!\n");
}
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c, d, e, k;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
scanf("%d", &k);
int box[10];
box[0] = a - b;
if (box[0] < 0) {
box[0] = box[0] * (-1);
}
box[1] = a - c;
if (box[1] < 0) {
box[1] = box[1] * (-1);
}
box[2] = a - d;
if (box[2] < 0) {
box[2] = box[2] * (-1);
}
box[3] = a - e;
if (box[3] < 0) {
box[3] = box[3] * (-1);
}
box[4] = b - c;
if (box[4] < 0) {
box[4] = box[4] * (-1);
}
box[5] = b - d;
if (box[5] < 0) {
box[5] = box[5] * (-1);
}
box[6] = b - e;
if (box[6] < 0) {
box[6] = box[6] * (-1);
}
box[7] = c - d;
if (box[7] < 0) {
box[7] = box[7] * (-1);
}
box[8] = c - e;
if (box[3] < 0) {
box[3] = box[3] * (-1);
}
box[9] = d - e;
if (box[9] < 0) {
box[9] = box[9] * (-1);
}
int i;
for (i = 0; i < 10; i++) {
if (box[i] > k) {
printf(":(\n");
break;
} else if (i == 9 && box[i] <= k) {
printf("Yay!\n");
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 890,197 | 890,198 | u015875086 | cpp |
p03075 | #include <stdio.h>
int main(void) {
int a, b, c, d, e, k;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
scanf("%d", &k);
int box[10];
box[0] = a - b;
if (box[0] < 0) {
box[0] = box[0] * (-1);
}
box[1] = a - c;
if (box[1] < 0) {
box[1] = box[1] * (-1);
}
box[2] = a - d;
if (box[2] < 0) {
box[2] = box[2] * (-1);
}
box[3] = a - e;
if (box[3] < 0) {
box[3] = box[3] * (-1);
}
box[4] = b - c;
if (box[4] < 0) {
box[4] = box[4] * (-1);
}
box[5] = b - d;
if (box[5] < 0) {
box[5] = box[5] * (-1);
}
box[6] = b - e;
if (box[6] < 0) {
box[6] = box[6] * (-1);
}
box[7] = c - d;
if (box[7] < 0) {
box[7] = box[7] * (-1);
}
box[8] = c - e;
if (box[3] < 0) {
box[3] = box[3] * (-1);
}
box[9] = d - e;
if (box[9] < 0) {
box[9] = box[9] * (-1);
}
int i;
for (i = 0; i < 10; i++) {
if (box[i] >= k) {
printf(":(\n");
break;
} else if (i == 9 && box[i] <= k) {
printf("Yay!\n");
}
}
return 0;
}
| #include <stdio.h>
int main(void) {
int a, b, c, d, e, k;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
scanf("%d", &k);
int box[10];
box[0] = a - b;
if (box[0] < 0) {
box[0] = box[0] * (-1);
}
box[1] = a - c;
if (box[1] < 0) {
box[1] = box[1] * (-1);
}
box[2] = a - d;
if (box[2] < 0) {
box[2] = box[2] * (-1);
}
box[3] = a - e;
if (box[3] < 0) {
box[3] = box[3] * (-1);
}
box[4] = b - c;
if (box[4] < 0) {
box[4] = box[4] * (-1);
}
box[5] = b - d;
if (box[5] < 0) {
box[5] = box[5] * (-1);
}
box[6] = b - e;
if (box[6] < 0) {
box[6] = box[6] * (-1);
}
box[7] = c - d;
if (box[7] < 0) {
box[7] = box[7] * (-1);
}
box[8] = c - e;
if (box[3] < 0) {
box[3] = box[3] * (-1);
}
box[9] = d - e;
if (box[9] < 0) {
box[9] = box[9] * (-1);
}
int i;
for (i = 0; i < 10; i++) {
if (box[i] > k) {
printf(":(\n");
break;
} else if (i == 9 && box[i] <= k) {
printf("Yay!\n");
}
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 890,199 | 890,198 | u015875086 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
cout << "Yay!" << endl;
} else if (e - a > k) {
cout << ":)" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
cout << "Yay!" << endl;
} else if (e - a > k) {
cout << ":(" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 890,214 | 890,215 | u746428948 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e;
if (e - a <= k && e - b <= k && e - c <= k && e - d <= k && d - a <= k &&
d - b <= k && d - c <= k && c - a <= k && c - b <= k && b - a <= k) {
cout << "Yay!";
}
else {
cout << ":(";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k && e - b <= k && e - c <= k && e - d <= k && d - a <= k &&
d - b <= k && d - c <= k && c - a <= k && c - b <= k && b - a <= k) {
cout << "Yay!";
}
else {
cout << ":(";
}
} | [
"expression.operation.binary.add"
] | 890,221 | 890,222 | u831830097 | cpp |
p03075 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) \
a ^= b; \
b ^= a; \
a ^= b;
//#define for(i,a,b) for (ll i=(a);i<(ll)b; i++)
#define print(x) std::cout << x << std::endl;
using namespace std;
typedef long long ll;
template <class T, class U>
std::string replace(std::string s, const T &target, const U &replacement,
bool replace_first = 0, bool replace_empty = 0);
bool isContain(int value, int under, int top);
vector<int> range(int x);
int main(void) {
// Program Start
vector<int> annt(5);
rep(i, 5) { cin >> annt[i]; }
int k;
cin >> k;
if (annt[4] - annt[0] > k) {
cout << ":(" << endl;
} else {
cout << "Yey!" << endl;
}
ProgramEndPointLabel:;
// Program End
// system("pause");
return 0;
}
vector<int> range(int y) {
vector<int> result(y);
for (int i = 0; i < y; i++)
result[i] = i;
return result;
}
bool isContain(int value, int under, int top) {
if (under <= value && value <= top)
return true;
return false;
}
template <class T, class U>
std::string replace(std::string s, const T &target, const U &replacement,
bool replace_first, bool replace_empty) {
using S = std::string;
using C = std::string::value_type;
using N = std::string::size_type;
struct {
auto len(const S &s) { return s.size(); }
auto len(const C *p) { return std::char_traits<C>::length(p); }
auto len(const C c) { return 1; }
auto sub(S *s, const S &t, N pos, N len) { s->replace(pos, len, t); }
auto sub(S *s, const C *t, N pos, N len) { s->replace(pos, len, t); }
auto sub(S *s, const C t, N pos, N len) { s->replace(pos, len, 1, t); }
auto ins(S *s, const S &t, N pos) { s->insert(pos, t); }
auto ins(S *s, const C *t, N pos) { s->insert(pos, t); }
auto ins(S *s, const C t, N pos) { s->insert(pos, 1, t); }
} util;
N target_length = util.len(target);
N replacement_length = util.len(replacement);
if (target_length == 0) {
if (!replace_empty || replacement_length == 0)
return s;
N n = s.size() + replacement_length * (1 + s.size());
s.reserve(!replace_first ? n : s.size() + replacement_length);
for (N i = 0; i < n; i += 1 + replacement_length) {
util.ins(&s, replacement, i);
if (replace_first)
break;
}
return s;
}
N pos = 0;
while ((pos = s.find(target, pos)) != std::string::npos) {
util.sub(&s, replacement, pos, target_length);
if (replace_first)
return s;
pos += replacement_length;
}
return s;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) \
a ^= b; \
b ^= a; \
a ^= b;
//#define for(i,a,b) for (ll i=(a);i<(ll)b; i++)
#define print(x) std::cout << x << std::endl;
using namespace std;
typedef long long ll;
template <class T, class U>
std::string replace(std::string s, const T &target, const U &replacement,
bool replace_first = 0, bool replace_empty = 0);
bool isContain(int value, int under, int top);
vector<int> range(int x);
int main(void) {
// Program Start
vector<int> annt(5);
rep(i, 5) { cin >> annt[i]; }
int k;
cin >> k;
if (annt[4] - annt[0] > k) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
ProgramEndPointLabel:;
// Program End
// system("pause");
return 0;
}
vector<int> range(int y) {
vector<int> result(y);
for (int i = 0; i < y; i++)
result[i] = i;
return result;
}
bool isContain(int value, int under, int top) {
if (under <= value && value <= top)
return true;
return false;
}
template <class T, class U>
std::string replace(std::string s, const T &target, const U &replacement,
bool replace_first, bool replace_empty) {
using S = std::string;
using C = std::string::value_type;
using N = std::string::size_type;
struct {
auto len(const S &s) { return s.size(); }
auto len(const C *p) { return std::char_traits<C>::length(p); }
auto len(const C c) { return 1; }
auto sub(S *s, const S &t, N pos, N len) { s->replace(pos, len, t); }
auto sub(S *s, const C *t, N pos, N len) { s->replace(pos, len, t); }
auto sub(S *s, const C t, N pos, N len) { s->replace(pos, len, 1, t); }
auto ins(S *s, const S &t, N pos) { s->insert(pos, t); }
auto ins(S *s, const C *t, N pos) { s->insert(pos, t); }
auto ins(S *s, const C t, N pos) { s->insert(pos, 1, t); }
} util;
N target_length = util.len(target);
N replacement_length = util.len(replacement);
if (target_length == 0) {
if (!replace_empty || replacement_length == 0)
return s;
N n = s.size() + replacement_length * (1 + s.size());
s.reserve(!replace_first ? n : s.size() + replacement_length);
for (N i = 0; i < n; i += 1 + replacement_length) {
util.ins(&s, replacement, i);
if (replace_first)
break;
}
return s;
}
N pos = 0;
while ((pos = s.find(target, pos)) != std::string::npos) {
util.sub(&s, replacement, pos, target_length);
if (replace_first)
return s;
pos += replacement_length;
}
return s;
}
| [
"literal.string.change",
"io.output.change"
] | 890,223 | 890,224 | u040251933 | cpp |
p03075 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a[5];
int k;
bool flag = true;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
if ((a[4] - a[0]) > k)
flag = false;
if (flag) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a[5];
int k;
bool flag = true;
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
if ((a[4] - a[0]) > k)
flag = false;
if (!flag) {
cout << ":(" << endl;
} else {
cout << "Yay!" << endl;
}
return 0;
}
| [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 890,229 | 890,230 | u019780057 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a[5];
int i, k, l;
for (i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
for (i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (a[i] - a[j] >= k) {
l = 1;
break;
} else {
l = 0;
}
}
}
if (l == 0) {
cout << "Yay!";
} else {
cout << ":(";
}
} | #include <iostream>
using namespace std;
int main() {
int a[5];
int i, k, l;
for (i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
for (i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (a[i] - a[j] > k) {
l = 1;
break;
} else {
l = 0;
}
}
}
if (l == 0) {
cout << "Yay!";
} else {
cout << ":(";
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 890,240 | 890,241 | u365178348 | cpp |
p03075 | #include <iostream>
using namespace std;
int a, b, c, d, e, k;
int main() {
cin >> a >> b >> c >> d >> e >> k;
int l = e - a;
if (l < k) {
cout << "Yay!" << endl;
} else
cout << ":(" << endl;
return 0;
} | #include <iostream>
using namespace std;
int a, b, c, d, e, k;
int main() {
cin >> a >> b >> c >> d >> e >> k;
int l = e - a;
if (l <= k) {
cout << "Yay!" << endl;
} else
cout << ":(" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 890,242 | 890,243 | u891005694 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) < k)
cout << "Yay!";
else
cout << ":(";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if ((e - a) <= k)
cout << "Yay!\n";
else
cout << ":(\n";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 890,244 | 890,245 | u665543246 | cpp |
p03075 | #include <iostream>
#include <string>
using namespace std;
int main() {
int A[6], k;
for (int i = 0; i < 6; i++) {
if (i < 5)
cin >> A[i];
if (i == 5)
cin >> k;
}
if (A[5] - A[0] > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int A[6], k;
for (int i = 0; i < 6; i++) {
if (i < 5)
cin >> A[i];
if (i == 5)
cin >> k;
}
if (A[4] - A[0] > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 890,263 | 890,264 | u142234618 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios::sync_with_stdio(false)
#define pb push_back
#define mp make_pair
#define precision(x, d) cout << fixed << setprecision(d) << x
#define all(x) (x).begin(), (x).end()
#define uint usigned int
typedef vector<ll> vi;
ll mod = 1918;
// vi v1[200005],v2;
// bool visit[200005]={false};
/*void bfs(ll n){
queue<ll> q;
q.push(n);
visit[n]=true;
while(!q.empty()){
ll t=q.front();
q.pop();
v2.pb(t);
for(ll i=0;i<v1[t].size();i++){
if(visit[v1[t][i]]==false){
q.push(v1[t][i]);
visit[v1[t][i]]=true;
}
}
}
}*/
/*void dfs(ll n){
for(ll i=0;i<v1[n].size();i++)
{
ll y=v1[n][i];
if(visit[y]==0)
{
v2.pb(y);
visit[y]=1;
dfs(y);
}
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b, c, d, e, k, x = 0, p, y = 0, ans = 0, m = 0;
cin >> a >> b >> c >> d >> e >> k;
if (b - a > k) {
cout << ":(";
return 0;
}
if (c - a > k) {
cout << ":(";
return 0;
}
if (d - a > k) {
cout << ":(";
return 0;
}
if (e - a > k) {
cout << ":(";
return 0;
}
if (c - b > k) {
cout << ":(";
return 0;
}
if (d - b > k) {
cout << ":(";
return 0;
}
if (e - b > k) {
cout << ":(";
return 0;
}
if (d - c > k) {
cout << ":(";
return 0;
}
if (e - c > k) {
cout << ":(";
return 0;
}
if (e - d > k) {
cout << ":(";
return 0;
}
cout << "yay!";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios::sync_with_stdio(false)
#define pb push_back
#define mp make_pair
#define precision(x, d) cout << fixed << setprecision(d) << x
#define all(x) (x).begin(), (x).end()
#define uint usigned int
typedef vector<ll> vi;
ll mod = 1918;
// vi v1[200005],v2;
// bool visit[200005]={false};
/*void bfs(ll n){
queue<ll> q;
q.push(n);
visit[n]=true;
while(!q.empty()){
ll t=q.front();
q.pop();
v2.pb(t);
for(ll i=0;i<v1[t].size();i++){
if(visit[v1[t][i]]==false){
q.push(v1[t][i]);
visit[v1[t][i]]=true;
}
}
}
}*/
/*void dfs(ll n){
for(ll i=0;i<v1[n].size();i++)
{
ll y=v1[n][i];
if(visit[y]==0)
{
v2.pb(y);
visit[y]=1;
dfs(y);
}
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b, c, d, e, k, x = 0, p, y = 0, ans = 0, m = 0;
cin >> a >> b >> c >> d >> e >> k;
if (b - a > k) {
cout << ":(";
return 0;
}
if (c - a > k) {
cout << ":(";
return 0;
}
if (d - a > k) {
cout << ":(";
return 0;
}
if (e - a > k) {
cout << ":(";
return 0;
}
if (c - b > k) {
cout << ":(";
return 0;
}
if (d - b > k) {
cout << ":(";
return 0;
}
if (e - b > k) {
cout << ":(";
return 0;
}
if (d - c > k) {
cout << ":(";
return 0;
}
if (e - c > k) {
cout << ":(";
return 0;
}
if (e - d > k) {
cout << ":(";
return 0;
}
cout << "Yay!";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 890,265 | 890,266 | u415518175 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios::sync_with_stdio(false)
#define pb push_back
#define mp make_pair
#define precision(x, d) cout << fixed << setprecision(d) << x
#define all(x) (x).begin(), (x).end()
#define uint usigned int
typedef vector<ll> vi;
ll mod = 1918;
// vi v1[200005],v2;
// bool visit[200005]={false};
/*void bfs(ll n){
queue<ll> q;
q.push(n);
visit[n]=true;
while(!q.empty()){
ll t=q.front();
q.pop();
v2.pb(t);
for(ll i=0;i<v1[t].size();i++){
if(visit[v1[t][i]]==false){
q.push(v1[t][i]);
visit[v1[t][i]]=true;
}
}
}
}*/
/*void dfs(ll n){
for(ll i=0;i<v1[n].size();i++)
{
ll y=v1[n][i];
if(visit[y]==0)
{
v2.pb(y);
visit[y]=1;
dfs(y);
}
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b, c, d, e, k, x = 0, p, y = 0, ans = 0, m = 0;
cin >> a >> b >> c >> d >> e >> k;
if (b - a > k) {
cout << ":(";
return 0;
}
if (c - a > k) {
cout << ":(";
return 0;
}
if (d - a > k) {
cout << ":(";
return 0;
}
if (e - a > k) {
cout << ":(";
return 0;
}
if (c - b > k) {
cout << ":(";
return 0;
}
if (d - b > k) {
cout << ":(";
return 0;
}
if (e - b > k) {
cout << ":(";
return 0;
}
if (d - c > k) {
cout << ":(";
return 0;
}
if (e - c > k) {
cout << ":(";
return 0;
}
if (e - a > k) {
cout << ":(";
return 0;
}
cout << "yay!";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios::sync_with_stdio(false)
#define pb push_back
#define mp make_pair
#define precision(x, d) cout << fixed << setprecision(d) << x
#define all(x) (x).begin(), (x).end()
#define uint usigned int
typedef vector<ll> vi;
ll mod = 1918;
// vi v1[200005],v2;
// bool visit[200005]={false};
/*void bfs(ll n){
queue<ll> q;
q.push(n);
visit[n]=true;
while(!q.empty()){
ll t=q.front();
q.pop();
v2.pb(t);
for(ll i=0;i<v1[t].size();i++){
if(visit[v1[t][i]]==false){
q.push(v1[t][i]);
visit[v1[t][i]]=true;
}
}
}
}*/
/*void dfs(ll n){
for(ll i=0;i<v1[n].size();i++)
{
ll y=v1[n][i];
if(visit[y]==0)
{
v2.pb(y);
visit[y]=1;
dfs(y);
}
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a, b, c, d, e, k, x = 0, p, y = 0, ans = 0, m = 0;
cin >> a >> b >> c >> d >> e >> k;
if (b - a > k) {
cout << ":(";
return 0;
}
if (c - a > k) {
cout << ":(";
return 0;
}
if (d - a > k) {
cout << ":(";
return 0;
}
if (e - a > k) {
cout << ":(";
return 0;
}
if (c - b > k) {
cout << ":(";
return 0;
}
if (d - b > k) {
cout << ":(";
return 0;
}
if (e - b > k) {
cout << ":(";
return 0;
}
if (d - c > k) {
cout << ":(";
return 0;
}
if (e - c > k) {
cout << ":(";
return 0;
}
if (e - d > k) {
cout << ":(";
return 0;
}
cout << "Yay!";
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 890,267 | 890,266 | u415518175 | cpp |
p03075 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int tmp, k;
bool flag = false;
vector<int> d;
string out;
cin >> tmp;
d.push_back(tmp);
cin >> tmp;
d.push_back(tmp);
cin >> tmp;
d.push_back(tmp);
cin >> tmp;
d.push_back(tmp);
cin >> tmp;
d.push_back(tmp);
cin >> k;
out = "Yay!";
for (int i = 0; i < d.size(); i++) {
for (int j = d.size() - 1; j > i; j--) {
if (d[j] - d[i] < k) {
continue;
} else {
flag = true;
out = ":(";
}
}
if (flag)
break;
}
cout << out << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int tmp, k;
bool flag = false;
vector<int> d;
string out;
cin >> tmp;
d.push_back(tmp);
cin >> tmp;
d.push_back(tmp);
cin >> tmp;
d.push_back(tmp);
cin >> tmp;
d.push_back(tmp);
cin >> tmp;
d.push_back(tmp);
cin >> k;
out = "Yay!";
for (int i = 0; i < d.size(); i++) {
for (int j = d.size() - 1; j > i; j--) {
if (d[j] - d[i] <= k) {
continue;
} else {
flag = true;
out = ":(";
}
}
if (flag)
break;
}
cout << out << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 890,276 | 890,277 | u363215066 | cpp |
p03075 | #include <stdio.h>
int main() {
int anthena[6] = {0}, i = 0, k = 0, j = 0;
for (i = 0; i < 6; i++) {
scanf("%d", &anthena[i]);
}
for (i = 4; i > 0; i--) {
for (j = 0; j > i; j++) {
if (anthena[i] - anthena[j] > anthena[5]) {
k++;
}
}
}
if (k > 0) {
printf(":(");
} else {
printf("Yay!");
}
return 0;
} | #include <stdio.h>
int main() {
int anthena[6] = {0}, i = 0, k = 0, j = 0;
for (i = 0; i < 6; i++) {
scanf("%d", &anthena[i]);
}
for (i = 4; i > 0; i--) {
for (j = 0; j < i; j++) {
if (anthena[i] - anthena[j] > anthena[5]) {
k++;
}
}
}
if (k > 0) {
printf(":(");
} else {
printf("Yay!");
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 890,282 | 890,283 | u813882787 | cpp |
p03075 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> A(5);
REP(i, 5) cin >> A[i];
int k;
cin >> k;
int b = 1;
for (int i = 0; i < 4; i++) {
for (int j = i; j < 5; j++) {
if (A[j] - A[k] > k) {
b = 0;
}
}
}
if (b) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> A(5);
REP(i, 5) cin >> A[i];
int k;
cin >> k;
int b = 1;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (A[j] - A[i] > k) {
b = 0;
}
}
}
if (b) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 890,284 | 890,285 | u520129469 | cpp |
p03075 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> A(5);
REP(i, 5) cin >> A[i];
int k;
cin >> k;
int b = 1;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (A[j] - A[k] - 1 > k) {
b = 0;
}
}
}
if (b) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> A(5);
REP(i, 5) cin >> A[i];
int k;
cin >> k;
int b = 1;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (A[j] - A[i] > k) {
b = 0;
}
}
}
if (b) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 890,286 | 890,285 | u520129469 | cpp |
p03075 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> A(5);
REP(i, 5) cin >> A[i];
int k;
cin >> k;
int b = 1;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (A[j] - A[k] > k) {
b = 0;
}
}
}
if (b) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> A(5);
REP(i, 5) cin >> A[i];
int k;
cin >> k;
int b = 1;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (A[j] - A[i] > k) {
b = 0;
}
}
}
if (b) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 890,287 | 890,285 | u520129469 | cpp |
p03075 | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
int a[6];
for (int i = 1; i <= 5; i++) {
cin >> a[i];
}
cin >> k;
for (int i = 1; i <= 5; i++) {
for (int j = i + 1; j <= 5; j++) {
if (a[j] - a[i] > 15) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
int a[6];
for (int i = 1; i <= 5; i++) {
cin >> a[i];
}
cin >> k;
for (int i = 1; i <= 5; i++) {
for (int j = i + 1; j <= 5; j++) {
if (a[j] - a[i] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 890,305 | 890,306 | u672576392 | cpp |
p03075 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
string ans;
if (e - a > k) {
ans = ':(';
} else {
ans = 'Yay!';
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
//入力
int a, b, c, d, e, k;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
cin >> k;
//処理
string ans;
if (e - a > k) {
ans = ":(";
} else {
ans = "Yay!";
}
//出力
cout << ans << endl;
}
| [
"literal.string.change",
"assignment.value.change"
] | 890,311 | 890,312 | u775507068 | cpp |
p03075 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int ans[15];
for (int i = 0; i < 6; i++)
scanf("%d", &ans[i]);
int ok = 1;
for (int i = 0; i < 4; i++)
for (int j = i + 1; j < 5; j++) {
if (abs(ans[i] - ans[j]) > ans[5]) {
cout << ":(" << endl;
return 0;
}
}
if (ok)
cout << "Yey!" << endl;
return 0;
} | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int ans[15];
for (int i = 0; i < 6; i++)
scanf("%d", &ans[i]);
int ok = 1;
for (int i = 0; i < 4; i++)
for (int j = i + 1; j < 5; j++) {
if (abs(ans[i] - ans[j]) > ans[5]) {
cout << ":(" << endl;
return 0;
}
}
if (ok)
cout << "Yay!" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 890,313 | 890,314 | u141938981 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int max10(int x) { return (x + 9) / 10 * 10; }
int sa10(int x) { return max10(x) - x; }
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
int sum = max10(A) + max10(B) + max10(C) + max10(D) + max10(E);
int sa = 10 - min({sa10(A), sa10(B), sa10(C), sa10(D), sa10(E)});
cout << sum - sa << endl;
} | #include <bits/stdc++.h>
using namespace std;
int max10(int x) { return (x + 9) / 10 * 10; }
int sa10(int x) { return max10(x) - x; }
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
int sum = max10(A) + max10(B) + max10(C) + max10(D) + max10(E);
int sa = max({sa10(A), sa10(B), sa10(C), sa10(D), sa10(E)});
cout << sum - sa << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 890,321 | 890,322 | u217508499 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int max10(int x) { return (x + 9) / 10 * 10; }
int sa10(int x) { return max10(x) - x; }
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
int sum = max10(A) + max10(B) + max10(C) + max10(D) + max10(E);
int sa = 10 - max({sa10(A), sa10(B), sa10(C), sa10(D), sa10(E)});
cout << sum - sa << endl;
} | #include <bits/stdc++.h>
using namespace std;
int max10(int x) { return (x + 9) / 10 * 10; }
int sa10(int x) { return max10(x) - x; }
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
int sum = max10(A) + max10(B) + max10(C) + max10(D) + max10(E);
int sa = max({sa10(A), sa10(B), sa10(C), sa10(D), sa10(E)});
cout << sum - sa << endl;
} | [
"expression.operation.binary.remove"
] | 890,323 | 890,322 | u217508499 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o, n) for (int j = o; j < (int)(n); ++j)
#define Repone(j, n) for (int j = 1; j < (int)(n); ++j)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define int long long
#define pb(a) push_back(a)
#define eraser(v, i) (v).erase(v.begin() + (i))
#define pbpair(a, b) push_back(make_pair(a, b))
#define MOD 1000000007
#define INF 9223372036854775807
#define pairint pair<int, int>
signed main() {
int x = 0, y = 0, z = 0, w = 0, n = 0, m = 0, a = 0, b = 0;
std::vector<int> v(5);
rep(i, 5) {
std::cin >> v[i];
if (v[i] % 10 > 0) {
y = 10 - v[i] % 10;
if (i == 0)
x = y;
else if (x < v[i] % 10)
x = y;
v[i] += y;
}
z += v[i];
}
std::cout << z - x << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o, n) for (int j = o; j < (int)(n); ++j)
#define Repone(j, n) for (int j = 1; j < (int)(n); ++j)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define int long long
#define pb(a) push_back(a)
#define eraser(v, i) (v).erase(v.begin() + (i))
#define pbpair(a, b) push_back(make_pair(a, b))
#define MOD 1000000007
#define INF 9223372036854775807
#define pairint pair<int, int>
signed main() {
int x = 0, y = 0, z = 0, w = 0, n = 0, m = 0, a = 0, b = 0;
std::vector<int> v(5);
rep(i, 5) {
std::cin >> v[i];
if (v[i] % 10 > 0) {
y = 10 - v[i] % 10;
if (i == 0)
x = y;
else if (x < y)
x = y;
v[i] += y;
}
z += v[i];
}
std::cout << z - x << '\n';
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 890,383 | 890,384 | u893330446 | cpp |
p03076 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int A[5];
int main() {
rep(i, 5) { cin >> A[i]; }
int last_idx = -1;
int last_value = -1;
rep(i, 5) {
int tmp = A[i] % 10;
if (tmp != 0 && 10 - tmp > last_value) {
last_idx = i;
last_value = A[i];
}
}
if (last_idx == -1)
last_idx = 0;
// cout << last_idx << endl;
int ans = 0;
rep(i, 5) {
if (i == last_idx) {
// printf("last %d %d\n", i, A[i]);
ans += A[last_idx];
} else {
while (A[i] % 10 != 0) {
A[i]++;
}
// printf("%d %d\n", i, A[i]);
ans += A[i];
}
}
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;
int A[5];
int main() {
rep(i, 5) { cin >> A[i]; }
int last_idx = -1;
int last_value = -1;
rep(i, 5) {
int tmp = A[i] % 10;
if (tmp != 0 && 10 - tmp > last_value) {
last_idx = i;
last_value = 10 - tmp;
}
}
if (last_idx == -1)
last_idx = 0;
// cout << last_idx << endl;
int ans = 0;
rep(i, 5) {
if (i == last_idx) {
// printf("last %d %d\n", i, A[i]);
ans += A[last_idx];
} else {
while (A[i] % 10 != 0) {
A[i]++;
}
// printf("%d %d\n", i, A[i]);
ans += A[i];
}
}
cout << ans << endl;
} | [] | 890,387 | 890,388 | u455366471 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
signed main() {
long long b[100], c = 0, d = 0, e, f = 1000000, t, g[100000];
int a[100];
for (int i = 0; i < 5; i++) {
cin >> c;
if (c % 10 == 0)
b[i] = 0;
else
b[i] = abs(10 - (c % 10));
a[i] = c - (c % 10);
}
sort(b, b + 5);
for (int i = 0; i < 5; i++) {
d += a[i] + b[i];
}
cout << d - b[4] << "\n";
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
long long b[100], c = 0, d = 0, e, f = 1000000, t, g[100000];
int a[100];
for (int i = 0; i < 5; i++) {
cin >> c;
if (c % 10 == 0)
b[i] = 0;
else
b[i] = abs(10 - (c % 10));
a[i] = c;
}
sort(b, b + 5);
for (int i = 0; i < 5; i++) {
d += a[i] + b[i];
}
cout << d - b[4] << "\n";
}
| [
"expression.operation.binary.remove"
] | 890,391 | 890,392 | u831161882 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<string> s(5);
for (int i = 0; i < 5; i++) {
cin >> s.at(i);
}
int ans = 0;
int MIN = 10;
for (int i = 0; i < 5; i++) {
if (s.at(i).at(s.at(i).size() - 1) - '0' == 0) {
ans += stoi(s.at(i));
} else {
ans += stoi(s.at(i)) / 10 + 10;
MIN = min(s.at(i).at(s.at(i).size() - 1) - '0', MIN);
}
}
ans -= 10;
ans += MIN;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<string> s(5);
for (int i = 0; i < 5; i++) {
cin >> s.at(i);
}
int ans = 0;
int MIN = 10;
for (int i = 0; i < 5; i++) {
if (s.at(i).at(s.at(i).size() - 1) - '0' == 0) {
ans += stoi(s.at(i));
} else {
ans += (stoi(s.at(i)) / 10) * 10 + 10;
MIN = min(s.at(i).at(s.at(i).size() - 1) - '0', MIN);
}
}
ans -= 10;
ans += MIN;
cout << ans << endl;
}
| [
"assignment.change"
] | 890,397 | 890,398 | u091552241 | cpp |
p03076 | #include <iostream>
using namespace std;
int main() {
int M[5];
int maxW = 0;
int lastM = 0;
for (int i = 0; i < 5; i++) {
cin >> M[i];
int mod = 10 - M[i] % 10;
if (mod != 0) {
if (mod > maxW) {
lastM = i;
maxW = mod;
}
}
}
int T = 0;
for (int i = 0; i < 5; i++) {
if (i == lastM || M[i] % 10 == 0) {
T += M[i];
} else {
// cout << "M[" << i << "]=" << M[i] << endl;;
// cout << 10 * (M[i] / 10) + 10 << endl;
T += 10 * (M[i] / 10) + 10;
}
}
// cout << maxW << endl;
// cout << lastM << endl;
cout << T << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int M[5];
int maxW = 0;
int lastM = 0;
for (int i = 0; i < 5; i++) {
cin >> M[i];
int mod = M[i] % 10;
if (mod != 0) {
if (10 - mod > maxW) {
lastM = i;
maxW = 10 - mod;
}
}
}
int T = 0;
for (int i = 0; i < 5; i++) {
if (i == lastM || M[i] % 10 == 0) {
T += M[i];
} else {
T += 10 * (M[i] / 10) + 10;
}
}
cout << T << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 890,409 | 890,410 | u074372598 | cpp |
p03076 | #include <iostream>
using namespace std;
int main() {
int M[5];
int maxW = 0;
int lastM = 0;
for (int i = 0; i < 5; i++) {
cin >> M[i];
int mod = M[i] % 10;
if (mod != 0) {
if (mod > maxW) {
lastM = i;
maxW = mod;
}
}
}
int T = 0;
for (int i = 0; i < 5; i++) {
if (i == lastM || M[i] % 10 == 0) {
T += M[i];
} else {
// cout << "M[" << i << "]=" << M[i] << endl;;
// cout << 10 * (M[i] / 10) + 10 << endl;
T += 10 * (M[i] / 10) + 10;
}
}
// cout << maxW << endl;
// cout << lastM << endl;
cout << T << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int M[5];
int maxW = 0;
int lastM = 0;
for (int i = 0; i < 5; i++) {
cin >> M[i];
int mod = M[i] % 10;
if (mod != 0) {
if (10 - mod > maxW) {
lastM = i;
maxW = 10 - mod;
}
}
}
int T = 0;
for (int i = 0; i < 5; i++) {
if (i == lastM || M[i] % 10 == 0) {
T += M[i];
} else {
T += 10 * (M[i] / 10) + 10;
}
}
cout << T << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 890,411 | 890,410 | u074372598 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
vi amari(5);
amari.at(0) = a % 10;
amari.at(1) = b % 10;
amari.at(2) = c % 10;
amari.at(3) = d % 10;
amari.at(4) = e % 10;
sort(amari.begin(), amari.end());
int mini = 0;
rep(i, 4) {
if (amari.at(0) == 0)
continue;
mini = amari.at(i);
break;
}
if (mini == 0) {
cout << a + b + c + d + e << endl;
return 0;
}
a = ((a + 9) / 10) * 10;
b = ((b + 9) / 10) * 10;
c = ((c + 9) / 10) * 10;
d = ((d + 9) / 10) * 10;
e = ((e + 9) / 10) * 10;
cout << a + b + c + d + e - 10 + mini << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
vi amari(5);
amari.at(0) = a % 10;
amari.at(1) = b % 10;
amari.at(2) = c % 10;
amari.at(3) = d % 10;
amari.at(4) = e % 10;
sort(amari.begin(), amari.end());
int mini = 0;
rep(i, 4) {
if (amari.at(i) == 0)
continue;
mini = amari.at(i);
break;
}
if (mini == 0) {
cout << a + b + c + d + e << endl;
return 0;
}
a = ((a + 9) / 10) * 10;
b = ((b + 9) / 10) * 10;
c = ((c + 9) / 10) * 10;
d = ((d + 9) / 10) * 10;
e = ((e + 9) / 10) * 10;
cout << a + b + c + d + e - 10 + mini << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 890,435 | 890,436 | u184335045 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
vi amari(5);
amari.at(0) = a % 10;
amari.at(1) = b % 10;
amari.at(2) = c % 10;
amari.at(3) = d % 10;
amari.at(4) = e % 10;
sort(amari.begin(), amari.end());
int mini = 0;
rep(i, 4) {
if (amari.at(0) == 0)
continue;
mini = amari.at(i);
}
if (mini == 0) {
cout << a + b + c + d + e << endl;
return 0;
}
a = ((a + 9) / 10) * 10;
b = ((b + 9) / 10) * 10;
c = ((c + 9) / 10) * 10;
d = ((d + 9) / 10) * 10;
e = ((e + 9) / 10) * 10;
cout << a + b + c + d + e - 10 + mini << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
vi amari(5);
amari.at(0) = a % 10;
amari.at(1) = b % 10;
amari.at(2) = c % 10;
amari.at(3) = d % 10;
amari.at(4) = e % 10;
sort(amari.begin(), amari.end());
int mini = 0;
rep(i, 4) {
if (amari.at(i) == 0)
continue;
mini = amari.at(i);
break;
}
if (mini == 0) {
cout << a + b + c + d + e << endl;
return 0;
}
a = ((a + 9) / 10) * 10;
b = ((b + 9) / 10) * 10;
c = ((c + 9) / 10) * 10;
d = ((d + 9) / 10) * 10;
e = ((e + 9) / 10) * 10;
cout << a + b + c + d + e - 10 + mini << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 890,437 | 890,436 | u184335045 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0;
int ma = 0;
for (int i = 0; i < 5; ++i) {
int a;
cin >> a;
int t = (a + 9) / 10;
sum += t;
ma = max(ma, t - a);
}
cout << sum - ma << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0;
int ma = 0;
for (int i = 0; i < 5; ++i) {
int a;
cin >> a;
int t = (a + 9) / 10 * 10;
sum += t;
ma = max(ma, t - a);
}
cout << sum - ma << endl;
} | [
"assignment.change"
] | 890,471 | 890,472 | u679366464 | cpp |
p03076 | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 64bit型
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
#define PRINT(V) \
{ \
for (int i = 0; i < V.size(); i++) { \
cout << V[i] << " "; \
} \
cout << endl; \
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int mod = 1000000000 + 7;
int dp[101][4][4][4];
int main() {
// input->compute->output//
vector<int> Time(5), nextTime(5);
for (int i = 0; i < 5; i++) {
cin >> Time[i];
}
for (int i = 0; i < 5; i++) {
nextTime[i] = (Time[i] + 9) / 10 * 10;
}
int ans = (int)1e9;
for (int i = 0; i < 5; i++) {
int res = 0;
for (int j = 0; j < 5; j++) {
if (i == j) {
res += Time[j];
}
res += nextTime[j];
}
ans = min(ans, res);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 64bit型
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
#define PRINT(V) \
{ \
for (int i = 0; i < V.size(); i++) { \
cout << V[i] << " "; \
} \
cout << endl; \
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int mod = 1000000000 + 7;
int dp[101][4][4][4];
int main() {
// input->compute->output//
vector<int> Time(5), nextTime(5);
for (int i = 0; i < 5; i++) {
cin >> Time[i];
}
for (int i = 0; i < 5; i++) {
nextTime[i] = (Time[i] + 9) / 10 * 10;
}
int ans = (int)1e9;
for (int i = 0; i < 5; i++) {
int res = 0;
for (int j = 0; j < 5; j++) {
if (i == j) {
res += Time[j];
} else {
res += nextTime[j];
}
}
ans = min(ans, res);
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.else.add"
] | 890,473 | 890,474 | u966508131 | cpp |
p03076 | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
#define PRINT(V) \
{ \
for (int i = 0; i < V.size(); i++) { \
cout << V[i] << " "; \
} \
cout << endl; \
}
typedef long long ll; // 64bit型
using namespace std;
const ll INF = 1LL << 20;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
vector<int> Time = {A, B, C, D, E};
vector<int> index = {0, 1, 2, 3, 4};
vector<int> nextTime(5);
for (int i = 0; i < 5; i++) {
if (Time[i] % 10 == 0)
nextTime[i] = Time[i];
nextTime[i] = (Time[i] + 10 - 1) / 10 * 10;
}
int ans = (int)1e9;
do {
int res = 0;
for (int i = 0; i < 5; i++) {
while (ans % 10 != 0)
ans++;
ans += Time[index[i]];
}
ans = min(ans, res);
} while (next_permutation(index.begin(), index.end()));
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
#define PRINT(V) \
{ \
for (int i = 0; i < V.size(); i++) { \
cout << V[i] << " "; \
} \
cout << endl; \
}
typedef long long ll; // 64bit型
using namespace std;
const ll INF = 1LL << 20;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
vector<int> Time = {A, B, C, D, E};
vector<int> index = {0, 1, 2, 3, 4};
vector<int> nextTime(5);
for (int i = 0; i < 5; i++) {
if (Time[i] % 10 == 0)
nextTime[i] = Time[i];
nextTime[i] = (Time[i] + 10 - 1) / 10 * 10;
}
int ans = (int)1e9;
do {
int res = 0;
for (int i = 0; i < 5; i++) {
while (res % 10 != 0)
res++;
res += Time[index[i]];
}
ans = min(ans, res);
} while (next_permutation(index.begin(), index.end()));
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.loop.condition.change",
"assignment.variable.change"
] | 890,475 | 890,476 | u966508131 | cpp |
p03076 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll a[5], k, sum = 0;
ll tmp = 10;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (int i = 0; i < 5; i++) {
if (min(a[i] % 10, tmp) && a[i] % 10 != 0) {
tmp = a[i] % 10;
}
if (a[i] % 10 == 0)
sum += a[i];
else
sum += a[i] + (10 - a[i] % 10);
}
if (tmp != 10) {
cout << sum - (10 - tmp) << endl;
} else {
cout << sum << endl;
}
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll a[5], k, sum = 0;
ll tmp = 10;
cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
for (int i = 0; i < 5; i++) {
if (a[i] % 10 < tmp && a[i] % 10 != 0) {
tmp = a[i] % 10;
// cout << tmp << endl;
}
if (a[i] % 10 == 0)
sum += a[i];
else
sum += a[i] + (10 - a[i] % 10);
}
// cout << sum<<tmp;;
if (tmp != 10) {
cout << sum - (10 - tmp) << endl;
} else {
cout << sum << endl;
}
}
| [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 890,479 | 890,480 | u503052349 | cpp |
p03076 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long ll;
int main(void) {
int A[5], time = 0, mi = 10;
for (int i = 0; i < 5; i++) {
cin >> A[i];
if (A[i] % 10)
mi = min(mi, A[i] % 10);
time += ceil(A[i] / 10) * 10;
}
cout << time + mi - 10;
return 0;
} | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long ll;
int main(void) {
int A[5], time = 0, mi = 10;
for (int i = 0; i < 5; i++) {
cin >> A[i];
if (A[i] % 10)
mi = min(mi, A[i] % 10);
time += ceil(A[i] / 10.0) * 10;
}
cout << time + mi - 10;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 890,488 | 890,489 | u895536055 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int maxtime(int x) {
//１の位を切り上げる
return (x + 9) / 10 * 10;
}
int remitime(int x) {
//ロスする時間
return (x)-x;
}
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int sum =
maxtime(a) + maxtime(b) + maxtime(c) + maxtime(d) + maxtime(e) -
max({remitime(a), remitime(b), remitime(c), remitime(d), remitime(e)});
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int maxtime(int x) {
//１の位を切り上げる
return (x + 9) / 10 * 10;
}
int remitime(int x) {
//ロスする時間
return maxtime(x) - x;
}
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int sum =
maxtime(a) + maxtime(b) + maxtime(c) + maxtime(d) + maxtime(e) -
max({remitime(a), remitime(b), remitime(c), remitime(d), remitime(e)});
cout << sum << endl;
}
| [
"call.add",
"function.return_value.change"
] | 890,504 | 890,505 | u880909682 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << 10 * ((a + 9) / 10 + (b + 9) / 10 + (c + 9) / 10 + (d + 9) / 10 +
(e + 9) / 10 - 1) +
min((a + 9) % 10,
min((b + 9) % 10,
min((c + 9) % 10, min((d + 9) % 10, (e + 9) % 10))));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << 10 * ((a + 9) / 10 + (b + 9) / 10 + (c + 9) / 10 + (d + 9) / 10 +
(e + 9) / 10 - 1) +
min((a + 9) % 10,
min((b + 9) % 10,
min((c + 9) % 10, min((d + 9) % 10, (e + 9) % 10)))) +
1;
} | [] | 890,510 | 890,511 | u952130512 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << 10 * ((a + 9) / 10 + (b + 9) / 10 + (c + 9) / 10 + (d + 9) / 10 +
(e + 9) / 10) -
min((a + 9) % 10,
min((b + 9) % 10,
min((c + 9) % 10, min((d + 9) % 10, (e + 9) % 10))));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << 10 * ((a + 9) / 10 + (b + 9) / 10 + (c + 9) / 10 + (d + 9) / 10 +
(e + 9) / 10 - 1) +
min((a + 9) % 10,
min((b + 9) % 10,
min((c + 9) % 10, min((d + 9) % 10, (e + 9) % 10)))) +
1;
} | [
"expression.operation.binary.add"
] | 890,512 | 890,511 | u952130512 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 5;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 0;
int offset = 0;
for (int i = 0; i < n; i++) {
if (a[i] % 10 == 0) {
ans += a[i];
} else {
ans += a[i] + (10 - a[i] % 10);
}
offset = max(offset, (10 - a[i] % 10));
}
cout << ans - offset << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 5;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 0;
int offset = 0;
for (int i = 0; i < n; i++) {
if (a[i] % 10 == 0) {
ans += a[i];
} else {
ans += a[i] + (10 - a[i] % 10);
offset = max(offset, (10 - a[i] % 10));
}
}
cout << ans - offset << endl;
return 0;
} | [] | 890,515 | 890,516 | u679159704 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPRl(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < (int)n; i++)
#define FORl(i, m, n) for (ll i = m; i < (ll)n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
vector<int> a(5);
REP(i, 5) { cin >> a[i]; }
int min = 10;
int sum = 0;
REP(i, 5) {
int lowest = a[i] % 10;
if (lowest < min) {
min = lowest;
}
int tmp = (lowest == 0 ? a[i] : ((a[i] / 10 + 1) * 10));
sum += tmp;
}
sum -= (10 - min);
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPRl(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < (int)n; i++)
#define FORl(i, m, n) for (ll i = m; i < (ll)n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
vector<int> a(5);
REP(i, 5) { cin >> a[i]; }
int min = 10;
int sum = 0;
REP(i, 5) {
int lowest = a[i] % 10;
if (lowest != 0 && lowest < min) {
min = lowest;
}
int tmp = (lowest == 0 ? a[i] : ((a[i] / 10 + 1) * 10));
sum += tmp;
}
sum -= (10 - min);
cout << sum << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 890,527 | 890,528 | u882037708 | cpp |
p03076 | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
vector<int> a(5);
rep0(i, 5) cin >> a[i];
vector<int> all = {0, 1, 2, 3, 4, 5};
int solve = INF;
do {
int ans = 0;
rep0(j, 5) {
while (ans % 10 != 0)
ans++;
ans += a[all[j]];
}
solve = min(solve, ans);
} while (next_permutation(all.begin(), all.end()));
cout << solve << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
vector<int> a(5);
rep0(i, 5) cin >> a[i];
vector<int> all = {0, 1, 2, 3, 4};
int solve = INF;
do {
int ans = 0;
rep0(j, 5) {
while (ans % 10 != 0)
ans++;
ans += a[all[j]];
}
solve = min(solve, ans);
} while (next_permutation(all.begin(), all.end()));
cout << solve << endl;
return 0;
} | [] | 890,531 | 890,532 | u820341516 | cpp |
p03076 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define dup(x, y) (((x) + (y)-1) / (y))
#define sz(x) (int)(x).size()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
vector<int> v(5);
rep(i, 5) cin >> v[i];
int ans = 0;
int m = 0;
rep(i, 5) {
ans += dup(v[i], 10) * 10;
if (v[i] % 10 != 0 && 10 - v[i] % 10 >= m) {
m = 10 - v[i] % 10;
}
}
cout << ans - 10 + m << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define dup(x, y) (((x) + (y)-1) / (y))
#define sz(x) (int)(x).size()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
vector<int> v(5);
rep(i, 5) cin >> v[i];
int ans = 0;
int m = 0;
rep(i, 5) {
ans += dup(v[i], 10) * 10;
if (v[i] % 10 != 0 && 10 - v[i] % 10 >= m) {
m = 10 - v[i] % 10;
}
}
cout << ans - m << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 890,554 | 890,555 | u319093540 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
//#define min min<int>
//#define max max<int>
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
int gcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return f;
}*/
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
int gcm(int a, int b) {
if (b == 0)
return a;
return gcm(b, a % b);
}
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a /= 10;
b /= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
signed main() {
V<int> a(5);
fo(i, 5) cin >> a[i];
sort(a.bgn, a.en, fe);
int b = 0;
fo(i, 4) {
if (a[i] % 10 == 0)
b += a[i];
else
b += (a[i] / 10 + 1) * 10;
}
cout << b + a[4] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
//#define min min<int>
//#define max max<int>
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
int gcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return f;
}*/
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
int gcm(int a, int b) {
if (b == 0)
return a;
return gcm(b, a % b);
}
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
signed main() {
V<int> a(5);
fo(i, 5) cin >> a[i];
sort(a.bgn, a.en, fe);
int b = 0;
fo(i, 4) {
if (a[i] % 10 == 0)
b += a[i];
else
b += (a[i] / 10 + 1) * 10;
}
cout << b + a[4] << endl;
} | [
"expression.operator.change"
] | 890,558 | 890,559 | u322177979 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
//#define min min<int>
//#define max max<int>
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
int gcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return f;
}*/
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
int gcm(int a, int b) {
if (b == 0)
return a;
return gcm(b, a % b);
}
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a /= 10;
b /= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a < b)
return true;
else
return false;
}
signed main() {
V<int> a(5);
fo(i, 5) cin >> a[i];
sort(a.bgn, a.en, fe);
int b = 0;
fo(i, 4) {
if (a[i] % 10 == 0)
b += a[i];
else
b += (a[i] / 10 + 1) * 10;
}
cout << b + a[4] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
//#define min min<int>
//#define max max<int>
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
int gcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return f;
}*/
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
int gcm(int a, int b) {
if (b == 0)
return a;
return gcm(b, a % b);
}
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
signed main() {
V<int> a(5);
fo(i, 5) cin >> a[i];
sort(a.bgn, a.en, fe);
int b = 0;
fo(i, 4) {
if (a[i] % 10 == 0)
b += a[i];
else
b += (a[i] / 10 + 1) * 10;
}
cout << b + a[4] << endl;
} | [
"expression.operator.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 890,560 | 890,559 | u322177979 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
int c = 10;
int p = 0;
for (int i = 0; i < 5; i++) {
if (a[i] % 10 == 0) {
p += a[i] % 10;
} else {
c = min(a[i] % 10, c);
p += a[i] % 10 + 1;
}
}
cout << (p - 1) * 10 + c << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
int c = 10;
int p = 0;
for (int i = 0; i < 5; i++) {
if (a[i] % 10 == 0) {
p += a[i] / 10;
} else {
c = min(a[i] % 10, c);
p += a[i] / 10 + 1;
}
}
cout << (p - 1) * 10 + c << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 890,581 | 890,582 | u331948661 | cpp |
p03076 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int l;
std::vector<int> t;
long p, last, buf;
last = 0;
buf = 10;
for (int i = 0; i < 5; i++) {
std::cin >> l;
t.push_back(l);
if (buf > l % 10 && l % 10 != 0) {
buf = l % 10;
last = i;
}
}
long result;
for (int i = 0; i < 5; i++) {
if (i != last && t[i] % 10 != 0) {
t[i] = (t[i] + 10) / 10 * 10;
}
result += t[i];
}
std::cout << result << "\n";
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int l;
std::vector<int> t;
long p, last, buf;
last = 0;
buf = 10;
for (int i = 0; i < 5; i++) {
std::cin >> l;
t.push_back(l);
if (buf > l % 10 && l % 10 != 0) {
buf = l % 10;
last = i;
}
}
long result = 0;
for (int i = 0; i < 5; i++) {
if (i != last && t[i] % 10 != 0) {
t[i] = (t[i] + 10) / 10 * 10;
}
result += t[i];
}
std::cout << result << "\n";
return 0;
}
| [
"variable_declaration.value.change"
] | 890,615 | 890,616 | u586259052 | cpp |
p03076 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int s[5];
for (int i = 0; i < 5; i++) {
cin >> s[i];
}
int mini = 10;
for (int i = 0; i < 5; i++) {
if (s[i] % 10 != 0) {
mini = min(s[i] % 10, mini);
}
}
int sum = 0;
for (int i = 0; i < 5; i++) {
if (s[i] % 10 == 0) {
sum += s[i];
} else {
sum += s[i] + (10 - s[i] % 10);
}
}
int ans = sum - mini;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int s[5];
for (int i = 0; i < 5; i++) {
cin >> s[i];
}
int mini = 10;
for (int i = 0; i < 5; i++) {
if (s[i] % 10 != 0) {
mini = min(s[i] % 10, mini);
}
}
int sum = 0;
for (int i = 0; i < 5; i++) {
if (s[i] % 10 == 0) {
sum += s[i];
} else {
sum += s[i] + (10 - s[i] % 10);
}
}
int ans = sum - 10 + mini;
cout << ans << endl;
} | [
"assignment.change"
] | 890,622 | 890,623 | u791220701 | cpp |
p03076 | #include <bits/stdc++.h>
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL)
#define ll long long int
#define ld long double
#define f(a, b) for (ll i = a; i < b; i++)
#define in(a, b) (b.find(a) != string::npos)
#define X first
#define Y second
#define vi vector<int>
#define fill(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define pf push_front
#define mp make_pair
#define all(v) v.begin(), v.end()
#define el "\n"
const ll M = 1e9 + 7;
using namespace std;
int main() {
fio;
int n = 5;
int a[n] = {0};
ll sm = 0;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
cin >> a[i];
v.pb(mp((10 - a[i]) % 10, i));
}
sort(all(v));
for (int i = 0; i < n; i++) {
sm += a[v[i].Y];
if (sm % 10 != 0 && i != n - 1) {
while (sm % 10 != 0)
sm++;
}
}
cout << sm << el;
return 0;
}
| #include <bits/stdc++.h>
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL)
#define ll long long int
#define ld long double
#define f(a, b) for (ll i = a; i < b; i++)
#define in(a, b) (b.find(a) != string::npos)
#define X first
#define Y second
#define vi vector<int>
#define fill(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define pf push_front
#define mp make_pair
#define all(v) v.begin(), v.end()
#define el "\n"
const ll M = 1e9 + 7;
using namespace std;
int main() {
fio;
int n = 5;
int a[n] = {0};
ll sm = 0;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
cin >> a[i];
v.pb(mp((10 - a[i] % 10) % 10, i));
}
sort(all(v));
for (int i = 0; i < n; i++) {
sm += a[v[i].Y];
if (sm % 10 != 0 && i != n - 1) {
while (sm % 10 != 0)
sm++;
}
}
cout << sm << el;
return 0;
}
| [
"expression.operation.binary.add"
] | 890,637 | 890,638 | u245531500 | cpp |
p03076 | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; ++i)
int main() {
int fans = 123 * 5 + 1;
vector<int> menus(5);
vector<int> order = {0, 1, 2, 3, 4};
rep(i, 5) scanf("%d", &menus[i]);
while (next_permutation(order.begin(), order.end())) {
int ans = 0;
rep(i, menus.size()) {
while (ans % 10 != 0)
ans++;
ans += menus[order[i]];
}
fans = min(fans, ans);
}
printf("%d\n", fans);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; ++i)
int main() {
int fans = 1012345678;
vector<int> menus(5);
vector<int> order = {0, 1, 2, 3, 4};
rep(i, 5) scanf("%d", &menus[i]);
while (next_permutation(order.begin(), order.end())) {
int ans = 0;
rep(i, menus.size()) {
while (ans % 10 != 0)
ans++;
ans += menus[order[i]];
}
fans = min(fans, ans);
}
printf("%d\n", fans);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 890,647 | 890,648 | u453070758 | cpp |
p03076 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; ++i)
int main() {
int fans = 123 * 5 + 1;
vector<int> menus(5);
vector<int> order = {0, 1, 2, 3, 4};
rep(i, 5) cin >> menus[i];
while (next_permutation(order.begin(), order.end())) {
int ans = 0;
rep(i, menus.size()) {
while (ans % 10 != 0)
ans++;
ans += menus[order[i]];
}
fans = min(fans, ans);
}
cout << fans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; ++i)
int main() {
int fans = 1012345678;
vector<int> menus(5);
vector<int> order = {0, 1, 2, 3, 4};
rep(i, 5) cin >> menus[i];
while (next_permutation(order.begin(), order.end())) {
int ans = 0;
rep(i, menus.size()) {
while (ans % 10 != 0)
ans++;
ans += menus[order[i]];
}
fans = min(fans, ans);
}
cout << fans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 890,649 | 890,650 | u453070758 | cpp |
p03076 | #include <stdio.h>
int main(void) {
int i, j, k, l, ans = 0;
int N;
int A[5];
l = 0;
k = 0;
for (i = 0; i < 5; i++) {
scanf("%d", &A[i]);
if (A[i] % 10 != 0 && 10 - A[i] % 10 > l) {
k = i;
l = (10 - A[i] % 10);
}
}
for (i = 0; i < 5; i++) {
j = 0;
while (A[i] > j) {
j = j + 10;
}
ans += j;
}
if (k != 0) {
ans = ans - (10 - A[k] % 10);
}
printf("%d\n", ans);
return 0;
} | #include <stdio.h>
int main(void) {
int i, j, k, l, ans = 0;
int N;
int A[5];
l = 0;
k = 9;
for (i = 0; i < 5; i++) {
scanf("%d", &A[i]);
if (A[i] % 10 != 0 && 10 - A[i] % 10 > l) {
k = i;
l = (10 - A[i] % 10);
}
}
for (i = 0; i < 5; i++) {
j = 0;
while (A[i] > j) {
j = j + 10;
}
ans += j;
}
if (k != 9) {
ans = ans - (10 - A[k] % 10);
}
printf("%d\n", ans);
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 890,656 | 890,657 | u629341543 | cpp |
p03076 | #include <algorithm>
#include <iostream>
using namespace std;
int maxTime(int x) { (x + 9) / 10 * 10; }
int los(int x) { maxTime(x) - x; }
int main() {
int a, b, c, d, e, ans;
cin >> a >> b >> c >> d >> e;
ans = maxTime(a) + maxTime(b) + maxTime(c) + maxTime(d) + maxTime(e);
ans -= max({los(a), los(b), los(c), los(d), los(e)});
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int maxTime(int x) { return (x + 9) / 10 * 10; }
int los(int x) { return maxTime(x) - x; }
int main() {
int a, b, c, d, e, ans;
cin >> a >> b >> c >> d >> e;
ans = maxTime(a) + maxTime(b) + maxTime(c) + maxTime(d) + maxTime(e);
ans -= max({los(a), los(b), los(c), los(d), los(e)});
cout << ans << endl;
} | [
"control_flow.return.add"
] | 890,675 | 890,676 | u456753075 | cpp |
p03076 | #include <algorithm>
#include <iostream>
using namespace std;
int maxTime(int x) { (x + 9) / 10 * 10; }
int los(int x) { maxTime(x) - x; }
int main() {
int a, b, c, d, e, ans;
cin >> a >> b >> c >> d >> e;
ans = maxTime(a) + maxTime(b) + maxTime(c) + maxTime(d) + maxTime(e);
ans -= min({los(a), los(b), los(c), los(d), los(e)});
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int maxTime(int x) { return (x + 9) / 10 * 10; }
int los(int x) { return maxTime(x) - x; }
int main() {
int a, b, c, d, e, ans;
cin >> a >> b >> c >> d >> e;
ans = maxTime(a) + maxTime(b) + maxTime(c) + maxTime(d) + maxTime(e);
ans -= max({los(a), los(b), los(c), los(d), los(e)});
cout << ans << endl;
} | [
"control_flow.return.add",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 890,677 | 890,676 | u456753075 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> p(5);
vector<int> r(5);
for (int i = 0; i < 5; i++) {
cin >> p[i];
r[i] = p[i] % 10; // rに１０で割ったあまりを代入
if (r[i] == 0) {
r[i] = 10; //あまりが0なら１０に
p[i] -= 10; //便宜上あまりが０なら10引いておく（後で足すことになるから）
}
}
int count = 0;
for (int i = 0; i < 5; i++) {
count += (p[i] / 10) + 10;
}
sort(r.begin(), r.end());
count -= 10 - r[0];
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> p(5);
vector<int> r(5);
for (int i = 0; i < 5; i++) {
cin >> p[i];
r[i] = p[i] % 10; // rに１０で割ったあまりを代入
if (r[i] == 0) {
r[i] = 10; //あまりが0なら１０に
p[i] -= 10; //便宜上あまりが０なら10引いておく（後で足すことになるから）
}
}
int count = 0;
for (int i = 0; i < 5; i++) {
count += (p[i] / 10) * 10 + 10;
}
sort(r.begin(), r.end());
count -= 10 - r[0];
cout << count << endl;
}
| [
"assignment.change"
] | 890,703 | 890,704 | u544165468 | cpp |
p03076 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define in(x) cin >> x
#define out(x) cout << x << endl
#define PI acos(-1)
#define pp push_back
#define Yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define NO cout << "NO" << endl
#define vec2(type) vector<vector<type>>
#define vec3(type) vector<vector<vector<type>>>
#define For(i, n) for (int i = 0; i < n; i++)
#define Tcmp(X, Y) (abs(aryvec[i]->x) == X && abs(aryvec[i]->y) == Y)
template <typename T> void input(T *data, int n) {
For(i, n) { cin >> data[i]; }
}
template <typename T> void sort(vector<T> &ary) {
sort(ary.begin(), ary.end());
}
template <typename T> void rsort(vector<T> &ary) {
sort(ary.rbegin(), ary.rend());
}
void rstring(string &str) {
string temp = str;
For(i, (int)str.size()) { str[i] = temp[(str.size() - 1) - i]; }
}
struct Vec {
int x, y;
Vec() : x(0), y(0) {}
};
int main() {
int x[5];
input(x, 5);
int time = 0;
int maxloss = 0;
For(i, 5) {
time += (x[i] % 10 == 0) ? time : ((x[i] / 10 + 1) * 10);
if (x[i] % 10 && (x[i] / 10 + 1) * 10 - x[i] > maxloss) {
maxloss = (x[i] / 10 + 1) * 10 - x[i];
}
}
time -= maxloss;
out(time);
return 0;
} |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define in(x) cin >> x
#define out(x) cout << x << endl
#define PI acos(-1)
#define pp push_back
#define Yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define NO cout << "NO" << endl
#define vec2(type) vector<vector<type>>
#define vec3(type) vector<vector<vector<type>>>
#define For(i, n) for (int i = 0; i < n; i++)
#define Tcmp(X, Y) (abs(aryvec[i]->x) == X && abs(aryvec[i]->y) == Y)
template <typename T> void input(T *data, int n) {
For(i, n) { cin >> data[i]; }
}
template <typename T> void sort(vector<T> &ary) {
sort(ary.begin(), ary.end());
}
template <typename T> void rsort(vector<T> &ary) {
sort(ary.rbegin(), ary.rend());
}
void rstring(string &str) {
string temp = str;
For(i, (int)str.size()) { str[i] = temp[(str.size() - 1) - i]; }
}
struct Vec {
int x, y;
Vec() : x(0), y(0) {}
};
int main() {
int x[5];
input(x, 5);
int time = 0;
int maxloss = 0;
For(i, 5) {
time += (x[i] % 10 == 0) ? x[i] : ((x[i] / 10 + 1) * 10);
if (x[i] % 10 && (x[i] / 10 + 1) * 10 - x[i] > maxloss) {
maxloss = (x[i] / 10 + 1) * 10 - x[i];
}
}
time -= maxloss;
out(time);
return 0;
} | [] | 890,707 | 890,708 | u153867760 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E, a, b, c, d, e;
int time, mint;
cin >> A >> B >> C >> D >> E;
time = 0;
a = A % 10;
b = B % 10;
c = C % 10;
d = D % 10;
e = E % 10;
mint = 200;
if (a != 0 && mint > a)
mint = a;
if (b != 0 && mint > b)
mint = b;
if (c != 0 && mint > c)
mint = c;
if (d != 0 && mint > d)
mint = d;
if (e != 0 && mint > e)
mint = e;
if (mint == 200)
mint = 0;
if (a != 0)
time += (A / 10 + 1) * 10;
else
time += A;
if (b != 0)
time = time + (B / 10 + 1) * 10;
else
time += B;
if (c != 0)
time = time + (C / 10 + 1) * 10;
else
time += C;
if (d != 0)
time = time + (D / 10 + 1) * 10;
else
time += D;
if (e != 0)
time = time + (E / 10 + 1) * 10;
else
time += E;
time = time + mint - 10;
if (mint == 0)
;
time += 10;
cout << time << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E, a, b, c, d, e;
int time, mint;
cin >> A >> B >> C >> D >> E;
time = 0;
a = A % 10;
b = B % 10;
c = C % 10;
d = D % 10;
e = E % 10;
mint = 200;
if (a != 0 && mint > a)
mint = a;
if (b != 0 && mint > b)
mint = b;
if (c != 0 && mint > c)
mint = c;
if (d != 0 && mint > d)
mint = d;
if (e != 0 && mint > e)
mint = e;
if (mint == 200)
mint = 0;
if (a != 0)
time += (A / 10 + 1) * 10;
else
time += A;
if (b != 0)
time = time + (B / 10 + 1) * 10;
else
time += B;
if (c != 0)
time = time + (C / 10 + 1) * 10;
else
time += C;
if (d != 0)
time = time + (D / 10 + 1) * 10;
else
time += D;
if (e != 0)
time = time + (E / 10 + 1) * 10;
else
time += E;
time = time + mint - 10;
if (mint == 0)
time += 10;
cout << time << endl;
} | [] | 890,713 | 890,714 | u074271465 | cpp |
p03076 | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
vector<int> all{a, b, c, d, e};
int last = 10;
for (int i = 0; i < 5; i++) {
if (all[i] % 10 > 0 && all[i] % 10 < last)
last = all[i] % 10;
if (all[i] % 10 > 0) {
all[i] += 10 - (all[i] % 10);
}
}
int ans = accumulate(all.begin(), all.end(), 0);
cout << ans - last << endl;
return 0;
} | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
vector<int> all{a, b, c, d, e};
int last = 10;
for (int i = 0; i < 5; i++) {
if (all[i] % 10 > 0 && all[i] % 10 < last)
last = all[i] % 10;
if (all[i] % 10 > 0) {
all[i] += 10 - (all[i] % 10);
}
}
int ans = accumulate(all.begin(), all.end(), 0);
cout << ans - (10 - last) << endl;
return 0;
} | [] | 890,720 | 890,721 | u684863590 | cpp |
p03076 | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
vector<int> all{a, b, c, d, e};
int last = 1000000000000000000;
for (int i = 0; i < 5; i++) {
if (all[i] % 10 > 0 && all[i] % 10 < last)
last = all[i] % 10;
if (all[i] % 10 > 0) {
all[i] += 10 - (all[i] % 10);
}
}
int ans = accumulate(all.begin(), all.end(), 0);
cout << ans - 10 - last << endl;
return 0;
} | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
vector<int> all{a, b, c, d, e};
int last = 10;
for (int i = 0; i < 5; i++) {
if (all[i] % 10 > 0 && all[i] % 10 < last)
last = all[i] % 10;
if (all[i] % 10 > 0) {
all[i] += 10 - (all[i] % 10);
}
}
int ans = accumulate(all.begin(), all.end(), 0);
cout << ans - (10 - last) << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 890,722 | 890,721 | u684863590 | cpp |
p03076 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, sum = 0, max = 0;
vector<int> rest;
for (int i = 0; i < 5; i++) {
cin >> a;
sum += a;
b = 10 - a % 10;
if (a % 10 != 0) {
rest.push_back(b);
}
if (max < a % 10) {
max = b;
}
}
for (int i = 0; i < rest.size(); i++) {
sum += rest[i];
}
cout << sum - max << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, sum = 0, max = 0;
vector<int> rest;
for (int i = 0; i < 5; i++) {
cin >> a;
sum += a;
b = 10 - a % 10;
if (a % 10 != 0) {
rest.push_back(b);
}
if (max < b && a % 10 != 0) {
max = b;
}
}
for (int i = 0; i < rest.size(); i++) {
sum += rest[i];
}
cout << sum - max << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 890,725 | 890,726 | u081094913 | cpp |
p03076 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
//注文してから届く時間
vector<int> Time = {a, b, c, d, e};
//注文してから次の注文
vector<int> nextTime(5);
for (int i = 0; i < 5; ++i) {
if (Time[i] % 10 == 0)
nextTime[i] = Time[i];
else {
nextTime[i] = Time[i] - Time[i] % 10 + 10;
}
}
int besttime = 1 << 30;
for (int i = 0; i < 5; ++i) {
int sumTime = 0;
for (int j = 0; j < 5; ++j) {
if (i == j) {
sumTime += Time[i];
} else {
sumTime += nextTime[i];
}
}
besttime = min(besttime, sumTime);
}
cout << besttime << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
//注文してから届く時間
vector<int> Time = {a, b, c, d, e};
//注文してから次の注文
vector<int> nextTime(5);
for (int i = 0; i < 5; ++i) {
if (Time[i] % 10 == 0)
nextTime[i] = Time[i];
else {
nextTime[i] = Time[i] - Time[i] % 10 + 10;
}
}
int besttime = 1 << 30;
for (int i = 0; i < 5; ++i) {
int sumTime = 0;
for (int j = 0; j < 5; ++j) {
if (i == j) {
sumTime += Time[i];
} else {
sumTime += nextTime[j];
}
}
besttime = min(besttime, sumTime);
}
cout << besttime << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 890,761 | 890,762 | u894555185 | cpp |
p03076 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int time[5];
int timep[5];
int sum = 0;
int pm = 1000;
bool pf = false;
vector<pair<int, int>> p;
for (int i = 0; i < 5; i++) {
cin >> time[i];
if (time[i] % 10 != 0) {
pf = true;
if (pm > time[i] % 10) {
pm = time[i] % 10;
}
time[i] -= time[i] % 10;
time[i] += 10;
}
sum += time[i];
}
if (pf) {
cout << sum - 10 + pf;
} else {
cout << sum;
}
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int time[5];
int timep[5];
int sum = 0;
int pm = 1000;
bool pf = false;
vector<pair<int, int>> p;
for (int i = 0; i < 5; i++) {
cin >> time[i];
if (time[i] % 10 != 0) {
pf = true;
if (pm > time[i] % 10) {
pm = time[i] % 10;
}
time[i] -= time[i] % 10;
time[i] += 10;
}
sum += time[i];
// cout << sum << endl;
}
if (pf) {
// cout << pm << endl;
cout << sum - 10 + pm;
} else {
cout << sum;
}
} | [
"identifier.change",
"io.output.change"
] | 890,767 | 890,768 | u352604942 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
int v;
int modmin = 10, time = 0;
for (int i = 0; i < 5; i++) {
cin >> v;
time += v / 10 * 10;
if (v % 10 != 0) {
time += 10;
if (modmin > v % 10)
modmin = v % 10;
}
}
if (modmin != 10)
time += 10 - modmin;
cout << time;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int v;
int modmin = 10, time = 0;
for (int i = 0; i < 5; i++) {
cin >> v;
time += v / 10 * 10;
if (v % 10 != 0) {
time += 10;
if (modmin > v % 10)
modmin = v % 10;
}
}
if (modmin != 10)
time -= (10 - modmin);
cout << time;
}
| [
"expression.operator.change"
] | 890,775 | 890,776 | u249546633 | cpp |
p03076 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000000;
using namespace std;
char mas[200500];
int main() {
int menu[7], counto = 0, Key = 10;
for (int i = 0; i < 5; i++) {
cin >> menu[i];
if (menu[i] % 10 == 0) {
counto += menu[i];
} else {
counto += (((menu[i] / 10) + 1) * 10);
Key = min(Key, (menu[i] - (menu[i] / 10 * 10)));
}
}
cout << counto - Key << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000000;
using namespace std;
char mas[200500];
int main() {
int menu[7], counto = 0, Key = 10;
for (int i = 0; i < 5; i++) {
cin >> menu[i];
if (menu[i] % 10 == 0) {
counto += menu[i];
} else {
counto += (((menu[i] / 10) + 1) * 10);
Key = min(Key, (menu[i] - (menu[i] / 10 * 10)));
}
}
cout << counto - 10 + Key << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 890,792 | 890,793 | u019465635 | cpp |
p03076 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (int i = (a), i##Len_ = (b); i < i##Len_; i++)
int main() {
int A, B, C, D, E, res;
int ryo[5];
int amari[5];
int min_index = 999;
int min = 10;
REP(i, 5) {
cin >> ryo[i];
amari[i] = ryo[i] % 10;
if (amari[i] < min && amari[i] != 0) {
min = ryo[i];
min_index = i;
}
}
res = 0;
//あまり最小の要素番号
REP(i, 5) {
res += ryo[i];
if (i != min_index && amari[i] != 0) {
res += 10 - amari[i];
}
}
cout << res << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (int i = (a), i##Len_ = (b); i < i##Len_; i++)
int main() {
int A, B, C, D, E, res;
int ryo[5];
int amari[5];
int min_index = 999;
int min = 10;
REP(i, 5) {
cin >> ryo[i];
amari[i] = ryo[i] % 10;
if (amari[i] < min && amari[i] != 0) {
min = amari[i];
min_index = i;
}
}
res = 0;
//あまり最小の要素番号
REP(i, 5) {
res += ryo[i];
if (i != min_index && amari[i] != 0) {
res += 10 - amari[i];
}
}
cout << res << endl;
}
| [
"assignment.value.change",
"identifier.change"
] | 890,802 | 890,803 | u485731913 | cpp |
p03076 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a[5], ans = 0, res = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
ans += 10 * ceil(a[i] / 10);
if (res < 10 * ceil(a[i] / 10) - a[i])
res = 10 * ceil(a[i] / 10) - a[i];
}
cout << ans - res;
return 0;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a[5], ans = 0, res = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
ans += 10 * ceil(a[i] / 10.0);
if (res < 10 * ceil(a[i] / 10.0) - a[i])
res = 10 * ceil(a[i] / 10.0) - a[i];
}
cout << ans - res;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 890,806 | 890,807 | u340494803 | cpp |
p03076 | #include <iostream>
using namespace std;
int main() {
int a[5], min = 10, sum = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
int rem = a[i] % 10;
if (rem != 0 && min > rem)
min = rem;
sum += (a[i] + 9) / 10;
}
cout << sum - 10 + min << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a[5], min = 10, sum = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
int rem = a[i] % 10;
if (rem != 0 && min > rem)
min = rem;
sum += (a[i] + 9) / 10;
}
cout << (sum - 1) * 10 + min << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 890,814 | 890,815 | u112766430 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
int main() {
int ans = 0, m = 0;
rep(i, 5) {
int t, l;
cin >> t;
l = 10 - (t % 10);
ans += t + l;
m = max(m, l);
}
ans -= m;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
int main() {
int ans = 0, m = 0;
rep(i, 5) {
int t, l;
cin >> t;
l = 10 - (t % 10);
l %= 10;
ans += t + l;
m = max(m, l);
}
ans -= m;
cout << ans << endl;
return 0;
}
| [
"assignment.add"
] | 890,818 | 890,819 | u058252012 | cpp |
p03076 | #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define f first
#define s second
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
// cin.ignore(); must be there when using getline(cin, s)
int sum, temp, m = 11;
for (int i = 0; i < 5; ++i) {
cin >> temp;
if (temp % 10 != 0)
m = min(m, temp % 10);
sum += (int)ceil(temp / 10.0);
}
cout << (sum - 1) * 10 + (m == 11 ? 10 : m);
} | #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define f first
#define s second
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
// cin.ignore(); must be there when using getline(cin, s)
int sum = 0, temp, m = 11;
for (int i = 0; i < 5; ++i) {
cin >> temp;
if (temp % 10 != 0)
m = min(m, temp % 10);
sum += (int)ceil(temp / 10.0);
}
cout << (sum - 1) * 10 + (m == 11 ? 10 : m);
} | [
"variable_declaration.value.change"
] | 890,830 | 890,831 | u125386496 | cpp |
p03076 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const long long N = 1e6 + 17;
ll cnt, ans, lnt, sum, n, l1, x, y, a[N];
pair<ll, ll> pr[N];
vector<ll> v, v2, v3;
map<ll, ll> mp;
bool used[N], t1, t2;
vector<string> sv;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
for (ll i = 0; i < 5; i++) {
cin >> a[i];
}
for (ll i = 1; i < 5; i++) {
if (a[i] % 10 != 0) {
x = 10 - (a[i] % 10);
if (x > n) {
n = x;
}
}
}
for (ll i = 0; i < 5; i++) {
if (a[i] % 10 == n) {
sum += a[i];
a[i] = 0;
break;
}
}
for (ll i = 0; i < 5; i++) {
if (a[i] % 10 != 0) {
a[i] += 10 - (a[i] % 10);
}
}
for (ll i = 0; i < 5; i++) {
sum += a[i];
}
cout << sum;
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const long long N = 1e6 + 17;
ll cnt, ans, lnt, sum, n, l1, x, y, a[N];
pair<ll, ll> pr[N];
vector<ll> v, v2, v3;
map<ll, ll> mp;
bool used[N], t1, t2;
vector<string> sv;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
for (ll i = 0; i < 5; i++) {
cin >> a[i];
}
for (ll i = 0; i < 5; i++) {
if (a[i] % 10 != 0) {
x = 10 - (a[i] % 10);
if (x > n) {
n = x;
}
}
}
for (ll i = 0; i < 5; i++) {
if (10 - (a[i] % 10) == n) {
sum += a[i];
a[i] = 0;
break;
}
}
for (ll i = 0; i < 5; i++) {
if (a[i] % 10 != 0) {
a[i] += 10 - (a[i] % 10);
}
}
for (ll i = 0; i < 5; i++) {
sum += a[i];
}
cout << sum;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 890,832 | 890,833 | u361768313 | cpp |
p03076 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define For(a, b) for (int i = (a); i < (b); i++)
#define Rep(n) for (int i = 0; i < (n); ++i)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
using namespace std;
typedef long long ll; // int64
typedef unsigned long long ull;
//----------program from here----------
int main() {
int ans = 0, mn = 10;
for (int i = 0, T; i < 5; ++i) {
cin >> T;
if (T % 10) {
mn = min(mn, T % 10);
T = (T / 10 + 1) * 10;
}
ans += T;
}
cout << ans - mn << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define For(a, b) for (int i = (a); i < (b); i++)
#define Rep(n) for (int i = 0; i < (n); ++i)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
using namespace std;
typedef long long ll; // int64
typedef unsigned long long ull;
//----------program from here----------
int main() {
int ans = 0, mn = 10;
for (int i = 0, T; i < 5; ++i) {
cin >> T;
if (T % 10) {
mn = min(mn, T % 10);
T = (T / 10 + 1) * 10;
}
ans += T;
}
cout << ans - (10 - mn) << endl;
} | [] | 890,841 | 890,842 | u413090011 | cpp |
p03076 | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--) /// n-1番目からn回
#define REP(i, a, b) for (int i = a; i < b; i++) /// a番目からb回
#define RREP(i, a, b) for (int i = a; i < b; i--)
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<string> vs;
// int arr[N]
////sort(arr,arr +N)
// vector <int> hoge
////sort(hoge.begin(),hoge.end());
///*min_element(hoge.begin(),hoge.end(); 最小値 最大値はmax_element();
#define Ru(n) (((n) + 9) / 10 * 10) //切りあげ
#define Rd(n) (((n)-10) / 10 * 10 + 10) 切り捨て
int gcd(int a, int b);
int main() {
int ans = 0;
vi a(10);
rep(i, 5) {
cin >> a[i];
ans += Ru(a[i]);
}
int max = (a[0]) * (-1) % 10, t = 0;
rep(i, 5) {
if (max < (10 - (a[i] % 10)) % 10) {
max = (10 - (a[i] % 10)) % 10;
t = i;
}
}
cout << ans - a[t] % 10;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
| #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--) /// n-1番目からn回
#define REP(i, a, b) for (int i = a; i < b; i++) /// a番目からb回
#define RREP(i, a, b) for (int i = a; i < b; i--)
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<string> vs;
// int arr[N]
////sort(arr,arr +N)
// vector <int> hoge
////sort(hoge.begin(),hoge.end());
///*min_element(hoge.begin(),hoge.end(); 最小値 最大値はmax_element();
#define Ru(n) (((n) + 9) / 10 * 10) //切りあげ
#define Rd(n) (((n)-10) / 10 * 10 + 10) 切り捨て
int gcd(int a, int b);
int main() {
int ans = 0;
vi a(10);
rep(i, 5) {
cin >> a[i];
ans += Ru(a[i]);
}
int max = (a[0]) * (-1) % 10, t = 0;
rep(i, 5) {
if (max < (10 - (a[i] % 10)) % 10) {
max = (10 - (a[i] % 10)) % 10;
t = i;
}
}
cout << ans - max;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
| [
"io.output.change",
"expression.operation.binary.remove"
] | 890,851 | 890,852 | u696415377 | cpp |
p03076 | #include <iostream>
class NumInfo {
private:
int _num;
int _plusNum;
public:
int GetNum();
void SetNum(int num);
int GetPlusNum();
void SetPlusNum(int pluNum);
};
int NumInfo::GetNum() { return _num; }
void NumInfo::SetNum(int num) { _num = num; }
int NumInfo::GetPlusNum() { return _plusNum; }
void NumInfo::SetPlusNum(int plusNum) { _plusNum = plusNum; }
int main(void) {
int num[5] = {0, 0, 0, 0, 0};
NumInfo *numInfo = NULL;
numInfo = new NumInfo[5];
for (int ii = 0; ii < 5; ii++) {
std::cin >> num[ii];
numInfo[ii].SetNum(num[ii]);
}
int minIndex = 0;
int minNum = 9;
for (int ii = 0; ii < 5; ii++) {
int tmp = 0;
int tmp2 = 0;
int pluNum = 0;
pluNum = num[ii] / 10;
tmp = num[ii] % 10;
if (tmp == 0) {
tmp2 = tmp * 10;
} else {
tmp2 = (tmp + 1) * 10;
}
numInfo[ii].SetPlusNum(tmp2);
if (tmp != 0) {
if (tmp < minNum) {
minNum = tmp;
minIndex = ii;
}
}
}
int sum = 0;
for (int jj = 0; jj < 5; jj++) {
if (jj == minIndex) {
sum = sum + numInfo[jj].GetNum();
} else {
sum = sum + numInfo[jj].GetPlusNum();
}
}
std::cout << sum;
return 0;
} | #include <iostream>
class NumInfo {
private:
int _num;
int _plusNum;
public:
int GetNum();
void SetNum(int num);
int GetPlusNum();
void SetPlusNum(int pluNum);
};
int NumInfo::GetNum() { return _num; }
void NumInfo::SetNum(int num) { _num = num; }
int NumInfo::GetPlusNum() { return _plusNum; }
void NumInfo::SetPlusNum(int plusNum) { _plusNum = plusNum; }
int main(void) {
int num[5] = {0, 0, 0, 0, 0};
NumInfo *numInfo = NULL;
numInfo = new NumInfo[5];
for (int ii = 0; ii < 5; ii++) {
std::cin >> num[ii];
numInfo[ii].SetNum(num[ii]);
}
int minIndex = 0;
int minNum = 9;
for (int ii = 0; ii < 5; ii++) {
int tmp = 0;
int tmp2 = 0;
int pluNum = 0;
pluNum = num[ii] / 10;
tmp = num[ii] % 10;
if (tmp == 0) {
tmp2 = pluNum * 10;
} else {
tmp2 = (pluNum + 1) * 10;
}
numInfo[ii].SetPlusNum(tmp2);
if (tmp != 0) {
if (tmp < minNum) {
minNum = tmp;
minIndex = ii;
}
}
}
int sum = 0;
for (int jj = 0; jj < 5; jj++) {
if (jj == minIndex) {
sum = sum + numInfo[jj].GetNum();
} else {
sum = sum + numInfo[jj].GetPlusNum();
}
}
std::cout << sum;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 890,867 | 890,868 | u065828312 | cpp |
p03076 | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
int ans = 10000;
for (int i; i < 5; i++) {
int tmp = 0;
for (int j; j < 5; j++) {
if (i == j)
tmp += a[j];
else
tmp += (a[j] % 10 == 0) ? a[j] : ((a[j] / 10) * 10 + 10);
}
ans = tmp <= ans ? tmp : ans;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
int ans = 10000;
for (int i = 0; i < 5; i++) {
int tmp = 0;
for (int j = 0; j < 5; j++) {
if (i == j)
tmp += a[j];
else
tmp += (a[j] % 10 == 0) ? a[j] : ((a[j] / 10) * 10 + 10);
}
ans = tmp <= ans ? tmp : ans;
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change"
] | 890,887 | 890,888 | u254766083 | cpp |
p03076 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
int x = 9;
for (int i = 0; i < 5; i++) {
if (a[i] % 10 < x && a[i] % 10 > 0) {
x = a[i];
}
}
int sum = 0;
for (int i = 0; i < 5; i++) {
if (a[i] % 10 != 0) {
sum = sum + (a[i] / 10 + 1) * 10;
} else
sum = sum + a[i];
}
cout << sum - (10 - x) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
for (int i = 0; i < 5; i++)
cin >> a[i];
int x = 10;
for (int i = 0; i < 5; i++) {
if (a[i] % 10 < x && a[i] % 10 > 0) {
x = a[i] % 10;
}
}
int sum = 0;
for (int i = 0; i < 5; i++) {
if (a[i] % 10 != 0) {
sum = sum + (a[i] / 10 + 1) * 10;
} else
sum = sum + a[i];
}
cout << sum - (10 - x) << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 890,956 | 890,955 | u827250617 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.