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 |
|---|---|---|---|---|---|---|---|
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int mae;
int ato;
mae = N / 100;
ato = N % 100;
if ((1 <= mae) && (mae <= 12) && (1 <= mae) && (mae <= 12)) {
cout << "AMBIGUOUS" << endl;
}
else if ((1 <= mae) && (mae <= 12)) {
cout << "MMYY" << endl;
}
els... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int mae;
int ato;
mae = N / 100;
ato = N % 100;
if ((1 <= mae) && (mae <= 12) && (1 <= ato) && (ato <= 12)) {
cout << "AMBIGUOUS" << endl;
}
else if ((1 <= mae) && (mae <= 12)) {
cout << "MMYY" << endl;
}
els... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,949 | 859,950 | u266059249 | cpp |
p03042 | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
if (n / 100 >= 1 && n / 100 <= 12) {
if (n % 100 >= 1 && n % 100 <= 12) {
cout << "AMBIGIOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else if (n % 100 >= 1 && n % 100 <= 12) {
cout <<... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
if (n / 100 >= 1 && n / 100 <= 12) {
if (n % 100 >= 1 && n % 100 <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else if (n % 100 >= 1 && n % 100 <= 12) {
cout <<... | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 859,955 | 859,956 | u650918644 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep0(i, b, s) for (int i = b; i < s; i++)
typedef long long ll;
int main() {
string S;
cin >> S;
int a, b;
a = 10 * (S[0] - '0') + (S[1] - '0');
b = 10 * (S[2] - '0') + (S[3] - '0');
if ((0 < a && a <= 12)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep0(i, b, s) for (int i = b; i < s; i++)
typedef long long ll;
int main() {
string S;
cin >> S;
int a, b;
a = 10 * (S[0] - '0') + (S[1] - '0');
b = 10 * (S[2] - '0') + (S[3] - '0');
if ((0 < a && a <= 12)... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 859,960 | 859,961 | u738835924 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, A) for (int i = 0; i < A; i++)
using namespace std;
using ll = long long int;
using ld = long double;... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, A) for (int i = 0; i < A; i++)
using namespace std;
using ll = long long int;
using ld = long double;... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 859,962 | 859,963 | u486021106 | cpp |
p03042 | #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)
#... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 859,964 | 859,965 | u679071005 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - 48;
ch = getchar();
}
return x * f;
}
const int N = 1e... | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - 48;
ch = getchar();
}
return x * f;
}
const int N = 1e... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 859,973 | 859,974 | u855248478 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - 48;
ch = getchar();
}
return x * f;
}
const int N = 1e... | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - 48;
ch = getchar();
}
return x * f;
}
const int N = 1e... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 859,975 | 859,974 | u855248478 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int a = n / 1000 + n / 100 % 10;
int b = n % 100;
if (a >= 1 && a <= 12 ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int a = n / 1000 * 10 + n / 100 % 10;
int b = n % 100;
if (a >= 1 && a <... | [
"assignment.change"
] | 859,976 | 859,977 | u876386943 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
if (N / 100 <= 12 && N / 100 != 0) {
if (N % 100 <= 12 && N / 100 != 0) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (N % 100 <= 12 && N / 100 != 0) {
cout << "YYMM" << endl... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
if (N / 100 <= 12 && N / 100 != 0) {
if (N % 100 <= 12 && N % 100 != 0) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (N % 100 <= 12 && N % 100 != 0) {
cout << "YYMM" << endl... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 859,978 | 859,979 | u322714721 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int MOD = (int)1e9 + 7;
int INF = (int)2e18;
// Comment out below and program paste
// #include "UnionFind.hpp"
// #include "power.hpp"
signed main() {
string S;
cin >> S;
int A = stoi(S.substr(0, 2));
int B = stoi(S.substr(2, 2));
if (A <=... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int MOD = (int)1e9 + 7;
int INF = (int)2e18;
// Comment out below and program paste
// #include "UnionFind.hpp"
// #include "power.hpp"
signed main() {
string S;
cin >> S;
int A = stoi(S.substr(0, 2));
int B = stoi(S.substr(2, 2));
if (A <=... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 860,006 | 860,007 | u714538557 | cpp |
p03042 | #include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
string s;
cin >> s;
int l = stoi(s.substr(0, 2));
int r = stoi(s.substr(2, 2));
if (1 <= l && l <= 12 && 1 <= r && r <= 12) {
cout << "AMBIGUOUS" << endl... | #include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
string s;
cin >> s;
int l = stoi(s.substr(0, 2));
int r = stoi(s.substr(2, 2));
if (1 <= l && l <= 12 && 1 <= r && r <= 12) {
cout << "AMBIGUOUS" << endl... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 860,008 | 860,009 | u032189172 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i = n / 100;
int j = n % 100;
bool flg = 0 <= i && i <= 12;
bool glg = 0 <= j && j <= 12;
string ret;
if (flg && glg)
ret = "AMBIGUOUS";
else if (flg && !glg)
ret = "MMYY";
else if (!flg && glg)
ret = "YYMM";... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i = n / 100;
int j = n % 100;
bool flg = 1 <= i && i <= 12;
bool glg = 1 <= j && j <= 12;
string ret;
if (flg && glg)
ret = "AMBIGUOUS";
else if (flg && !glg)
ret = "MMYY";
else if (!flg && glg)
ret = "YYMM";... | [
"literal.number.change",
"expression.operation.binary.change"
] | 860,014 | 860,015 | u846041485 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
int main() {
string S;
cin >> S;
int s1 = (S[0] - 48) * 10 + (S[1] - 48);
int s2 = (S[2] - 48) * 10 + (S[3] - 48);
IFD cout << s1 << " " << s2 << endl;
if (1 <= s1 && s1 <= 1... | #include <iostream>
#include <string>
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
int main() {
string S;
cin >> S;
int s1 = (S[0] - 48) * 10 + (S[1] - 48);
int s2 = (S[2] - 48) * 10 + (S[3] - 48);
IFD cout << s1 << " " << s2 << endl;
if (1 <= s1 && s1 <= 1... | [
"literal.string.change",
"io.output.change"
] | 860,026 | 860,027 | u711582524 | cpp |
p03042 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 1e5 + 10;
int f, d;
int valid(int year, int mon) {
// if (mon == 1 || mon == 3|| mon == 5|| mon == 7|| mon == 8|| mon == 10||
//mon == 12) return day <= 31; if (mon == 2) return day <= 29; return day <=
//30;
return mon <= 12 &... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 1e5 + 10;
int f, d;
int valid(int year, int mon) {
// if (mon == 1 || mon == 3|| mon == 5|| mon == 7|| mon == 8|| mon == 10||
//mon == 12) return day <= 31; if (mon == 2) return day <= 29; return day <=
//30;
return mon <= 12 &... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 860,037 | 860,038 | u076784075 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = (S[0] - '0') * 10 + (S[1] - '0');
int b = (S[2] - '0') * 10 + (S[3] - '0');
bool ok1 = (1 <= b && b <= 12);
bool ok2 = (1 <= a && a <= 12);
if (ok1 && ok2) {
cout << "ANBIGUOUS" << endl;
} else if (ok1) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = (S[0] - '0') * 10 + (S[1] - '0');
int b = (S[2] - '0') * 10 + (S[3] - '0');
bool ok1 = (1 <= b && b <= 12);
bool ok2 = (1 <= a && a <= 12);
if (ok1 && ok2) {
cout << "AMBIGUOUS" << endl;
} else if (ok1) {
... | [
"literal.string.change",
"io.output.change"
] | 860,039 | 860,040 | u656368720 | cpp |
p03042 | #include <iostream>
int main(int argc, char const *argv[]) {
int a;
std::cin >> a;
auto left = a / 100;
auto right = a - left * 100;
auto yymm = false;
auto mmyy = false;
if (1 <= left && left <= 12) {
if (12 <= right && right <= 12) {
yymm = true;
mmyy = true;
} else {
mmyy ... | #include <iostream>
int main(int argc, char const *argv[]) {
int a;
std::cin >> a;
auto left = a / 100;
auto right = a - left * 100;
auto yymm = false;
auto mmyy = false;
if (1 <= left && left <= 12) {
if (1 <= right && right <= 12) {
yymm = true;
mmyy = true;
} else {
mmyy =... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 860,041 | 860,042 | u197999770 | cpp |
p03042 | #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 (... | [
"literal.string.change",
"call.arguments.change"
] | 860,047 | 860,048 | u360501542 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
static const int INF = 1e9 + 7;
template <typename T> using Vec = vector<T>;
template <typename T, typename T2> using P = pair<T, T2>;
template <typename... Args> using Tup = tuple<Args...>;
template <typename T> using qp = priority_queue<T, Vec<T>, greater<T>>;
temp... | #include <bits/stdc++.h>
using namespace std;
static const int INF = 1e9 + 7;
template <typename T> using Vec = vector<T>;
template <typename T, typename T2> using P = pair<T, T2>;
template <typename... Args> using Tup = tuple<Args...>;
template <typename T> using qp = priority_queue<T, Vec<T>, greater<T>>;
temp... | [
"literal.string.change",
"io.output.change"
] | 860,049 | 860,050 | u752074356 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
string a = s.substr(0, 2), b = s.substr(3);
int y = stoi(a), m = stoi(b);
bool c = y <= 12 && y != 0;
bool d = m <= 12 && m != 0;
if (c && d)
cout << "AMBIGUOUS" << endl;
else if (c)
cout << "MMYY" << endl;
else if (d)
... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
string a = s.substr(0, 2), b = s.substr(2);
int y = stoi(a), m = stoi(b);
bool c = y <= 12 && y != 0;
bool d = m <= 12 && m != 0;
if (c && d)
cout << "AMBIGUOUS" << endl;
else if (c)
cout << "MMYY" << endl;
else if (d)
... | [
"literal.number.change",
"call.arguments.change"
] | 860,051 | 860,052 | u734519000 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
double ans = 0;
for (int i = 1; i <= a; i++) {
double pos = 1.0 / a;
int now = i;
while (now < b) {
now *= 2;
pos /= 2;
}
ans += pos;
}
printf("%.12llf\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
double ans = 0;
for (int i = 1; i <= a; i++) {
double pos = 1.0 / a;
int now = i;
while (now < b) {
now *= 2;
pos /= 2;
}
ans += pos;
}
printf("%.12f\n", ans);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,055 | 860,056 | u254440076 | cpp |
p03043 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
#... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
#... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,059 | 860,060 | u917502362 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
// max=({});
//条件式が真ならwhileの中身を回し続ける
bool flag[1050000];
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; ++i) {
double target = i;
dou... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
// max=({});
//条件式が真ならwhileの中身を回し続ける
bool flag[1050000];
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; ++i) {
double target = i;
dou... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,063 | 860,064 | u631558039 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
int main(void) {
ll n, i = 0, j, p, h[1000010], k;
double c = 1, kaku = 0;
cin >> n >> k;
for (i = 1; i <= n; i++) {
j = i;
while (j <= k) {
c = c / 2;
j = j * 2;
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
int main(void) {
ll n, i = 0, j, p, h[1000010], k;
double c = 1, kaku = 0;
cin >> n >> k;
for (i = 1; i <= n; i++) {
j = i;
while (j < k) {
c = c / 2;
j = j * 2;
}
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,065 | 860,066 | u806320475 | cpp |
p03043 | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | [
"assignment.change",
"variable_declaration.type.widen.change"
] | 860,067 | 860,068 | u434874161 | cpp |
p03043 | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"variable_declaration.type.widen.change"
] | 860,069 | 860,068 | u434874161 | cpp |
p03043 | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | [
"assignment.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 860,067 | 860,070 | u434874161 | cpp |
p03043 | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_std... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"variable_declaration.type.widen.change",
"literal.number.change"
] | 860,069 | 860,070 | u434874161 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; i++) {
double cnt = 1;
double tmp = i;
while (tmp < k) {
tmp *= 2;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; i++) {
double cnt = 1;
double tmp = i;
while (tmp < k) {
tmp *= 2;... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,089 | 860,090 | u681323954 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
double res = 0.0;
for (long long i = 1; i < n + 1; ++i) {
double tmp = 1.0;
long long d = i;
while (i < k) {
i *= 2;
tmp /= 2.0;
}
res += tmp;
}
res /= n;
cout << fixed << setprecisio... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
double res = 0.0;
for (long long i = 1; i < n + 1; ++i) {
double tmp = 1.0;
long long d = i;
while (d < k) {
d *= 2;
tmp /= 2.0;
}
res += tmp;
}
res /= n;
cout << fixed << setprecisio... | [
"identifier.change",
"control_flow.loop.condition.change",
"assignment.variable.change"
] | 860,096 | 860,095 | u075502030 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
double res = 0.0;
for (long long i = 1; i < n; ++i) {
double tmp = 1.0;
long long d = i;
while (i < k) {
i *= 2;
tmp /= 2.0;
}
res += tmp;
}
res /= n;
cout << fixed << setprecision(15... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
double res = 0.0;
for (long long i = 1; i < n + 1; ++i) {
double tmp = 1.0;
long long d = i;
while (d < k) {
d *= 2;
tmp /= 2.0;
}
res += tmp;
}
res /= n;
cout << fixed << setprecisio... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.change",
"control_flow.loop.condition.change",
"assignment.variable.change"
] | 860,097 | 860,095 | u075502030 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
double res = 0.0;
for (long long i = 1; i < n; ++i) {
long double tmp = 1.0;
long long d = i;
while (i < k) {
i *= 2;
tmp /= 2.0;
}
res += tmp;
}
res /= n;
cout << fixed << setprecisi... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
double res = 0.0;
for (long long i = 1; i < n + 1; ++i) {
double tmp = 1.0;
long long d = i;
while (d < k) {
d *= 2;
tmp /= 2.0;
}
res += tmp;
}
res /= n;
cout << fixed << setprecisio... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"variable_declaration.type.narrow.change",
"identifier.change",
"control_flow.loop.condition.change",
"assignment.variable.change"
] | 860,098 | 860,095 | u075502030 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
double res = 0.0;
for (long long i = 1; i < n + 1; ++i) {
double tmp = 1.0;
long long d = i;
while (i < k) {
i *= 2;
tmp /= 2.0;
}
res += tmp;
}
res /= n;
cout << fixed << setprecisio... | #include <bits/stdc++.h>
using namespace std;
int main() {
/*long long n, k; cin >> n >> k;
double res = 0.0;
for(long long i=1; i<n+1; ++i){
double tmp = 1.0;
long long d = i;
while (d < k) d *= 2, tmp /= 2.0;
res += tmp;
}
res /= n;
cout << fixed << setprecision(10) << res << endl;*/
long long n, k;
... | [
"identifier.change",
"control_flow.loop.condition.change",
"assignment.variable.change"
] | 860,096 | 860,100 | u075502030 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
double res = 0.0;
for (long long i = 1; i < n; ++i) {
double tmp = 1.0;
long long d = i;
while (i < k) {
i *= 2;
tmp /= 2.0;
}
res += tmp;
}
res /= n;
cout << fixed << setprecision(15... | #include <bits/stdc++.h>
using namespace std;
int main() {
/*long long n, k; cin >> n >> k;
double res = 0.0;
for(long long i=1; i<n+1; ++i){
double tmp = 1.0;
long long d = i;
while (d < k) d *= 2, tmp /= 2.0;
res += tmp;
}
res /= n;
cout << fixed << setprecision(10) << res << endl;*/
long long n, k;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.change",
"control_flow.loop.condition.change",
"assignment.variable.change"
] | 860,097 | 860,100 | u075502030 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
double res = 0.0;
for (long long i = 1; i < n; ++i) {
long double tmp = 1.0;
long long d = i;
while (i < k) {
i *= 2;
tmp /= 2.0;
}
res += tmp;
}
res /= n;
cout << fixed << setprecisi... | #include <bits/stdc++.h>
using namespace std;
int main() {
/*long long n, k; cin >> n >> k;
double res = 0.0;
for(long long i=1; i<n+1; ++i){
double tmp = 1.0;
long long d = i;
while (d < k) d *= 2, tmp /= 2.0;
res += tmp;
}
res /= n;
cout << fixed << setprecision(10) << res << endl;*/
long long n, k;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"variable_declaration.type.narrow.change",
"identifier.change",
"control_flow.loop.condition.change",
"assignment.variable.change"
] | 860,098 | 860,100 | u075502030 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
double res = 0.0;
for (long long i = 1; i < n + 1; ++i) {
double tmp = 1.0;
long long d = i;
while (i < k) {
i *= 2;
tmp /= 2.0;
}
res += tmp;
}
res /= n;
cout << fixed << setprecisio... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
double res = 0.0;
for (long long i = 1; i < n + 1; ++i) {
double tmp = 1.0;
long long d = i;
while (d < k)
d *= 2, tmp /= 2.0;
res += tmp;
}
res /= n;
cout << fixed << setprecision(10) << res ... | [
"identifier.change",
"control_flow.loop.condition.change",
"assignment.variable.change",
"literal.number.change",
"io.output.change"
] | 860,096 | 860,101 | u075502030 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
double coin(int n, int k) {
int cnt = 0;
while (n < k) {
n *= 2;
cnt++;
}
return cnt;
}
int main() {
int n, k;
cin >> n >> k;
vector<double> a;
for (int i = 1; i <= n; i++) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
double coin(int n, int k) {
int cnt = 0;
while (n < k) {
n *= 2;
cnt++;
}
return cnt;
}
int main() {
int n, k;
cin >> n >> k;
vector<double> a;
for (int i = 1; i <= n; i++) {
... | [
"io.output.change"
] | 860,109 | 860,110 | u862412671 | cpp |
p03043 | #include <math.h>
#include <stdio.h>
int main(void) {
// Your code here!
int n, k;
scanf("%d %d", &n, &k);
double ans = 0;
int s;
double m;
int i;
for (i = 1; i < n + 1; i++) {
m = 1;
if (i >= k) {
ans += 1;
} else {
// printf("%lf ", )
s = i;
while (s < k) {
... | #include <math.h>
#include <stdio.h>
int main(void) {
// Your code here!
int n, k;
scanf("%d %d", &n, &k);
double ans = 0;
int s;
double m;
int i;
for (i = 1; i < n + 1; i++) {
m = 1;
if (i >= k) {
ans += 1;
} else {
// printf("%lf ", )
s = i;
while (s < k) {
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,111 | 860,112 | u179778090 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define itn int
int main(void) {
int n, k;
cin >> n >> k;
long double ans = 0;
for (int i = 1; i <= n; i++) {
int alina = i;
long double cnt = 1;
while (1) {
if (alina >= k)
break;
alina *= 2;
cnt /= 2;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define itn int
int main(void) {
int n, k;
cin >> n >> k;
long double ans = 0;
for (int i = 1; i <= n; i++) {
int alina = i;
long double cnt = 1;
while (1) {
if (alina >= k)
break;
alina *= 2;
cnt /= 2;
... | [
"io.output.change"
] | 860,114 | 860,115 | u512624048 | cpp |
p03043 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) ... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) ... | [
"variable_declaration.type.change",
"literal.number.change",
"io.output.change"
] | 860,116 | 860,117 | u304829684 | cpp |
p03043 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) ... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) ... | [
"variable_declaration.type.change"
] | 860,116 | 860,118 | u304829684 | cpp |
p03043 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using indexed_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define ld long doubl... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using indexed_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define ld long doubl... | [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,119 | 860,120 | u865613237 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define reps(i, a, b) for (int i = a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
double n, k;
cin >> n >> k;
double ans ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define reps(i, a, b) for (int i = a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
double n, k;
cin >> n >> k;
double ans ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,121 | 860,122 | u423665486 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
double tmp ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
double tmp ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,123 | 860,124 | u423665486 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ", ";
os << "]";
r... | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ", ";
os << "]";
r... | [
"variable_declaration.type.narrow.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 860,127 | 860,128 | u513402782 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
// sengen
int n, k;
// nyuryoku
cin >> n >> k;
// keisan
double ans = 0, tmp;
for (int i = 1; i <= n; i++) {
tmp = (double)1 / n;
int now = i;
while (now < k) {
now *= 2;
tmp = tmp / 2;
}
ans +... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
// sengen
int n, k;
// nyuryoku
cin >> n >> k;
// keisan
double ans = 0, tmp;
for (int i = 1; i <= n; i++) {
tmp = (double)1 / n;
int now = i;
while (now < k) {
now *= 2;
tmp = tmp / 2;
}
ans +... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,131 | 860,132 | u002847662 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL << 30;
int main() {
ll n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int x = i;
double ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL << 30;
int main() {
ll n, k;
cin >> n >> k;
long double ans = 0;
for (int i = 1; i <= n; i++) {
int x = i;
lo... | [
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,139 | 860,140 | u633967774 | cpp |
p03043 | #include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
using lld = long long;
/*
浮動小数点の入力
cout << fixed << setprecision(9) << endl;
*/
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
while (b != 0) {
... | #include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
using lld = long long;
/*
浮動小数点の入力
cout << fixed << setprecision(9) << endl;
*/
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
while (b != 0) {
... | [
"variable_declaration.type.change"
] | 860,145 | 860,146 | u111653921 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int n, k;
double win(int i) {
double p = 1;
while (i < k - 1) {
p /= 2;
i *= 2;
}
return p;
}
int main() {
cin >> n >> k;
double ans = 0;
for (int i =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
ll n, k;
double win(int i) {
double p = 1;
while (i < k) {
p /= 2;
i *= 2;
}
return p;
}
int main() {
cin >> n >> k;
double ans = 0;
for (int i = 1; i... | [
"variable_declaration.type.change",
"expression.operation.binary.remove",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,149 | 860,150 | u886613668 | cpp |
p03043 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,153 | 860,154 | u941028483 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<double> prob(n + 1);
double a = 1;
double ans = 0;
for (int i = 1; i <= n; i++) {
int tmp = i;
while (tmp < k) {
tmp *= 2;
a /= 2.0;
}
prob.at(i) = a;
a = 1;
}
for (int i = 1; i <=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<double> prob(n + 1);
double a = 1;
double ans = 0;
for (int i = 1; i <= n; i++) {
int tmp = i;
while (tmp < k) {
tmp *= 2;
a /= 2.0;
}
prob.at(i) = a;
a = 1;
}
for (int i = 1; i <=... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,155 | 860,156 | u600480888 | cpp |
p03043 | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int 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 rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int 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 rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 860,161 | 860,162 | u608773191 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | [
"expression.operation.binary.add"
] | 860,169 | 860,170 | u007099475 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double a = 0;
for (int i = 1; i <= n; i++) {
int num = i;
double t = 1 / n;
while (num < k) {
num *= 2;
t /= 2;
}
a += t;
}
cout << fixed << setprecision(15) << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double a = 0;
for (int i = 1; i <= n; i++) {
int num = i;
double t = 1.0 / n;
while (num < k) {
num *= 2;
t /= 2;
}
a += t;
}
cout << fixed << setprecision(20) << a << endl;
}
| [
"literal.number.change",
"expression.operation.binary.change",
"io.output.change"
] | 860,174 | 860,175 | u834753207 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K;
double Sum = 0;
cin >> N >> K;
rep(i, N) {
int A = i + 1, cnt = 0;
while (K >= A) {
A *= 2;
cnt++;
}
Sum += 1 / (N * pow(2, cnt));
}
cout << setprecision(15)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K;
double Sum = 0;
cin >> N >> K;
rep(i, N) {
int A = i + 1, cnt = 0;
while (K > A) {
A *= 2;
cnt++;
}
Sum += 1 / (N * pow(2, cnt));
}
cout << setprecision(15) ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,180 | 860,181 | u749022615 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// Shift+Command+bでデバッグ
//その後ターミナルで./a.outを実行
//入力を貼り付ける
//////////////////
// A
/*int main(void){
int n,k;
string s;
cin >> n>>k>>s;
for(int i=0 ;i<... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// Shift+Command+bでデバッグ
//その後ターミナルで./a.outを実行
//入力を貼り付ける
//////////////////
// A
/*int main(void){
int n,k;
string s;
cin >> n>>k>>s;
for(int i=0 ;i<... | [
"io.output.change"
] | 860,199 | 860,200 | u317432339 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, k, n) for (int i = k; i < (n); i++)
using ll = long long;
int main() {
long double n, k, prob;
cin >> n >> k;
rep(i, 1, n + 1) {
int cnt = i;
long double toss = 1;
while (cnt < k) {
cnt *= 2;
toss *= 0.5;
}
prob += toss ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, k, n) for (int i = k; i < (n); i++)
using ll = long long;
int main() {
double n, k, prob;
cin >> n >> k;
rep(i, 1, n + 1) {
int cnt = i;
double toss = 1;
while (cnt < k) {
cnt *= 2;
toss *= 0.5;
}
prob += toss / n;
}
... | [
"variable_declaration.type.narrow.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,201 | 860,202 | u436733497 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,210 | 860,211 | u748757847 | cpp |
p03043 |
#include <bits/stdc++.h>
using namespace std;
double dice(int i, int K) {
int k = i;
int count = 0;
while (k < K) {
k = k * 2;
count++;
}
// cout << pow(0.5,count) << endl;
return pow(0.5, count);
}
int main() {
int N, K;
double ans = 0;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
an... |
#include <bits/stdc++.h>
using namespace std;
double dice(int i, int K) {
int k = i;
int count = 0;
while (k < K) {
k = k * 2;
count++;
}
// cout << pow(0.5,count) << endl;
return pow(0.5, count);
}
int main() {
int N, K;
double ans = 0;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
an... | [
"io.output.change"
] | 860,214 | 860,215 | u583701239 | cpp |
p03043 | #include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
int N, K;
cin >> N >> K;
double ans = 0.0;
for (int i = 1; i <= N; i++) {
int cnt = 0;
int t = i;
while (t < K) {
t *= 2;
cnt++;
}
... | #include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
int N, K;
cin >> N >> K;
double ans = 0.0;
for (int i = 1; i <= N; i++) {
int cnt = 0;
int t = i;
while (t < K) {
t *= 2;
cnt++;
}
... | [
"io.output.change"
] | 860,218 | 860,219 | u365077014 | cpp |
p03043 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, k) for (... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, k) for (... | [
"io.output.change"
] | 860,220 | 860,221 | u452955775 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> p... | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> p... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,235 | 860,236 | u132033278 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, k, a, t;
float ans = 0;
cin >> n >> k;
rep(i, n) {
t = 0;
a = i + 1;
while (a < k) {
a *= 2;
t++;
}
ans += powl(0.5, t);
}
ans = ans / n;
c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, k, a, t;
long double ans = 0;
cin >> n >> k;
rep(i, n) {
t = 0;
a = i + 1;
while (a < k) {
a *= 2;
t++;
}
ans += powl(0.5, t);
}
ans = ans / ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 860,237 | 860,238 | u644374454 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n, k;
cin >> k;
long double ans = 0;
REP(i, n) {
int cnt = 0;
int t = i;
while (t < k) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n, k;
cin >> n >> k;
long double ans = 0;
REP(i, n) {
int cnt = 0;
int t = i;
while (t < ... | [
"expression.operation.binary.add"
] | 860,239 | 860,240 | u065456707 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
float ret = 0.0;
for (int i = 1; i <= a; i++) {
float tmp = 1.0 / a;
int now = i;
while (now < b) {
now *= 2.0;
tmp /= 2.0;
}
ret += tmp;
}
cout << fixed << setprecision(12) << ret << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
double ret = 0.0;
for (int i = 1; i <= a; i++) {
double tmp = 1.0 / a;
int now = i;
while (now < b) {
now *= 2.0;
tmp /= 2.0;
}
ret += tmp;
}
cout << fixed << setprecision(12) << ret << endl;... | [
"variable_declaration.type.primitive.change"
] | 860,246 | 860,247 | u336145516 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
#define all(v) (v).begin(), (v).end()
const int INF = 1001001001;
int main() {
int n, k;
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
#define all(v) (v).begin(), (v).end()
const int INF = 1001001001;
int main() {
int n, k;
cin >... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,252 | 860,253 | u160861278 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll ... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll ... | [
"io.output.change"
] | 860,258 | 860,259 | u999788719 | cpp |
p03043 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
int main() {
double n = 0, k = 0, tmp = 0.5, kake = 0;
double ans = 0;
cin >> n >> k;
double up = cei... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
int main() {
double n = 0, k = 0, tmp = 0.5, kake = 0;
double ans = 0;
cin >> n >> k;
double up = cei... | [
"call.add",
"call.arguments.change"
] | 860,265 | 860,266 | u730499268 | cpp |
p03043 | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string l... | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string l... | [
"io.output.change"
] | 860,267 | 860,268 | u610897920 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int max_in_dice, required_score;
cin >> max_in_dice >> required_score;
double probability = 0;
// calculate probability for each roll
for (int roll = 1; roll <= max_in_dice; ++roll) {
int current_score = roll;
double tmp_probability = 1 / max... | #include <bits/stdc++.h>
using namespace std;
int main() {
int max_in_dice, required_score;
cin >> max_in_dice >> required_score;
double probability = 0;
// calculate probability for each roll
for (int roll = 1; roll <= max_in_dice; ++roll) {
int current_score = roll;
double tmp_probability = 1.0 / m... | [
"literal.number.change",
"expression.operation.binary.change"
] | 860,269 | 860,270 | u323748756 | cpp |
p03043 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define bit(n) (1LL << (n))
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define en '\n'
#define pb push_back
#define P pair<int, int>
typedef long lon... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define bit(n) (1LL << (n))
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define en '\n'
#define pb push_back
#define P pair<int, int>
typedef long lon... | [
"io.output.change"
] | 860,271 | 860,272 | u273352618 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
ll N, K;
double sum = 0;
cin >> N >> K;
for (ll i = 1; i <= N; i++) {
sum += 1.0 / N * pow(0.5, ceil(max(0.0, log2(K / i))));
}
cout << fixed << setprecision(9) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
ll N, K;
double sum = 0;
cin >> N >> K;
for (ll i = 1; i <= N; i++) {
sum += 1.0 / N * pow(0.5, ceil(max(0.0, log2((double)K / i))));
}
cout << fixed << setpreci... | [
"type_conversion.add"
] | 860,273 | 860,274 | u196953553 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
double N, K;
double sum = 0;
double pre;
double pre2 = log10(2);
cin >> N >> K;
pre = 1.0 / N;
for (ll i = 1; i <= N; i++) {
if (i < K) {
double x = ceil(log10(K / i) / pre2);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
double N, K;
double sum = 0;
double pre;
double pre2 = log10(2);
cin >> N >> K;
pre = 1.0 / N;
for (ll i = 1; i <= N; i++) {
if (i < K) {
double x = ceil(log10(K / i) / pre2);
... | [
"literal.number.change",
"io.output.change"
] | 860,275 | 860,276 | u196953553 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
double a = 0, s = i;
while (s <= k) {
s *= 2;
a++;
}
ans += 1 / (n * pow(2, a));
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
double a = 0, s = i;
while (s < k) {
s *= 2;
a++;
}
ans += 1 / (n * pow(2, a));
}... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,279 | 860,280 | u907525511 | cpp |
p03043 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
double n, k;
cin >> n;
cin >> k;
/*
double ans = 0;
double iter;
double tmp;
for (int i = 1; i <= n; i++){
iter = 0;
if (... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
double n, k;
cin >> n;
cin >> k;
/*
double ans = 0;
double iter;
double tmp;
for (int i = 1; i <= n; i++){
iter = 0;
if (... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,281 | 860,282 | u934068520 | cpp |
p03043 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) (v.begin(), v.end(... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) (v.begin(), v.end(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 860,285 | 860,286 | u459105164 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int minExp(int a, int b) {
long long c = a;
while (c < b) {
c *= 2;
}
return c / a;
}
int main() {
int N, K;
cin >> N >> K;
long long max = minExp(1, K);
long long sum = 0;
for (int i = 0; i < N; i++) {
sum += max / minExp(i + 1, K);
}
... | #include <bits/stdc++.h>
using namespace std;
int minExp(int a, int b) {
long long c = a;
while (c < b) {
c *= 2;
}
return c / a;
}
int main() {
int N, K;
cin >> N >> K;
long long max = minExp(1, K);
long long sum = 0;
for (int i = 0; i < N; i++) {
sum += max / minExp(i + 1, K);
}
... | [
"io.output.change"
] | 860,289 | 860,290 | u303453927 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long double ans = 0;
for (int i = 1; i <= n; i++) {
double pw = 1;
for (int j = 0; j < n; j++) {
if (i * pw < k)
pw *= 2;
else {
ans += 1 / (pw * n);
break;
}
}
}
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long double ans = 0;
for (int i = 1; i <= n; i++) {
double pw = 1;
for (int j = 0;; j++) {
if (i * pw < k)
pw *= 2;
else {
ans += 1 / (pw * n);
break;
}
}
}
cout << fixe... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 860,295 | 860,296 | u813174766 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
int cnt = 0;
float ans;
int point;
for (int i = 1; i <= n; i++) {
cnt = 0;
point = i;
for (int j = 0; j < pow(10, 9); j++) {
if (point * pow(2, j) >= k... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
int cnt = 0;
double ans;
int point;
for (int i = 1; i <= n; i++) {
cnt = 0;
point = i;
for (int j = 0; j < pow(10, 9); j++) {
if (point * pow(2, j) >= ... | [
"variable_declaration.type.primitive.change"
] | 860,304 | 860,305 | u593934357 | cpp |
p03043 | #include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef queue<int> qi;
typedef queue<pair<int, int>> ... | #include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef queue<int> qi;
typedef queue<pair<int, int>> ... | [
"io.output.change"
] | 860,308 | 860,309 | u640888913 | cpp |
p03043 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,314 | 860,315 | u863537799 | cpp |
p03043 | #include <iomanip>
#include <iostream>
using namespace std;
double pow_list[20] = {1.};
int main() {
int N, K;
cin >> N >> K;
for (int i = 1; i < 20; i++) {
pow_list[i] = pow_list[i - 1] * 0.5;
}
double ans = 0;
for (int i = 1; i <= N; i++) {
int point = i;
int loop = 0;
while (point < K... | #include <iomanip>
#include <iostream>
using namespace std;
double pow_list[20] = {1.};
int main() {
int N, K;
cin >> N >> K;
for (int i = 1; i < 20; i++) {
pow_list[i] = pow_list[i - 1] * 0.5;
}
double ans = 0;
for (int i = 1; i <= N; i++) {
int point = i;
int loop = 0;
while (point < K... | [] | 860,316 | 860,317 | u016119075 | cpp |
p03043 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double probability = 0;
for (int i = 1; i <= N; ++i) {
int a = i;
double temp = 1 / N;
while (a < K) {
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double probability = 0;
for (int i = 1; i <= N; ++i) {
int a = i;
double temp = 1 / (double)N;
while (a < K)... | [
"type_conversion.add"
] | 860,318 | 860,319 | u323542775 | 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++) {
double temp = 1.0 / n;
int val = i;
while (val < k) {
val *= 2;
temp /= 2;
}
ans += temp;
}
cout << ans;
return 0;
} | #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++) {
double temp = 1.0 / n;
int val = i;
while (val < k) {
val *= 2;
temp /= 2;
}
ans += temp;
}
cout << setprecision(25) << ans;
return 0;
} | [
"io.output.change"
] | 860,324 | 860,325 | u859421710 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
long double N, K;
cin >> N >> K;
long double ans = 0, kaku = 0;
for (int i = 1; i <= N; i++) {
int tmp = i;
kaku = 1 / N;
while (tmp < K) {
kaku = kaku / 2;
tmp = tmp * 2;
}
ans = ans + kaku;
}
cout << ans;
return ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long double N, K;
cin >> N >> K;
long double ans = 0, kaku = 0;
for (int i = 1; i <= N; i++) {
int tmp = i;
kaku = 1 / N;
while (tmp < K) {
kaku = kaku / 2;
tmp = tmp * 2;
}
ans = ans + kaku;
}
cout << setprecision(1... | [
"io.output.change"
] | 860,340 | 860,341 | u231455327 | cpp |
p03043 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int p = 0;
while (pow(2, p) ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int p = 0;
while (pow(2, p) ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,342 | 860,343 | u928536113 | cpp |
p03043 | #include <iomanip>
#include <iostream>
using namespace std;
int coin_throw(int dice, int k) {
int count = 0;
while (dice < k) {
dice *= 2;
count++;
}
return count;
}
double factorial(int n) {
int ans = 1;
for (int i = 0; i < n; i++)
ans *= 2;
return ans;
}
int main() {
int n, k;
cin >> ... | #include <iomanip>
#include <iostream>
using namespace std;
int coin_throw(int dice, int k) {
int count = 0;
while (dice < k) {
dice *= 2;
count++;
}
return count;
}
double factorial(int n) {
int ans = 1;
for (int i = 0; i < n; i++)
ans *= 2;
return ans;
}
int main() {
int n, k;
cin >> ... | [
"literal.number.change",
"io.output.change"
] | 860,348 | 860,349 | u579644164 | cpp |
p03043 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N + 1);
for (int i = 1; i <= N; i++) {
int temp = i;
while (temp < K) {
temp *= 2;
A[i] += 1;
}
}
float ans = 0.0;
for (int i = 1; i <= N; i++) {
ans += (1... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N + 1);
for (int i = 1; i <= N; i++) {
int temp = i;
while (temp < K) {
temp *= 2;
A[i] += 1;
}
}
double ans = 0.0;
for (int i = 1; i <= N; i++) {
ans += (... | [
"variable_declaration.type.primitive.change"
] | 860,350 | 860,351 | u886569237 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, i, pt;
double p, sum = 0;
cin >> N >> K;
for (i = 1; i <= N; i++) {
pt = i;
p = 1 / N;
while (pt < K) {
pt *= 2;
p /= 2;
}
sum += p;
}
cout << setprecision(15) << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, i, pt;
double p;
double sum = 0;
cin >> N >> K;
for (i = 1; i <= N; i++) {
pt = i;
p = 1.0 / N;
while (pt < K) {
pt *= 2;
p /= 2;
}
sum += p;
}
cout << setprecision(15) << sum << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 860,357 | 860,358 | u981759938 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, i, pt;
double p, sum = 0;
cin >> N >> K;
for (i = 1; i <= K; i++) {
pt = i;
p = 1 / N;
while (pt < K) {
pt *= 2;
p /= 2;
}
sum += p;
}
cout << setprecision(15) << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, i, pt;
double p;
double sum = 0;
cin >> N >> K;
for (i = 1; i <= N; i++) {
pt = i;
p = 1.0 / N;
while (pt < K) {
pt *= 2;
p /= 2;
}
sum += p;
}
cout << setprecision(15) << sum << endl;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"assignment.value.change"
] | 860,359 | 860,358 | u981759938 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, i, pt;
double p, sum = 0;
cin >> N >> K;
for (i = 1; i <= K; i++) {
pt = i;
p = 1 / i;
while (pt < K) {
pt *= 2;
p /= 2;
}
sum += p;
}
cout << setprecision(15) << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, i, pt;
double p;
double sum = 0;
cin >> N >> K;
for (i = 1; i <= N; i++) {
pt = i;
p = 1.0 / N;
while (pt < K) {
pt *= 2;
p /= 2;
}
sum += p;
}
cout << setprecision(15) << sum << endl;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"assignment.value.change"
] | 860,360 | 860,358 | u981759938 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main() {
long double N, K;
cin >> N >> K;
long double ans = 0;
for (long double i = 1; i <= N; i++) {
long double p... | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main() {
long double N, K;
cin >> N >> K;
long double ans = 0;
for (long double i = 1; i <= N; i++) {
long double p... | [
"expression.operator.change"
] | 860,361 | 860,362 | u031178961 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
ld ans = 0;
for (int i = 1; i <= n; i++) {
double tmp = 1.0 / n;
int point = i;
while (point < k) {
tmp = tmp / 2;
point = point * 2;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
int main() {
int n, k;
cin >> n >> k;
ld ans = 0;
for (int i = 1; i <= n; i++) {
double tmp = 1.0 / n;
int point = i;
while (point < k) {
tmp = tmp / 2;
point = point * 2;
... | [
"io.output.change"
] | 860,363 | 860,364 | u584787460 | cpp |
p03043 | #include "bits/stdc++.h"
using namespace std;
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; i++) {
double i_temp = i;
double cnt = 0;
while (i_temp <= k) {
i_temp *= 2;
cnt++;
}
ans += ((double)1 / n) * pow(0.5, cnt);
}
cout << fixed <... | #include "bits/stdc++.h"
using namespace std;
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; i++) {
double i_temp = i;
double cnt = 0;
while (i_temp < k) {
i_temp *= 2;
cnt++;
}
ans += ((double)1 / n) * pow((double)0.5, cnt);
}
cout << ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.number.change",
"io.output.change"
] | 860,365 | 860,366 | u418785081 | cpp |
p03043 | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | [
"assignment.change"
] | 860,367 | 860,368 | u950002813 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int need(int current_score, int needed) {
int res = 0;
while (current_score < needed) {
res += 1;
current_score <<= 1;
}
return res;
}
double solve(int n, int k) {
double first_part = (1 / (double)n);
double total = 0;
for (int i = 1; i <= n; i++... | #include <bits/stdc++.h>
using namespace std;
int need(int current_score, int needed) {
int res = 0;
while (current_score < needed) {
res += 1;
current_score <<= 1;
}
return res;
}
double solve(int n, int k) {
double first_part = (1 / (double)n);
double total = 0;
for (int i = 1; i <= n; i++... | [
"literal.number.change",
"io.output.change"
] | 860,372 | 860,373 | u090445726 | cpp |
p03043 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int jou = 0;
while (pow(2, jou) < K)
jou++;
int n_j = jou;
float node = 1.0;
double ans = 0.0;
for (int i = 1; i <= N; i++) {
// cout << f... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int jou = 0;
while (pow(2, jou) < K)
jou++;
int n_j = jou;
float node = 1.0;
long double ans = 0.0;
for (int i = 1; i <= N; i++) {
// cout... | [
"variable_declaration.type.widen.change",
"assignment.value.change",
"call.function.change",
"variable_declaration.type.primitive.change",
"literal.number.change",
"io.output.change"
] | 860,378 | 860,379 | u969116807 | cpp |
p03043 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int jou = 0;
while (pow(2, jou) < K)
jou++;
int n_j = jou;
float node = 1.0;
double ans = 0.0;
for (int i = 1; i <= N; i++) {
// cout << f... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int jou = 0;
while (pow(2, jou) < K)
jou++;
int n_j = jou;
float node = 1.0;
long double ans = 0.0;
for (int i = 1; i <= N; i++) {
// cout... | [
"variable_declaration.type.widen.change",
"assignment.value.change",
"call.function.change",
"variable_declaration.type.primitive.change",
"literal.number.change",
"io.output.change"
] | 860,380 | 860,379 | u969116807 | cpp |
p03043 | // ConsoleApplication1.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string... | // ConsoleApplication1.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string... | [
"variable_declaration.type.narrow.change"
] | 860,383 | 860,384 | u065467277 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string, int>;
const double PI = acos(-1);
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int t = i;
int cnt = 0;
while (t <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string, int>;
const double PI = acos(-1);
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; i++) {
double t = i;
double cnt = 0;
w... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,389 | 860,390 | u425086757 | cpp |
p03043 | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#i... | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#i... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,393 | 860,394 | u931901821 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.