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 |
|---|---|---|---|---|---|---|---|
p03043 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; i++)
#define rep(i, n) for (ll ... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; i++)
#define rep(i, n) for (ll ... | [] | 861,617 | 861,618 | u434662823 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | [
"io.output.change",
"call.arguments.add"
] | 861,628 | 861,629 | u721367699 | cpp |
p03043 | // Author:- Yatin Patel
// Mail:- yatinpatel.gt@gmail.com
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define FILEIN \
ifstream fin; \
fin.open("input.txt");
#define ... | // Author:- Yatin Patel
// Mail:- yatinpatel.gt@gmail.com
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define FILEIN \
ifstream fin; \
fin.open("input.txt");
#define ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,640 | 861,641 | u646513066 | cpp |
p03043 | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int N, K, j;
double a, count, ans = 0.0;
cin >> N >> K;
a = (1.0 / N);
for (int i = 1; i <= N; i++) {
if (i >= K) {
ans += a;
} else {
j = i;
count = 1.0;
while (j <= K) {
j *= 2.0;
count *= 0.5;
... | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int N, K, j;
double a, count, ans = 0.0;
cin >> N >> K;
a = (1.0 / N);
for (int i = 1; i <= N; i++) {
if (i >= K) {
ans += a;
} else {
j = i;
count = 1.0;
while (j < K) {
j *= 2.0;
count *= 0.5;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,655 | 861,656 | u780684946 | cpp |
p03043 | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int N, K, j;
double a, count, ans = 0.0;
cin >> N >> K;
a = (100.0 / N);
for (int i = 1; i <= N; i++) {
if (i >= K) {
ans += a;
} else {
j = i;
count = 1.0;
while (j <= K) {
j *= 2.0;
count *= 0.5... | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int N, K, j;
double a, count, ans = 0.0;
cin >> N >> K;
a = (1.0 / N);
for (int i = 1; i <= N; i++) {
if (i >= K) {
ans += a;
} else {
j = i;
count = 1.0;
while (j < K) {
j *= 2.0;
count *= 0.5;
... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,657 | 861,656 | u780684946 | cpp |
p03043 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll hituyou = 0;
ll N, K;
double kakuritu1, kakuritu_sum = 0;
cin >> N >> K;
for (ll i = 1; i <= N; i++) {
while (i * (int)pow(2.0, hituyou * 1.0) <= K)
hituyou++;
// cout<<hituyou<<endl;
kakuritu_sum += (1.0 / (... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll hituyou = 0;
ll N, K;
double kakuritu1, kakuritu_sum = 0;
cin >> N >> K;
for (ll i = 1; i <= N; i++) {
while (i * (int)pow(2.0, hituyou * 1.0) < K)
hituyou++;
// cout<<hituyou<<endl;
kakuritu_sum += (1.0 / (d... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,670 | 861,671 | u530497183 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
int main() {
int nn, k;
cin >> nn >> k;
long double ans = 0, a1 = 0;
ll n = 0, d = 1;
for (int i = 1; i <= nn; i++) {
int p = i, cc = 0, kk = 1;
while (p <= k) {
p = p * 2;
cc++;
kk = kk * 2;
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
int main() {
int nn, k;
cin >> nn >> k;
double ans = 0, a1 = 0;
ll n = 0, d = 1;
for (int i = 1; i <= nn; i++) {
int p = i, cc = 0, kk = 1;
while (p < k) {
p = p * 2;
cc++;
kk = kk * 2;
}
... | [
"variable_declaration.type.narrow.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,672 | 861,673 | u090794688 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / (b))
#define SORTG(v) sort(v.begin(), v.end(), greater<>())
#define SORT(v) sort(v.begin(), v.end())
#define ALL(v) (v).begin(), (v).end()
#define pb p... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / (b))
#define SORTG(v) sort(v.begin(), v.end(), greater<>())
#define SORT(v) sort(v.begin(), v.end())
#define ALL(v) (v).begin(), (v).end()
#define pb p... | [
"expression.operation.binary.add"
] | 861,678 | 861,679 | u635484372 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
double ans = 0;
for (int i = 1; i <= n; ++i) {
int tmp = i;
int flag = 0;
for (int j = 0; j < 20; ++j) {
if (tmp >= k) {
flag = j;
break;
}
tmp *= 2;
}
ans += 1.0 / (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
double ans = 0;
for (int i = 1; i <= n; ++i) {
int tmp = i;
int flag = 0;
for (int j = 0; j < 20; ++j) {
if (tmp >= k) {
flag = j;
break;
}
tmp *= 2;
}
ans += 1.0 / (... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,688 | 861,689 | u963610246 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0.0;
for (int i = 1; i <= n; ++i) {
if (i >= k) {
ans += (1.000000000 / n);
} else {
double j = log2(k / i);
ans += (1.000000000 / n) * (pow((0.500000000), ceil(j)));
}
}
printf("%... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0.0;
for (int i = 1; i <= n; ++i) {
if (i >= k) {
ans += (1.000000000 / n);
} else {
double j = log2(k) - log2(i);
ans += (1.000000000 / n) * (pow((0.500000000), ceil(j)));
}
}
pri... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 861,690 | 861,691 | u221811114 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,694 | 861,695 | u318785595 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main() {
ll N, K;
cin >> N >> K;
long double ans = 0;
for (ll i = 1; i <= N; i++) {
long double tmp = 1;
ll score = i;
while (score < K) {
score *= 2;
tmp /= 2;
}
ans += tmp;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main() {
ll N, K;
cin >> N >> K;
long double ans = 0;
for (ll i = 1; i <= N; i++) {
long double tmp = 1;
ll score = i;
while (score < K) {
score *= 2;
tmp /= 2;
}
ans += tmp;
}
... | [
"io.output.change"
] | 861,696 | 861,697 | u872581897 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
long double N, K;
cin >> N >> K;
long double ans = 0;
for (int i = 1; i <= N; i++) {
long double t = 1;
int j = i;
while (j < K) {
j = j * 2;
t = t / 2;
}
ans += t / N;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long double N, K;
cin >> N >> K;
long double ans = 0;
for (int i = 1; i <= N; i++) {
long double t = 1;
int j = i;
while (j < K) {
j = j * 2;
t = t / 2;
}
ans += t / N;
}
cout << setprecision(10) << ans << endl;
re... | [
"io.output.change"
] | 861,706 | 861,707 | u077536797 | cpp |
p03043 | #include <cmath>
#include <cstdint>
#include <cstdio>
int main(void) {
int n, k;
std::scanf("%d %d", &n, &k);
double prob = 0.0;
for (int i = 1; i <= n; i++) {
int point = i;
double prob_1 = 1.0 / n;
while (point < k) {
point *= 2;
prob_1 /= 2.0;
}
prob += prob_1;
}
print... | #include <cmath>
#include <cstdint>
#include <cstdio>
int main(void) {
int n, k;
std::scanf("%d %d", &n, &k);
double prob = 0.0;
for (int i = 1; i <= n; i++) {
int point = i;
double prob_1 = 1.0 / n;
while (point < k) {
point *= 2;
prob_1 /= 2.0;
}
prob += prob_1;
}
print... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,725 | 861,726 | u012646025 | cpp |
p03043 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
//#define sz(x) int((x).size())
// lcm = a*(b/gcd) least common multiple
// gcd: greatest common divisor
//
int gcd(int a, int b) {
if (a < b)
gcd(b, a);
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
in... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
//#define sz(x) int((x).size())
// lcm = a*(b/gcd) least common multiple
// gcd: greatest common divisor
//
int gcd(int a, int b) {
if (a < b)
gcd(b, a);
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
in... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,737 | 861,738 | u949755084 | cpp |
p03043 | #include <math.h>
#include <stdio.h>
int main() {
int i, j, N, K, count;
long double kakuritu = 0.0;
scanf("%d", &N);
scanf("%d", &K);
for (i = 1; i <= N; i++) {
count = 0;
j = i;
while (j < K) {
j *= 2;
count++;
}
kakuritu += 1.0 / ((double)N * pow(2, count));
}
print... | #include <math.h>
#include <stdio.h>
int main() {
int i, j, N, K, count;
double kakuritu = 0.0;
scanf("%d", &N);
scanf("%d", &K);
for (i = 1; i <= N; i++) {
count = 0;
j = i;
while (j < K) {
j *= 2;
count++;
}
kakuritu += 1.0 / ((double)N * pow(2, count));
}
printf("%.... | [
"variable_declaration.type.narrow.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,739 | 861,740 | u539916870 | cpp |
p03043 | #include <math.h>
#include <stdio.h>
int main() {
int i, j, N, K, count;
double kakuritu = 0.0;
scanf("%d", &N);
scanf("%d", &K);
for (i = 1; i <= N; i++) {
count = 0;
j = i;
while (j < K) {
j *= 2;
count++;
}
kakuritu += 1.0 / ((double)N * pow(2, count));
}
printf("%f... | #include <math.h>
#include <stdio.h>
int main() {
int i, j, N, K, count;
double kakuritu = 0.0;
scanf("%d", &N);
scanf("%d", &K);
for (i = 1; i <= N; i++) {
count = 0;
j = i;
while (j < K) {
j *= 2;
count++;
}
kakuritu += 1.0 / ((double)N * pow(2, count));
}
printf("%.... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,741 | 861,740 | u539916870 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
double sum = 0, p, tmp;
for (int i = 1; i <= n; i++) {
if (i > m) {
sum += 1;
} else {
tmp = ceil(log2((float)m / i));
sum += pow(2, (-1) * tmp);
}
}
cout << (sum / n);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
double sum = 0, p, tmp;
for (int i = 1; i <= n; i++) {
if (i > m) {
sum += 1;
} else {
tmp = ceil(log2((float)m / i));
sum += pow(2, (-1) * tmp);
}
}
cout << setprecision(10) << (sum / n);
}
| [
"io.output.change"
] | 861,742 | 861,743 | u576740505 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
float l = 0;
double ans = 0;
cin >> n >> k;
cout << setprecision(60);
for (int i = 1; i <= n; i++) {
double h = k / i;
double m = ceil(log2(h));
if (m <= 0) {
m = 1;
}
double j = 1 / pow(2, m);
if (k <= i... | #include <bits/stdc++.h>
using namespace std;
int main() {
float n, k;
float l = 0;
double ans = 0;
cin >> n >> k;
cout << setprecision(60);
for (int i = 1; i <= n; i++) {
double h = k / i;
double m = ceil(log2(h));
if (m <= 0) {
m = 1;
}
// cout<<h<<" "<<m<<endl;
double j... | [
"variable_declaration.type.primitive.change"
] | 861,747 | 861,748 | u449417320 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
float l = 0;
double ans = 0;
cin >> n >> k;
cout << setprecision(60);
for (int i = 1; i <= n; i++) {
double h = k / i;
double m = ceil(log2(h));
if (m <= 0) {
m = 1;
}
double j = 1 / pow(2, m);
if (k <= i... | #include <bits/stdc++.h>
using namespace std;
int main() {
float n, k;
float l = 0;
double ans = 0;
cin >> n >> k;
cout << setprecision(60);
for (int i = 1; i <= n; i++) {
double h = k / i;
double m = ceil(log2(h));
if (m <= 0) {
m = 1;
}
// cout<<h<<" "<<m<<endl;
double j... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change"
] | 861,749 | 861,748 | u449417320 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(0); ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,767 | 861,768 | u624688258 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long lld;
int main() {
std::ios::sync_with_stdio(false);
lld t = 1;
// cin >> t;
while (t--) {
lld n, k;
cin >> n >> k;
lld ans = -1;
vector<lld> deno;
for (lld i = 1; i <= n; i++) {
lld sc = i;
lld turn = 0;
while... | #include <bits/stdc++.h>
using namespace std;
typedef long long lld;
int main() {
std::ios::sync_with_stdio(false);
lld t = 1;
// cin >> t;
while (t--) {
lld n, k;
cin >> n >> k;
lld ans = -1;
vector<lld> deno;
for (lld i = 1; i <= n; i++) {
lld sc = i;
lld turn = 0;
while... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,774 | 861,775 | u915533570 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, k;
scanf("%lf %lf", &n, &k);
double ans = 0, i = 1;
for (i = 1; i <= n; i++) {
if (i >= k) {
ans += 1;
continue;
}
int len = log2(k / i) + 1;
ans += 1 / pow(2, len);
}
ans /= n;
printf("%1.12lf", ans);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double n, k;
scanf("%lf %lf", &n, &k);
double ans = 0, i = 1;
for (i = 1; i <= n; i++) {
if (i >= k) {
ans += 1;
continue;
}
int len = log2((k - 1) / i) + 1;
ans += 1 / pow(2, len);
}
ans /= n;
printf("%1.12lf", an... | [
"call.arguments.change"
] | 861,780 | 861,781 | u790553153 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
double ans = 0;
for (size_t i = 1; i <= a; i++) {
int counter = 0;
int j = i;
while (j <= b) {
j *= 2;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
double ans = 0;
for (size_t i = 1; i <= a; i++) {
int counter = 0;
int j = i;
while (j < b) {
j *= 2;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,786 | 861,787 | u315685304 | cpp |
p03043 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long double N, K;
cin >> N;
cin >> K;
long double sum = 0;
for (long double i = 1; i <= N; i++) {
long double count = 0;
while (i * pow(2, count) <= ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
double N, K;
cin >> N;
cin >> K;
double sum = 0;
for (double i = 1; i <= N; i++) {
double count = 0;
while (i * pow(2, count) <= K - 1)
count++... | [
"variable_declaration.type.narrow.change"
] | 861,807 | 861,808 | u998203751 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j, b;
long double p = 0.0;
cin >> n >> k;
for (i = 1; i <= n; i++) {
b = i;
for (j = 0; b <= k; j++)
b *= 2;
p += ((long double)1 / (long double)n) *
((long double)1 / (long double)pow(2, j));
}
cout << setpr... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j, b;
long double p = 0.0;
cin >> n >> k;
for (i = 1; i <= n; i++) {
b = i;
for (j = 0; b < k; j++)
b *= 2;
p += ((long double)1 / (long double)n) *
((long double)1 / (long double)pow(2, j));
}
cout << setpre... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 861,812 | 861,813 | u408650734 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define range(i, n, ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define range(i, n, ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 861,823 | 861,824 | u991974907 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldbl;
typedef pair<int, int> pii;
typedef pair<uint, uint> puu;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<double, double> pdd;
typedef vector<int> vi... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldbl;
typedef pair<int, int> pii;
typedef pair<uint, uint> puu;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<double, double> pdd;
typedef vector<int> vi... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 861,825 | 861,826 | u840905163 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double temp, count, sum = 0;
for (int i = 1; i <= N; i++) {
temp = i;
count = 1;
while (temp < K) {
temp *= 2;
count *= 2;
}
sum += 1 / count;
// cout<<count<<endl;
}
cout << sum / N <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double temp, count, sum = 0;
for (int i = 1; i <= N; i++) {
temp = i;
count = 1;
while (temp < K) {
temp *= 2;
count *= 2;
}
sum += 1 / count;
// cout<<count<<endl;
}
cout << setprecisi... | [
"io.output.change"
] | 861,827 | 861,828 | u977554186 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int n, k;
cin >> n >> k;
double a[n + 1];
a[0] = 0;
for (int i = 1; i <= n; i++) {
if (i >= k) {
a[i] = 1.0 / n;
continue;
}
int x = (int)log2(k / i) + 1;
a[i] = pow(0.5, x) / n;
}
double ans = 0... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int n, k;
cin >> n >> k;
double a[n + 1];
a[0] = 0;
for (int i = 1; i <= n; i++) {
if (i >= k) {
a[i] = 1.0 / n;
continue;
}
int x = (int)log2((k - 1) / i) + 1;
a[i] = pow(0.5, x) / n;
}
double a... | [
"call.arguments.change"
] | 861,833 | 861,834 | u313766957 | cpp |
p03043 | #include <cstdio>
using namespace std;
int n, k;
double expo(double a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a;
double half = expo(a, b / 2);
half = (half * half);
if (b & 1)
half = half * a;
return half;
}
int main() {
scanf("%d%d", &n, &k);
double ans = 0;
for (int i = 1; ... | #include <cstdio>
#include <iostream>
using namespace std;
int n, k;
double expo(double a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a;
double half = expo(a, b / 2);
half = (half * half);
if (b & 1)
half = half * a;
return half;
}
int main() {
scanf("%d%d", &n, &k);
double ans = 0... | [
"import.add",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 861,835 | 861,836 | u853418842 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, k, ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
int now = i;
double temp = 1 / n;
while (now < k) {
now *= 2;
temp /= 2;
}
ans += temp;
}
printf("%f\n", ans);
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double n, k, ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
int now = i;
double temp = 1 / n;
while (now < k) {
now *= 2;
temp /= 2;
}
ans += temp;
}
printf("%.10f\n", ans);
return (0);
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,841 | 861,842 | u912752743 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define ppi pair<pii, int>
#define pip pair<int, pii>
#define pdd pair<double, double>
#define f first
#define s second
#define MOD 1000000007
#defin... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define ppi pair<pii, int>
#define pip pair<int, pii>
#define pdd pair<double, double>
#define f first
#define s second
#define MOD 1000000007
#defin... | [
"literal.number.change",
"io.output.change"
] | 861,843 | 861,844 | u146724119 | cpp |
p03043 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#includ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,845 | 861,846 | u614497125 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double ld;
ll inv(ll a, ll b) { return (a > 1 ? b - inv(b % a, a) * b / a : 1); }
#define rc(s) return cout << s, 0
#define fi first
#define se second
#define L (nod << 1)
#define R (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double ld;
ll inv(ll a, ll b) { return (a > 1 ? b - inv(b % a, a) * b / a : 1); }
#define rc(s) return cout << s, 0
#define fi first
#define se second
#define L (nod << 1)
#define R (... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,847 | 861,848 | u360501542 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double p = 0;
int x = 1;
for (int i = N; i > 0; i--) {
while (x < 1.0 * K / i) {
x *= 2;
}
p += 1.0 / x;
}
cout << 1.0 * p / N << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double p = 0;
int x = 1;
for (int i = N; i > 0; i--) {
while (x < 1.0 * K / i) {
x *= 2;
}
p += 1.0 / x;
}
cout << setprecision(15) << 1.0 * p / N << endl;
return 0;
}
| [
"io.output.change"
] | 861,882 | 861,883 | u269804060 | cpp |
p03043 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#... | [
"io.output.change"
] | 861,886 | 861,887 | u679071005 | cpp |
p03043 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define lol long long
int main() {
double N, K;
cin >> N >> K;
double ans = 0.0;
for (int i = 1; i <= N; i++) {
int count = 0;
if (i >= K) {
ans ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define lol long long
int main() {
double N, K;
cin >> N >> K;
double ans = 0.0;
for (int i = 1; i <= N; i++) {
int count = 0;
if (i >= K) {
ans ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,890 | 861,891 | u086366728 | cpp |
p03043 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
//定義場所//
int i, j, k, l, m, n;
double W, N, K;
////////////
int main() {
cin >> N >> K;
double ans = 0;
for (i = 1; i <= N; i++) {
double A = 1 / N;
int score = i;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
//定義場所//
int i, j, k, l, m, n;
double W, N, K;
////////////
int main() {
cin >> N >> K;
double ans = 0;
for (i = 1; i <= N; i++) {
double A = 1 / N;
int score = i;
... | [
"io.output.change"
] | 861,892 | 861,893 | u916974091 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
typedef long long int lli;
typedef pair<int, int> P;
int main() {
lli n, k;
cin >> n >> k;
lli num;
lli bunbo;
double ans = 0;
for (lli i = 1; i < n + 1; i++) {
// i が出たとき
num = i;
bunbo = 1;
whil... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
typedef long long int lli;
typedef pair<int, int> P;
int main() {
lli n, k;
cin >> n >> k;
lli num;
lli bunbo;
double ans = 0;
for (lli i = 1; i < n + 1; i++) {
// i が出たとき
num = i;
bunbo = 1;
whil... | [
"io.output.change"
] | 861,894 | 861,895 | u058297300 | cpp |
p03043 | #include <algorithm>
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
double sum = 0;
for (int i = 1; i < n + 1; i++) {
int i2 = i;
for (int j = 0; j < 20; j++) {
if (k <= i) {
sum += pow(2, 20 - j);
j += 114514;
}
... | #include <algorithm>
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
double sum = 0;
for (int i = 1; i < n + 1; i++) {
int i2 = i;
for (int j = 0; j < 20; j++) {
if (k <= i) {
sum += pow(2, 20 - j);
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,902 | 861,903 | u942393279 | cpp |
p03043 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
double n, k, m, cnt;
cin >> n >> k;
double ans;
for (int i = 1; i <= n; i++) {
m = i;
cnt = 0;
if (i >= k) {
ans += 1 / n;
continue;
}
while (m * 2 <= k) {
m *= 2;
cnt++;
}
cnt+... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
double n, k, m, cnt;
cin >> n >> k;
double ans;
for (int i = 1; i <= n; i++) {
m = i;
cnt = 0;
if (i >= k) {
ans += 1 / n;
continue;
}
while (m * 2 < k) {
m *= 2;
cnt++;
}
cnt++... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,906 | 861,907 | u620735210 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | [
"expression.operation.binary.add"
] | 861,910 | 861,911 | u319234342 | cpp |
p03043 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e10;
const int MOD = 1e9 + 7;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define SANKOU(n, a, b) cout << ((n) ? (#a) : (#b... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e10;
const int MOD = 1e9 + 7;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define SANKOU(n, a, b) cout << ((n) ? (#a) : (#b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,914 | 861,915 | u070600790 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
// __builtin_popcount
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
double n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
if (i > k) {
ans += 1.0 / n;
continue;
}
ans += (1.0 / n) *
(1.0 /
... | #include <bits/stdc++.h>
using namespace std;
// __builtin_popcount
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long double n, k;
cin >> n >> k;
long double ans = 0;
for (int i = 1; i <= n; i++) {
if (i >= k) {
ans += 1.0 / n;
continue;
}
ans +=
(1.0 / n) *
... | [
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 861,916 | 861,917 | u170407818 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
double res = 0;
for (int i = 1; i <= n; ++i) {
if (i >= k... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
double res = 0;
for (int i = 1; i <= n; ++i) {
if (i >= k... | [
"call.arguments.change"
] | 861,920 | 861,921 | u536580583 | cpp |
p03043 | /*
*/
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <complex>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#in... | /*
*/
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <complex>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#in... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,922 | 861,923 | u806695213 | cpp |
p03043 | /*
____________________________________________________________
| |
| Author: ay2306 |
|____________________________________________________________|
*/
#include <bits/stdc++.h>
// For ordered_set
#include <ext/pb_d... | /*
____________________________________________________________
| |
| Author: ay2306 |
|____________________________________________________________|
*/
#include <bits/stdc++.h>
// For ordered_set
#include <ext/pb_d... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,924 | 861,925 | u669067427 | cpp |
p03043 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cassert>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <std... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cassert>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <std... | [
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,926 | 861,927 | u545022164 | cpp |
p03044 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | [
"call.arguments.change",
"call.arguments.add"
] | 861,933 | 861,934 | u489823438 | cpp |
p03044 | #include <iostream>
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
class EdgeInfo {
public:
EdgeInfo(int cap) : cap_(cap), orig_cap_(cap) {}
int cap_;
int orig_cap_;
};
class Edge {
public:
Edge(unsigned int s, unsigned int t, EdgeInfo ei) : s_(s), t_(t), ei_(ei) {}
unsigned in... | #include <iostream>
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
class EdgeInfo {
public:
EdgeInfo(int cap) : cap_(cap), orig_cap_(cap) {}
int cap_;
int orig_cap_;
};
class Edge {
public:
Edge(unsigned int s, unsigned int t, EdgeInfo ei) : s_(s), t_(t), ei_(ei) {}
unsigned in... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 861,943 | 861,944 | u306805217 | cpp |
p03044 | // Even Relation
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i, x, y) for (ll i = x; i < y; i++)
#define nvarep(n, a) \
ll n; \
... | // Even Relation
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i, x, y) for (ll i = x; i < y; i++)
#define nvarep(n, a) \
ll n; \
... | [
"control_flow.branch.if.condition.change"
] | 861,945 | 861,946 | u663842230 | cpp |
p03044 | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
// using Graph = vector<vector<int>>;
... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
// using Graph = vector<vector<int>>;
... | [
"literal.number.change",
"call.arguments.change"
] | 861,977 | 861,978 | u665871498 | cpp |
p03044 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"identifier.change",
"call.arguments.change"
] | 861,981 | 861,982 | u809967037 | cpp |
p03044 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, ll> P;
struct edge {
int to, cost;
};
vector<edge> G[100005];
bool used[100005];
int ans[100005];
int main() {
ios::sync_... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, ll> P;
struct edge {
int to, cost;
};
vector<edge> G[100005];
bool used[100005];
int ans[100005];
int main() {
ios::sync_... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 861,998 | 861,999 | u190018920 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to, d;
};
using Graph = vector<vector<edge>>;
int main() {
int N;
cin >> N;
Graph G(N);
for (int i = 0; i < N - 1; i++) {
int u, v, w;
cin >> u >> v >> w;
u--;
v--;
edge e = {v, w};
G[u].push_back(e);
edge E = {u, w};
... | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to, d;
};
using Graph = vector<vector<edge>>;
int main() {
int N;
cin >> N;
Graph G(N);
for (int i = 0; i < N - 1; i++) {
int u, v, w;
cin >> u >> v >> w;
u--;
v--;
edge e = {v, w};
G[u].push_back(e);
edge E = {u, w};
... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 862,010 | 862,011 | u101018317 | cpp |
p03044 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, L... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, L... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 862,025 | 862,024 | u637983859 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#defin... | [
"expression.operation.binary.add"
] | 862,046 | 862,047 | u225581241 | cpp |
p03044 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = l... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = l... | [
"expression.operation.binary.remove"
] | 862,050 | 862,051 | u026620445 | cpp |
p03044 | #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<vector<int>> g;
vector<vector<int>> gw;
vector<int> gc;
int f(int x, int c, int o = -1) {
gc.at(x) = c;
rep(i, g.at(x).size()) {
if (g.at(x).at(i) == o)
co... | #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<vector<int>> g;
vector<vector<int>> gw;
vector<int> gc;
int f(int x, int c, int o = -1) {
gc.at(x) = c;
rep(i, g.at(x).size()) {
if (g.at(x).at(i) == o)
co... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 862,059 | 862,060 | u945901686 | cpp |
p03044 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
vi color;
void dfs(int v, vector<vector<pair<int, int>>> &edge, int x) {
if (color[v] != -1) {
return;
}
color[v] = x % 2;
... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
vi color;
void dfs(int v, vector<vector<pair<int, int>>> &edge, int x) {
if (color[v] != -1) {
return;
}
color[v] = x % 2;
... | [
"call.arguments.change"
] | 862,079 | 862,080 | u802434195 | cpp |
p03044 | /*
* atcoder/abc126/d.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (ll __x = __start; __x < __end; __x++)
template <class T>... | /*
* atcoder/abc126/d.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (ll __x = __start; __x < __end; __x++)
template <class T>... | [
"expression.operation.binary.add"
] | 862,085 | 862,086 | u823862638 | cpp |
p03044 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 862,101 | 862,102 | u806999568 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
const ll MAXN = 1e5 + 5;
vector<vector<pair<ll, ll>>> adj(MAXN, vector<pair<ll, ll>>());
vector<ll> c(MAXN);
void dfs(ll u, ll p) {
for (auto edge : adj[u]) {
ll to = edge.first;
ll len = edge.second;
if (... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
const ll MAXN = 1e5 + 5;
vector<vector<pair<ll, ll>>> adj(MAXN, vector<pair<ll, ll>>());
vector<ll> c(MAXN);
void dfs(ll u, ll p) {
for (auto edge : adj[u]) {
ll to = edge.first;
ll len = edge.second;
if (... | [
"control_flow.branch.if.condition.change"
] | 862,117 | 862,118 | u929156598 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
void dfs(vector<vector<pair<int, int>>> &graph, vector<int> &ans, int now,
int parent, int color) {
ans.at(now) = color;
for (int i = 0; i < graph.at(now).size(); i++) {
int next = graph.at(now).at(i).first;
if (next == ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
void dfs(vector<vector<pair<int, int>>> &graph, vector<int> &ans, int now,
int parent, int color) {
ans.at(now) = color;
for (int i = 0; i < graph.at(now).size(); i++) {
int next = graph.at(now).at(i).first;
if (next == ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 862,133 | 862,134 | u618649215 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii ve... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii ve... | [] | 862,174 | 862,175 | u682820318 | cpp |
p03044 | //
// main.cpp
// test130
//
// Created by on 2019/06/16.
// Copyright © 2 All rights reserved.
//
//
// main.cpp
// new
//
// Created on 2019/06/09.
// Copyright All rights reserved.
//
// C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This fi... | //
// main.cpp
// test130
//
// Created by on 2019/06/16.
// Copyright © 2 All rights reserved.
//
//
// main.cpp
// new
//
// Created on 2019/06/09.
// Copyright All rights reserved.
//
// C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This fi... | [
"assignment.add"
] | 862,178 | 862,179 | u943070796 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll... | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll... | [
"identifier.change",
"call.arguments.change"
] | 862,202 | 862,203 | u377907412 | cpp |
p03044 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <new>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <new>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 862,220 | 862,221 | u121734488 | cpp |
p03044 | //----AUTHOR:kkdrummer----/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> P;
#define X real()
#define Y imag()
ld restant(P p) { return ab... | //----AUTHOR:kkdrummer----/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> P;
#define X real()
#define Y imag()
ld restant(P p) { return ab... | [
"assignment.add"
] | 862,251 | 862,252 | u452240501 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
using lli = long long int;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, co... | #include <bits/stdc++.h>
using namespace std;
using lli = long long int;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, co... | [
"literal.number.type.widen.change"
] | 862,263 | 862,264 | u720447689 | cpp |
p03044 | #include <iostream>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
vector<int> colour;
vector<vector<pair<int, int>>> G;
void dfs(int num, int parent) {
for (auto item : G[num]) {
if (item.first == parent)
continue;
if (item.second) {
col... | #include <iostream>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
vector<int> colour;
vector<vector<pair<int, int>>> G;
void dfs(int num, int parent) {
for (auto item : G[num]) {
if (item.first == parent)
continue;
if (item.second) {
col... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 862,279 | 862,280 | u806657856 | cpp |
p03044 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | [
"expression.operation.binary.add"
] | 862,294 | 862,295 | u700484101 | cpp |
p03044 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | [
"expression.operation.binary.add"
] | 862,296 | 862,297 | u700484101 | cpp |
p03044 | #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 <... | [
"expression.operation.binary.remove"
] | 862,305 | 862,306 | u221285045 | cpp |
p03044 | #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 <... | [
"expression.operation.binary.add"
] | 862,308 | 862,306 | u221285045 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
vector<pair<int, int>> G[N];
vector<int> C(N);
vector<bool> seen(N);
int n;
void dfs(int now, int pre) {
seen[now] = true;
for (int i = 0; i < G[now].size(); i++) {
int to = G[now][i].first;
if (to == pre or seen[to])
continue;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
vector<pair<int, int>> G[N];
vector<int> C(N);
vector<bool> seen(N);
int n;
void dfs(int now, int pre) {
seen[now] = true;
for (int i = 0; i < G[now].size(); i++) {
int to = G[now][i].first;
if (to == pre or seen[to])
continue;
... | [
"identifier.change",
"call.arguments.change"
] | 862,309 | 862,310 | u136869985 | cpp |
p03044 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
using namespace std;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
long modpow(long a, long n, long mod) {
long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
using namespace std;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
long modpow(long a, long n, long mod) {
long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;... | [
"expression.operation.binary.add"
] | 862,321 | 862,322 | u216491514 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
#define mem(dp, a) memset(dp, a, sizeof dp)
#define ninja \
ios_base::sync_with_stdio(false); \
cin.tie(NUL... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
#define mem(dp, a) memset(dp, a, sizeof dp)
#define ninja \
ios_base::sync_with_stdio(false); \
cin.tie(NUL... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.unary.add",
"identifier.replace.add",
"literal.replace.remove"
] | 862,323 | 862,324 | u504940906 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define revrepeat(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n)... | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define revrepeat(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n)... | [
"call.function.change"
] | 862,333 | 862,334 | u765690804 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define revrepeat(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n)... | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define revrepeat(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n)... | [
"expression.operation.binary.add"
] | 862,335 | 862,336 | u765690804 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define revrepeat(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n)... | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define revrepeat(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n)... | [
"expression.operation.binary.add"
] | 862,337 | 862,336 | u765690804 | cpp |
p03044 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
/* (=＾o＾=) */
#define int ll
/* macro ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
/* (=＾o＾=) */
#define int ll
/* macro ... | [
"expression.operation.binary.add"
] | 862,343 | 862,344 | u715750943 | cpp |
p03044 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
vector<pii> g[100005];
int z[100005];
void dfs(int x, int p) {
for (pii i : g[x])
if (i.first != p) {
if (i.secon... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
vector<pii> g[100005];
int z[100005];
void dfs(int x, int p) {
for (pii i : g[x])
if (i.first != p) {
if (i.secon... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 862,364 | 862,365 | u151855078 | cpp |
p03044 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, i... | [
"expression.operation.binary.remove"
] | 862,389 | 862,390 | u115838990 | cpp |
p03044 | /**
* Title:
* Url:
*/
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int n;
cin >... | /**
* Title:
* Url:
*/
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int n;
cin >... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 862,397 | 862,398 | u036744414 | cpp |
p03044 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"literal.number.change"
] | 862,406 | 862,407 | u698883164 | cpp |
p03044 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; --i)
using ll = long long;
static const ll mod... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 862,408 | 862,407 | u698883164 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
typedef pair<int, int> P;
vector<int> l(N + 1);
vector<vector<P>> vw(N + 1);
rep(i, N - 1) {
int u, v, w;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
typedef pair<int, int> P;
vector<int> l(N + 1);
vector<vector<P>> vw(N + 1);
rep(i, N - 1) {
int u, v, w;
... | [
"identifier.change",
"io.output.change"
] | 862,452 | 862,453 | u821284362 | cpp |
p03044 | #include "bits/stdc++.h"
using namespace std;
using lint = long long;
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, n) for (int i = int(n); i >= 0; --i)
#define all(vec) (vec).begin(), (vec).end()
#define cend printf("\n");
#define prique(T) priority_q... | #include "bits/stdc++.h"
using namespace std;
using lint = long long;
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, n) for (int i = int(n); i >= 0; --i)
#define all(vec) (vec).begin(), (vec).end()
#define cend printf("\n");
#define prique(T) priority_q... | [
"assignment.add",
"assignment.value.change",
"identifier.change"
] | 862,455 | 862,456 | u054475353 | cpp |
p03044 | #include "bits/stdc++.h"
using namespace std;
using lint = long long;
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, n) for (int i = int(n); i >= 0; --i)
#define all(vec) (vec).begin(), (vec).end()
#define cend printf("\n");
#define prique(T) priority_q... | #include "bits/stdc++.h"
using namespace std;
using lint = long long;
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, n) for (int i = int(n); i >= 0; --i)
#define all(vec) (vec).begin(), (vec).end()
#define cend printf("\n");
#define prique(T) priority_q... | [
"assignment.add",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 862,457 | 862,456 | u054475353 | cpp |
p03044 | // confilm 0LL and 1LL
// confilm cornercases such as 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecVec = vector<Vec>;
#define REP(i, m, n) for (ll(i) = (m); (i)... | // confilm 0LL and 1LL
// confilm cornercases such as 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecVec = vector<Vec>;
#define REP(i, m, n) for (ll(i) = (m); (i)... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 862,460 | 862,461 | u997368585 | cpp |
p03044 | #include <bits/stdc++.h>
using namespace std;
vector<vector<pair<int, int>>> tree;
vector<int> col;
void dfs(int current, int c) {
col.at(current) = c;
for (pair<int, int> e : tree.at(current)) {
int to = e.first;
if (col.at(to) != -1)
continue;
int dist = e.second;
if (dist % 2 == 0) {
... | #include <bits/stdc++.h>
using namespace std;
vector<vector<pair<int, int>>> tree;
vector<int> col;
void dfs(int current, int c) {
col.at(current) = c;
for (pair<int, int> e : tree.at(current)) {
int to = e.first;
if (col.at(to) != -1)
continue;
int dist = e.second;
if (dist % 2 == 0) {
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 862,471 | 862,472 | u048904090 | cpp |
p03044 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 100005;
//頂点番号と距離を記録したい.
/*
方針
rootから見ていく。親との距離が偶数なら同じ色、違うなら違う色を塗れば
よさそう。それで任意の組み合わせについて条件が達成されるが...?
λ関数でdfsを実装するのは理由がわからないけど無理そう。なので外部に.
*/
vector<P> ale[MAX... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 100005;
//頂点番号と距離を記録したい.
/*
方針
rootから見ていく。親との距離が偶数なら同じ色、違うなら違う色を塗れば
よさそう。それで任意の組み合わせについて条件が達成されるが...?
λ関数でdfsを実装するのは理由がわからないけど無理そう。なので外部に.
*/
vector<P> ale[MAX... | [
"expression.operation.binary.add"
] | 862,475 | 862,476 | u480887263 | cpp |
p03044 | #include <iostream>
#include <vector>
using namespace std;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
Graph G;
vector<int> d; // d[i]根から頂点iまでの距離
void Dfs(int v, int parent) {
for (auto e : G[v]) {
if (e.first == parent)
continue; // 逆流を防ぐ(探索の肝！)
d[e.first] = d[v] + e.second;
D... | #include <iostream>
#include <vector>
using namespace std;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
Graph G;
vector<int> d; // d[i]根から頂点iまでの距離
void Dfs(int v, int parent) {
for (auto e : G[v]) {
if (e.first == parent)
continue; // 逆流を防ぐ(探索の肝！)
d[e.first] = d[v] + e.second;
D... | [] | 862,487 | 862,488 | u774438048 | cpp |
p03044 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define MAX_N 100000
int N;
pair<vector<int>, vector<long int>> G[MAX_N];
vector<int> d(MAX_N);
vector<int> color(MAX_N);
void input() {
cin >> N;
REP(i, N - 1) {
int s, t, u;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define MAX_N 100000
int N;
pair<vector<int>, vector<long int>> G[MAX_N];
vector<int> d(MAX_N);
vector<int> color(MAX_N);
void input() {
cin >> N;
REP(i, N - 1) {
int s, t, u;
... | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"call.arguments.change"
] | 862,496 | 862,497 | u754909749 | cpp |
p03044 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
vector<pair<int, int>> edg[100003];
int main() {
... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
vector<pair<int, int>> edg[100003];
int main() {
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 862,504 | 862,505 | u843522325 | cpp |
p03043 | #include <bits/stdc++.h>
#define mov(i, a, b) for (int i = a; i < b; i++)
#define MOD 1000000007
#define INF 1e9 + 5
typedef long long ll;
using namespace std;
bool isPowerOfTwo(ll n) { return (ceil(log2(n)) == floor(log2(n))); }
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if... | #include <bits/stdc++.h>
#define mov(i, a, b) for (int i = a; i < b; i++)
#define MOD 1000000007
#define INF 1e9 + 5
typedef long long ll;
using namespace std;
bool isPowerOfTwo(ll n) { return (ceil(log2(n)) == floor(log2(n))); }
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if... | [
"assignment.value.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 862,506 | 862,507 | u527398664 | cpp |
p03043 | #include "bits/stdc++.h"
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double answer = 0;
for (int i = 1; i <= N; i++) {
if (i > K) {
answer += 1;
continue;
}
int n;
n = ceil(log(K / i) / log(2));
answer += pow(0.5, n);
}
answer /= N;
cout << answer << endl... | #include "bits/stdc++.h"
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double answer = 0;
for (int i = 1; i <= N; i++) {
if (i > K) {
answer += 1;
continue;
}
int n;
n = ceil(log(K / i) / log(2));
answer += pow(0.5, n);
}
answer /= N;
cout << setprecision(1... | [
"io.output.change"
] | 862,513 | 862,512 | u436976004 | cpp |
p03043 | #include "bits/stdc++.h"
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double answer = 0;
for (int i = 1; i <= N; i++) {
if (i > K) {
answer += 1;
continue;
}
int n;
n = ceil(log(K / i) / log(2));
answer += pow(0.5, n);
}
answer /= N;
cout << answer << endl... | #include "bits/stdc++.h"
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double answer = 0;
for (int i = 1; i <= N; i++) {
if (i > K) {
answer += 1;
continue;
}
int n;
n = ceil(log(K / i) / log(2));
answer += pow(0.5, n);
}
answer /= N;
cout << setprecision(1... | [
"io.output.change"
] | 862,513 | 862,514 | u436976004 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.