problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
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 (MA... | #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 (MA... | [
"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;... | #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;... | [
"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... | #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;... | [
"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 <... | #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 <... | [
"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>
#incl... | // 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>
#incl... | [] | 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>
#incl... | #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>
#incl... | [
"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)
co... | #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)
co... | [
"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)
co... | #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)
co... | [
"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)... | #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) ... | [
"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) ... | #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) ... | [
"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 ==... | #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 == ... | [
"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;
}
... | #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;
}
... | [] | 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;
} e... | #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;
} e... | [
"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 <... | #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 <... | [
"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] * ... | #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] * ... | [
"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] * ... | #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] * ... | [
"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 ^=... | #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 ^=... | [
"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 ... | #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 ... | [
"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... | #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 ... | [
"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 ... | #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 ... | [
"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 ... | #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 ... | [
"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_bac... | #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_bac... | [
"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(":(");
} els... | #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(":(");
} els... | [
"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++) {
... | #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++) ... | [
"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++) ... | #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++) ... | [
"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++) ... | #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++) ... | [
"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... | #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 ... | [
"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;
... | #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;
... | [
"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... | #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), ... | [
"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... | #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), ... | [
"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... | #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... | [
"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 ... | #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 ... | [] | 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 (i... | #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... | [
"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... | #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(... | [
"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... | #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 <... | [
"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++) {... | #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 <... | [
"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,... | #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,... | [
"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,... | #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,... | [
"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 ... | #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 ... | [
"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) ... | #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) ... | [
"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++) {
... | #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++) {
... | [
"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 ... | [
"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... | #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) -
... | [
"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((... | #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((... | [] | 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 + ... | #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((... | [
"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 = m... | #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(o... | [] | 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... | #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... | [
"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 ... | #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 ... | [] | 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;... | #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;... | [
"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()
#... | #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()
#... | [
"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()
#... | #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()
#... | [
"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 <... | #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 <... | [
"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;
... | #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 = ... | [
"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 (... | #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 (... | [
"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))
... | #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))
... | [
"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()))... | #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())) ... | [
"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())) {
... | #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())) {
... | [
"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) {
... | #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) {
... | [
"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), ... | #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), lo... | [
"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), ... | #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), lo... | [
"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;
... | #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;
... | [
"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)
#... |
#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)
#... | [] | 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 = ... | #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 = ... | [] | 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... | #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... | [] | 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;
... | #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... | [
"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 ... | #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;
}
}
f... | [
"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] = T... | #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] = T... | [
"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 > ti... | #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 > ti... | [
"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;
... | #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);... | [
"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];
i... | #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];
i... | [
"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];
am... | #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];
am... | [
"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... | [
"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... | #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... | [
"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);
// fr... | #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);
// fr... | [
"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 <... | #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 <... | [] | 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;... | #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;... | [
"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 Nu... | #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 Nu... | [
"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... | #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] %... | [
"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 ... | #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 ... | [
"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.