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 <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1'000'000'007
using ll = long long;
using namespa... | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1'000'000'007
using ll = long long;
using namespa... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,038 | 861,039 | u324303263 | cpp |
p03043 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define FORSTEP(i, start, end, step) for (int i = start... | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define FORSTEP(i, start, end, step) for (int i = start... | [
"expression.operation.binary.add"
] | 861,040 | 861,041 | u324303263 | cpp |
p03043 | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double rate = 0.0;
for (int i = 1; i < n; i++) {
double temp = 1.0 / double(n);
int now = i;
while (now < k) {
now *= 2;
temp /= 2.0;
}
rate += temp;
}
cou... | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double rate = 0.0;
for (int i = 1; i <= n; i++) {
double temp = 1.0 / double(n);
int now = i;
while (now < k) {
now *= 2;
temp /= 2.0;
}
rate += temp;
}
co... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 861,042 | 861,043 | u947304300 | cpp |
p03043 | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef vector<pair<int, int>> vpi;
int n, k;
void r... | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef vector<pair<int, int>> vpi;
int n, k;
void r... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"io.output.change",
"expression.operation.binary.remove"
] | 861,052 | 861,050 | u519883882 | cpp |
p03043 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double ans = 0;
for (int i = 1; i <= N; i++) {
int point = i;
double probability = 1.0 / N;
while (point < K) {
point *=... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double ans = 0;
for (int i = 1; i <= N; i++) {
int point = i;
double probability = 1.0 / N;
while (point < K) {
point *=... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,053 | 861,054 | u582357587 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double prob = 0.0;
for (int i = 1; i <= n; i++) {
int point = i;
double p = 1.0;
while (point < k) {
point *= 2;
p *= 0.5;
}
prob += p;
}
prob /= n;
cout << prob << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double prob = 0.0;
for (int i = 1; i <= n; i++) {
int point = i;
double p = 1.0;
while (point < k) {
point *= 2;
p *= 0.5;
}
prob += p;
}
prob /= n;
cout << setprecision(20) << prob <<... | [
"io.output.change"
] | 861,069 | 861,070 | u756514276 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
double win = 0;
int times;
int ii;
for (int i = 1; i <= N; i++) {
ii = i;
times = 0;
while (ii < K) {
times += 1;
ii *= 2;
}
win += 1 / pow(2, times);
}
cout << win / N << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
double win = 0;
int times;
int ii;
for (int i = 1; i <= N; i++) {
ii = i;
times = 0;
while (ii < K) {
times += 1;
ii *= 2;
}
win += 1 / pow(2, times);
}
cout << setprecision(12) << wi... | [
"io.output.change"
] | 861,073 | 861,074 | u636279017 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,083 | 861,084 | u219508174 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int check(int a, int k) {
int res = 0;
while (a <= k) {
a *= 2;
res++;
}
return res;
}
int main(int argc, const char *argv[]) {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int check(int a, int k) {
int res = 0;
while (a < k) {
a *= 2;
res++;
}
return res;
}
int main(int argc, const char *argv[]) {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"variable_declaration.type.primitive.change"
] | 861,087 | 861,088 | u432194969 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int MOD = (int)1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
double prob = 0.0;
rep(i, n) {
int point = i + 1;
double buf = 1.0 / n;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int MOD = (int)1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
double prob = 0.0;
rep(i, n) {
int point = i + 1;
double buf = 1.0 / n;
... | [
"io.output.change"
] | 861,089 | 861,090 | u494379309 | cpp |
p03043 | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <iostream>
#include <map> // pair
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
ll n, k;
long double sum = 0.0;
cin >> n >> k;
for (int i = 1; i <... | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <iostream>
#include <map> // pair
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
ll n, k;
long double sum = 0.0;
cin >> n >> k;
for (int i = 1; i <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,093 | 861,094 | u276796245 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double sum = 0;
for (int i = 1; i <= n; i++) {
double ans = 1 / n;
int now = i;
while (now < k) {
now *= 2;
ans /= 2;
}
sum += ans;
}
printf("%.12f\n", sum);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double sum = 0;
for (int i = 1; i <= n; i++) {
double ans = 1.0 / n;
int now = i;
while (now < k) {
now *= 2;
ans /= 2;
}
sum += ans;
}
printf("%.12f\n", sum);
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 861,101 | 861,102 | u370447425 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int K;
cin >> K;
double ans = 0;
for (int i = 0; i < N; i++) {
double H = 1;
while ((i + 1) * H < K)
H *= 2;
H = 1 / H;
ans += H;
}
printf("ans : %.12f", ans / N);
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int K;
cin >> K;
double ans = 0;
for (int i = 0; i < N; i++) {
double H = 1;
while ((i + 1) * H < K)
H *= 2;
H = 1 / H;
ans += H;
}
printf("%.12f", ans / N);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,111 | 861,112 | u281840563 | cpp |
p03043 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long n, k;
long double sum = 0;
cin >> n >> k;
for (long long i = 1; i <= n; i++) {
long long y = i, count1 = 0;
long double d = 1;
while ((y) < k) {
y = y * 2;
d = d * 1 / (pow(0.5, 1));
}
sum = ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long n, k;
double sum = 0;
cin >> n >> k;
for (long long i = 1; i <= n; i++) {
long long y = i, count1 = 0;
double d = 1;
while ((y) < k) {
y = y * 2;
d = d * 1 / (pow(0.5, 1));
}
sum = sum + (1 /... | [
"variable_declaration.type.narrow.change"
] | 861,119 | 861,120 | u188903786 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <random>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <random>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) ... | [
"variable_declaration.type.widen.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 861,135 | 861,136 | u419390395 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <random>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <random>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) ... | [
"variable_declaration.type.widen.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change"
] | 861,137 | 861,136 | u419390395 | cpp |
p03043 | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | [
"io.output.change"
] | 861,138 | 861,139 | u419390395 | cpp |
p03043 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double ret = 0;
for (int i = 1; i <= N; i++) {
double tmp = 1.0 / N;
int now = i;
while (now < K) {
now *= 2;
tmp /= 2;
}
... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double ret = 0;
for (int i = 1; i <= N; i++) {
double tmp = 1.0 / N;
int now = i;
while (now < K) {
now *= 2;
tmp /= 2;
}
... | [
"io.output.change"
] | 861,148 | 861,149 | u661461084 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
double f(double K, double i, double n) {
if (K < i) {
// cout << n << endl;
return n;
}
n++;
f(K, i * 2, n);
}
int main() {
// ifstream in("data1.txt");
// cin.rdbuf(in.rdbuf())... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
double f(double K, double i, int n) {
if (K <= i) {
return n;
}
n++;
f(K, i * 2, n);
}
int main() {
double N;
double K;
cin >> N >> K;
double ans;
for (double i = N; i >= 1; i... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,150 | 861,151 | u154650168 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
double f(double K, double i, double n) {
if (K < i) {
// cout << n << endl;
return n;
}
n++;
f(K, i * 2, n);
}
int main() {
// ifstream in("data1.txt");
// cin.rdbuf(in.rdbuf())... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
double f(double K, double i, double n) {
if (K <= i) {
return n;
}
n++;
f(K, i * 2, n);
}
int main() {
// ifstream in("data1.txt");
// cin.rdbuf(in.rdbuf());
double N;
double K;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,150 | 861,152 | u154650168 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int a = i;
double p = 1.0 / n;
while (a < k)
a *= 2, p /= 2;
ans += p;
}
cout << ans << endl;
return... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int a = i;
double p = 1.0 / n;
while (a < k)
a *= 2, p /= 2;
ans += p;
}
cout << setprecision(9) << ans... | [
"io.output.change"
] | 861,155 | 861,156 | u781095600 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define ALL(x) (x).begin(), (x).end()
const long long MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define ALL(x) (x).begin(), (x).end()
const long long MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
int ... | [
"expression.operation.unary.reference.add"
] | 861,159 | 861,160 | u615258936 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N;
int K;
cin >> N;
cin >> K;
double ans = 0;
double syoki = 1 / N;
for (int i = 1; i <= N; i++) {
double an = 1;
int p = i;
while (p < K) {
an = an * 0.5;
p = p * 2;
}
an = an * syoki;
ans = ans + an;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N;
int K;
cin >> N;
cin >> K;
double ans = 0;
double syoki = 1 / N;
for (int i = 1; i <= N; i++) {
double an = 1;
int p = i;
while (p < K) {
an = an * 0.5;
p = p * 2;
}
an = an * syoki;
ans = ans + an;
... | [
"io.output.change"
] | 861,161 | 861,162 | u439333767 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define rd(x) scanf("%d", &x)
#define rd2(x, y) scanf("%d %d", &x, &y)
#define rl(x) scanf("%lld", &x)
#define rl2(x, y) scanf("%ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define rd(x) scanf("%d", &x)
#define rd2(x, y) scanf("%d %d", &x, &y)
#define rl(x) scanf("%lld", &x)
#define rl2(x, y) scanf("%ll... | [] | 861,165 | 861,166 | u431615124 | cpp |
p03043 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1e9 + 7;
const int larg = 1e5;
typedef pair<int, int> P;
typedef long long ll;
int main() {
double N, K;
double prob = 0;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
double temp = 1.0 / N;
... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1e9 + 7;
const int larg = 1e5;
typedef pair<int, int> P;
typedef long long ll;
int main() {
double N, K;
double prob = 0;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
double temp = 1.0 / N;
... | [
"io.output.change"
] | 861,167 | 861,168 | u554988565 | cpp |
p03043 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Joy
*/
#include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < (N); ++i)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define PB push_back
#define MP make_pair
using namespace std;
typedef long l... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Joy
*/
#include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < (N); ++i)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define PB push_back
#define MP make_pair
using namespace std;
typedef long l... | [
"expression.operation.binary.add"
] | 861,177 | 861,178 | u408053343 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
double prob;
int score;
for (int i = 1; i <= n; i++) {
score = i;
prob = 1.0 / n;
while (score < k) {
score *= 2;
prob /= 2;
}
ans += prob;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
double prob;
int score;
for (int i = 1; i <= n; i++) {
score = i;
prob = 1.0 / n;
while (score < k) {
score *= 2;
prob /= 2;
}
ans += prob;
}
// printf("%.12f\n",ans);
c... | [
"io.output.change"
] | 861,179 | 861,180 | u045575753 | cpp |
p03043 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define endl '\n'
#define x first
#define y second
#define int long long
#define double long double
#define all(a) (a).begin(), (a).end()
#define ar vector
#define vse(a) a.begin(), a.end()
#ifdef LOCAL
#define dbg(x) cout << #x << " ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define endl '\n'
#define x first
#define y second
#define int long long
#define double long double
#define all(a) (a).begin(), (a).end()
#define ar vector
#define vse(a) a.begin(), a.end()
#ifdef LOCAL
#define dbg(x) cout << #x << " ... | [
"type_conversion.add"
] | 861,181 | 861,182 | u157759251 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define double float
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define maxn 15
signed main() {
int N, K;
cin >> N >> K;
double ans = 0;
for (int i = 1; i <= N; i++) {
double x = 0;
if (i < K... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define maxn 15
signed main() {
int N, K;
cin >> N >> K;
double ans = 0;
for (int i = 1; i <= N; i++) {
double x = 0;
if (i < K) {
x = ceil(lo... | [
"literal.number.change",
"io.output.change"
] | 861,187 | 861,188 | u568545273 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double ans = 0;
for (int i = 1; i <= N; i++) {
int x = i;
double y = 1 / N;
while (x < K) {
x *= 2;
y /= 2.0;
}
ans += y;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double ans = 0;
for (int i = 1; i <= N; i++) {
int x = i;
double y = 1 / N;
while (x < K) {
x *= 2;
y /= 2.0;
}
ans += y;
}
cout << setprecision(15) << ans << endl;
} | [
"io.output.change"
] | 861,189 | 861,190 | u835534008 | cpp |
p03043 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int f(int x, int y) {
if (x >= y)
return 0;
return 1 + f(x * 2, y);
}
int n, k, x, ans1, ans2;
int main(void) {
cin >> n >> k;
x = f(1, k);
ans2 = n * (1 << x);
for (int i = 1; i <= n; i++) {
ans1 += (1 << (x - f(i, k)));
}
cout <... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int f(int x, int y) {
if (x >= y)
return 0;
return 1 + f(x * 2, y);
}
int n, k, x, ans1, ans2;
int main(void) {
cin >> n >> k;
x = f(1, k);
ans2 = n * (1 << x);
for (int i = 1; i <= n; i++) {
ans1 += (1 << (x - f(i, k)));
}
cout <... | [
"call.function.change",
"io.output.change"
] | 861,191 | 861,192 | u050428930 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double sum = 0.0;
int cnt = 0;
for (double i = 1; i <= N; i++) {
double now = i;
while (now <= K) {
now = now * 2;
cnt++;
}
sum += (1.0 / N) * pow(0.5, cnt);
cnt = 0;
}
cout << fixed <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double sum = 0;
double cnt = 0;
for (double i = 1; i <= N; i++) {
int now = i;
while (now < K) {
now = now * 2;
cnt++;
}
sum += (1.0 / N) * pow(0.5, cnt);
cnt = 0;
}
cout << fixed << se... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,195 | 861,196 | u764860452 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double sum = 0.0;
double cnt = 0;
for (double i = 1; i <= N; i++) {
double now = i;
while (now <= K) {
now = now * 2;
cnt++;
}
sum += (1.0 / N) * pow(0.5, cnt);
cnt = 0;
}
cout << fixed... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double sum = 0;
double cnt = 0;
for (double i = 1; i <= N; i++) {
int now = i;
while (now < K) {
now = now * 2;
cnt++;
}
sum += (1.0 / N) * pow(0.5, cnt);
cnt = 0;
}
cout << fixed << se... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"io.output.change"
] | 861,197 | 861,196 | u764860452 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double sum = 0;
double cnt = 0;
for (int i = 1; i <= N; i++) {
int now = i;
while (now <= K) {
now = now * 2;
cnt++;
}
sum += (1.0 / N) * pow(0.5, cnt);
cnt = 0;
}
cout << fixed << setp... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double sum = 0;
double cnt = 0;
for (double i = 1; i <= N; i++) {
int now = i;
while (now < K) {
now = now * 2;
cnt++;
}
sum += (1.0 / N) * pow(0.5, cnt);
cnt = 0;
}
cout << fixed << se... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.number.change",
"io.output.change"
] | 861,198 | 861,196 | u764860452 | cpp |
p03043 | // abc139_b
// #include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
double sum = 0.0;
for (int i = 1; i <= N; i++) {
int t = i;
double e = 0;
while (t <= K) {
t *= 2;
e++;
}
// cout << i <... | // abc139_b
// #include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
double sum = 0.0;
for (int i = 1; i <= N; i++) {
int t = i;
double e = 0;
while (t < K) {
t *= 2;
e++;
}
// cout << i <<... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,202 | 861,203 | u798557584 | cpp |
p03043 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double n;
double k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i < n + 1; i++) {
int score = i;
double p = 1;
while (score <= k) {
score = score * 2;
p *= 0.5;
}
ans += (1 / (n * ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double n;
double k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i < n + 1; i++) {
int score = i;
double p = 1;
while (score < k) {
score = score * 2;
p *= 0.5;
}
ans += (1 / (n * 1... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,209 | 861,210 | u698571659 | cpp |
p03043 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double n;
double k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i < n + 1; i++) {
int score = i;
double p = 1;
while (score <= k) {
score = score * 2;
p *= 0.5;
}
ans += (1 / (n * ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double n;
double k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i < n + 1; i++) {
int score = i;
double p = 1;
while (score < k) {
score = score * 2;
p *= 0.5;
}
ans += (1 / (n * 1... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,211 | 861,210 | u698571659 | cpp |
p03043 | #include <algorithm>
#include <bitset>
#include <cassert>
#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>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#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>
#includ... | [
"call.add",
"expression.operation.binary.change"
] | 861,212 | 861,213 | u585670083 | 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++) {
// 現在の得点が既にK以上の場合、勝つ確率を計算し加える
if (i >= K) {
ans += (double)(1.0 / (double)N);
continue;
}
int num_coin_wins = 0;
for (int j = i; j <= K; j... | #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++) {
// 現在の得点が既にK以上の場合、勝つ確率を計算し加える
if (i >= K) {
ans += (double)(1.0 / (double)N);
continue;
}
int num_coin_wins = 0;
for (int j = i; j <= K - ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,216 | 861,217 | u553129408 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
int main() {
int n, k;
cin >> n >> k;
double ans = 0.0;
// if(n > k)
// {
// vector<... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
int main() {
int n, k;
cin >> n >> k;
double ans = 0.0;
vector<int> count;
for (int i = 1;... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 861,220 | 861,221 | u115819033 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
int main() {
int n, k;
cin >> n >> k;
double ans = 0.0;
// if(n > k)
// {
// vector<... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
int main() {
int n, k;
cin >> n >> k;
double ans = 0.0;
// if(n > k)
// {
// vector<... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 861,220 | 861,222 | u115819033 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double sum = 0;
for (int i = 1; i <= N; i++) {
int cnt = 0;
int i_copy = i;
while (i_copy < K) {
i_copy *= 2;
cnt++;
}
sum += pow(0.5, cnt);
}
sum /= N;
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double sum = 0;
for (int i = 1; i <= N; i++) {
int cnt = 0;
int i_copy = i;
while (i_copy < K) {
i_copy *= 2;
cnt++;
}
sum += pow(0.5, cnt);
}
sum /= N;
cout << setprecision(11) << sum << e... | [
"io.output.change"
] | 861,231 | 861,232 | u426572476 | cpp |
p03043 | #include <cmath>
#include <stdio.h>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
double ans = 0.0;
for (int i = 1; i <= n; i++) {
if (i >= k) {
ans += 1.0 / n;
} else {
ans += pow(0.5, ceil(log2((double)(k / i)))) / n;
}
}
printf("%.12f", ans);
}
| #include <cmath>
#include <stdio.h>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
double ans = 0.0;
for (int i = 1; i <= n; i++) {
if (i >= k) {
ans += 1.0 / n;
} else {
ans += pow(0.5, ceil(log2(k / (double)i))) / n;
}
}
printf("%.12f", ans);
} | [
"call.arguments.add",
"call.arguments.change"
] | 861,239 | 861,240 | u652037179 | cpp |
p03043 | #include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
int N, K;
void solve() {
double ans = 0.0;
for (int i = 1; i < N + 1; i++) {
if (i >= K) {
ans += (double)1.0 / (double)N;
} else {
ans += (double)1.0 / (double)N *
pow((double)1.0 / 2.... | #include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
int N, K;
void solve() {
double ans = 0.0;
for (int i = 1; i < N + 1; i++) {
if (i >= K) {
ans += (double)1.0 / (double)N;
} else {
ans += (double)1.0 / (double)N *
pow((double)1.0 / 2.... | [
"io.output.change"
] | 861,241 | 861,242 | u036744414 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
const long long mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int count = 0;
int x = i;
while (true) {
if (x < k) {
x = x << 1;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
const long long mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int count = 0;
int x = i;
while (true) {
if (x < k) {
x = x << 1;
... | [
"io.output.change"
] | 861,263 | 861,264 | u207048881 | cpp |
p03043 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int N, K;
double solve() {
double result = 0;
for (double num = 1; num <= N; num++) {
double q;
for (q = 0;; q++)
if (pow(2, q) >= (double)K / num)
break;
result += pow(0.5, q);
}
return result * (1 / (double... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int N, K;
double solve() {
double result = 0;
for (double num = 1; num <= N; num++) {
double q;
for (q = 0;; q++)
if (pow(2, q) >= (double)K / num)
break;
result += pow(0.5, q);
}
return result * (1 / (double... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,271 | 861,272 | u141938981 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int point = 0;
int n, k;
double sum = 0;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
double tem = 1.0 / n;
point = i;
while (point < k) {
point *= 2;
tem /= 2;
}
sum += tem;
}
cout << sum << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int point = 0;
int n, k;
double sum = 0;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
double tem = 1.0 / n;
point = i;
while (point < k) {
point *= 2;
tem /= 2;
}
sum += tem;
}
cout << setprecision(12) <<... | [
"io.output.change"
] | 861,278 | 861,279 | u616053863 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define intv vector<v>
#define llv vector<long long>
#define intvv vector<vector<int>>
#define llvv vector<vector<long long>>
using namespace s... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define intv vector<v>
#define llv vector<long long>
#define intvv vector<vector<int>>
#define llvv vector<vector<long long>>
using namespace s... | [
"function.return_value.change"
] | 861,287 | 861,285 | u379440427 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define intv vector<v>
#define llv vector<long long>
#define intvv vector<vector<int>>
#define llvv vector<vector<long long>>
using namespace s... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define intv vector<v>
#define llv vector<long long>
#define intvv vector<vector<int>>
#define llvv vector<vector<long long>>
using namespace s... | [
"function.return_value.change",
"literal.string.change",
"call.arguments.change"
] | 861,288 | 861,285 | u379440427 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define intv vector<v>
#define llv vector<long long>
#define intvv vector<vector<int>>
#define llvv vector<vector<long long>>
using namespace s... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define intv vector<v>
#define llv vector<long long>
#define intvv vector<vector<int>>
#define llvv vector<vector<long long>>
using namespace s... | [
"function.return_value.change",
"literal.string.change",
"call.arguments.change"
] | 861,289 | 861,285 | u379440427 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define intv vector<v>
#define llv vector<long long>
#define intvv vector<vector<int>>
#define llvv vector<vector<long long>>
using namespace s... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define intv vector<v>
#define llv vector<long long>
#define intvv vector<vector<int>>
#define llvv vector<vector<long long>>
using namespace s... | [
"identifier.change",
"call.function.change"
] | 861,290 | 861,285 | u379440427 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i < n + 1; i++) {
double count = 0;
bool ok = true;
int j = i;
while (ok) {
if (j < k) {
j = j * 2;
count++;
} else if (j >= k) {
double z... | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i < n + 1; i++) {
double count = 0;
bool ok = true;
int j = i;
while (ok) {
if (j < k) {
j = j * 2;
count++;
} else if (j >= k) {
double z... | [
"io.output.change"
] | 861,297 | 861,298 | u800100718 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
int main() {
int n, k, a;
double prob = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
a = i;
for (int j = 0; j <= 20; j++) {
... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
int main() {
int n, k, a;
double prob = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
a = i;
for (int j = 0; j <= 20; j++) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,299 | 861,300 | u687204015 | cpp |
p03043 | // g++ -I ~/Documents/programming/cppLib -std=gnu++14 -o test
// ~/Documents/programming/cppLib/test.cpp && ./test && rm test
#include <bits/stdc++.h>
using namespace std;
template <typename T> using vector2 = vector<vector<T>>;
template <typename T> using vector3 = vector<vector2<T>>;
template <typename T> using vecto... | // g++ -I ~/Documents/programming/cppLib -std=gnu++14 -o test
// ~/Documents/programming/cppLib/test.cpp && ./test && rm test
#include <bits/stdc++.h>
using namespace std;
template <typename T> using vector2 = vector<vector<T>>;
template <typename T> using vector3 = vector<vector2<T>>;
template <typename T> using vecto... | [
"io.output.change"
] | 861,301 | 861,302 | u151724181 | cpp |
p03043 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define ra... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < n; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define ra... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 861,303 | 861,304 | u767543103 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int N, K;
int main() {
cin >> N >> K;
int l = 1, h = N;
float ans = 0;
for (int i = 1; i <= N; i++) {
int n = i;
float r = 1;
while (n < K) {
r /= 2;
n *= 2;
}
ans += r;
}
cout << std::setprecision(20) << ans / N << endl;
} | #include <bits/stdc++.h>
using namespace std;
int N, K;
int main() {
cin >> N >> K;
int l = 1, h = N;
long double ans = 0;
for (int i = 1; i <= N; i++) {
int n = i;
long double r = 1;
while (n < K) {
r /= 2;
n *= 2;
}
ans += r;
}
cout << std::setprecision(20) << ans / N <<... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 861,307 | 861,308 | u957084285 | cpp |
p03043 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K, calc, cnt;
cin >> N >> K;
double ans;
ans = 0;
for (int i = 1; i <= N; i++) {
calc = i;
cnt = 0;
while (calc < K) {
calc = calc * 2;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K, calc, cnt;
cin >> N >> K;
double ans;
ans = 0;
for (int i = 1; i <= N; i++) {
calc = i;
cnt = 0;
while (calc < K) {
calc = calc * 2;
... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 861,312 | 861,313 | u752013826 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#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);
double N, K;
cin >> N >> K;
double sub = 0;
for (int i = 1; i <= N; i... | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#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);
double N, K;
cin >> N >> K;
double sub = 0;
for (int i = 1; i <= N; i... | [
"io.output.change"
] | 861,316 | 861,317 | u892438699 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long p = 0;
for (int i = 1; i <= n; i++) {
/* code */
long long first = 1.0 / n;
int sum = i;
while (sum < k) {
/* code */
sum *= 2;
first /= 2.0;
}
p += first;
}
cout << setpr... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double p = 0;
for (int i = 1; i <= n; i++) {
/* code */
double first = 1.0 / n;
int sum = i;
while (sum < k) {
/* code */
sum *= 2;
first /= 2.0;
}
p += first;
}
cout << setprecisio... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 861,318 | 861,319 | u376859266 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long p = 0;
for (int i = 1; i <= n; i++) {
/* code */
long long first = 1.0 / n;
int sum = i;
while (sum < k) {
/* code */
sum *= 2;
first /= 2.0;
}
p += first;
}
cout << setpr... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double p = 0;
for (int i = 1; i <= n; i++) {
/* code */
double first = 1.0 / n;
int sum = i;
while (sum < k) {
/* code */
sum *= 2;
first /= 2.0;
}
p += first;
}
cout << setprecisio... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"io.output.change"
] | 861,320 | 861,319 | u376859266 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double p = 0;
for (int i = 1; i <= n; i++) {
/* code */
double first = 1.0 / n;
int sum = i;
while (sum < k) {
/* code */
sum *= 2;
first /= 2.0;
}
p += first;
}
cout << p << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double p = 0;
for (int i = 1; i <= n; i++) {
/* code */
double first = 1.0 / n;
int sum = i;
while (sum < k) {
/* code */
sum *= 2;
first /= 2.0;
}
p += first;
}
cout << setprecisio... | [
"io.output.change"
] | 861,321 | 861,319 | u376859266 | cpp |
p03043 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define RFOR(i, a, b) for (int i = (b)-1, i##_min = (a); i >= i##_min; --i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define ALL(obj) (obj).begin... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define RFOR(i, a, b) for (int i = (b)-1, i##_min = (a); i >= i##_min; --i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define ALL(obj) (obj).begin... | [
"io.output.change"
] | 861,322 | 861,323 | u220997159 | cpp |
p03043 | /*
Problem : https://atcoder.jp/contests/abc126/tasks/abc126_c
Algorithm : math
Status :
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
int n, k;
double ans;
int main() ... | /*
Problem : https://atcoder.jp/contests/abc126/tasks/abc126_c
Algorithm : math
Status :
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
int n, k;
double ans;
int main() ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,324 | 861,325 | u090150453 | cpp |
p03043 | /*
Problem : https://atcoder.jp/contests/abc126/tasks/abc126_c
Algorithm : math
Status :
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
int n, k;
double ans;
int main() ... | /*
Problem : https://atcoder.jp/contests/abc126/tasks/abc126_c
Algorithm : math
Status :
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
int n, k;
double ans;
int main() ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,326 | 861,325 | u090150453 | cpp |
p03043 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, k;
long double sum, ans;
ans = 0.0;
cin >> n >> k;
for (long long i = 1; i <= n; i++) {
long double tmp = 1.0 / n;
sum = i;
while (sum <= k) {
sum *= 2.0;
tmp /= 2.0;
}
a... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, k;
long double ans;
ans = 0.0;
cin >> n >> k;
for (long long i = 1; i <= n; i++) {
long double tmp = 1.0 / n;
int sum = i;
while (sum < k) {
sum *= 2.0;
tmp /= 2.0;
}
ans... | [
"variable_declaration.remove",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,327 | 861,328 | u607288620 | cpp |
p03043 | #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
double k;
cin >> n >> k;
double ans = 0;
rep(i, n) {
int detame = i + 1;
double kakuritu = 1;
while (detame < k) {
detame *= 2;
kakuri... | #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
double k;
cin >> n >> k;
double ans = 0;
rep(i, n) {
int detame = i + 1;
double kakuritu = 1;
while (detame < k) {
detame *= 2;
kakuri... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 861,329 | 861,330 | u118875091 | cpp |
p03043 | #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
double k;
cin >> n >> k;
double ans = 0;
rep(i, n) {
int detame = i + 1;
double kakuritu = 1;
while (detame < k) {
detame *= 2;
kakuri... | #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
double k;
cin >> n >> k;
double ans = 0;
rep(i, n) {
int detame = i + 1;
double kakuritu = 1;
while (detame < k) {
detame *= 2;
kakuri... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.change"
] | 861,331 | 861,330 | u118875091 | cpp |
p03043 | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
double sum = 0;
double temp;
double p;
for (int i = 1; i <= n; i++) {
temp = 1.0 / n;
p = i;
while (p <= k) {
p *= 2;
temp /= 2;
}
... | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
double sum = 0;
double temp;
double p;
for (int i = 1; i <= n; i++) {
temp = 1.0 / n;
p = i;
while (p < k) {
p *= 2;
temp /= 2;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,332 | 861,333 | u460737328 | cpp |
p03043 | // https://atcoder.jp/contests/abc126/tasks/abc126_c
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
double n, k;
cin >> n >> k;
double answer = 0.0;
for (int i = 1; i <= n; i++) {
double this_prob = 1.0 / n;
int this_score = i;
whi... | // https://atcoder.jp/contests/abc126/tasks/abc126_c
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
double n, k;
cin >> n >> k;
double answer = 0.0;
for (int i = 1; i <= n; i++) {
double this_prob = 1.0 / n;
int this_score = i;
whi... | [
"io.output.change"
] | 861,348 | 861,349 | u673273726 | cpp |
p03043 | // https://atcoder.jp/contests/abc126/tasks/abc126_c
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
float n, k;
cin >> n >> k;
float answer = 0.0f;
for (int i = 1; i <= n; i++) {
float this_prob = 1.0 / n;
int this_score = i;
while... | // https://atcoder.jp/contests/abc126/tasks/abc126_c
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
double n, k;
cin >> n >> k;
double answer = 0.0;
for (int i = 1; i <= n; i++) {
double this_prob = 1.0 / n;
int this_score = i;
whi... | [
"variable_declaration.type.primitive.change"
] | 861,350 | 861,349 | u673273726 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#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 ALL(x) x.begin(), x.end()
#define REVERSE(x) reverse(x.begin(), x.end())
typedef long long LL;
const... | #include <bits/stdc++.h>
using namespace std;
#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 ALL(x) x.begin(), x.end()
#define REVERSE(x) reverse(x.begin(), x.end())
typedef long long LL;
const... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,351 | 861,352 | u709810602 | cpp |
p03043 | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
double answer = 0;
for (int i = 0; i < N; i++) {
long long score = i + 1;
double tmp = 1;
while (score < K) {
tmp /= 2;
score *= 2;
}
answer += tmp;
}
cout << setprecision(16) << answer ... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
double answer = 0;
for (int i = 0; i < N; i++) {
long long score = i + 1;
double tmp = 1.0 / N;
while (score < K) {
tmp /= 2;
score *= 2;
}
answer += tmp;
}
cout << setprecision(16) << a... | [
"literal.number.change"
] | 861,357 | 861,358 | u422592877 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double sum = 0;
for (int i = 1; i < n + 1; i++) {
double d = 1.0 / n;
for (int j = i; j < k; j *= 2) {
d *= 0.5;
}
sum += d;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double sum = 0;
for (int i = 1; i < n + 1; i++) {
double d = 1.0 / n;
for (int j = i; j < k; j *= 2) {
d *= 0.5;
}
sum += d;
}
cout << setprecision(10) << sum << endl;
} | [
"io.output.change"
] | 861,361 | 861,362 | u440248708 | cpp |
p03043 |
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N, K, now;
double c = 1, d = 0;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
now = i;
while (now < K) {
now *= 2;
c /= 2;
}
d += c / N;
c == 1;
}
cout << setprecision(12) << d;
}
| #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N, K, now;
double c = 1, d = 0;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
now = i;
while (now < K) {
now *= 2;
c /= 2;
}
d += c / N;
c = 1;
}
cout << setprecision(12) << d;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 861,373 | 861,374 | u220403681 | cpp |
p03043 | #include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n, k, i = 1;
double a, b, c;
cin >> n >> k;
a = 1 / (double)n;
for (int i = 1; i <= n; i++) {
int x = 0, p = i;
while (p <= k) {
p *= 2;
x++;
}
c = ... | #include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n, k, i = 1;
double a, b, c;
cin >> n >> k;
a = 1 / (double)n;
for (int i = 1; i <= n; i++) {
int x = 0, p = i;
while (p < k) {
p *= 2;
x++;
}
c = p... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,375 | 861,376 | u454003145 | cpp |
p03043 | #include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n, k, i = 1;
double a, b, c;
cin >> n >> k;
a = 1 / (double)n;
for (int i = 1; i <= n; i++) {
int x = 0, p = i;
while (p <= k) {
p *= 2;
x++;
}
c =... | #include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n, k, i = 1;
double a, b, c;
cin >> n >> k;
a = 1 / (double)n;
for (int i = 1; i <= n; i++) {
int x = 0, p = i;
while (p < k) {
p *= 2;
x++;
}
c = p... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,377 | 861,376 | u454003145 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
double sum = 0;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
int x = 0; //指数
int y = i;
bool a = true;
while (a) {
if (y < K) {
y *= 2;
x++;
} else {
a = false;
sum += (1.0 / N) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
double sum = 0;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
int x = 0; //指数
int y = i;
bool a = true;
while (a) {
if (y < K) {
y *= 2;
x++;
} else {
a = false;
sum += (1.0 / N) ... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 861,382 | 861,383 | u422506696 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const ll N = 1e5 + 5, MOD = 1e9 + 7;
double n, k;
double ans;
ll power(ll x, ll y) {
ll res = 1;
while (y > 0) {
if (y & 1)
res *= x;
y = y >> 1;
x *= x;
}
return res;
}
int main() {
ios_base::sync_wi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define double long double
const ll N = 1e5 + 5, MOD = 1e9 + 7;
double n, k;
double ans;
ll power(ll x, ll y) {
ll res = 1;
while (y > 0) {
if (y & 1)
res *= x;
y = y >> 1;
x *= x;
}
return res;
}
int ma... | [
"literal.number.change",
"io.output.change"
] | 861,390 | 861,391 | u769602639 | cpp |
p03043 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
double a = 1.0 / n;
int tmp = i;
while (tmp <= k) {
tmp *= 2;
a /= 2;
}
ans += a;
}
cout << fixed << setprecision(12) << a... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
double a = 1.0 / n;
int tmp = i;
while (tmp < k) {
tmp *= 2;
a /= 2;
}
ans += a;
}
cout << fixed << setprecision(12) << an... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,392 | 861,393 | u479371430 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define rep(n) for (int i = 0; i < n; i += 1)
#define prarr(a, n) rep(n) cout << a[i] << endl printf("%s\n", " ");
#define sc(a) scanf("%d", &a);
#define scl(a) scanf("%lld",... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define rep(n) for (int i = 0; i < n; i += 1)
#define prarr(a, n) rep(n) cout << a[i] << endl printf("%s\n", " ");
#define sc(a) scanf("%d", &a);
#define scl(a) scanf("%lld",... | [] | 861,394 | 861,395 | u943072121 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define lson l, mid, id << 1
#define rson mid + 1, r, id << 1 | 1
#define ls id << 1
#define rs id << 1 | 1
#define MID(l, r) (((l) + (r)) >> 1)
const int MOD = (int)1e9 + 7;
const double eps = (double)1e-8;
const int m... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define lson l, mid, id << 1
#define rson mid + 1, r, id << 1 | 1
#define ls id << 1
#define rs id << 1 | 1
#define MID(l, r) (((l) + (r)) >> 1)
const int MOD = (int)1e9 + 7;
const double eps = (double)1e-8;
const int m... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,408 | 861,409 | u682322833 | cpp |
p03043 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).beg... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).beg... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,413 | 861,414 | u786453831 | cpp |
p03043 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
long double func1(long double a, long double b) {
long double ret = 0;
while (1) {
if (a < b) {
a = a * 2;
ret++;
} else
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
long double func1(long double a, long double b) {
long double ret = 0;
while (1) {
if (a < b) {
a = a * 2;
ret++;
} else
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 861,415 | 861,416 | u180436681 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
int64_t v = std::pow(10, 10);
int main(void) {
int64_t n, k;
std::cin >> n >> k;
auto GetCount = [&](int64_t i) {
int64_t coun... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
int64_t v = std::pow(10, 10);
int main(void) {
int64_t n, k;
std::cin >> n >> k;
auto GetCount = [&](int64_t i) {
int64_t coun... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 861,419 | 861,420 | u100280611 | cpp |
p03043 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double base = 1 / (double)n;
double cur = 2;
double tot = 0;
for (int i = n; i >= 1; i--) {
if (i >= k)
tot += base;
else {
while (i * cur <= k) {
cur *= 2;
}... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double base = 1 / (double)n;
double cur = 2;
double tot = 0;
for (int i = n; i >= 1; i--) {
if (i >= k)
tot += base;
else {
while (i * cur < k) {
cur *= 2;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,421 | 861,422 | u563397131 | cpp |
p03043 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double base = 1 / (double)n;
double cur = 2;
double tot = 0;
for (int i = n; i >= 1; i--) {
if (i >= k)
tot += base;
else {
if (i * cur <= k)
cur *= 2;
tot +=... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double base = 1 / (double)n;
double cur = 2;
double tot = 0;
for (int i = n; i >= 1; i--) {
if (i >= k)
tot += base;
else {
while (i * cur < k) {
cur *= 2;
}
... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,423 | 861,422 | u563397131 | cpp |
p03043 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <s... | [
"io.output.change"
] | 861,464 | 861,465 | u952843849 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(), a.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(), a.end()
#defin... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 861,474 | 861,475 | u665172861 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(), a.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long int LL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(), a.end()
#defin... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change",
"control_flow.loop.for.condition.change"
] | 861,476 | 861,475 | u665172861 | cpp |
p03043 | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
double n, k, ans = 0, p;
cin >> n >> k;
int i = 1, point = 1;
for (p = 1.0 / n; i <= n; p = 1.0 / n, i++, point = i) {
while (point < k)
point <<= 1;
p *= 1 / 2.0;
ans += p;
}
cout << setprecision(15) << ans << endl;
... | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
double n, k, ans = 0, p;
cin >> n >> k;
int i = 1, point = 1;
for (p = 1.0 / n; i <= n; p = 1.0 / n, i++, point = i) {
while (point < k)
point <<= 1, p *= 1 / 2.0;
ans += p;
}
cout << setprecision(15) << ans << endl;
re... | [] | 861,483 | 861,484 | u612175324 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define INFTY (1 << 30);
typedef long long ll;
int main(void) {
ll N, K;
double prob = 0.0;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
if (i >= K) {
prob += (1.0 / (double)N) * ((double)N - (double)i + 1.0);
break;
}
double res_log = (d... | #include <bits/stdc++.h>
using namespace std;
#define INFTY (1 << 30);
typedef long long ll;
int main(void) {
ll N, K;
double prob = 0.0;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
if (i >= K) {
prob += (1.0 / (double)N) * ((double)N - (double)i + 1.0);
break;
}
double res_log = (d... | [
"io.output.change"
] | 861,490 | 861,491 | u869091859 | cpp |
p03043 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
long double xyz(int n) {
long double ans = 1;
for (int i = 0; i < n; i++) {
ans /= 2.0;
}
return ans;
}
int abc(int n, int k) {
int tmp = n;
int cnt = 0;
while (tmp... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
long double xyz(int n) {
long double ans = 1;
for (int i = 0; i < n; i++) {
ans /= 2.0;
}
return ans;
}
int abc(int n, int k) {
int tmp = n;
int cnt = 0;
while (tmp... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,508 | 861,509 | u419383010 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double p = 1.0 / N;
double sum = 0;
for (double i = 1; i <= N; i++) {
for (double j = 1; j < 20; j++) {
if (i * pow(2.0, j) > K) {
sum += p * pow(2.0, -j);
break;
}
}
}
printf("%.10... | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double p = 1.0 / N;
double sum = 0;
for (double i = 1; i <= N; i++) {
for (double j = 0; j < 20; j++) {
if (i * pow(2.0, j) >= K) {
sum += p * pow(2.0, -j);
break;
}
}
}
printf("%.1... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 861,512 | 861,513 | u413492096 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 2e9;
int main() {
int n, k;
ll ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
ll a = 1000000000000 / n;
int score = i;
while (score <= k - 1) {
score *= 2;
a /= 2;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 2e9;
int main() {
int n, k;
ll ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
ll a = 1000000000000000 / n;
int score = i;
while (score <= k - 1) {
score *= 2;
a /= 2;
... | [
"literal.number.change",
"expression.operation.binary.change",
"io.output.change"
] | 861,514 | 861,515 | u193591892 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 2e9;
int main() {
int n, k;
ll ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
ll a = 1000000000 / n;
int score = i;
while (score <= k - 1) {
score *= 2;
a /= 2;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 2e9;
int main() {
int n, k;
ll ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
ll a = 1000000000000000 / n;
int score = i;
while (score <= k - 1) {
score *= 2;
a /= 2;
... | [
"literal.number.change",
"expression.operation.binary.change",
"io.output.change"
] | 861,516 | 861,515 | u193591892 | cpp |
p03043 | //------------------------------------------
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <... | //------------------------------------------
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,519 | 861,520 | u226861390 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n = 0, k = 0;
int count = 0;
double times = 0;
double prob = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
count = i;
while (k >= count) {
count = count * 2;
times++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n = 0, k = 0;
int count = 0;
double times = 0;
double prob = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
count = i;
while (k > count) {
count = count * 2;
times++;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,547 | 861,548 | u734455596 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double prob = 0;
for (int i = 1; i <= N; i++) {
int dcount = 0;
int score = i;
while (score < K) {
score *= 2;
dcount++;
}
prob += pow(0.5, dcount);
}
prob *= 1.0 / N;
printf("%lf\n",... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double prob = 0;
for (int i = 1; i <= N; i++) {
int dcount = 0;
int score = i;
while (score < K) {
score *= 2;
dcount++;
}
prob += pow(0.5, dcount);
}
prob *= 1.0 / N;
printf("%.13lf\... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,566 | 861,567 | u624923345 | cpp |
p03043 | #include <bits/stdc++.h>
#define ll long long int
#define N 100000
#define M 1000000007
#define f(i, a, b) for (ll i = (ll)a; i <= (ll)b; i++)
#define rf(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
#define po pop_back
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define ibs ios_base::sync_with_st... | #include <bits/stdc++.h>
#define ll long long int
#define N 100000
#define M 1000000007
#define f(i, a, b) for (ll i = (ll)a; i <= (ll)b; i++)
#define rf(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
#define po pop_back
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define ibs ios_base::sync_with_st... | [
"literal.number.change",
"io.output.change"
] | 861,568 | 861,569 | u773105035 | cpp |
p03043 | #include <algorithm>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,573 | 861,574 | u919394785 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.