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 |
|---|---|---|---|---|---|---|---|
p03206 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "... | [
"io.output.change"
] | 998,368 | 998,369 | u335839000 | cpp |
p03206 | #include <bits/stdc++.h>
int main(int argc, char *argv[]) {
int D;
std::cin >> D;
if (D == 25) {
std::cout << "Chistmas" << std::endl;
} else if (D == 24) {
std::cout << "Chistmas Eve" << std::endl;
} else if (D == 23) {
std::cout << "Chistmas Eve Eve" << std::endl;
} else if (D == 22) {
s... | #include <bits/stdc++.h>
int main(int argc, char *argv[]) {
int D;
std::cin >> D;
if (D == 25) {
std::cout << "Christmas" << std::endl;
} else if (D == 24) {
std::cout << "Christmas Eve" << std::endl;
} else if (D == 23) {
std::cout << "Christmas Eve Eve" << std::endl;
} else if (D == 22) {
... | [
"literal.string.change",
"expression.operation.binary.change"
] | 998,372 | 998,373 | u458798873 | cpp |
p03206 | #include <iostream>
using namespace std;
int main() {
int D;
cin >> D;
if (D == 25)
cout << "Christmas" << endl;
else if (D == 24)
cout << "Christmas" << endl;
else if (D == 23)
cout << "Christmas Eve Eve" << endl;
else if (D == 22)
cout << "Christmas Eve Eve Eve" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int D;
cin >> D;
if (D == 25)
cout << "Christmas" << endl;
else if (D == 24)
cout << "Christmas Eve" << endl;
else if (D == 23)
cout << "Christmas Eve Eve" << endl;
else if (D == 22)
cout << "Christmas Eve Eve Eve" << endl;
return 0;... | [
"literal.string.change",
"io.output.change"
] | 998,383 | 998,384 | u523303964 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
int n;
cin >> n;
cout << "Chiristmas";
for (int i = 0; i < 25 - n; ++i)
cout << " Eve";
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
int n;
cin >> n;
cout << "Christmas";
for (int i = 0; i < 25 - n; ++i)
cout << " Eve";
cout << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 998,387 | 998,388 | u705918648 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
int D;
cin >> D;
if (D == 25) {
cout << "Christmas" << endl;
} else if (D == 24) {
cout << "Christmas Eve" << endl;
} else if (D == 24) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
int D;
cin >> D;
if (D == 25) {
cout << "Christmas" << endl;
} else if (D == 24) {
cout << "Christmas Eve" << endl;
} else if (D == 23) ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 998,394 | 998,395 | u147544115 | cpp |
p03206 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 998,396 | 998,397 | u471289663 | cpp |
p03206 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 998,402 | 998,403 | u141378465 | cpp |
p03206 | #include <stdio.h>
int main() {
int D;
scanf("%d", &D);
if (22 <= D && D <= 25) {
if (D == 25)
printf("christmas");
else if (D == 24)
printf("christmas Eve");
else if (D == 23)
printf("christmas Eve Eve");
else
printf("christmas Eve Eve Eve");
} else
printf("请重新输入数字")... | #include <stdio.h>
int main() {
int D;
scanf("%d", &D);
if (22 <= D && D <= 25) {
if (D == 25)
printf("Christmas");
else if (D == 24)
printf("Christmas Eve");
else if (D == 23)
printf("Christmas Eve Eve");
else
printf("Christmas Eve Eve Eve");
} else
printf("请重新输入数字")... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 998,415 | 998,416 | u303693872 | cpp |
p03206 | #include <iostream>
using namespace std;
int main() {
int D;
string eve = " eve";
cin >> D;
cout << "Christmas";
for (int i = 0; i < 25 - D; i++) {
cout << eve;
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int D;
string eve = " Eve";
cin >> D;
cout << "Christmas";
for (int i = 0; i < 25 - D; i++) {
cout << eve;
}
cout << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change"
] | 998,424 | 998,425 | u795707846 | cpp |
p03206 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 25)
cout << "Chiristmas" << endl;
if (N == 24)
cout << "Chiristmas Eve" << endl;
if (N == 23)
cout << "Chiristmas Eve Eve" << endl;
if (N == 22)
cout << "Chiristmas Eve Eve Eve" << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 25)
cout << "Christmas" << endl;
if (N == 24)
cout << "Christmas Eve" << endl;
if (N == 23)
cout << "Christmas Eve Eve" << endl;
if (N == 22)
cout << "Christmas Eve Eve Eve" << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 998,434 | 998,435 | u938317342 | cpp |
p03206 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
// #define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
// #define SIZE_OF_ARRAY(pro2) (sizeof(pro2)/sizeof(pro2[0]))
int main() {
int d;
cin >> d;
if (d == 22) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
// #define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
// #define SIZE_OF_ARRAY(pro2) (sizeof(pro2)/sizeof(pro2[0]))
int main() {
int d;
cin >> d;
if (d == 25) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 998,436 | 998,437 | u248442450 | cpp |
p03206 | #include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 25) {
cout << "Christmas";
}
if (d == 24) {
cout << "Christmas Eve";
if (d == 23) {
cout << "Christmas Eve Eve";
}
if (d == 22) {
cout << "... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int d;
cin >> d;
if (d == 25) {
cout << "Christmas";
}
if (d == 24) {
cout << "Christmas Eve";
}
if (d == 23) {
cout << "Christmas Eve Eve";
}
if (d == 22) {
cout << "Christ... | [] | 998,438 | 998,439 | u397035018 | cpp |
p03206 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
// typedef long long int;
typedef long long ll;
// typedef pair<int, int> P;
const int INF = 1 << 30;
const int... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
// typedef long long int;
typedef long long ll;
// typedef pair<int, int> P;
const int INF = 1 << 30;
const int... | [
"literal.string.change",
"io.output.change"
] | 998,451 | 998,452 | u484962958 | cpp |
p03206 | #include <cmath>
#include <cstdio>
#include <iostream>
#include <stack>
#include <string>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
int main(void) {
int N;
cin >> N;
if (N == 25) {
cout << "Christmas" << endl;
} else if (N == 24) {
cout << ... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <stack>
#include <string>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
int main(void) {
int N;
cin >> N;
if (N == 25) {
cout << "Christmas" << endl;
} else if (N == 24) {
cout << ... | [
"literal.string.change",
"io.output.change"
] | 998,453 | 998,454 | u776929617 | cpp |
p03206 | #include <iostream>
using namespace std;
int main() {
int D;
cin >> D;
if (D == 22) {
cout << "Christmas Eve Eve Eve" << endl;
}
if (D == 23) {
cout << "Christmas Eve" << endl;
}
if (D == 24) {
cout << "Christmas Eve" << endl;
}
if (D == 25) {
cout << "Christmas" << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int D;
cin >> D;
if (D == 22) {
cout << "Christmas Eve Eve Eve" << endl;
}
if (D == 23) {
cout << "Christmas Eve Eve" << endl;
}
if (D == 24) {
cout << "Christmas Eve" << endl;
}
if (D == 25) {
cout << "Christmas" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 998,457 | 998,458 | u342121835 | cpp |
p03206 | #include <iostream>
using namespace std;
int main() {
int D;
cin >> D;
if (D == 22) {
cout << "Christmas Eve Eve Eve" << endl;
}
if (D == 23) {
cout << "Christmas Eve" << endl;
}
if (D == 24) {
cout << "Christmas Eve" << endl;
}
if (D = 25) {
cout << "Christmas" << endl;
}
return... | #include <iostream>
using namespace std;
int main() {
int D;
cin >> D;
if (D == 22) {
cout << "Christmas Eve Eve Eve" << endl;
}
if (D == 23) {
cout << "Christmas Eve Eve" << endl;
}
if (D == 24) {
cout << "Christmas Eve" << endl;
}
if (D == 25) {
cout << "Christmas" << endl;
}
}
| [
"literal.string.change",
"io.output.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 998,460 | 998,458 | u342121835 | cpp |
p03206 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
cin >> N;
string out = "Christmas";
for (int i = 0; i < 25 - N; i++) {
out = out + " eve";
}
cout << out << endl;
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
cin >> N;
string out = "Christmas";
for (int i = 0; i < 25 - N; i++) {
out = out + " Eve";
}
cout << out << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 998,463 | 998,464 | u790171360 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
if (N == 25) {
cout << "Christmas" << endl;
} else if (N == 24) {
cout << "Christmas Eve" << endl;
} else if (N == 23) {
cout << "Christmas Eve Eve" << endl;
} else if (N == 22) {
cout << "hristmas Eve Eve Eve... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
if (N == 25) {
cout << "Christmas" << endl;
} else if (N == 24) {
cout << "Christmas Eve" << endl;
} else if (N == 23) {
cout << "Christmas Eve Eve" << endl;
} else if (N == 22) {
cout << "Christmas Eve Eve Ev... | [
"literal.string.change",
"io.output.change"
] | 998,469 | 998,470 | u498467508 | cpp |
p03206 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, start, end) for (int i = start; i < end; i++)
#define all(x) (x).begin(), (x).end()
#de... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, start, end) for (int i = start; i < end; i++)
#define all(x) (x).begin(), (x).end()
#de... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 998,471 | 998,472 | u934073187 | cpp |
p03206 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, start, end) for (int i = start; i < end; i++)
#define all(x) (x).begin(), (x).end()
#de... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, start, end) for (int i = start; i < end; i++)
#define all(x) (x).begin(), (x).end()
#de... | [
"literal.string.change",
"io.output.change",
"literal.string.case.change"
] | 998,473 | 998,472 | u934073187 | cpp |
p03206 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define r(i, n) for (int i = 0; i < n; i++)
#define R(i, c, n) for (int i = c; i < n; i++)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define r(i, n) for (int i = 0; i < n; i++)
#define R(i, c, n) for (int i = c; i < n; i++)... | [
"literal.string.change",
"io.output.change"
] | 998,480 | 998,481 | u449422108 | cpp |
p03206 | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
if (s == 25) {
cout << "Christmas" << endl;
} else if (s == 24) {
cout << "Cristmas Eve" << endl;
} else if (s == 23) {
cout << "Cristmas Eve Eve" << endl;
} else {
cout << "Cristmas Eve Eve Eve" << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
if (s == 25) {
cout << "Christmas" << endl;
} else if (s == 24) {
cout << "Christmas Eve" << endl;
} else if (s == 23) {
cout << "Christmas Eve Eve" << endl;
} else {
cout << "Christmas Eve Eve Eve" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 998,487 | 998,488 | u081445141 | cpp |
p03206 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
} else if (a % b) {
return gcd(b, a % b);
} else {
return b;
}
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int main() {
int D;
cin >> D;
if (D = 22)
cout << "Chr... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
} else if (a % b) {
return gcd(b, a % b);
} else {
return b;
}
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int main() {
int D;
cin >> D;
if (D == 22)
cout << "Ch... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 998,496 | 998,497 | u546943614 | cpp |
p03206 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
map<string, int> mp;
int mai... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
map<string, int> mp;
int mai... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 998,502 | 998,503 | u154672915 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int D;
cin >> D;
if (D == 22)
cout << "Christmas Eve Eve Eve" << endl;
else if (D == 23)
cout << "Christmas Eve Eve" << endl;
else if (D == 24)
cout << "Christmas Eve" << endl;
else if (D == 23)
cout << "Christmas" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int D;
cin >> D;
if (D == 22)
cout << "Christmas Eve Eve Eve" << endl;
else if (D == 23)
cout << "Christmas Eve Eve" << endl;
else if (D == 24)
cout << "Christmas Eve" << endl;
else if (D == 25)
cout << "Christmas" << endl;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 998,507 | 998,508 | u438583134 | cpp |
p03206 | #include <stdio.h>
int main(void) {
int D;
scanf("%d", &D);
if (D == 25) {
printf("Chirstmas\n");
} else if (D == 24) {
printf("Chirstmas Eve\n");
} else if (D == 23) {
printf("Chirstmas Eve Eve\n");
} else {
printf("Chirstmas Eve Eve Eve\n");
}
return 0;
}
| #include <stdio.h>
int main(void) {
int D;
scanf("%d", &D);
if (D == 25) {
printf("Christmas\n");
} else if (D == 24) {
printf("Christmas Eve\n");
} else if (D == 23) {
printf("Christmas Eve Eve\n");
} else {
printf("Christmas Eve Eve Eve\n");
}
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 998,515 | 998,516 | u889278665 | cpp |
p03206 |
#include <bits/stdc++.h>
using namespace std;
// D=25 なら Christmas
// D=24 なら Christmas Eve
// D=23 なら Christmas Eve Eve
// D=22 なら Christmas Eve Eve Eve
int main() {
int D;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> D;
if (D == 25)
cout << "YES" << endl;
else if (D == 24)
cout << "Christma... |
#include <bits/stdc++.h>
using namespace std;
// D=25 なら Christmas
// D=24 なら Christmas Eve
// D=23 なら Christmas Eve Eve
// D=22 なら Christmas Eve Eve Eve
int main() {
int D;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> D;
if (D == 25)
cout << "Christmas" << endl;
else if (D == 24)
cout << "Ch... | [
"literal.string.change",
"io.output.change"
] | 998,523 | 998,524 | u627562722 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 25) {
cout << "christmas" << endl;
} else if (n == 24) {
cout << "christmas Eve" << endl;
} else if (n == 23) {
cout << "christmas Eve Eve" << endl;
} else if (n == 22) {
cout << "christmas Eve Eve Eve" <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 25) {
cout << "Christmas" << endl;
} else if (n == 24) {
cout << "Christmas Eve" << endl;
} else if (n == 23) {
cout << "Christmas Eve Eve" << endl;
} else if (n == 22) {
cout << "Christmas Eve Eve Eve" <<... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 998,525 | 998,526 | u962104148 | cpp |
p03206 | #include <iostream>
using namespace std;
int main(void) {
int d;
cin >> d;
cout << "Cristmas";
for (int i = 0; i < 25 - d; i++)
cout << " Eve";
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int d;
cin >> d;
cout << "Christmas";
for (int i = 0; i < 25 - d; i++)
cout << " Eve";
cout << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 998,529 | 998,530 | u787420015 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
string c = "Chirstmas";
string eve = "Eve";
int main() {
int d;
cin >> d;
cout << c;
for (int i = 0; i < 25 - d; i++) {
cout << " " << eve;
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string c = "Christmas";
string eve = "Eve";
int main() {
int d;
cin >> d;
cout << c;
for (int i = 0; i < 25 - d; i++) {
cout << " " << eve;
}
cout << endl;
return 0;
} | [
"literal.string.change",
"variable_declaration.value.change"
] | 998,533 | 998,534 | u283229916 | cpp |
p03206 | #include <iostream>
using namespace std;
int main() {
int D;
cin >> D;
if (D == 25) {
cout << "Christmas" << endl;
}
if (D == 24) {
cout << "Christmas Eve" << endl;
}
if (D == 23) {
cout << "CChristmas Eve Eve" << endl;
}
if (D == 22) {
cout << "Christmas Eve Eve Eve " << endl;
}
... | #include <iostream>
using namespace std;
int main() {
int D;
cin >> D;
if (D == 25) {
cout << "Christmas" << endl;
}
if (D == 24) {
cout << "Christmas Eve" << endl;
}
if (D == 23) {
cout << "Christmas Eve Eve" << endl;
}
if (D == 22) {
cout << "Christmas Eve Eve Eve " << endl;
}
r... | [
"literal.string.change",
"io.output.change"
] | 998,535 | 998,536 | u389009751 | cpp |
p03206 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 998,537 | 998,538 | u591824072 | cpp |
p03206 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REVERS... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REVERS... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 998,539 | 998,540 | u164300951 | cpp |
p03206 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string.h>
#include <vector>
using namespace std;
int main(void) {
int D;
cin >> D;
if (D == 22) {
cout << "Christmas Eve Eve Eve";
}
if (D == 23) {
cout << "Christmas EVe Eve";
}
if (D == 24) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string.h>
#include <vector>
using namespace std;
int main(void) {
int D;
cin >> D;
if (D == 22) {
cout << "Christmas Eve Eve Eve";
}
if (D == 23) {
cout << "Christmas Eve Eve";
}
if (D == 24) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 998,541 | 998,542 | u238235808 | cpp |
p03206 | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// using cint = cpp_int;
//#pragma GCC optimize("", on)
//#pragma GCC optimization_level 3
//#define min(...) min({...})
//#define max(...) max({...})
// Define
using ll = long long;
u... | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// using cint = cpp_int;
//#pragma GCC optimize("", on)
//#pragma GCC optimization_level 3
//#define min(...) min({...})
//#define max(...) max({...})
// Define
using ll = long long;
u... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 998,545 | 998,546 | u398942100 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int N;
cin >> N;
int MA = 0;
int X, sum;
sum = 0;
rep(i, N) {
cin >> X;
sum += X;
MA = max(MA, X);
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int N;
cin >> N;
int MA = 0;
int X, sum;
sum = 0;
rep(i, N) {
cin >> X;
sum += X;
MA = max(MA, X);
}
... | [
"identifier.change",
"io.output.change"
] | 998,553 | 998,554 | u025773431 | cpp |
p03207 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n;
cin >> n;
n = 3;
int sum = 0;
int k[n];
r... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n;
cin >> n;
int sum = 0;
int k[n];
rep(i, n) ... | [] | 998,555 | 998,556 | u037675438 | cpp |
p03207 |
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> ... |
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <fstream> //ファイルストリーム（標準入力変更用）
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> ... | [
"variable_declaration.value.change"
] | 998,559 | 998,560 | u889915625 | cpp |
p03207 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | [] | 998,567 | 998,568 | u156778176 | cpp |
p03207 | //بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
#define endl "\n"
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, sum = 0;
cin >> a;... | //بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
#define endl "\n"
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, sum = 0;
cin >> a;... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 998,620 | 998,621 | u581850493 | cpp |
p03207 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | [] | 998,630 | 998,631 | u580593895 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int sum = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.rbegin(), a.rend());
for (int i = 1; i < n; i++) {
sum += a[i];
}
sum += (a[0] / 2);
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int sum = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.rbegin(), a.rend());
for (int i = 1; i < n; i++) {
sum += a[i];
}
sum += (a[0] / 2);
cou... | [] | 998,644 | 998,645 | u836164315 | cpp |
p03207 | #include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
typedef long double ldouble;
using Graph = vector<vector<int>>;
int main() {
int N;
int MAX = 0;
int sum = 0;
for (int i = 0; i < ... | #include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
typedef long double ldouble;
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
int MAX = 0;
int sum = 0;
for (int... | [] | 998,646 | 998,647 | u108484707 | cpp |
p03207 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int m = 100;
int sum = 0;
rep(i, n) {
sum += p[i];
m = max(m, p[i]);
}
cout << sum - m / 2 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int m = 100;
int sum = 0;
rep(i, n) {
sum += p[i];
m = max(m, p[i]);
}
cout << sum - m / 2 << endl;
} | [] | 998,658 | 998,659 | u816145694 | cpp |
p03207 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p[i];
sort(p.begin(), p.end());
int ans = 0;
for (int i = 0; i < N - 1; i++) {
ans += p[i];
}
ans += p[N - 2] / 2;
cout << ans <<... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p[i];
sort(p.begin(), p.end());
int ans = 0;
for (int i = 0; i < N - 1; i++) {
ans += p[i];
}
ans += p[N - 1] / 2;
cout << ans <<... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 998,673 | 998,674 | u016119075 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p.at(i);
sort(p.begin(), p.end());
int ans = 0;
for (int i = 0; i < n - 1; i++)
ans += p.at(i);
cout << ans + p.at(n - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p.at(i);
sort(p.begin(), p.end());
int ans = 0;
for (int i = 0; i < n - 1; i++)
ans += p.at(i);
cout << ans + p.at(n - 1) / 2 << endl;
} | [
"expression.operation.binary.add"
] | 998,675 | 998,676 | u247123590 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, P, A, B = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> P;
A += P;
B = max(B, P);
}
cout << A - B / 2;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, P, A = 0, B = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> P;
A += P;
B = max(B, P);
}
cout << A - B / 2 << endl;
} | [
"variable_declaration.value.change",
"io.output.newline.add"
] | 998,684 | 998,685 | u045289115 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, P, A, B = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> P;
A += P;
B = max(B, P);
}
cout << A - B / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, P, A = 0, B = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> P;
A += P;
B = max(B, P);
}
cout << A - B / 2 << endl;
} | [
"variable_declaration.value.change"
] | 998,686 | 998,685 | u045289115 | cpp |
p03207 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | [
"assignment.change"
] | 998,575 | 998,576 | u341447450 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, mx = -1, nm = 0;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
for (int i = 0; i < n; i++) {
mx = max(mx, d[i]);
nm += d[i];
}
cout << nm - mx / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, mx = -1, nm = 0;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
for (int i = 0; i < n; i++) {
mx = max(mx, d[i]);
nm += d[i];
}
cout << nm - mx / 2 << endl;
}
| [] | 998,589 | 998,590 | u834753207 | cpp |
p03207 | /* mytemplate.cpp {{{ */
/* header */
#include <bits/stdc++.h>
using namespace std;
/* rep */
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) rep4(i, a, n, 1... | /* mytemplate.cpp {{{ */
/* header */
#include <bits/stdc++.h>
using namespace std;
/* rep */
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) rep4(i, a, n, 1... | [] | 998,610 | 998,611 | u073139376 | cpp |
p03207 | /* mytemplate.cpp {{{ */
/* header */
#include <bits/stdc++.h>
using namespace std;
/* rep */
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) rep4(i, a, n, 1... | /* mytemplate.cpp {{{ */
/* header */
#include <bits/stdc++.h>
using namespace std;
/* rep */
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) rep4(i, a, n, 1... | [
"expression.operation.binary.add"
] | 998,612 | 998,611 | u073139376 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int INF = 1001001001;
int main() {
int N;
cin >> N;
int p[N];
rep(i, N) cin >> p[i];
sort(p, p + N, greater<int>());
int payment = 0;
rep(i, N) {
if (payment == 0) {
paymen... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int INF = 1001001001;
int main() {
int N;
cin >> N;
int p[N];
rep(i, N) cin >> p[i];
sort(p, p + N, greater<int>());
int payment = 0;
rep(i, N) {
if (payment == 0) {
paymen... | [
"io.output.change"
] | 998,690 | 998,691 | u067267880 | cpp |
p03207 | #include <iostream>
using namespace std;
int a[100];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int najveci = a[0];
for (int i = 1; i < n; ++i) {
if (najveci < a[i])
najveci = a[i];
}
int c = 0;
for (int i = 0; i < n; i++) {
c = c + a[i] - najveci / ... | #include <iostream>
using namespace std;
int a[100];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int najveci = a[0];
for (int i = 1; i < n; ++i) {
if (najveci < a[i])
najveci = a[i];
}
int c = 0;
for (int i = 0; i < n; i++) {
c = c + a[i];
}
c = c... | [
"assignment.change"
] | 998,702 | 998,703 | u212144411 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, p;
cin >> N;
int sum = 0, M = 10000;
for (int i = 0; i < N; i++) {
cin >> p;
sum += p;
M = max(M, p);
}
cout << sum - M / 2;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, p;
cin >> N;
int sum = 0;
int M = 0;
for (int i = 0; i < N; i++) {
cin >> p;
sum += p;
M = max(M, p);
}
cout << sum - M / 2;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 998,704 | 998,705 | u424374375 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, all, x;
cin >> n;
vector<int> p;
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
all = 0;
for (int i = 0; i < n; i++) {
all += p.at(0);
}
x = p.at(0);
for (int i = 1; i < n; i++) {
if (x <= p.at(i)) {
x = p.at(i);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, all, x;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
all = 0;
for (int i = 0; i < n; i++) {
all += p.at(i);
}
x = p.at(0);
for (int i = 1; i < n; i++) {
if (x <= p.at(i)) {
x = p.at(i);... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 998,709 | 998,710 | u584169254 | cpp |
p03207 | //無断転用の一切を禁ずるよ//////////////////////////
#include <algorithm> //辞書順はnext_permutationだよ
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h> //printするよ
#include <string.h>
#include <string>
#include <time.h>
#include <utility> //sw... | //無断転用の一切を禁ずるよ//////////////////////////
#include <algorithm> //辞書順はnext_permutationだよ
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h> //printするよ
#include <string.h>
#include <string>
#include <time.h>
#include <utility> //sw... | [
"assignment.value.change"
] | 998,716 | 998,717 | u742306624 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> X(N);
for (int i = 0; i < N; i++)
cin >> X[i];
sort(X.begin(), X.end());
int pay = X[N - 1] / 2;
for (int i = 1; i < N; i++)
pay += X[i];
cout << (int)pay << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> X(N);
for (int i = 0; i < N; i++)
cin >> X[i];
sort(X.begin(), X.end());
int pay = X[N - 1] / 2;
for (int i = 0; i < N - 1; i++)
pay += X[i];
cout << pay << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 998,724 | 998,725 | u987167511 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> X(N);
for (int i = 0; i < N; i++)
cin >> X[i];
sort(X.begin(), X.end());
int pay = X[0] / 2;
for (int i = 1; i < N; i++)
pay += X[i];
cout << pay << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> X(N);
for (int i = 0; i < N; i++)
cin >> X[i];
sort(X.begin(), X.end());
int pay = X[N - 1] / 2;
for (int i = 0; i < N - 1; i++)
pay += X[i];
cout << pay << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.chan... | 998,726 | 998,725 | u987167511 | cpp |
p03207 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"expression.operation.binary.add"
] | 998,735 | 998,736 | u043443359 | cpp |
p03207 | #include <iostream>
using namespace std;
int a[100000];
int main() {
int n, i, p, max = 0, sum = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
sum = sum + a[i];
if (a[i] > max)
max = a[i];
sum = sum - max;
sum = sum + max / 2;
cout << sum;
}
| #include <iostream>
using namespace std;
int a[100000];
int main() {
int n, i, p, max = 0, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
sum = sum + a[i];
if (a[i] > max)
max = a[i];
}
sum = sum - max;
sum = sum + max / 2;
cout << sum;
}
| [] | 998,757 | 998,758 | u746310630 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
sort(p.begin(), p.end());
int S = 0;
for (int i = 0; i < N - 1; i++) {
S += p[i];
}
S += p[N] / 2;
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
sort(p.begin(), p.end());
int S = 0;
for (int i = 0; i < N - 1; i++) {
S += p[i];
}
S += +p[N - 1] / 2;
cout << S << endl;
} | [
"expression.operation.unary.add",
"assignment.change"
] | 998,759 | 998,760 | u016183710 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
int sum;
int max = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
sum += p[i];
if (p[i] > max) {
max = p[i];
}
}
cout << sum - max / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
int sum = 0;
int max = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
sum += p[i];
if (p[i] >= max) {
max = p[i];
}
}
cout << sum - max / 2 << endl;
}
| [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 998,761 | 998,762 | u101777447 | cpp |
p03207 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p, ans = 0, M = 10001;
for (int i = 0; i < n; i++) {
cin >> p;
ans += p;
M = max(M, p);
}
cout << ans - M / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p, ans = 0, M = -1;
for (int i = 0; i < n; i++) {
cin >> p;
ans += p;
M = max(M, p);
}
cout << ans - M / 2 << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 998,771 | 998,772 | u765815947 | cpp |
p03207 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int S;
int max = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
S += a;
max = std::max(max, a);
}
S -= max / 2;
cout << S << endl;
} |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int S = 0;
int max = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
S += a;
max = std::max(max, a);
}
S -= max / 2;
cout << S << endl;
} | [
"variable_declaration.value.change"
] | 998,775 | 998,776 | u142946678 | cpp |
p03207 | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
// cant wait for holiday
// string days[7] ={"SUN","MON","TUE","WED","THU","FRI","SAT"};
// string s;
// int n;
// cin>> s;
// for (int i = 0; i< 7; i++){
// if (s== days[i]){
// n = i;
/... | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
// cant wait for holiday
// string days[7] ={"SUN","MON","TUE","WED","THU","FRI","SAT"};
// string s;
// int n;
// cin>> s;
// for (int i = 0; i< 7; i++){
// if (s== days[i]){
// n = i;
/... | [
"variable_declaration.value.change"
] | 998,804 | 998,805 | u834488582 | cpp |
p03207 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
sort(p, p + N);
p[N - 1] /= 2;
int ans;
for (int i = 0; i < N; i++) {
ans += p[i];
}
cout << ans;
cout << endl;
re... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int p[N];
for (int i = 0; i < N; i++) {
cin >> p[i];
}
sort(p, p + N);
p[N - 1] /= 2;
int ans = 0;
for (int i = 0; i < N; i++) {
ans += p[i];
}
cout << ans;
cout << endl;
... | [
"variable_declaration.value.change"
] | 998,806 | 998,807 | u828388155 | cpp |
p03207 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 998,830 | 998,831 | u154756110 | cpp |
p03207 | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x, n) for (int i = x;... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x, n) for (int i = x;... | [] | 998,848 | 998,849 | u445401544 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int pi, res, pmax = 0;
for (int i = 0; i < N; i++) {
cin >> pi;
res += pi;
pmax = max(pmax, pi);
}
cout << (res - pmax / 2) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int pi, res = 0, pmax = 0;
for (int i = 0; i < N; i++) {
cin >> pi;
res += pi;
pmax = max(pmax, pi);
}
cout << (res - pmax / 2) << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 998,928 | 998,929 | u235057691 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int ans;
int mnum = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
ans += tmp;
mnum = max(mnum, tmp);
}
ans -= mnum / 2;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int ans = 0;
int mnum = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
ans += tmp;
mnum = max(mnum, tmp);
}
ans -= mnum / 2;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 998,930 | 998,931 | u998251394 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> items(n);
for (int i = 0; i < n; ++i)
cin >> items[i];
sort(items.begin(), items.end());
int ans = 0;
for (int i = 0; i < n - 1; ++i)
ans += items[i];
cout << ans + items[n - 2] / 2 << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> items(n);
for (int i = 0; i < n; ++i)
cin >> items[i];
sort(items.begin(), items.end());
int ans = 0;
for (int i = 0; i < n - 1; ++i)
ans += items[i];
cout << ans + items[n - 1] / 2 << endl;
return 0;
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 998,936 | 998,937 | u676654593 | cpp |
p03207 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, ANS, max = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
ANS = ANS + A;
if (max < A) {
... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, ANS = 0, max = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
ANS = ANS + A;
if (max < A) {
... | [
"variable_declaration.value.change"
] | 998,949 | 998,950 | u230139835 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
sum += P.at(i);
}
sort(P.begin(), P.end());
cout << sum - P.at(N - 1) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum;
cin >> N;
sum = 0;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
sum += P.at(i);
}
sort(P.begin(), P.end());
cout << sum - P.at(N - 1) / 2 << endl;
}
| [
"assignment.add"
] | 998,959 | 998,960 | u668650380 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> p(a);
int money = 0;
int x = 10000;
for (int i = 0; i < a; i++) {
cin >> p[i];
x = min(x, p[i]);
}
for (int i = 0; i < a; i++) {
money += p[i];
}
money -= x / 2;
cout << money << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> p(a);
int money = 0;
int x = 0;
for (int i = 0; i < a; i++) {
cin >> p[i];
x = max(x, p[i]);
}
for (int i = 0; i < a; i++) {
money += p[i];
}
money -= x / 2;
cout << money << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 998,963 | 998,964 | u532401120 | cpp |
p03207 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> p[i];
ans += p[i];
}
sort(p.begin(), p.end(), greater<int>());
cout << ans - p[N - 1] / 2 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> p[i];
ans += p[i];
}
sort(p.begin(), p.end(), greater<int>());
cout << ans - p[0] / 2 << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"io.output.change",
"expression.operation.binary.remove"
] | 998,969 | 998,970 | u227379863 | cpp |
p03207 | #include <iostream>
using namespace std;
int main() {
int N, num;
cin >> N;
int sum = 0, max = 0;
for (int i = 0; i < N; i++) {
cin >> num;
sum += num;
if (max < num)
max += num;
}
cout << sum - max / 2;
} | #include <iostream>
using namespace std;
int main() {
int N, num;
cin >> N;
int sum = 0, max = 0;
for (int i = 0; i < N; i++) {
cin >> num;
sum += num;
if (max < num)
max = num;
}
cout << sum - (int)max / 2;
} | [
"assignment.value.change"
] | 998,978 | 998,979 | u554988565 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p.at(i);
sort(p.begin(), p.end());
for (int i = 0; i < p.size(); i++) {
if (i == p.size() - 1) {
ans += p.at(i) / 2;
// cout << "half: " << p.at(i) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p.at(i);
sort(p.begin(), p.end());
for (int i = 0; i < p.size(); i++) {
if (i == p.size() - 1) {
ans += p.at(i) / 2;
// cout << "half: " << p.at... | [
"variable_declaration.value.change"
] | 998,980 | 998,981 | u828766688 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
sort(p.begin(), p.end());
for (int i = 0; i < N - 1; i++) {
sum += p[i];
}
sum += p[N - 1];
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
sort(p.begin(), p.end());
for (int i = 0; i < N - 1; i++) {
sum += p[i];
}
sum += p[N - 1] / 2;
cout << sum << endl;
} | [
"assignment.change"
] | 998,982 | 998,983 | u593555034 | cpp |
p03207 | #include <bits/stdc++.h>
#define MAX 100000
using namespace std;
int n, som, maior, aux;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &aux);
if (aux > maior)
maior = aux;
som += aux;
}
som -= aux / 2;
printf("%d\n", som);
return 0;
}
| #include <bits/stdc++.h>
#define MAX 100000
using namespace std;
int n, som, maior, aux;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &aux);
if (aux > maior)
maior = aux;
som += aux;
}
som -= maior / 2;
printf("%d\n", som);
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 998,984 | 998,985 | u688109846 | cpp |
p03207 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define ll long long
using namespace std;
// tmp = stoi(S.substr(i,3));
int main() {
ll N, p, res;
cin >> N;
ll iMax = 0;
REP(i, N) {
cin >> p;
... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define ll long long
using namespace std;
// tmp = stoi(S.substr(i,3));
int main() {
ll N, p, res;
cin >> N;
ll iMax = 0;
res = 0;
REP(i, N) {
... | [
"assignment.add"
] | 998,986 | 998,987 | u485731913 | cpp |
p03207 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, i, sum = 0;
cin >> n;
int p[n];
for (i = 0; i < n; i++)
cin >> p[i];
sort(p, p + n);
for (i = 1; i < n; i++)
sum += p[i];
cout << sum + p[0] / 2;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, i, sum = 0;
cin >> n;
int p[n];
for (i = 0; i < n; i++)
cin >> p[i];
sort(p, p + n);
for (i = 0; i < n - 1; i++)
sum += p[i];
cout << sum + p[n - 1] / 2;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 998,992 | 998,993 | u340494803 | cpp |
p03207 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
main() {
int N;
cin >> N;
vector<int> V(N);
for (int i = 0; i < N; i++)
cin >> V[i];
sort(V.rbegin(), V.rend());
int sum = 0;
for (int i = 0; i < N; i++) {
sum += V[i];
}
sum -= V[0];
cout << sum << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
main() {
int N;
cin >> N;
vector<int> V(N);
for (int i = 0; i < N; i++)
cin >> V[i];
sort(V.rbegin(), V.rend());
int sum = 0;
for (int i = 0; i < N; i++) {
sum += V[i];
}
sum -= V[0] / 2;
cout << sum << endl;
}
| [
"assignment.change"
] | 998,998 | 998,999 | u157322125 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, N, p, max = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> p;
sum += p;
if (max < p)
max = p;
}
cout << sum - p / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, N, p, max = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> p;
sum += p;
if (max < p)
max = p;
}
cout << sum - max / 2 << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 999,000 | 999,001 | u239087789 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, N, p, max = 0;
for (int i = 0; i < N; i++) {
cin >> p;
sum += p;
if (max < p)
max = p;
}
cout << sum - p / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, N, p, max = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> p;
sum += p;
if (max < p)
max = p;
}
cout << sum - max / 2 << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 999,002 | 999,001 | u239087789 | cpp |
p03207 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
int total = 0;
vector<int> v(n);
rep(i, n) {
cin >> v[i];
total += v[i];
}
total -= *max_element(v.begin(), v.end());
cout... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
int total = 0;
vector<int> v(n);
rep(i, n) {
cin >> v[i];
total += v[i];
}
total -= *max_element(v.begin(), v.end()) / 2;
... | [
"assignment.change"
] | 999,006 | 999,007 | u130834452 | cpp |
p03207 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vbb vector<vector<bool>>
#define all(a) (a).begin(), (a).end()
using namespace st... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vbb vector<vector<bool>>
#define all(a) (a).begin(), (a).end()
using namespace st... | [
"expression.operation.binary.add"
] | 999,010 | 999,011 | u386131832 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | [
"assignment.change"
] | 999,024 | 999,025 | u219873012 | cpp |
p03207 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
//#include<numerice>
using namespace std;
int main() {
int N, total;
int price_max = -10;
cin >> N;
for (int i = 0; i < N; i++) {
int price;
cin >> price;
total += price;
price_max = max(price_max, price);
}
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
//#include<numerice>
using namespace std;
int main() {
int N;
int total = 0;
int price_max = -10;
cin >> N;
for (int i = 0; i < N; i++) {
int price;
cin >> price;
total += price;
price_max = max(price_max, pric... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 999,026 | 999,027 | u143492911 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
p.at(0) /= 2;
int sum = 0;
for (int i = 0; i < N; i++) {
sum += p.at(i);
}
cout << sum;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
p.at(0) /= 2;
int sum = 0;
for (int i = 0; i < N; i++) {
sum += p.at(i);
}
cout << sum;
}
| [] | 999,028 | 999,029 | u074402558 | cpp |
p03207 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int P[N];
for (int i = 0; i < N; i++)
cin >> P[i];
sort(P, P + N);
P[N - 1] /= 2;
int sum;
for (int i = 0; i < N; i++)
sum += P[i];
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int P[N];
for (int i = 0; i < N; i++)
cin >> P[i];
sort(P, P + N);
P[N - 1] /= 2;
int sum = 0;
for (int i = 0; i < N; i++)
sum += P[i];
cout << sum << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 999,032 | 999,033 | u911222357 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a.size())
#define endl "\n"
vector<ll> p(15);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a.size())
#define endl "\n"
vector<ll> p(15);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
... | [
"assignment.value.change",
"expression.operation.unary.arithmetic.remove"
] | 999,034 | 999,035 | u616547520 | cpp |
p03207 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
int i;
int taka = 0;
int m;
int ans = 0;
for (i = 0; i < n; i++) {
cin >> p[i];
if (p[i] > taka) {
taka = p[i];
m = i;
}
}
for (i = 0; i ... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
int i;
int taka = 0;
int m;
int ans = 0;
for (i = 0; i < n; i++) {
cin >> p[i];
if (p[i] > taka) {
taka = p[i];
m = i;
}
}
for (i = 0; i ... | [
"control_flow.loop.for.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 999,047 | 999,048 | u127768253 | cpp |
p03207 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> value;
for (int i = 0; i < n; i++) {
cin >> value[i];
}
int max = 0;
for (int i = 0; i < n; i++) {
if (max < value[i])
max = value[i];
}
int sum = 0;
for (int i = 0; i < n; i++)... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> value(10, 0);
for (int i = 0; i < n; i++) {
cin >> value[i];
}
int max = 0;
for (int i = 0; i < n; i++) {
if (max < value[i])
max = value[i];
}
int sum = 0;
for (int i = 0; i < ... | [
"call.arguments.add"
] | 999,053 | 999,054 | u407416173 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 999,057 | 999,058 | u430974466 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 999,059 | 999,058 | u430974466 | cpp |
p03207 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
int M = 0;
int index;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] > M) {
M = p[i];
index = i;
}
}
int ans;
for (int i = 0; i < n; i++) {
if (i == index) {
ans += p[i] / 2;
}... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
int M = 0;
int index;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] > M) {
M = p[i];
index = i;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (i == index) {
ans += p[i] / 2;
... | [
"variable_declaration.value.change"
] | 999,079 | 999,080 | u222293734 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
int N;
cin >> N;
vector<int> p(N);
REP(i, N) { cin >> p.at(i); }
sort(ALL(p));
reverse(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
int N;
cin >> N;
vector<int> p(N);
REP(i, N) { cin >> p.at(i); }
sort(ALL(p));
reverse(... | [
"assignment.change"
] | 999,093 | 999,094 | u408053343 | cpp |
p03207 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | [
"assignment.change",
"io.output.newline.add"
] | 999,101 | 999,102 | u846813901 | cpp |
p03207 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | [] | 999,105 | 999,106 | u240509821 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.