problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<double, vector<double>, greater<double>> pt;
double a, b, sum = 0;
for (int i = 0; i < n; i++) {
scanf("%lf", &a);
pt.push(a);
}
while (!pt.empty()) {
a = pt.top();
pt.pop();
b = pt.top();
pt... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<double, vector<double>, greater<double>> pt;
double a, b, sum = 0;
for (int i = 0; i < n; i++) {
scanf("%lf", &a);
pt.push(a);
}
while (pt.size() > 1) {
a = pt.top();
pt.pop();
b = pt.top();
... | [
"expression.operation.unary.logical.remove",
"control_flow.loop.condition.change",
"call.function.change"
] | 737,798 | 737,799 | u654104650 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n;
cin >> n;
priority_queue<double, vector<double>, greater<double>> pt;
double a, b, sum = 0;
for (int i = 0; i < n; i++) {
scanf("%lf", &a);
pt.push(a);
}
while (!pt.empty()) {
a = pt.top();
pt.pop();
b = pt.top();
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<double, vector<double>, greater<double>> pt;
double a, b, sum = 0;
for (int i = 0; i < n; i++) {
scanf("%lf", &a);
pt.push(a);
}
while (pt.size() > 1) {
a = pt.top();
pt.pop();
b = pt.top();
... | [
"variable_declaration.type.primitive.change",
"expression.operation.unary.logical.remove",
"control_flow.loop.condition.change",
"call.function.change"
] | 737,800 | 737,799 | u654104650 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n - 1; i++) {
int temp = (a[i] + a[i + 1]) / 2;
a[i + 1] = temp;
}
cout << a[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n - 1; i++) {
double temp = (a[i] + a[i + 1]) / 2;
a[i + 1] = temp;
}
cout << a[n - 1];
}
| [
"variable_declaration.type.primitive.change"
] | 737,807 | 737,808 | u676312981 | cpp |
p02935 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
// reverse(vec.begin(),vec.end());
double t = 0.0;
for (int i = 0; i < N - 1; i++) ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
// reverse(vec.begin(),vec.end());
double t = 0.0;
for (int i = 0; i < N - 1; i+... | [
"variable_declaration.type.primitive.change"
] | 737,813 | 737,814 | u281055657 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
float a = (arr[1] + arr[0]) / 2;
for (int i = 2; i < n; i++) {
a = (a + arr[i]) / 2;
}
cout << a;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
float a = (arr[1] + arr[0]) / 2;
for (int i = 2; i < n; i++) {
a = (a + arr[i]) / 2;
}
cout << a;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 737,822 | 737,823 | u917909548 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
float k = 0;
for (int i = 0; i < n - 1; i++) {
k = (arr[i] + arr[i + 1]) / 2.0;
arr[i + 1] = k;
}
cout << k << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
float k = 0;
for (int i = 0; i < n - 1; i++) {
k = (arr[i] + arr[i + 1]) / 2;
arr[i + 1] = k;
}
cout << k << endl;
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 737,824 | 737,825 | u213391030 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
int k = 0;
for (int i = 0; i < n - 1; i++) {
k = (arr[i] + arr[i + 1]) / 2;
arr[i + 1] = k;
}
cout << k << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
float k = 0;
for (int i = 0; i < n - 1; i++) {
k = (arr[i] + arr[i + 1]) / 2;
arr[i + 1] = k;
}
cout << k << endl;
} | [
"variable_declaration.type.primitive.change"
] | 737,826 | 737,825 | u213391030 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float k;
priority_queue<float, vector<int>, greater<int>> a;
for (int i = 0; i < n; i++) {
cin >> k;
a.push(k);
}
while (a.size() != 1) {
float x = a.top();
a.pop();
float y = a.top();
a.pop();
float z... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float k;
priority_queue<float, vector<float>, greater<float>> a;
for (int i = 0; i < n; i++) {
cin >> k;
a.push(k);
}
while (a.size() != 1) {
float x = a.top();
a.pop();
float y = a.top();
a.pop();
flo... | [
"variable_declaration.type.primitive.change"
] | 737,830 | 737,831 | u243126309 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<float> v;
float a;
for (int i = 0; i < N; i++) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
float V = v[0];
for (int i... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<float> v;
float a;
for (int i = 0; i < N; i++) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
float V = v[0];
for (int i... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 737,843 | 737,844 | u383455755 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i = 0, t;
cin >> N;
double v[N];
for (i = 0; i < N; i++) {
cin >> t;
v[i] = t;
}
sort(v, v + N);
double temp = (v[0] + v[1]) / 2.0;
if (N > 2) {
for (i = 2; i < N; i++) {
temp = (temp + v[2]) / 2.0;
}
}
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i = 0, t;
cin >> N;
double v[N];
for (i = 0; i < N; i++) {
cin >> t;
v[i] = t;
}
sort(v, v + N);
double temp = (v[0] + v[1]) / 2.0;
if (N > 2) {
for (i = 2; i < N; i++) {
temp = (temp + v[i]) / 2.0;
}
}
co... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 737,847 | 737,848 | u682526550 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[1100];
int main() {
int n;
int x;
double ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
if (n == 2)
ans = 1.0 * (a[1] + a[2]) / 2;
else {
ans = (a[1] + a[2]) / 2;
for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[110];
int main() {
int n;
int x;
double ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
if (n == 2)
ans = 1.0 * (a[1] + a[2]) / 2;
else {
ans = 1.0 * (a[1] + a[2]) / 2;
fo... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 737,849 | 737,850 | u628984480 | cpp |
p02935 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; i < (n); ++(i))
typedef long long ll;
const ll MOD = 1e9 + 7;
const int MAX_N = 50;
int main() {
int N;
std::priority_queue<int> pq;
std::cin >> N;
rep(i, N) {
int v;
std::cin >> v;
pq.push(-v);
}
double ans = 0.0;
rep(i, N - 1) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; i < (n); ++(i))
typedef long long ll;
const ll MOD = 1e9 + 7;
const int MAX_N = 50;
int main() {
int N;
std::priority_queue<double> pq;
std::cin >> N;
rep(i, N) {
double v;
std::cin >> v;
pq.push(-v);
}
double ans = 0.0;
rep(i, N ... | [
"variable_declaration.type.primitive.change"
] | 737,853 | 737,854 | u600759947 | cpp |
p02935 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a);
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main(void) {
int n;
scanf("%d",... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a);
int asc(const void *a, const void *b) { return *(double *)a - *(double *)b; }
int main(void) {
int n;
scanf... | [
"variable_declaration.type.primitive.change"
] | 737,855 | 737,856 | u456658814 | cpp |
p02935 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a);
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main(void) {
int n;
scanf("%d",... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a);
int asc(const void *a, const void *b) { return *(double *)a - *(double *)b; }
int main(void) {
int n;
scanf... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 737,857 | 737,856 | u456658814 | cpp |
p02935 | #include <stdio.h>
#include <stdlib.h>
int desc(const void *a, const void *b) {
double x;
int k;
x = *(double *)b - *(double *)a;
k = x > 0 ? -1 : 1;
return k;
}
int main(void) {
int i, n;
double v[1001];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%le", &v[i]);
}
qsort(v, n, sizeof(d... | #include <stdio.h>
#include <stdlib.h>
int desc(const void *a, const void *b) {
double x;
int k;
x = *(double *)b - *(double *)a;
k = x > 0 ? +1 : -1;
return k;
}
int main(void) {
int i, n;
double v[1001];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%lf", &v[i]);
}
qsort(v, n, sizeof(... | [
"misc.opposites",
"literal.number.change",
"expression.operator.arithmetic.change",
"expression.operation.unary.arithmetic.add",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 737,865 | 737,866 | u391667116 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<ll, ll> P;
const int MAX = 55;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int N;
int main() {
cin >> N;
vector<double> v(N);
rep(i, N) cin >> v[i];
while (1 < v.size()) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<ll, ll> P;
const int MAX = 55;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int N;
int main() {
cin >> N;
vector<double> v(N);
rep(i, N) cin >> v[i];
while (1 < v.size()) {
... | [
"variable_declaration.type.primitive.change"
] | 737,877 | 737,878 | u992875223 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
int p = A.at(0);
for (int i = 0; i < N; i++) {
p = (p + A.at(i)) / 2;
}
cout << p << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
double p = A.at(0);
for (int i = 0; i < N; i++) {
p = (p + A.at(i)) / 2;
}
cout << p << endl;
} | [
"variable_declaration.type.primitive.change"
] | 737,882 | 737,883 | u204437779 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int i, n, b;
vector<double> v;
cin >> n;
for (i = 0; i < n; i++) {
cin >> b;
v.push_back(b);
}
sort(v.begin(), v.end());
for (i = 0; i < n - 1; i++) {
v[i + 1] = (v[i] + v[i + 1]) / 2.0;
}
c... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int i, n, b;
vector<double> v;
cin >> n;
for (i = 0; i < n; i++) {
cin >> b;
v.push_back(b);
}
sort(v.begin(), v.end());
for (i = 0; i < n - 2; i++) {
v[i + 1] = (v[i] + v[i + 1]) / 2.0;
}
c... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 737,884 | 737,885 | u610897920 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> v;
int solve();
// int buf(vector<int> vs);
int main() {
cin >> N;
v = vector<int>(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
solve();
}
int solve() {
for (int i = 0; i < N - 1; i++) {
// buf(v);
sort(v.begin(), v.end(... | #include <bits/stdc++.h>
using namespace std;
int N;
vector<double> v;
int solve();
// int buf(vector<int> vs);
int main() {
cin >> N;
v = vector<double>(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
solve();
}
int solve() {
for (int i = 0; i < N - 1; i++) {
// buf(v);
sort(v.begin(), ... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 737,886 | 737,887 | u526476325 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | [
"variable_declaration.type.primitive.change"
] | 737,891 | 737,892 | u160321725 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int a[1000];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
double num = (a[0] + a[1]) / 2;
for (int i = 2; i < n; i++) {
num += a[i];
num /= 2;
}
cout << num << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[1000];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
double num = (a[0] + a[1]) * 1.0 / 2;
for (int i = 2; i < n; i++) {
num += a[i];
num /= 2;
}
cout << num << endl;
return 0;
} | [
"assignment.change"
] | 737,930 | 737,931 | u333991119 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
a[i] = (a[i] + a[i - 1]) / 2;
}
cout << a.back() << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
for (int i = 1; i < n; i++) {
a[i] = (a[i] + a[i - 1]) / 2;
}
cout << a.back() << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 737,934 | 737,935 | u196798307 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | [
"variable_declaration.type.change"
] | 737,945 | 737,946 | u364018936 | cpp |
p02935 | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
double A[50];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A, A + N);
double ans = (A[0] + A[1]) / 2.0;
for (int i = 2; i < N; i++) {
ans = (ans + A[2]) / 2.0;
}
cout << setprecisi... | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
double A[50];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A, A + N);
double ans = (A[0] + A[1]) / 2.0;
for (int i = 2; i < N; i++) {
ans = (ans + A[i]) / 2.0;
}
cout << setprecisi... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 737,949 | 737,950 | u107077805 | cpp |
p02935 | // ★★ ASHWINI SHARMA ★★
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#... | // ★★ ASHWINI SHARMA ★★
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 737,960 | 737,961 | u909051929 | cpp |
p02935 | // k_k_dubey_
#include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
#define inf 999999999999
#define mx 200005
#define gcd __gcd
#define pb push_back
#define mk make_pair
#define bs binary_search
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
#define endl "\n"
#define vl vector<l... | // k_k_dubey_
#include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
#define inf 999999999999
#define mx 200005
#define gcd __gcd
#define pb push_back
#define mk make_pair
#define bs binary_search
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
#define endl "\n"
#define vl vector<l... | [
"variable_declaration.type.change"
] | 737,964 | 737,965 | u720296041 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mm 1000000007
#define pb push_back
// nestedcode
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, i;
cin >> n;
ll a[n + 5];
double ans = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
// cout<<ans... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mm 1000000007
#define pb push_back
// nestedcode
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, i;
cin >> n;
ll a[n + 5];
double ans = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
// cout<<ans... | [
"type_conversion.add"
] | 737,968 | 737,969 | u995107278 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> v;
double answer = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
v.push_back(tmp);
}
sort(v.begin(), v.end());
answer += (v[0] + v[1]) / 2;
for (int i = 2; i < N; i++) {
answer = (answer... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> v;
double answer = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
v.push_back(tmp);
}
sort(v.begin(), v.end());
answer += (double)(v[0] + v[1]) / 2;
for (int i = 2; i < N; i++) {
answer =... | [
"type_conversion.add"
] | 737,972 | 737,973 | u016092854 | cpp |
p02935 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
REP(i, n) cin >> v.at(i);
sort(v.begin(), v.end());
int ans = v.at(0);
for (int i = 1; i < v.size(); i++) {
ans = (ans + v.at(i... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<long double> v(n);
REP(i, n) cin >> v.at(i);
sort(v.begin(), v.end());
long double ans = v.at(0);
for (int i = 1; i < v.size(); i++) {
ans... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 737,974 | 737,975 | u539914590 | cpp |
p02935 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include... | [
"variable_declaration.type.primitive.change"
] | 737,976 | 737,977 | u585670083 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N;
cin >> N;
vector<ll> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
sort(V.begin(), V.end());
double a = V[0];
for (int i = 1; i < N; i++) {
a = (a + V[i]) / 2;
}
return a;
}
int main() {
cout.prec... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
double solve() {
ll N;
cin >> N;
vector<ll> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
sort(V.begin(), V.end());
double a = V[0];
for (int i = 1; i < N; i++) {
a = (a + V[i]) / 2;
}
return a;
}
int main() {
cout.... | [] | 737,984 | 737,985 | u930841425 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int niz[100];
int main() {
ios_base::sync_with_stdio(false);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> niz[i];
}
sort(niz + 1, niz + 1 + n);
ld res = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int niz[100];
int main() {
ios_base::sync_with_stdio(false);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> niz[i];
}
sort(niz + 1, niz + 1 + n);
ld res = niz... | [
"identifier.replace.add",
"literal.replace.remove",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 737,988 | 737,989 | u320923811 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
long int answer = v[0];
for (int i = 1; i < N; ++i) {
answer = (answer + v[i]) / 2;
}
c... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
double answer = v[0];
for (int i = 1; i < N; ++i) {
answer = (answer + v[i]) / 2;
}
cou... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 738,002 | 738,003 | u077117247 | cpp |
p02935 | /* Don’t Quit
When things go wrong as they sometimes will;
When the road you’re trudging seems all uphill;
When the funds are low, and the debts are high;
And you want to smile, but you have to sigh;
When care is pressing you down a bit
... | /* Don’t Quit
When things go wrong as they sometimes will;
When the road you’re trudging seems all uphill;
When the funds are low, and the debts are high;
And you want to smile, but you have to sigh;
When care is pressing you down a bit
... | [
"variable_declaration.type.primitive.change"
] | 738,008 | 738,009 | u035131936 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, N) repi(i, 0, (N))
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define ios() ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, N) repi(i, 0, (N))
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define ios() ... | [] | 738,010 | 738,011 | u904833081 | cpp |
p02935 |
#include <bits/stdc++.h>
using namespace std;
#define PAIN___ \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long... |
#include <bits/stdc++.h>
using namespace std;
#define PAIN___ \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long... | [
"variable_declaration.type.change"
] | 738,014 | 738,015 | u866981537 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
if (n == 2) {
double a = v[0] + v[1];
a /= 2;
cout << a << endl;
retur... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
if (n == 2) {
double a = v[0] + v[1];
a /= 2;
cout << a << endl;
retur... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.loop.for.initializer.change"
] | 738,020 | 738,021 | u115819033 | cpp |
p02935 | /*
Author: ankrypt
*/
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define u64 unsigned long long int
ll N;
ll arr[55];
ll A, B;
int main() {
scanf("%lld", &N);
for (int i = 0; i < N; i++) {
scanf("%lld", &arr[i]);
}
sort(arr, arr + N);
int fla... | /*
Author: ankrypt
*/
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define u64 unsigned long long int
ll N;
ll arr[55];
double A, B;
int main() {
scanf("%lld", &N);
for (int i = 0; i < N; i++) {
scanf("%lld", &arr[i]);
}
sort(arr, arr + N);
int... | [
"variable_declaration.type.change"
] | 738,022 | 738,023 | u428267713 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v, v + n);
double ans;
ans = v[0];
for (int i = 1; i < n; i++) {
ans += (ans + v[i]) / 2;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v, v + n);
double ans;
ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
return 0;
} | [
"assignment.value.change"
] | 738,030 | 738,031 | u812475404 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n;
double ans = 0;
cin >> n;
int ara[n];
for (i = 0; i < n; i++) {
cin >> ara[i];
}
sort(ara, ara + n);
ans = (ara[0] + ara[1]) / 2;
if (n > 2) {
for (i = 2; i < n; i++) {
ans = (ans + ara[i]) / 2;
}
}
cout << an... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n;
double ans = 0;
cin >> n;
double ara[n];
for (i = 0; i < n; i++) {
cin >> ara[i];
}
sort(ara, ara + n);
ans = (ara[0] + ara[1]) / 2;
if (n > 2) {
for (i = 2; i < n; i++) {
ans = (ans + ara[i]) / 2;
}
}
cout <<... | [
"variable_declaration.type.primitive.change"
] | 738,038 | 738,039 | u808454282 | cpp |
p02935 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> v(n);
rep... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> v(n);
rep... | [
"assignment.value.change"
] | 738,045 | 738,046 | u654115954 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> vect(n, 0);
for (int i = 0; i < n; i++) {
cin >> vect[i];
}
sort(vect.begin(), vect.end());
double sum = 0;
long long int j = 2;
sum = vect[0] + vect[1];
for (int i = 2; i < n; i++) {
sum += j... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> vect(n, 0);
for (int i = 0; i < n; i++) {
cin >> vect[i];
}
sort(vect.begin(), vect.end());
double sum = 0;
long long int j = 2;
sum = vect[0] + vect[1];
for (int i = 2; i < n; i++) {
sum += j... | [
"assignment.add"
] | 738,060 | 738,061 | u190066528 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | [
"variable_declaration.type.change"
] | 738,062 | 738,063 | u874644572 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
priority_queue<float, vector<float>, greater<float>> q;
for (int i = 0; i < n; i++) {
float y;
cin >> y;
q.push(y);
}
while (q.size() != 1) {
float x = q.top();
q.pop();
float y = q.top();
q.pop();
float z = (flo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<float, vector<float>, greater<float>> q;
for (int i = 0; i < n; i++) {
float y;
cin >> y;
q.push(y);
}
while (q.size() != 1) {
float x = q.top();
q.pop();
float y = q.top();
q.pop();
fl... | [] | 738,064 | 738,065 | u179077505 | cpp |
p02935 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> x;
cin >> n;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
x.push_back(temp);
}
sort(x.begin(), x.end());
float val = (x[0] + x[1]) / 2.0f;
x.erase(x.begin(), x.begin() +... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> x;
cin >> n;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
x.push_back(temp);
}
sort(x.begin(), x.end());
float val = (x[0] + x[1]) / 2.0f;
x.erase(x.begin(), x.begin() +... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 738,067 | 738,068 | u355286859 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, j = 0;
float total;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
j++;
if (i == 0) {
total = (vec.at(0) + vec.at(1)) / 2;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, j = 0;
float total;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
j++;
if (i == 0) {
total = (vec.at(0) + vec.at(1)) / 2.... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 738,071 | 738,072 | u361557064 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, j = 0;
double total;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
j++;
if (i == 0) {
total = (vec.at(0) + vec.at(1)) / 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, j = 0;
float total;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
j++;
if (i == 0) {
total = (vec.at(0) + vec.at(1)) / 2.... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 738,073 | 738,072 | u361557064 | cpp |
p02935 | // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// ~~~~~~~ Aashutosh Rathi~~~~~~
// ~~~~~~~~aashutoshrathi~~~~~~~~~~~
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// Use memcpy while copying matrix :D
// o_O Never do calculation in if block -_-
// Use __builtin_popcount(z) to get set bit count of z
#include <bits/stdc++.h> // Apne aap me s... | // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// ~~~~~~~ Aashutosh Rathi~~~~~~
// ~~~~~~~~aashutoshrathi~~~~~~~~~~~
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// Use memcpy while copying matrix :D
// o_O Never do calculation in if block -_-
// Use __builtin_popcount(z) to get set bit count of z
#include <bits/stdc++.h> // Apne aap me s... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 738,074 | 738,075 | u958403713 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
double s;
int main() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
double s;
int main() {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 738,076 | 738,077 | u703214333 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<float> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
vec.at(i) = vec.at(i) / 2 + vec.at(i + 1) / 2;
}
cout << vec.at(N - 1) << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<float> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
vec.at(i + 1) = vec.at(i) / 2 + vec.at(i + 1) / 2;
}
cout << vec.at(N - 1) << en... | [
"assignment.change"
] | 738,083 | 738,084 | u890758760 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
int main() {
//定義
int n;
// Nをインプット
cin >> n;
// n個のベクター
vector<int> vec;
//ベクターに標準入力を入れる
int a;
for (int i = 0; i < n; ++i) {
cin >> a;
vec.push_back(a);
}
//ソートしたーい
sort(vec.begin(), vec.end()); //ソート実行
int answer;
answer = (vec[0] + ve... | #include <bits/stdc++.h>
using namespace std;
int main() {
//定義
int n;
// Nをインプット
cin >> n;
// n個のベクター
vector<double> vec;
//ベクターに標準入力を入れる
int a;
for (int i = 0; i < n; ++i) {
cin >> a;
vec.push_back(a);
}
//ソートしたーい
sort(vec.begin(), vec.end()); //ソート実行
double answer;
answer = (vec[0... | [
"variable_declaration.type.primitive.change"
] | 738,088 | 738,089 | u602325778 | cpp |
p02935 | #include <bits/stdc++.h>
#include <iostream>
int main(void) {
int N;
std::cin >> N;
std::vector<double> v(N);
for (int i = 0; i < N; i++) {
std::cin >> v[i];
}
for (int i = 0; i < N - 1; i++) {
double val;
std::sort(v.begin(), v.end());
v.push_back((v[i] + v[i + 1]) / 2.0);
v.erase(v.b... | #include <bits/stdc++.h>
#include <iostream>
int main(void) {
int N;
std::cin >> N;
std::vector<double> v(N);
for (int i = 0; i < N; i++) {
std::cin >> v[i];
}
for (int i = 0; i < N - 1; i++) {
double val;
std::sort(v.begin(), v.end());
// for (auto x: v)
// std::cout << x << " ";... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 738,090 | 738,091 | u122994151 | cpp |
p02935 | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <iostream>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
namespace {
void printElems(const int *begin, const int *end) {
for (const int *p = begin; p != end; ++p) {
std::cout << *p << std::ends;
}
std::cout << std:... | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <iostream>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
namespace {
void printElems(const int *begin, const int *end) {
for (const int *p = begin; p != end; ++p) {
std::cout << *p << std::ends;
}
std::cout << std:... | [
"variable_declaration.type.primitive.change"
] | 738,092 | 738,093 | u337373905 | cpp |
p02935 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
long double value = 0;
int input;
for (int i = 0; i < n; i++) {
cin >> input;
v.push_back(input);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
long double value = 0;
int input;
for (int i = 0; i < n; i++) {
cin >> input;
v.push_back(input);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end... | [
"assignment.change"
] | 738,096 | 738,097 | u492321750 | cpp |
p02935 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
double numArr[n];
int index = 0;
while (n != index) {
int input;
cin >> input;
numArr[index] = input;
index += 1;
}
sort(numArr, numArr + n);
for (int i = 0; i < n - 1; ++i) {
double first ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
double numArr[n];
int index = 0;
while (n != index) {
int input;
cin >> input;
numArr[index] = input;
index += 1;
}
sort(numArr, numArr + n);
for (int i = 0; i < n - 1; ++i) {
double first ... | [
"expression.operation.binary.add"
] | 738,103 | 738,104 | u780842141 | cpp |
p02935 | /*
#include "stdafx.h"
#include<algorithm>
#include<cmath>
#include<complex>
#include<iostream>
#include<queue>
#include<stack>
#include<vector>
*/
#include <bits/stdc++.h>
#define X real()
#define Y imag()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define FastF... | /*
#include "stdafx.h"
#include<algorithm>
#include<cmath>
#include<complex>
#include<iostream>
#include<queue>
#include<stack>
#include<vector>
*/
#include <bits/stdc++.h>
#define X real()
#define Y imag()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define FastF... | [
"variable_declaration.type.primitive.change"
] | 738,105 | 738,106 | u292633934 | cpp |
p02935 | #include <algorithm>
#include <iostream>
using namespace std;
double a[110], res = 0;
int main() {
int i, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
res = a[0];
for (i = 1; i < n; i++) {
res += (res + a[i]) / 2;
}
cout << res << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
double a[110], res = 0;
int main() {
int i, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
res = a[0];
for (i = 0; i < n; i++) {
res = (res + a[i]) / 2;
}
cout << res << endl;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 738,109 | 738,110 | u621509943 | cpp |
p02936 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | [
"assignment.value.change"
] | 738,152 | 738,153 | u264265458 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define COUT(x) cout << (x) << "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define COUT(x) cout << (x) << "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"assignment.value.change"
] | 738,154 | 738,155 | u303884911 | cpp |
p02936 | #include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
// macro
#define let auto const &
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) ... | #include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
// macro
#define let auto const &
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) ... | [
"assignment.value.change"
] | 738,156 | 738,157 | u653699618 | cpp |
p02936 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | [
"identifier.change",
"expression.operation.binary.change"
] | 738,170 | 738,171 | u649310245 | cpp |
p02936 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
void dfs(const vector<vector<int>> &G, vector<bool> &seen, int v, ll sum,
vector<ll> &values) {
seen[v] = true;
values[v] += sum;
for (auto next_v : G[v]) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
void dfs(const vector<vector<int>> &G, vector<bool> &seen, int v, ll sum,
vector<ll> &values) {
seen[v] = true;
values[v] += sum;
for (auto next_v : G[v]) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 738,204 | 738,205 | u698741861 | cpp |
p02936 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main(... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 738,240 | 738,241 | u135626132 | cpp |
p02936 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
void dfs(int s, vector<vector<int>> &g, vector<int> &ans, int pre = -1) {
for (auto u : g[s]) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
void dfs(int s, vector<vector<int>> &g, vector<int> &ans, int pre = -1) {
for (auto u : g[s]) {
... | [
"assignment.value.change"
] | 738,244 | 738,245 | u596311864 | cpp |
p02936 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define L(ID) ((ID * 2) + 1)
#define R(ID) ((ID * 2) + 2)
#define M(L, R) ((L + R) / ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define L(ID) ((ID * 2) + 1)
#define R(ID) ((ID * 2) + 2)
#define M(L, R) ((L + R) / ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 738,248 | 738,249 | u577511087 | cpp |
p02936 | #include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define fs first
#define sc second
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define fastio ... | #include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define fs first
#define sc second
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define fastio ... | [
"assignment.value.change"
] | 738,254 | 738,255 | u567661286 | cpp |
p02936 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> r(n + 1);
vector<int> r2(n + 1, n + 1);
int a, b;
rep(i, n - 1) {
cin >> a >> b;
r[a].push_back(b);... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> r(n + 1);
vector<int> r2(n + 1, n + 1);
int a, b;
rep(i, n - 1) {
cin >> a >> b;
r[a].push_back(b);... | [
"identifier.change",
"call.arguments.change"
] | 738,262 | 738,263 | u992471673 | cpp |
p02936 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
vector<ll> ans;
vector<vector<int>> node;
void score(int now, int parent = -1) {
rep(i, node[now].size()) {
if (node[now][i] == parent)
continue;
ans[node[now][... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
vector<ll> ans;
vector<vector<int>> node;
void score(int now, int parent = -1) {
rep(i, node[now].size()) {
if (node[now][i] == parent)
continue;
ans[node[now][... | [
"assignment.value.change"
] | 738,266 | 738,267 | u796269639 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < (int)b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
vector<int> g[200005];
int ans[200005];
void dfs(int now, int from) {
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < (int)b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
vector<int> g[200005];
int ans[200005];
void dfs(int now, int from) {
fo... | [
"call.arguments.add",
"call.arguments.change"
] | 738,292 | 738,293 | u214304095 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x) ... | [
"identifier.change",
"call.arguments.change"
] | 738,336 | 738,337 | u168017191 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x) ... | [
"identifier.change",
"call.arguments.change",
"literal.string.change",
"io.output.change"
] | 738,338 | 738,337 | u168017191 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
vector<int> g[n];
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
}
int c[n]{};
for (int i = 0; i < q; i++) {
int a,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
vector<int> g[n];
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
}
int c[n]{};
for (int i = 0; i < q; i++) {
int a,... | [] | 738,352 | 738,353 | u804999113 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
vector<int> g[n];
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
}
int c[n]{};
for (int i = 0; i < q; i++) {
int a,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
vector<int> g[n];
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
}
int c[n]{};
for (int i = 0; i < q; i++) {
int a,... | [] | 738,354 | 738,353 | u804999113 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | [
"identifier.change",
"call.arguments.change"
] | 738,355 | 738,356 | u427344224 | cpp |
p02936 | // https://ei1333.github.io/luzhiled/
// http://beet-aizu.hatenablog.com/entry/2017/01/04/113233
// http://www.prefield.com/algorithm/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bo... | // https://ei1333.github.io/luzhiled/
// http://beet-aizu.hatenablog.com/entry/2017/01/04/113233
// http://www.prefield.com/algorithm/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bo... | [
"call.remove"
] | 738,386 | 738,387 | u852839243 | cpp |
p02936 | // https://ei1333.github.io/luzhiled/
// http://beet-aizu.hatenablog.com/entry/2017/01/04/113233
// http://www.prefield.com/algorithm/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bo... | // https://ei1333.github.io/luzhiled/
// http://beet-aizu.hatenablog.com/entry/2017/01/04/113233
// http://www.prefield.com/algorithm/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bo... | [
"call.remove",
"assignment.value.change"
] | 738,388 | 738,387 | u852839243 | cpp |
p02936 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef lon... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef lon... | [] | 738,392 | 738,393 | u188706971 | cpp |
p02936 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | [
"assignment.value.change"
] | 738,410 | 738,411 | u221285045 | cpp |
p02936 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <... | [
"call.remove"
] | 738,412 | 738,413 | u221285045 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
vector<int> graph[100000];
vector<int> counter(100000, 0);
vector<int> ans(100000, 0);
void dfs(int n, int c) {
ans[n] = c + counter[n];
for (auto t : graph[n]) {
dfs(t, ans[n]);
}
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, Q;
... | #include <bits/stdc++.h>
using namespace std;
vector<int> graph[200000];
vector<int> counter(200000, 0);
vector<int> ans(200000, 0);
void dfs(int n, int c) {
ans[n] = c + counter[n];
for (auto t : graph[n]) {
dfs(t, ans[n]);
}
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, Q;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 738,418 | 738,417 | u500092662 | cpp |
p02936 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define pii pair<int, int>
#define ll long long
#define el '\n'
using namespace std;
const int N = 2e5 + 10;
int ans[N];
vector<int> adl[N];
int n, q;
int lazy[N];
void dfs(int node, int p)... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define pii pair<int, int>
#define ll long long
#define el '\n'
using namespace std;
const int N = 2e5 + 10;
int ans[N];
vector<int> adl[N];
int n, q;
int lazy[N];
void dfs(int node, int p)... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 738,485 | 738,486 | u287988203 | cpp |
p02936 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct node {
int point;
int qPoint;
bool kita;
vector<int> next;
};
void dfs(vector<node> &tree, int now, int ngo) {
if (tree[now].kita)
return;
tree[now].kita = 1;
tree[now].point = t... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct node {
int point;
int qPoint;
bool kita;
vector<int> next;
};
void dfs(vector<node> &tree, int now, int ngo) {
if (tree[now].kita)
return;
tree[now].kita = 1;
tree[now].point = t... | [
"assignment.value.change"
] | 738,512 | 738,513 | u386131832 | cpp |
p02936 | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
re... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
re... | [
"identifier.change",
"call.arguments.change"
] | 738,522 | 738,523 | u181719868 | cpp |
p02936 | #include <iostream>
#include <vector>
using Tree = std::vector<std::vector<uint32_t>>;
Tree V;
std::vector<uint32_t> values;
void Run(uint32_t i, uint32_t f, uint32_t sum) {
auto c = values[i];
values[i] += sum;
for (const auto &e : V[i]) {
if (e != f) {
Run(e, i, sum + c);
}
}
}
int main() {
... | #include <iostream>
#include <vector>
using Tree = std::vector<std::vector<uint32_t>>;
Tree V;
std::vector<uint32_t> values;
void Run(uint32_t i, uint32_t f, uint32_t sum) {
auto c = values[i];
values[i] += sum;
for (const auto &e : V[i]) {
if (e != f) {
Run(e, i, sum + c);
}
}
}
int main() {
... | [
"assignment.value.change"
] | 738,533 | 738,534 | u686041468 | cpp |
p02936 | // bismillahir rahmanir rahim //Author:Fayed Anik
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
/*
template <typename T> using ordered_set =
tree<T, null_type, less<T>, /// greater<T> fo... | // bismillahir rahmanir rahim //Author:Fayed Anik
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
/*
template <typename T> using ordered_set =
tree<T, null_type, less<T>, /// greater<T> fo... | [] | 738,550 | 738,551 | u769965655 | cpp |
p02936 | // bismillahir rahmanir rahim //Author:Fayed Anik
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
/*
template <typename T> using ordered_set =
tree<T, null_type, less<T>, /// greater<T> fo... | // bismillahir rahmanir rahim //Author:Fayed Anik
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
/*
template <typename T> using ordered_set =
tree<T, null_type, less<T>, /// greater<T> fo... | [
"call.arguments.change"
] | 738,552 | 738,551 | u769965655 | cpp |
p02936 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ... | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 738,556 | 738,557 | u047655753 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, r, n) for (ll i = r; i < n; i++)
#define debug(x) cout << #x << " = " << (x) << endl;
#define pb push_back
#define MOD 1000000007
//#de... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, r, n) for (ll i = r; i < n; i++)
#define debug(x) cout << #x << " = " << (x) << endl;
#define pb push_back
#define MOD 1000000007
//#de... | [
"call.add"
] | 738,570 | 738,571 | u521723672 | cpp |
p02936 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int V; //頂点数
int t[200010]; //親
vector<int> e[200010]; // iから出る辺
int d[200010];
int c[200010];
bool c_end[200010];
void count(int s) {
if (!c_end[s]) {
if (s == 1) {
c... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int V; //頂点数
int t[200010]; //親
vector<int> e[200010]; // iから出る辺
int d[200010];
int c[200010];
bool c_end[200010];
void count(int s) {
if (!c_end[s]) {
if (s == 1) {
c... | [] | 738,595 | 738,596 | u992779443 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, i... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, i... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 738,614 | 738,615 | u902149880 | cpp |
p02936 | //部分木に含まれる頂点を全て求めてしまえばよい
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> u(n);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
u[a - 1].push_back(b - 1);
u[b - ... | //部分木に含まれる頂点を全て求めてしまえばよい
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> u(n);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
u[a - 1].push_back(b - 1);
u[b - ... | [
"call.arguments.add",
"assignment.value.change"
] | 738,616 | 738,617 | u989345508 | cpp |
p02936 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int main() {
int n, q;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int main() {
int n, q;
... | [
"misc.opposites",
"assignment.value.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 738,633 | 738,634 | u467826805 | cpp |
p02936 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int main() {
int n, q;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int main() {
int n, q;
... | [
"misc.opposites",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 738,635 | 738,634 | u467826805 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
int ans[200005] = {}, memo[200005] = {};
vector<int> ab[200005];
void my(int now, int carry) {
ans[now] += carry;
for (auto i = ab[now].begin(); i != ab[now].end(); ++i) {
if (memo[*i] == 0) {
memo[*i] = 1;
my(*i, ans[now]);
}
}
}
int main(int a... | #include <bits/stdc++.h>
using namespace std;
int ans[200005] = {}, memo[200005] = {};
vector<int> ab[200005];
void my(int now, int carry) {
ans[now] += carry;
for (auto i = ab[now].begin(); i != ab[now].end(); ++i) {
if (memo[*i] == 0) {
memo[*i] = 1;
my(*i, ans[now]);
}
}
}
int main(int a... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 738,649 | 738,650 | u399987025 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int timer = 0;
vector<int> a[N], tin(N), tout(N);
long long ans[N + 5];
void dfs(int x, int p = -1) {
tin[x] = ++timer;
for (auto i : a[x])
if (i != p)
dfs(i, x);
tout[x] = timer;
}
int main() {
int n, q;
cin >> n >> q;
for (i... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int timer = 0;
vector<int> a[N], tin(N), tout(N);
long long ans[N + 5];
void dfs(int x, int p = -1) {
tin[x] = ++timer;
for (auto i : a[x])
if (i != p)
dfs(i, x);
tout[x] = timer;
}
int main() {
int n, q;
cin >> n >> q;
for (i... | [] | 738,687 | 738,688 | u971421535 | cpp |
p02936 | //
// main.cpp
// ABC
//
// Created by Amarsanaa Davaasuren on 2019/08/31.
// Copyright © 2019 Amarsanaa Davaasuren. All rights reserved.
//
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
class UnionFind {
public:
vector<int> Parent;
UnionFind(int... | //
// main.cpp
// ABC
//
// Created by Amarsanaa Davaasuren on 2019/08/31.
// Copyright © 2019 Amarsanaa Davaasuren. All rights reserved.
//
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
class UnionFind {
public:
vector<int> Parent;
UnionFind(int... | [] | 738,689 | 738,690 | u358748139 | cpp |
p02936 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
#define ll long long
#define ull unsigned long long
#define mod 1000000007
using namespace std;
struct node {
ll count;
vector<int> cNodes;
};
node nodes[200000];
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
#define ll long long
#define ull unsigned long long
#define mod 1000000007
using namespace std;
struct node {
ll count;
vector<int> cNodes;
};
node nodes[200000];
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 738,705 | 738,706 | u020230257 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
void dfs(vector<bool> &flag, int pos, vector<long long> &ans, int par,
vector<vector<int>> &tree) {
if (flag[pos])
return;
if (par != -1) {
ans[pos] += ans[par];
flag[pos] = true;
}
for (int i = 0; i < tree[pos].size(); i++) {
dfs(flag, tre... | #include <bits/stdc++.h>
using namespace std;
void dfs(vector<bool> &flag, int pos, vector<long long> &ans, int par,
vector<vector<int>> &tree) {
if (flag[pos])
return;
if (par != -1) {
ans[pos] += ans[par];
}
flag[pos] = true;
for (int i = 0; i < tree[pos].size(); i++) {
dfs(flag, tree[... | [] | 738,723 | 738,724 | u351265848 | cpp |
p02936 | #include <bits/stdc++.h>
using namespace std;
// counterの値を親から子に伝搬させる
void dfs(int vertex, int parent, vector<vector<int>> &Tree,
vector<int> &counter) {
//親のカウンターの値を足し合わせる
counter[vertex] += counter[parent];
//子に伝播させる
for (const int &nxtv : Tree[vertex]) {
if (nxtv == parent)
continue;
... | #include <bits/stdc++.h>
using namespace std;
// counterの値を親から子に伝搬させる
void dfs(int vertex, int parent, vector<vector<int>> &Tree,
vector<int> &counter) {
//親のカウンターの値を足し合わせる
counter[vertex] += counter[parent];
//子に伝播させる
for (const int &nxtv : Tree[vertex]) {
if (nxtv == parent)
continue;
... | [
"assignment.change"
] | 738,725 | 738,726 | u069450081 | cpp |
p02936 | //#include "stdafx.h"
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
/*----... | //#include "stdafx.h"
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
/*----... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 738,727 | 738,728 | u796408111 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.