problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
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;
}
else if ((1 <= ato) && (ato <= 12)) {
cout << "YYMM" << endl;
}
else {
cout << "NA" << endl;
}
} | #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;
}
else if ((1 <= ato) && (ato <= 12)) {
cout << "YYMM" << endl;
}
else {
cout << "NA" << endl;
}
} | [
"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 << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
} | #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 << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
} | [
"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) && (b < 0 && b <= 12))
cout << "AMBIGUOUS" << endl;
else if ((a == 0 || a > 12) && (b == 0 || b > 12))
cout << "NA" << endl;
else if (a == 0 || a > 12)
cout << "YYMM" << endl;
else
cout << "MMYY" << endl;
}
| #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) && (0 < b && b <= 12))
cout << "AMBIGUOUS" << endl;
else if ((a == 0 || a > 12) && (b == 0 || b > 12))
cout << "NA" << endl;
else if (a == 0 || a > 12)
cout << "YYMM" << endl;
else
cout << "MMYY" << endl;
}
| [
"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;
using vl = vector<ll>;
using vd = vector<ld>;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
string S;
cin >> S;
int flag = 0;
if (S[0] == '0' && S[0] != '0') {
flag = 1;
} else if (S[0] == '1' && S[1] <= '2') {
flag = 1;
} else {
flag = 2;
}
if (S[2] == '0' && S[3] != '0') {
flag += 10;
} else if (S[2] == '1' && S[3] <= '2') {
flag += 10;
} else {
flag += 20;
}
if (flag == 11) {
cout << "AMBIGUOUS";
} else if (flag == 12) {
cout << "YYMM";
} else if (flag == 21) {
cout << "MMYY";
} else {
cout << "NA";
}
return 0;
} | #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;
using vl = vector<ll>;
using vd = vector<ld>;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
string S;
cin >> S;
int flag = 0;
if (S[0] == '0' && S[1] != '0') {
flag = 1;
} else if (S[0] == '1' && S[1] <= '2') {
flag = 1;
} else {
flag = 2;
}
if (S[2] == '0' && S[3] != '0') {
flag += 10;
} else if (S[2] == '1' && S[3] <= '2') {
flag += 10;
} else {
flag += 20;
}
if (flag == 11) {
cout << "AMBIGUOUS";
} else if (flag == 12) {
cout << "YYMM";
} else if (flag == 21) {
cout << "MMYY";
} else {
cout << "NA";
}
return 0;
} | [
"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)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = __int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
void solve() {
int s;
cin >> s;
int sa = s / 100;
int sb = s % 100;
if ((sa <= 0 || sa > 12) && (sb <= 0 || sb > 12)) {
cout << "NA" << endl;
} else if ((0 < sa && sa < 12) && (sb <= 0 || sb > 12)) {
cout << "MMYY" << endl;
} else if ((0 < sb && sb < 12) && (sa <= 0 || sa > 12)) {
cout << "YYMM" << endl;
} else {
cout << "AMBIGUOUS" << endl;
}
}
int main() {
solve();
return 0;
} | #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)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = __int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
void solve() {
int s;
cin >> s;
int sa = s / 100;
int sb = s % 100;
if ((sa <= 0 || sa > 12) && (sb <= 0 || sb > 12)) {
cout << "NA" << endl;
} else if ((0 < sa && sa <= 12) && (sb <= 0 || sb > 12)) {
cout << "MMYY" << endl;
} else if ((0 < sb && sb <= 12) && (sa <= 0 || sa > 12)) {
cout << "YYMM" << endl;
} else {
cout << "AMBIGUOUS" << endl;
}
}
int main() {
solve();
return 0;
} | [
"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 = 1e5 + 10;
char s[5];
int main() {
cin >> s;
int ret = 0;
int a = (s[0] - '0') * 10 + s[1] - '0';
if (a <= 12 && a >= 0)
ret++;
a = (s[2] - '0') * 10 + s[3] - '0';
if (a <= 12 && a >= 0)
ret += 2;
if (ret == 0)
puts("NA");
if (ret == 1)
puts("MMYY");
if (ret == 2)
puts("YYMM");
if (ret == 3)
puts("AMBIGUOUS");
return 0;
} | #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 = 1e5 + 10;
char s[5];
int main() {
cin >> s;
int ret = 0;
int a = (s[0] - '0') * 10 + s[1] - '0';
if (a <= 12 && a > 0)
ret++;
a = (s[2] - '0') * 10 + s[3] - '0';
if (a <= 12 && a > 0)
ret += 2;
if (ret == 0)
puts("NA");
if (ret == 1)
puts("MMYY");
if (ret == 2)
puts("YYMM");
if (ret == 3)
puts("AMBIGUOUS");
return 0;
} | [
"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 = 1e5 + 10;
char s[5];
int main() {
cin >> s;
int ret = 0;
int a = (s[0] - '0') * 10 - s[1] - '0';
if (a <= 12 && a >= 0)
ret++;
a = (s[2] - '0') * 10 + s[3] - '0';
if (a <= 12 && a >= 0)
ret += 2;
if (ret == 0)
puts("NA");
if (ret == 1)
puts("MMYY");
if (ret == 2)
puts("YYMM");
if (ret == 3)
puts("AMBIGUOUS");
return 0;
} | #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 = 1e5 + 10;
char s[5];
int main() {
cin >> s;
int ret = 0;
int a = (s[0] - '0') * 10 + s[1] - '0';
if (a <= 12 && a > 0)
ret++;
a = (s[2] - '0') * 10 + s[3] - '0';
if (a <= 12 && a > 0)
ret += 2;
if (ret == 0)
puts("NA");
if (ret == 1)
puts("MMYY");
if (ret == 2)
puts("YYMM");
if (ret == 3)
puts("AMBIGUOUS");
return 0;
} | [
"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 && b >= 1 && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else if (a >= 1 && a <= 12 && (b >= 13 || b == 0)) {
cout << "MMYY" << endl;
} else if (b >= 1 && b <= 12 && (a >= 13 || a == 0)) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
| #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 <= 12 && b >= 1 && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else if (a >= 1 && a <= 12 && (b >= 13 || b == 0)) {
cout << "MMYY" << endl;
} else if (b >= 1 && b <= 12 && (a >= 13 || a == 0)) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
| [
"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;
} else {
cout << "NA" << 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;
} else {
cout << "NA" << 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 <= 12 && B <= 12 && A != 0 && B != 0) {
cout << "AMBIGUOUS" << endl;
} else if (A <= 12 && B != 0) {
cout << "MMYY" << endl;
} else if (B <= 12 && A != 0) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
} | #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 <= 12 && B <= 12 && A != 0 && B != 0) {
cout << "AMBIGUOUS" << endl;
} else if (A <= 12 && A != 0) {
cout << "MMYY" << endl;
} else if (B <= 12 && B != 0) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
} | [
"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;
return 0;
} else if ((l == 0 || 12 < l) && (1 <= r && r <= 12)) {
cout << "YYMM" << endl;
return 0;
} else if ((1 <= l && l <= 12) && (r == 0 || 12 < l)) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
return 0;
}
| #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;
return 0;
} else if ((l == 0 || 12 < l) && (1 <= r && r <= 12)) {
cout << "YYMM" << endl;
return 0;
} else if ((1 <= l && l <= 12) && (r == 0 || 12 < r)) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
return 0;
}
| [
"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";
else
ret = "NA";
cout << ret << endl;
return 0;
} | #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";
else
ret = "NA";
cout << ret << endl;
return 0;
}
| [
"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 <= 12) {
if (1 <= s2 && s2 <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "YYMM" << endl;
}
} else {
if (1 <= s2 && s2 <= 12) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
}
return 0;
}
| #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 <= 12) {
if (1 <= s2 && s2 <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= s2 && s2 <= 12) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
return 0;
}
| [
"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 && mon >= 1;
}
char s[10];
int main() {
scanf("%s", s);
f = (s[0] - '0') * 10 + s[1] - '0';
d = (s[2] - '0') * 10 + s[3] - '0';
if (valid(f, d) && valid(d, f)) {
puts("AMBIGUOUS");
} else {
if (valid(f, d)) {
puts("YYMM");
} else if (valid(d, d)) {
puts("MMYY");
} else {
puts("NA");
}
}
return 0;
} | #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 && mon >= 1;
}
char s[10];
int main() {
scanf("%s", s);
f = (s[0] - '0') * 10 + s[1] - '0';
d = (s[2] - '0') * 10 + s[3] - '0';
if (valid(f, d) && valid(d, f)) {
puts("AMBIGUOUS");
} else {
if (valid(f, d)) {
puts("YYMM");
} else if (valid(d, f)) {
puts("MMYY");
} else {
puts("NA");
}
}
return 0;
} | [
"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) {
cout << "YYMM" << endl;
} else if (ok2) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
} | #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) {
cout << "YYMM" << endl;
} else if (ok2) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
} | [
"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 = true;
}
} else {
if (right <= 12 && 1 <= right) {
yymm = true;
} else {
}
}
if (yymm) {
if (mmyy) {
std::cout << "AMBIGUOUS" << std::endl;
} else {
std::cout << "YYMM" << std::endl;
}
} else {
if (mmyy) {
std::cout << "MMYY" << std::endl;
} else {
std::cout << "NA" << std::endl;
}
}
} | #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 = true;
}
} else {
if (right <= 12 && 1 <= right) {
yymm = true;
} else {
}
}
if (yymm) {
if (mmyy) {
std::cout << "AMBIGUOUS" << std::endl;
} else {
std::cout << "YYMM" << std::endl;
}
} else {
if (mmyy) {
std::cout << "MMYY" << std::endl;
} else {
std::cout << "NA" << std::endl;
}
}
} | [
"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 (L | 1)
#define smax(X, Y) ((X) > (Y) ? (X) : (Y))
#define smin(X, Y) ((X) < (Y) ? (X) : (Y))
const ld e = 2.71828182845904523536028747;
const ld PI = 3.14159265359;
const ll inf = (1LL << 62);
const int iinf = (1 << 30);
string s;
int main() {
cin >> s;
int a = s[1] - '0' + (s[0] - '0') * 10;
int b = s[3] - '0' + (s[2] - '0') * 10;
if (a <= 12 && a && b <= 12 && b)
rc("AMBGUOUS");
if (a <= 12 && a)
rc("MMYY");
if (b <= 12 && b)
rc("YYMM");
rc("NA");
return 0;
}
| #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 (L | 1)
#define smax(X, Y) ((X) > (Y) ? (X) : (Y))
#define smin(X, Y) ((X) < (Y) ? (X) : (Y))
const ld e = 2.71828182845904523536028747;
const ld PI = 3.14159265359;
const ll inf = (1LL << 62);
const int iinf = (1 << 30);
string s;
int main() {
cin >> s;
int a = s[1] - '0' + (s[0] - '0') * 10;
int b = s[3] - '0' + (s[2] - '0') * 10;
if (a <= 12 && a && b <= 12 && b)
rc("AMBIGUOUS");
if (a <= 12 && a)
rc("MMYY");
if (b <= 12 && b)
rc("YYMM");
rc("NA");
return 0;
}
| [
"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>>;
template <typename T> using pq = priority_queue<T>;
using llong = long long;
using ullong = unsigned long long;
using uint = unsigned int;
template <typename T> T gcd(T x, T y) { return y ? gcd(y, x % y) : x; }
int h, w, k;
map<pair<int, int>, long long> dp;
long long dfs(int now, int x) {
if (now == h)
return x == k - 1;
auto status = make_pair(now, x);
if (dp.count(status))
return dp[status];
long long res = 0;
for (int i = 0; i < 1 << (w - 1); i++) {
bool check = true;
for (int j = 0; j < w - 2; j++) {
if ((i >> j & 1) && (i >> (j + 1) & 1)) {
check = false;
break;
}
}
if (check) {
if (0 < x && (i >> (x - 1) & 1)) {
res += dfs(now + 1, x - 1);
res %= INF;
} else if (x + 1 < w && ((i >> x) & 1)) {
res += dfs(now + 1, x + 1);
res %= INF;
} else {
res += dfs(now + 1, x);
res %= INF;
}
}
}
return dp[status] = res;
}
void hawawa() {
string str;
cin >> str;
if ("00" < str.substr(0, 2) && str.substr(0, 2) < "13") {
if ("00" < str.substr(2) && str.substr(2) < "13") {
cout << "AMBIGUOUS\n";
} else {
cout << "MMYY\n";
}
} else {
if ("00" < str.substr(2) && str.substr(2) < "13") {
cout << "YYNN\n";
} else {
cout << "NA\n";
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
hawawa();
}
| #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>>;
template <typename T> using pq = priority_queue<T>;
using llong = long long;
using ullong = unsigned long long;
using uint = unsigned int;
template <typename T> T gcd(T x, T y) { return y ? gcd(y, x % y) : x; }
int h, w, k;
map<pair<int, int>, long long> dp;
long long dfs(int now, int x) {
if (now == h)
return x == k - 1;
auto status = make_pair(now, x);
if (dp.count(status))
return dp[status];
long long res = 0;
for (int i = 0; i < 1 << (w - 1); i++) {
bool check = true;
for (int j = 0; j < w - 2; j++) {
if ((i >> j & 1) && (i >> (j + 1) & 1)) {
check = false;
break;
}
}
if (check) {
if (0 < x && (i >> (x - 1) & 1)) {
res += dfs(now + 1, x - 1);
res %= INF;
} else if (x + 1 < w && ((i >> x) & 1)) {
res += dfs(now + 1, x + 1);
res %= INF;
} else {
res += dfs(now + 1, x);
res %= INF;
}
}
}
return dp[status] = res;
}
void hawawa() {
string str;
cin >> str;
if ("00" < str.substr(0, 2) && str.substr(0, 2) < "13") {
if ("00" < str.substr(2) && str.substr(2) < "13") {
cout << "AMBIGUOUS\n";
} else {
cout << "MMYY\n";
}
} else {
if ("00" < str.substr(2) && str.substr(2) < "13") {
cout << "YYMM\n";
} else {
cout << "NA\n";
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
hawawa();
}
| [
"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)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
return 0;
} | #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)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
return 0;
} | [
"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;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
int main() {
ll N, K;
cin >> N >> K;
double a, cnt = 1, sum = 0;
for (int i = 1; i <= N; i++) {
a = i;
while (a < K - 1) {
cnt /= 2;
a *= 2;
}
sum += cnt / N;
cnt = 1;
}
cout << std::fixed << std::setprecision(15) << sum << endl;
} | #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;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
int main() {
ll N, K;
cin >> N >> K;
double a, cnt = 1, sum = 0;
for (int i = 1; i <= N; i++) {
a = i;
while (a <= K - 1) {
cnt /= 2;
a *= 2;
}
sum += cnt / N;
cnt = 1;
}
cout << std::fixed << std::setprecision(15) << sum << endl;
} | [
"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;
double pro = 1 / n;
while (target < k) {
target *= 2;
pro /= 2;
}
ans += pro;
}
printf("%12f\n", ans);
}
| #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;
double pro = 1 / n;
while (target < k) {
target *= 2;
pro /= 2;
}
ans += pro;
}
printf("%.12f\n", ans);
}
| [
"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;
}
kaku += c / n;
c = 1;
}
cout << fixed << setprecision(12);
cout << kaku << endl;
return 0;
}
| #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;
}
kaku += c / n;
c = 1;
}
cout << fixed << setprecision(12);
cout << kaku << endl;
return 0;
}
| [
"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_stdio(false), cin.tie(NULL));
#define vll(v) v.begin(), v.end()
#define all(x) x.rbegin(), x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int, vector<int>, greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) \
((ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') || \
(ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U'))
#define bug cout << "BUG" << endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI = 3.141592653589793238463;
bool compare(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
return a / __gcd(a, b) * b;
}
void input(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cin >> ara[i];
}
void print(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cout << ara[i] << " ";
cout << endl;
}
int main() {
fastread();
ll i, j, n, m, p, a, k, t, b, c, d, cnt = 0, q, l, r;
double ans = 0;
bool flag = false;
string str;
long double sum = 0;
cin >> n >> k;
for (i = 1; i <= n; i++) {
if (i > k) {
sum += n - i;
break;
}
double value = 1.0;
a = i;
while (a < k) {
a *= 2;
value /= 2.0;
}
// cout<<value<<endl;
sum += value;
}
sum /= n;
cout << setprecision(12) << fixed << sum << endl;
}
| /*
-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_stdio(false), cin.tie(NULL));
#define vll(v) v.begin(), v.end()
#define all(x) x.rbegin(), x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int, vector<int>, greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) \
((ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') || \
(ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U'))
#define bug cout << "BUG" << endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI = 3.141592653589793238463;
bool compare(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
return a / __gcd(a, b) * b;
}
void input(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cin >> ara[i];
}
void print(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cout << ara[i] << " ";
cout << endl;
}
int main() {
fastread();
ll i, j, n, m, p, a, k, t, b, c, d, cnt = 0, q, l, r;
double ans = 0;
bool flag = false;
string str;
long double sum = 0;
cin >> n >> k;
for (i = 1; i <= n; i++) {
if (i > k) {
sum += n - i + 1;
break;
}
long double value = 1.0;
a = i;
while (a < k) {
a *= 2;
value /= 2.0;
}
// cout<<value<<endl;
sum += value;
}
sum /= n;
cout << setprecision(12) << fixed << sum << endl;
}
| [
"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_stdio(false), cin.tie(NULL));
#define vll(v) v.begin(), v.end()
#define all(x) x.rbegin(), x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int, vector<int>, greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) \
((ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') || \
(ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U'))
#define bug cout << "BUG" << endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI = 3.141592653589793238463;
bool compare(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
return a / __gcd(a, b) * b;
}
void input(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cin >> ara[i];
}
void print(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cout << ara[i] << " ";
cout << endl;
}
int main() {
fastread();
ll i, j, n, m, p, a, k, t, b, c, d, cnt = 0, q, l, r;
double ans = 0;
bool flag = false;
string str;
long double sum = 0;
cin >> n >> k;
for (i = 1; i <= n; i++) {
if (i > k) {
sum += n - i - 1;
break;
}
double value = 1.0;
a = i;
while (a < k) {
a *= 2;
value /= 2.0;
}
// cout<<value<<endl;
sum += value;
}
sum /= n;
cout << setprecision(12) << fixed << sum << endl;
}
| /*
-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_stdio(false), cin.tie(NULL));
#define vll(v) v.begin(), v.end()
#define all(x) x.rbegin(), x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int, vector<int>, greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) \
((ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') || \
(ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U'))
#define bug cout << "BUG" << endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI = 3.141592653589793238463;
bool compare(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
return a / __gcd(a, b) * b;
}
void input(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cin >> ara[i];
}
void print(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cout << ara[i] << " ";
cout << endl;
}
int main() {
fastread();
ll i, j, n, m, p, a, k, t, b, c, d, cnt = 0, q, l, r;
double ans = 0;
bool flag = false;
string str;
long double sum = 0;
cin >> n >> k;
for (i = 1; i <= n; i++) {
if (i > k) {
sum += n - i + 1;
break;
}
long double value = 1.0;
a = i;
while (a < k) {
a *= 2;
value /= 2.0;
}
// cout<<value<<endl;
sum += value;
}
sum /= n;
cout << setprecision(12) << fixed << sum << endl;
}
| [
"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_stdio(false), cin.tie(NULL));
#define vll(v) v.begin(), v.end()
#define all(x) x.rbegin(), x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int, vector<int>, greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) \
((ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') || \
(ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U'))
#define bug cout << "BUG" << endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI = 3.141592653589793238463;
bool compare(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
return a / __gcd(a, b) * b;
}
void input(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cin >> ara[i];
}
void print(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cout << ara[i] << " ";
cout << endl;
}
int main() {
fastread();
ll i, j, n, m, p, a, k, t, b, c, d, cnt = 0, q, l, r;
double ans = 0;
bool flag = false;
string str;
long double sum = 0;
cin >> n >> k;
for (i = 1; i <= n; i++) {
if (i > k) {
sum += n - i;
break;
}
double value = 1.0;
a = i;
while (a < k) {
a *= 2;
value /= 2.0;
}
// cout<<value<<endl;
sum += value;
}
sum /= n;
cout << setprecision(12) << fixed << sum << endl;
}
| /*
-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_stdio(false), cin.tie(NULL));
#define vll(v) v.begin(), v.end()
#define all(x) x.rbegin(), x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int, vector<int>, greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) \
((ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') || \
(ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U'))
#define bug cout << "BUG" << endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI = 3.141592653589793238463;
bool compare(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
return a / __gcd(a, b) * b;
}
void input(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cin >> ara[i];
}
void print(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cout << ara[i] << " ";
cout << endl;
}
int main() {
fastread();
ll i, j, n, m, p, a, k, t, b, c, d, cnt = 0, q, l, r;
double ans = 0;
bool flag = false;
string str;
long double sum = 0;
cin >> n >> k;
for (i = 1; i <= n; i++) {
if (i > k) {
sum += n - i + 1;
break;
}
long double value = 1.0;
a = i;
while (a < k) {
a *= 2;
value /= 2;
}
// cout<<value<<endl;
sum += value;
}
sum /= n;
cout << setprecision(12) << fixed << sum << endl;
}
| [
"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_stdio(false), cin.tie(NULL));
#define vll(v) v.begin(), v.end()
#define all(x) x.rbegin(), x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int, vector<int>, greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) \
((ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') || \
(ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U'))
#define bug cout << "BUG" << endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI = 3.141592653589793238463;
bool compare(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
return a / __gcd(a, b) * b;
}
void input(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cin >> ara[i];
}
void print(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cout << ara[i] << " ";
cout << endl;
}
int main() {
fastread();
ll i, j, n, m, p, a, k, t, b, c, d, cnt = 0, q, l, r;
double ans = 0;
bool flag = false;
string str;
long double sum = 0;
cin >> n >> k;
for (i = 1; i <= n; i++) {
if (i > k) {
sum += n - i - 1;
break;
}
double value = 1.0;
a = i;
while (a < k) {
a *= 2;
value /= 2.0;
}
// cout<<value<<endl;
sum += value;
}
sum /= n;
cout << setprecision(12) << fixed << sum << endl;
}
| /*
-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_stdio(false), cin.tie(NULL));
#define vll(v) v.begin(), v.end()
#define all(x) x.rbegin(), x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int, vector<int>, greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) \
((ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') || \
(ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U'))
#define bug cout << "BUG" << endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI = 3.141592653589793238463;
bool compare(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
return a / __gcd(a, b) * b;
}
void input(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cin >> ara[i];
}
void print(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cout << ara[i] << " ";
cout << endl;
}
int main() {
fastread();
ll i, j, n, m, p, a, k, t, b, c, d, cnt = 0, q, l, r;
double ans = 0;
bool flag = false;
string str;
long double sum = 0;
cin >> n >> k;
for (i = 1; i <= n; i++) {
if (i > k) {
sum += n - i + 1;
break;
}
long double value = 1.0;
a = i;
while (a < k) {
a *= 2;
value /= 2;
}
// cout<<value<<endl;
sum += value;
}
sum /= n;
cout << setprecision(12) << fixed << sum << endl;
}
| [
"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;
cnt *= 2;
}
ans += ((1 / n) * (1 / cnt));
}
printf("%lf\n", ans);
return 0;
} | #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;
cnt *= 2;
}
ans += ((1 / n) * (1 / cnt));
}
printf("%.12f\n", ans);
return 0;
} | [
"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 << setprecision(15) << res << endl;
return 0;
} | #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(15) << res << endl;
return 0;
} | [
"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) << res << endl;
return 0;
} | #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(15) << res << endl;
return 0;
} | [
"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 << setprecision(15) << res << endl;
return 0;
} | #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(15) << res << endl;
return 0;
} | [
"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 << setprecision(15) << res << endl;
return 0;
} | #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;
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(15) << res << endl;
return 0;
} | [
"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) << res << endl;
return 0;
} | #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;
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(15) << res << endl;
return 0;
} | [
"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 << setprecision(15) << res << endl;
return 0;
} | #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;
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(15) << res << endl;
return 0;
} | [
"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 << setprecision(15) << res << endl;
return 0;
} | #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; 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 << setprecision(15) << res << endl;*/
return 0;
} | [
"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++) {
a.push_back(coin(i, k));
}
double sum = 0;
for (int i = 0; i < n; i++) {
sum += pow(0.5, a[i]);
}
sum /= n;
cout << sum;
}
| #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++) {
a.push_back(coin(i, k));
}
double sum = 0;
for (int i = 0; i < n; i++) {
sum += pow(0.5, a[i]);
}
sum /= n;
cout << setprecision(10) << sum;
}
| [
"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) {
m *= 0.5;
s *= 2;
}
ans += m;
// printf("%lf\n",m);
}
}
printf("%lf", ans / n);
return 0;
} | #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) {
m *= 0.5;
s *= 2;
}
ans += m;
// printf("%lf\n",m);
}
}
printf("%.13lf", ans / n);
return 0;
} | [
"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;
}
ans += cnt;
}
cout << ans / n << endl;
} | #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;
}
ans += cnt;
}
cout << setprecision(20) << ans / n << endl;
} | [
"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(...) \
show(__VA_ARGS__); \
cout << endl;
#else
#define s(...)
#define sl(...)
#endif
void show() {}
template <class Head, class... Args> void show(Head t, Args... args) {
std::cout << t << " ";
show(args...);
}
#define REP(i, n) for (ll i = 1; i <= n; i++)
#define REPR(i, n) for (ll i = n; i >= 1; i--)
#define FOR(i, m, n) for (ll i = m; i <= n; i++)
const ld INF = 1e9 + 123;
#define VEC(type, A, N) vector<type> A(N + 10)
#define VECi(type, A, N, i) vector<type> A(N + 10, i)
#define VEC2(type, A, N, M) vector<vector<type>> A(N + 10, vector<type>(M + 10))
#define VEC2i(type, A, N, M, i) \
vector<vector<type>> A(N + 10, vector<type>(M + 10, i))
#define ALL(v) v.begin() + 1, v.end() - 9
ll frac(ll k) {
int s = 1;
for (ll i = 1; i <= k; ++i)
s *= i;
return s;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll antidiv(ll N, ll C, ll D) {
return N - floor(N / C) - floor(N / D) + floor(N / lcm(C, D));
}
vector<ll> yakusuu(ll N) {
vector<ll> ret;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
ret.push_back(i);
if (i * i != N)
ret.push_back(N / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
int main() {
ld N, K;
cin >> N >> K;
double t, k = 0;
REP(i, N) {
t = ceil(log(K / i) / log(2));
k += (pow((ld)1 / 2, t <= 0 ? 0 : t)) / N;
// sl(t,k,(pow((ld)1/2,t<=0?0:t)))
}
// cout<<ac<<" "<<wa;
cout << fixed << setprecision(15) << k;
// sort(ALL(C),[](auto& a, auto& b) {return a[2] < b[2];});
// if(equal(D.begin(), D.end()-1, K.begin()))cout<<"Yes";else cout<<"No";
cout << endl;
return 0;
}
| #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(...) \
show(__VA_ARGS__); \
cout << endl;
#else
#define s(...)
#define sl(...)
#endif
void show() {}
template <class Head, class... Args> void show(Head t, Args... args) {
std::cout << t << " ";
show(args...);
}
#define REP(i, n) for (ll i = 1; i <= n; i++)
#define REPR(i, n) for (ll i = n; i >= 1; i--)
#define FOR(i, m, n) for (ll i = m; i <= n; i++)
const ld INF = 1e9 + 123;
#define VEC(type, A, N) vector<type> A(N + 10)
#define VECi(type, A, N, i) vector<type> A(N + 10, i)
#define VEC2(type, A, N, M) vector<vector<type>> A(N + 10, vector<type>(M + 10))
#define VEC2i(type, A, N, M, i) \
vector<vector<type>> A(N + 10, vector<type>(M + 10, i))
#define ALL(v) v.begin() + 1, v.end() - 9
ll frac(ll k) {
int s = 1;
for (ll i = 1; i <= k; ++i)
s *= i;
return s;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll antidiv(ll N, ll C, ll D) {
return N - floor(N / C) - floor(N / D) + floor(N / lcm(C, D));
}
vector<ll> yakusuu(ll N) {
vector<ll> ret;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
ret.push_back(i);
if (i * i != N)
ret.push_back(N / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
int main() {
double N, K;
cin >> N >> K;
double t, k = 0;
REP(i, N) {
t = (int)ceil(log(K / i) / log(2));
k += (pow((ld)1 / 2, t <= 0 ? 0 : t)) / N;
// sl(t,k,(pow((ld)1/2,t<=0?0:t))/N)
}
// cout<<ac<<" "<<wa;
cout << fixed << setprecision(32) << k;
// sort(ALL(C),[](auto& a, auto& b) {return a[2] < b[2];});
// if(equal(D.begin(), D.end()-1, K.begin()))cout<<"Yes";else cout<<"No";
cout << endl;
return 0;
}
| [
"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(...) \
show(__VA_ARGS__); \
cout << endl;
#else
#define s(...)
#define sl(...)
#endif
void show() {}
template <class Head, class... Args> void show(Head t, Args... args) {
std::cout << t << " ";
show(args...);
}
#define REP(i, n) for (ll i = 1; i <= n; i++)
#define REPR(i, n) for (ll i = n; i >= 1; i--)
#define FOR(i, m, n) for (ll i = m; i <= n; i++)
const ld INF = 1e9 + 123;
#define VEC(type, A, N) vector<type> A(N + 10)
#define VECi(type, A, N, i) vector<type> A(N + 10, i)
#define VEC2(type, A, N, M) vector<vector<type>> A(N + 10, vector<type>(M + 10))
#define VEC2i(type, A, N, M, i) \
vector<vector<type>> A(N + 10, vector<type>(M + 10, i))
#define ALL(v) v.begin() + 1, v.end() - 9
ll frac(ll k) {
int s = 1;
for (ll i = 1; i <= k; ++i)
s *= i;
return s;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll antidiv(ll N, ll C, ll D) {
return N - floor(N / C) - floor(N / D) + floor(N / lcm(C, D));
}
vector<ll> yakusuu(ll N) {
vector<ll> ret;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
ret.push_back(i);
if (i * i != N)
ret.push_back(N / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
int main() {
ld N, K;
cin >> N >> K;
double t, k = 0;
REP(i, N) {
t = ceil(log(K / i) / log(2));
k += (pow((ld)1 / 2, t <= 0 ? 0 : t)) / N;
// sl(t,k,(pow((ld)1/2,t<=0?0:t)))
}
// cout<<ac<<" "<<wa;
cout << fixed << setprecision(15) << k;
// sort(ALL(C),[](auto& a, auto& b) {return a[2] < b[2];});
// if(equal(D.begin(), D.end()-1, K.begin()))cout<<"Yes";else cout<<"No";
cout << endl;
return 0;
}
| #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(...) \
show(__VA_ARGS__); \
cout << endl;
#else
#define s(...)
#define sl(...)
#endif
void show() {}
template <class Head, class... Args> void show(Head t, Args... args) {
std::cout << t << " ";
show(args...);
}
#define REP(i, n) for (ll i = 1; i <= n; i++)
#define REPR(i, n) for (ll i = n; i >= 1; i--)
#define FOR(i, m, n) for (ll i = m; i <= n; i++)
const ld INF = 1e9 + 123;
#define VEC(type, A, N) vector<type> A(N + 10)
#define VECi(type, A, N, i) vector<type> A(N + 10, i)
#define VEC2(type, A, N, M) vector<vector<type>> A(N + 10, vector<type>(M + 10))
#define VEC2i(type, A, N, M, i) \
vector<vector<type>> A(N + 10, vector<type>(M + 10, i))
#define ALL(v) v.begin() + 1, v.end() - 9
ll frac(ll k) {
int s = 1;
for (ll i = 1; i <= k; ++i)
s *= i;
return s;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll antidiv(ll N, ll C, ll D) {
return N - floor(N / C) - floor(N / D) + floor(N / lcm(C, D));
}
vector<ll> yakusuu(ll N) {
vector<ll> ret;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
ret.push_back(i);
if (i * i != N)
ret.push_back(N / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
int main() {
double N, K;
cin >> N >> K;
double t, k = 0;
REP(i, N) {
t = (int)ceil(log(K / i) / log(2));
k += (pow((ld)1 / 2, t <= 0 ? 0 : t)) / N;
// sl(t,k,(pow((ld)1/2,t<=0?0:t))/N)
}
// cout<<ac<<" "<<wa;
cout << fixed << setprecision(15) << k;
// sort(ALL(C),[](auto& a, auto& b) {return a[2] < b[2];});
// if(equal(D.begin(), D.end()-1, K.begin()))cout<<"Yes";else cout<<"No";
cout << endl;
return 0;
}
| [
"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 double
#define pb push_back
#define mp make_pair
#define in insert
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define mod 1000000007
#define sz(v) (int)(v.size())
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define prec fixed << setprecision(12)
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef set<int> si;
typedef map<int, int> mii;
typedef vector<pii> vpi;
void solve() {
ld n, k;
cin >> n >> k;
ld ans = 1 / n;
ld ans2 = 0;
for (int i = 1; i <= n; ++i) {
int x = i;
int cnt = 0;
while (x <= k)
x *= 2, cnt++;
ans2 += pow(0.5, cnt);
}
cout << prec << ans * ans2;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin >> t;
for (int i = 1; i <= t; ++i) {
solve();
}
return 0;
}
| #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 double
#define pb push_back
#define mp make_pair
#define in insert
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define mod 1000000007
#define sz(v) (int)(v.size())
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define prec fixed << setprecision(20)
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef set<int> si;
typedef map<int, int> mii;
typedef vector<pii> vpi;
void solve() {
ld n, k;
cin >> n >> k;
ld ans = 1 / n;
ld ans2 = 0;
for (int i = 1; i <= n; ++i) {
int x = i;
int cnt = 0;
while (x < k)
x *= 2, cnt++;
ans2 += pow(0.5, cnt);
}
cout << prec << ans * ans2;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin >> t;
for (int i = 1; i <= t; ++i) {
solve();
}
return 0;
}
| [
"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 = 0;
double r = 1 / n;
reps(i, 1, n + 1) {
if (k <= i) {
ans += r;
continue;
} else {
double rr = r;
double v = i;
while (v < k) {
rr *= 0.5;
v *= 2;
}
ans += rr;
}
}
printf("%.8f", ans);
return 0;
} | #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 = 0;
double r = 1 / n;
reps(i, 1, n + 1) {
if (k <= i) {
ans += r;
continue;
} else {
double rr = r;
double v = i;
while (v < k) {
rr *= 0.5;
v *= 2;
}
ans += rr;
}
}
printf("%.10f", ans);
return 0;
} | [
"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 = i;
double p = 1.0 / n;
while (tmp < k) {
tmp *= 2;
p /= 2.0;
}
ans += p;
}
printf("%.8f", ans);
return 0;
} | #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 = i;
double p = 1.0 / n;
while (tmp < k) {
tmp *= 2;
p /= 2.0;
}
ans += p;
}
printf("%.10f", ans);
return 0;
} | [
"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 << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ", ";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << ", " << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << ": " << v.second << ", ";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << ": " << v.second << ", ";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool chmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool chmin(T &m, const T q) {
if (q < m) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
double sides;
int target;
cin >> sides >> target;
vector<long double> twos = {1};
int curr = 1;
while (curr <= target) {
curr = curr * 2;
twos.push_back(curr);
}
double ans = 0;
for (int i = 1; i <= sides; i++) {
if (i >= target) {
ans += (1 / sides);
continue;
}
for (int j = 0; j < twos.size(); j++) {
if (twos[j] * i > target) {
ans += (1 / sides) * (1 / twos[j]);
break;
}
}
}
printf("%.15f", ans);
} | #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 << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ", ";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ", ";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << ", " << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << ": " << v.second << ", ";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << ": " << v.second << ", ";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool chmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool chmin(T &m, const T q) {
if (q < m) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
double sides;
int target;
cin >> sides >> target;
vector<double> twos = {1};
int curr = 1;
while (curr <= target) {
curr = curr * 2;
twos.push_back(curr);
}
double ans = 0;
for (int i = 1; i <= sides; i++) {
if (i >= target) {
ans += (1 / sides);
continue;
}
for (int j = 0; j < twos.size(); j++) {
if (twos[j] * i >= target) {
ans += (1 / sides) * (1 / twos[j]);
break;
}
}
}
printf("%.15f", ans);
} | [
"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 += tmp;
}
// syutsuryoku
printf("%lf\n", 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 += tmp;
}
// syutsuryoku
printf("%.12lf\n", 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 cnt = 0;
while (x <= k) {
x *= 2;
cnt++;
}
double tmp = 1 / pow(2, cnt);
tmp /= (double)n;
ans += tmp;
}
cout << fixed << setprecision(10) << ans << endl;
} | #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;
long double cnt = 0;
while (x < k) {
x *= 2;
cnt++;
}
long double tmp = 1 / pow(2, cnt);
tmp /= (long double)n;
ans += tmp;
}
cout << fixed << setprecision(10) << ans << endl;
} | [
"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) {
ll tmp = b;
b = a % b;
a = tmp;
}
return a;
}
int main() {
double N, K;
cin >> N >> K;
lld result = 0;
loop(1, N + 1, i) {
lld score = K / i;
if (score <= 1) {
result += 1;
continue;
}
int times = ceil(log2(score));
result += 1.0 / pow(2, times);
}
cout << fixed << setprecision(9) << result / N << endl;
} | #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) {
ll tmp = b;
b = a % b;
a = tmp;
}
return a;
}
int main() {
double N, K;
cin >> N >> K;
double result = 0;
loop(1, N + 1, i) {
double score = K / i;
if (score <= 1) {
result += 1;
continue;
}
int times = ceil(log2(score));
result += 1.0 / pow(2, times);
}
cout << fixed << setprecision(9) << result / N << endl;
} | [
"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 = 1; i <= n; i++) {
ans += win(i) / n;
}
printf("%10f\n", ans);
}
| #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 <= n; i++) {
ans += win(i) / n;
}
printf("%.12f\n", ans);
}
| [
"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, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
#define INF 1LL << 60
int N, K;
int xwin(int a) {
if (a >= K)
return 0;
int ans = ceil(log2(double(K) / a));
return ans;
}
int main() {
cin >> N >> K;
double ans = 0;
FOR(a, 1, N) {
int x = xwin(a);
ans += (1.0 / N) * pow(0.5, x);
}
printf("%.8f\n", ans);
return 0;
} | #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, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
#define INF 1LL << 60
int N, K;
int xwin(int a) {
if (a >= K)
return 0;
int ans = ceil(log2(double(K) / a));
return ans;
}
int main() {
cin >> N >> K;
double ans = 0;
FOR(a, 1, N) {
int x = xwin(a);
ans += (1.0 / N) * pow(0.5, x);
}
printf("%.16f\n", ans);
return 0;
} | [
"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 <= n; i++) {
// cout << prob.at(i) << endl;
ans += prob.at(i);
}
ans /= n;
printf("%lf\n", ans);
}
| #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 <= n; i++) {
// cout << prob.at(i) << endl;
ans += prob.at(i);
}
ans /= n;
printf("%.12f\n", ans);
}
| [
"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 push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr int inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
int keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
int log(int a, int b) {
int i = 0;
int A = a;
while (a < b) {
a *= 2;
i++;
}
return i;
}
signed main() {
long double n, k;
cin >> n >> k;
long double ans = 0;
rep1(i, n) { ans += (1 / n) * pow(0.5, log(i, 10)); }
cout << fixed << setprecision(10) << ans << endl;
// cout << log(2,10) << endl;
return 0;
} | #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 push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr int inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
int keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
int log(int a, int b) {
int i = 0;
int A = a;
while (a < b) {
a *= 2;
i++;
}
return i;
}
signed main() {
long double n, k;
cin >> n >> k;
long double ans = 0;
rep1(i, n) { ans += (1 / n) * pow(0.5, log(i, k)); }
cout << fixed << setprecision(10) << ans << endl;
// cout << log(2,10) << endl;
return 0;
} | [
"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++)
#define all(a) (a).begin(), (a).end()
#define allg(a) (a).begin(), (a).end(), greator<>()
#define d20 std::setprecision(20)
#define veci vector<int>
#define vecll vector<long long int>
#define vecb vector<bool>
#define vecd vector<double>
template <typename T> T lcm(T a, T b) { return a / __gcd(a, b) * b; }
void comb(vector<vector<long long int>> &v) {
for (size_t i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (size_t k = 1; k < v.size(); k++) {
for (size_t j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
ll repeat_squaring(ll n, ll p, ll m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
ll t = repeat_squaring(n, p / 2, m);
return t * t % m;
}
return n * repeat_squaring(n, p - 1, m);
}
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
REP(i, 1, n) {
int tmp_point = i;
double tmp_ans = 1. / n;
int frequency = 0;
while (tmp_point < k) {
tmp_point *= 2;
frequency++;
}
tmp_ans *= 1. / pow(2, frequency);
ans += tmp_ans;
}
cout << d20 << ans << endl;
return 0;
} | #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++)
#define all(a) (a).begin(), (a).end()
#define allg(a) (a).begin(), (a).end(), greator<>()
#define d20 std::setprecision(20)
#define veci vector<int>
#define vecll vector<long long int>
#define vecb vector<bool>
#define vecd vector<double>
template <typename T> T lcm(T a, T b) { return a / __gcd(a, b) * b; }
void comb(vector<vector<long long int>> &v) {
for (size_t i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (size_t k = 1; k < v.size(); k++) {
for (size_t j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
ll repeat_squaring(ll n, ll p, ll m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
ll t = repeat_squaring(n, p / 2, m);
return t * t % m;
}
return n * repeat_squaring(n, p - 1, m);
}
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
REP(i, 1, n + 1) {
int tmp_point = i;
double tmp_ans = 1. / n;
int frequency = 0;
while (tmp_point < k) {
tmp_point *= 2;
frequency++;
}
tmp_ans *= 1. / pow(2, frequency);
ans += tmp_ans;
}
cout << d20 << ans << endl;
return 0;
} | [
"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) << Sum << endl;
} | #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) << Sum << endl;
} | [
"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<n;i++){
if(i+1==k){
if(s[i]=='A') cout<<'a';
else if(s[i]=='B') cout<<'b';
else cout<<'c';
}else{
cout<<s[i];
}
}
cout<<endl;
return 0;
}*/
//////////////////
// B
/*int main(void){
string s;
cin >> s;
int a=stoi(s)/100,b=stoi(s)%100;
if(a==0){
if(b==0) cout << "NA" <<endl;
else if(b<=12) cout << "YYMM" <<endl;
else cout<<"NA"<<endl;
}else if(a<=12){
if(b==0) cout << "MMYY" <<endl;
else if(b<=12) cout << "AMBIGUOUS" <<endl;
else cout<<"MMYY"<<endl;
}else{
if(b==0) cout << "NA" <<endl;
else if(b<=12) cout << "YYMM" <<endl;
else cout<<"NA"<<endl;
}
return 0;
}*/
//////////////////
// C
int main(void) {
int n, k;
cin >> n >> k;
double ret = 0;
double tmp;
int point;
for (int i = 1; i <= n; i++) {
point = i;
tmp = 1.0 / n;
while (point < k) {
tmp /= 2;
point *= 2;
}
ret += tmp;
}
cout << ret << endl;
return 0;
}
//////////////////
// D
/*int main(void){
return 0;
}*/
//////////////////
// E
/*int main(void){
return 0;
}*/
//////////////////
// F
/*int main(void){
return 0;
}*/
| #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<n;i++){
if(i+1==k){
if(s[i]=='A') cout<<'a';
else if(s[i]=='B') cout<<'b';
else cout<<'c';
}else{
cout<<s[i];
}
}
cout<<endl;
return 0;
}*/
//////////////////
// B
/*int main(void){
string s;
cin >> s;
int a=stoi(s)/100,b=stoi(s)%100;
if(a==0){
if(b==0) cout << "NA" <<endl;
else if(b<=12) cout << "YYMM" <<endl;
else cout<<"NA"<<endl;
}else if(a<=12){
if(b==0) cout << "MMYY" <<endl;
else if(b<=12) cout << "AMBIGUOUS" <<endl;
else cout<<"MMYY"<<endl;
}else{
if(b==0) cout << "NA" <<endl;
else if(b<=12) cout << "YYMM" <<endl;
else cout<<"NA"<<endl;
}
return 0;
}*/
//////////////////
// C
int main(void) {
int n, k;
cin >> n >> k;
double ret = 0;
double tmp;
int point;
for (int i = 1; i <= n; i++) {
point = i;
tmp = 1.0 / n;
while (point < k) {
tmp /= 2;
point *= 2;
}
ret += tmp;
}
cout << setprecision(11) << ret << endl;
return 0;
}
//////////////////
// D
/*int main(void){
return 0;
}*/
//////////////////
// E
/*int main(void){
return 0;
}*/
//////////////////
// F
/*int main(void){
return 0;
}*/
| [
"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 / n;
}
printf("%.10Lf\n", prob);
return 0;
} | #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;
}
printf("%.10f\n", prob);
return 0;
} | [
"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 chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n, k;
cin >> n >> k;
vector<double> p(n + 1, 1);
for (int i = 1; i <= n; i++) {
int tmp = i;
while (tmp < k) {
tmp *= 2;
p[i] *= 0.5;
}
}
double ans = 0;
for (int i = 1; i <= n; i++) {
ans += p[i];
}
printf("%lf", ans / n);
return 0;
} | #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 chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n, k;
cin >> n >> k;
vector<double> p(n + 1, 1);
for (int i = 1; i <= n; i++) {
int tmp = i;
while (tmp < k) {
tmp *= 2;
p[i] *= 0.5;
}
}
double ans = 0;
for (int i = 1; i <= n; i++) {
ans += p[i];
}
printf("%.12lf", ans / n);
return 0;
} | [
"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++) {
ans += dice(i, K);
}
ans = ans / N;
cout << ans << endl;
} |
#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++) {
ans += dice(i, K);
}
ans = ans / N;
cout << setprecision(12) << ans << endl;
}
| [
"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++;
}
ans += (1 / (double)N) * pow(0.5, cnt);
}
cout << ans << endl;
return 0;
}
| #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++;
}
ans += (1 / (double)N) * pow(0.5, cnt);
}
cout << setprecision(10) << ans << endl;
return 0;
}
| [
"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 (i = 0; i < k; i++)
typedef long long ll;
typedef pair<ll, ll> l_l;
int i, j;
int main() {
ll a, b, k, n = 0, z = 0;
string s;
cin >> n >> k;
double d = 0;
ll o[20];
double p[20];
o[0] = 1;
p[0] = 1;
rep(i, 19) {
o[i + 1] = o[i] * 2;
p[i + 1] = p[i] / 2;
}
for (i = 1; i <= n; i++) {
rep(j, 20) {
if (i * o[j] >= k) {
d += p[j];
// cout <<j<<" "<< d << "\n";
break;
}
}
}
d = double(d / n);
cout << d;
}
| #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 (i = 0; i < k; i++)
typedef long long ll;
typedef pair<ll, ll> l_l;
int i, j;
int main() {
ll a, b, k, n = 0, z = 0;
string s;
cin >> n >> k;
double d = 0;
ll o[20];
double p[20];
o[0] = 1;
p[0] = 1;
rep(i, 19) {
o[i + 1] = o[i] * 2;
p[i + 1] = p[i] / 2;
}
for (i = 1; i <= n; i++) {
rep(j, 20) {
if (i * o[j] >= k) {
d += p[j];
// cout <<j<<" "<< d << "\n";
break;
}
}
}
d = double(d / n);
cout << setprecision(12) << d;
}
| [
"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> pint;
typedef vector<long long> vlong;
typedef vector<string> vstring;
#define _GLIBCXX_DEBUG
#define vpush(a, x) a.push_back(x);
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
#define REP(i, x, n) for (int i = x; i < n; i++)
const int INF = 1 << 30;
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
#define stp(x) setprecision(x)
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long double n, k;
cin >> n >> k;
long double sum = 0;
REP(i, 1, n + 1) {
long double count = 0, a = i;
while (k >= a) {
a *= 2;
count++;
}
a = 0.5;
sum += (long double)(1 / n) * (long double)pow(a, count);
}
cout << fixed << setprecision(12) << sum << '\n';
return (0);
}
| #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> pint;
typedef vector<long long> vlong;
typedef vector<string> vstring;
#define _GLIBCXX_DEBUG
#define vpush(a, x) a.push_back(x);
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
#define REP(i, x, n) for (int i = x; i < n; i++)
const int INF = 1 << 30;
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
#define stp(x) setprecision(x)
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long double n, k;
cin >> n >> k;
long double sum = 0;
REP(i, 1, n + 1) {
long double count = 0, a = i;
while (k > a) {
a *= 2;
count++;
}
a = 0.5;
sum += (long double)(1 / n) * (long double)pow(a, count);
}
cout << fixed << setprecision(12) << sum << '\n';
return (0);
}
| [
"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;
cout << fixed << setprecision(12) << ans << endl;
} | #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 / n;
cout << fixed << setprecision(12) << ans << endl;
} | [
"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) {
t *= 2;
cnt++;
}
ans += 1.0 / n * pow(0.5, cnt);
}
cout << fixed << setprecision(20) << ans << endl;
return 0;
} | #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 < k) {
t *= 2;
cnt++;
}
ans += 1.0 / n * pow(0.5, cnt);
}
cout << fixed << setprecision(20) << ans << endl;
return 0;
} | [
"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;
return 0;
} | #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;
return 0;
} | [
"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 >> n >> k;
double cnt = 0;
for (int i = 1; i <= n; i++) {
if (i >= k)
cnt += (double)1 / n;
else {
int den = 2;
while (1) {
if (k <= den * i) {
cnt += (double)1 / (den * n);
break;
}
den *= 2;
}
}
}
printf("%.8f", cnt);
} | #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 >> n >> k;
double cnt = 0;
for (int i = 1; i <= n; i++) {
if (i >= k)
cnt += (double)1 / n;
else {
int den = 2;
while (1) {
if (k <= den * i) {
cnt += (double)1 / (den * n);
break;
}
den *= 2;
}
}
}
printf("%.15f", cnt);
} | [
"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 mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B) {
if (B == 0)
return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
/*------------------------------------------------------------------*/
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int l = i;
double p = 1.0 / n;
while (l < k) {
l *= 2;
p *= 0.5;
}
ans += p;
}
cout << ans << endl;
} | #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 mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B) {
if (B == 0)
return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
/*------------------------------------------------------------------*/
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int l = i;
double p = 1.0 / n;
while (l < k) {
l *= 2;
p *= 0.5;
}
ans += p;
}
cout << setprecision(15) << ans << endl;
} | [
"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 = ceil(log2(k));
int cnt = log2(k) + 1;
vector<double> table;
table.push_back(1);
rep(i, up) {
table.push_back(tmp);
tmp *= 0.5;
}
for (double i = 1; i <= n; i++) {
ans += (1 / n) * table[log2((k > i) ? k / i : 1)];
}
cout << fixed << setprecision(12) << ans << endl;
return 0;
}
| #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 = ceil(log2(k));
int cnt = log2(k) + 1;
vector<double> table;
table.push_back(1);
rep(i, up) {
table.push_back(tmp);
tmp *= 0.5;
}
for (double i = 1; i <= n; i++) {
ans += (1 / n) * table[ceil(log2((k > i) ? k / i : 1))];
}
cout << fixed << setprecision(12) << ans << endl;
return 0;
}
| [
"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 lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int s = i;
int j;
for (j = 0; s < k; j++) {
s *= 2;
}
ans += (1.0 / (double)n) / pow(2, j);
}
cout << ans;
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
} | // 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 lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int s = i;
int j;
for (j = 0; s < k; j++) {
s *= 2;
}
ans += (1.0 / (double)n) / pow(2, j);
}
cout << setprecision(12) << ans;
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
} | [
"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_in_dice; // probability of a roll
// need to see heads every time until the current score reaches/exceeds the
// specific score.
while (current_score < required_score) {
current_score *= 2;
tmp_probability /= 2;
}
probability += tmp_probability;
}
cout << setprecision(15) << probability;
cout << "\n";
} | #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 / max_in_dice; // probability of a roll
// need to see heads every time until the current score reaches/exceeds the
// specific score.
while (current_score < required_score) {
current_score *= 2;
tmp_probability /= 2;
}
probability += tmp_probability;
}
cout << setprecision(15) << probability;
cout << "\n";
} | [
"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 long ll;
using namespace std;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int INF = (int)1e9;
const ll inf = (ll)1e18;
const int mod = 1000000007;
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaa;
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;
tmp /= 2;
}
ret += tmp;
}
cout << fixed << setprecision(12) << endl;
} | #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 long ll;
using namespace std;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int INF = (int)1e9;
const ll inf = (ll)1e18;
const int mod = 1000000007;
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaa;
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;
tmp /= 2;
}
ret += tmp;
}
cout << fixed << setprecision(12) << ret << endl;
} | [
"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) << sum << endl;
return 0;
}
| #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 << setprecision(9) << sum << endl;
return 0;
}
| [
"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);
sum += pre * pow(0.5, x);
} else {
sum += pre;
}
}
cout << setprecision(8) << fixed << sum << endl;
return 0;
}
| #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);
sum += pre * pow(0.5, x);
} else {
sum += pre;
}
}
cout << setprecision(12) << fixed << sum << endl;
return 0;
}
| [
"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));
}
printf("%.12f\n", ans);
return 0;
}
| #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));
}
printf("%.12f\n", ans);
return 0;
}
| [
"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 (i < k){
tmp = i;
while(true) {
tmp = tmp * 2;
if (tmp >= k){
iter +=1;
break;
}
else{
iter +=1;
continue;
}
};
ans = ans + (1/n) * pow(0.5, iter);
}
else{
ans = ans + (1/n) * (1/2);
}
}
cout << ans << endl;
*/
double p = 1 / n;
double score, add, ans;
ans = 0;
for (int i = 1; i <= n; i++) {
score = i;
add = p;
while (score <= k) {
score *= 2;
add /= 2.0;
};
ans += add;
}
// cout << ans << endl;
printf("%.12f\n", ans);
return 0;
}
| #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 (i < k){
tmp = i;
while(true) {
tmp = tmp * 2;
if (tmp >= k){
iter +=1;
break;
}
else{
iter +=1;
continue;
}
};
ans = ans + (1/n) * pow(0.5, iter);
}
else{
ans = ans + (1/n) * (1/2);
}
}
cout << ans << endl;
*/
double p = 1 / n;
double score, add, ans;
ans = 0;
for (int i = 1; i <= n; i++) {
score = i;
add = p;
while (score < k) {
score *= 2;
add /= 2.0;
};
ans += add;
}
// cout << ans << endl;
printf("%.12f\n", ans);
return 0;
}
| [
"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())
#define COUT(x) cout << (x) << endl
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
FOR(i, 1, min(k, n + 1)) {
int t = i;
double kaku = 1.0 / n;
double kaku1 = kaku;
while (t < k) {
t *= 2;
kaku /= 2.0;
}
if (n <= k)
ans += kaku;
else
ans += kaku1 - kaku;
}
if (n <= k)
cout << setprecision(20) << ans << endl;
else
cout << setprecision(20) << 1 - ans << endl;
return 0;
}
| #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())
#define COUT(x) cout << (x) << endl
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
FOR(i, 1, min(k, n + 1)) {
int t = i;
double kaku = 1.0 / n;
double kaku1 = kaku;
while (t < k) {
t *= 2;
kaku /= 2.0;
}
if (n < k)
ans += kaku;
else
ans += kaku1 - kaku;
}
if (n < k)
cout << setprecision(20) << ans << endl;
else
cout << setprecision(20) << 1 - ans << endl;
return 0;
}
| [
"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);
}
cout << (double)sum / (N * max) << endl;
return 0;
} | #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);
}
cout << setprecision(9) << (double)sum / (N * max) << endl;
return 0;
} | [
"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 << fixed << setprecision(15) << ans << endl;
}
| #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 << fixed << setprecision(15) << ans << endl;
}
| [
"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) {
ans += 1.0 / (pow(2, cnt) * n);
break;
}
cnt++;
}
}
printf("%.12f\n", ans);
} | #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) >= k) {
ans += 1.0 / (pow(2, cnt) * n);
break;
}
cnt++;
}
}
printf("%.12f\n", ans);
} | [
"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>> qp;
#define mp make_pair
#define pi 3.14159265358979323846
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
#define gt(T) greater<T>()
#define sum(v) accumulate(v.begin(), v.end(), 0)
#define uni(v) \
do { \
sort(v.begin(), v.end()); \
decltype(v)::iterator result = unique(v.begin(), v.end()); \
v.erase(result, v.end()); \
} while (0)
#define fi(init, n) for (int i = init; i < n; ++i)
#define fj(init, n) for (int j = init; j < n; ++j)
#define fk(init, n) for (int k = init; k < n; ++k)
#define zero(x) memset(x, 0, sizeof(x))
#define negative(x) memset(x, ~0, sizeof(x))
const ll MOD = 1e9 + 7;
const int INF = 1e9;
const int di[] = {0, 1, 0, -1};
const int dj[] = {1, 0, -1, 0};
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
template <typename T> int finder(vector<T> vec, T number) {
auto itr = find(vec.begin(), vec.end(), number);
size_t index = distance(vec.begin(), itr);
if (index != vec.size())
return 1;
else
return 0;
}
ll frac(ll n) {
if (n == 0)
return 1;
return (n * frac(n - 1)) % MOD;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(int argc, char **argv) {
#ifdef HIRO
string quiz(argv[1]);
string id(argv[2]);
string filename("input/" + quiz + "/" + id + ".txt");
ifstream fin(filename);
if (fin.peek() == ifstream::traits_type::eof()) {
cout << "No input.";
return 0;
}
ifstream cin(filename);
std::cin.rdbuf(cin.rdbuf());
#endif
ld ans = 0, per;
// ll n;
// cin >> n;
ll n, k, x;
cin >> n >> k;
// ll n, m, k;
// cin >> n >> m >> k;
fi(1, n + 1) {
per = 1;
x = i;
while (x < k) {
per /= 2;
x *= 2;
}
ans += per;
}
ans /= n;
cout << ans << endl;
return 0;
}
| #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>> qp;
#define mp make_pair
#define pi 3.14159265358979323846
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
#define gt(T) greater<T>()
#define sum(v) accumulate(v.begin(), v.end(), 0)
#define uni(v) \
do { \
sort(v.begin(), v.end()); \
decltype(v)::iterator result = unique(v.begin(), v.end()); \
v.erase(result, v.end()); \
} while (0)
#define fi(init, n) for (int i = init; i < n; ++i)
#define fj(init, n) for (int j = init; j < n; ++j)
#define fk(init, n) for (int k = init; k < n; ++k)
#define zero(x) memset(x, 0, sizeof(x))
#define negative(x) memset(x, ~0, sizeof(x))
const ll MOD = 1e9 + 7;
const int INF = 1e9;
const int di[] = {0, 1, 0, -1};
const int dj[] = {1, 0, -1, 0};
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
template <typename T> int finder(vector<T> vec, T number) {
auto itr = find(vec.begin(), vec.end(), number);
size_t index = distance(vec.begin(), itr);
if (index != vec.size())
return 1;
else
return 0;
}
ll frac(ll n) {
if (n == 0)
return 1;
return (n * frac(n - 1)) % MOD;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(int argc, char **argv) {
#ifdef HIRO
string quiz(argv[1]);
string id(argv[2]);
string filename("input/" + quiz + "/" + id + ".txt");
ifstream fin(filename);
if (fin.peek() == ifstream::traits_type::eof()) {
cout << "No input.";
return 0;
}
ifstream cin(filename);
std::cin.rdbuf(cin.rdbuf());
#endif
ld ans = 0, per;
// ll n;
// cin >> n;
ll n, k, x;
cin >> n >> k;
// ll n, m, k;
// cin >> n >> m >> k;
fi(1, n + 1) {
per = 1;
x = i;
while (x < k) {
per /= 2;
x *= 2;
}
ans += per;
}
ans /= n;
cout << setprecision(9) << ans << endl;
return 0;
}
| [
"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;
constexpr long long int infll = 1001001001001001LL;
constexpr int INF = 1000000007;
constexpr int inf = 1000000007;
const int 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 chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline double nCr(const int n, int r) {
if (n == 0) {
return 0;
}
if (r == 0) {
return 1;
}
if (r == 1) {
return n;
}
if (n == r) {
return 1;
}
if (r > n / 2) {
r = n / 2;
}
double result = 1;
for (double i = 1; i <= r; i++) {
result *= (n - i + 1) / i;
}
return (result);
}
template <typename T> T seinomi(T a) {
if (a > 0) {
return a;
} else {
return 0;
}
}
//----------------------------------------------------------------
int main() {
ll n, k;
cin >> n >> k;
int j;
double sum = 0;
ll cnt = 0;
for (int i = 1; i <= n; i++) {
j = i;
cnt = 0;
while (j <= k) {
j = j * 2;
cnt++;
}
sum += (double)1 / (pow(2, cnt) * n);
}
cout << fixed << setprecision(15) << sum << endl;
} | #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;
constexpr long long int infll = 1001001001001001LL;
constexpr int INF = 1000000007;
constexpr int inf = 1000000007;
const int 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 chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline double nCr(const int n, int r) {
if (n == 0) {
return 0;
}
if (r == 0) {
return 1;
}
if (r == 1) {
return n;
}
if (n == r) {
return 1;
}
if (r > n / 2) {
r = n / 2;
}
double result = 1;
for (double i = 1; i <= r; i++) {
result *= (n - i + 1) / i;
}
return (result);
}
template <typename T> T seinomi(T a) {
if (a > 0) {
return a;
} else {
return 0;
}
}
//----------------------------------------------------------------
int main() {
ll n, k;
cin >> n >> k;
int j;
double sum = 0;
ll cnt = 0;
for (int i = 1; i <= n; i++) {
j = i;
cnt = 0;
while (j < k) {
j = j * 2;
cnt++;
}
sum += (double)1 / (pow(2, cnt) * n);
}
cout << fixed << setprecision(15) << sum << endl;
} | [
"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) {
point *= 2;
loop++;
}
ans += pow_list[loop];
}
ans *= (1 / N);
cout << setprecision(20) << ans << endl;
return 0;
}
| #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) {
point *= 2;
loop++;
}
ans += pow_list[loop];
}
ans *= (1. / N);
cout << setprecision(20) << ans << endl;
return 0;
}
| [] | 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) {
a *= 2;
temp /= 2;
}
probability += temp;
}
cout << setprecision(10) << probability << endl;
} | #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) {
a *= 2;
temp /= 2;
}
probability += temp;
}
cout << setprecision(10) << probability << endl;
} | [
"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 0;
}
| #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(15) << ans;
return 0;
}
| [
"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) * i < k)
p++;
ans += ((double)1 / (n * pow(2, p)));
}
printf("%.8f\n", ans);
} | #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) * i < k)
p++;
ans += ((double)1 / (n * pow(2, p)));
}
printf("%.9f\n", ans);
} | [
"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 >> n >> k;
double sum = 0;
for (int i = 1; i <= n; i++)
sum += 1 / factorial(coin_throw(i, k));
double ans = sum / n;
cout << setprecision(8) << ans << endl;
return 0;
} | #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 >> n >> k;
double sum = 0;
for (int i = 1; i <= n; i++)
sum += 1 / factorial(coin_throw(i, k));
double ans = sum / n;
cout << setprecision(10) << ans << endl;
return 0;
}
| [
"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.0 / N) * pow(0.5, A[i]);
}
cout << setprecision(10) << ans << endl;
} | #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 += (1.0 / N) * pow(0.5, A[i]);
}
cout << setprecision(10) << ans << endl;
} | [
"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 pw = 1;
while (i * pw < K)
pw *= 2;
ans += 1 / pw;
}
ans *= N;
cout << setprecision(15) << ans << endl;
}
| #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 pw = 1;
while (i * pw < K)
pw *= 2;
ans += 1 / pw;
}
ans /= N;
cout << setprecision(15) << ans << endl;
}
| [
"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;
}
ans += tmp;
}
cout << ans << endl;
return 0;
} | #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;
}
ans += tmp;
}
cout << setprecision(12) << ans << endl;
return 0;
} | [
"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 << setprecision(15) << ans << endl;
}
| #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 << fixed << setprecision(12) << ans << endl;
}
| [
"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.141592653589793238462643383279502884197169399375105820974
#define ten5p1 100001
#define ten6p1 1000001
#define ten8p1 100000001
#define ten9p1 1000000001
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define rep(var, n) for (int var = 0; var < n; ++var)
#define repi(n) rep(i, n)
#define repj(n) rep(j, n)
#define repi1(n) for (int i = 1; i < n; ++i)
#define repj1(n) for (int j = 1; j < n; ++j)
int _min(int a, int b) { return a <= b ? a : b; }
int _min(ll a, ll b) { return a <= b ? a : b; }
int _max(int a, int b) { return a >= b ? a : b; }
int _max(ll a, ll b) { return a >= b ? a : b; }
void zero(int *data, int n) { memset(data, 0, sizeof(int) * n); }
void zero(ll *data, int n) { memset(data, 0, sizeof(ll) * n); }
void zero(char *data, int n) { memset(data, 0, sizeof(char) * n); }
char readc() {
char var;
fscanf(_fin, "%c", &var);
return var;
}
int readi() {
int var;
fscanf(_fin, "%d", &var);
return var;
}
ll readll() {
ll var;
fscanf(_fin, "%lld", &var);
return var;
}
void repread(int *data, int n) { repi(n) data[i] = readi(); }
void repread(ll *data, int n) { repi(n) data[i] = readll(); }
int reads(char *str, int maxsize) {
for (;;) {
if (fgets(str, maxsize, _fin) == NULL)
break;
if (str[0] != '\n' && str[0] != '\r')
break;
}
int slen = strlen(str);
if (slen == 0)
return 0;
if (str[slen - 1] == '\n' || str[slen - 1] == '\r')
str[--slen] = 0;
return slen;
}
#define writec(var) fprintf(_fout, "%c", var)
#define writecsp(var) fprintf(_fout, "%c ", var)
#define writecln(var) fprintf(_fout, "%c\n", var)
#define writei(var) fprintf(_fout, "%d", var)
#define writeisp(var) fprintf(_fout, "%d ", var)
#define writellsp(var) fprintf(_fout, "%lld ", var)
#define writeiln(var) fprintf(_fout, "%d\n", var)
#define writellln(var) fprintf(_fout, "%lld\n", var)
#define writeulln(var) fprintf(_fout, "%llu\n", var)
#define writefln(var) fprintf(_fout, "%f\n", var)
#define writes(str) fprintf(_fout, "%s", str)
#define writesp() fprintf(_fout, " ")
#define writeln() fprintf(_fout, "\n")
#define RUN_LOCAL(testfilename) \
{ \
_fin = fopen(testfilename, "r"); \
if (_fin == NULL) \
_fin = stdin; \
}
#define swap(type, a, b) \
{ \
type t = a; \
a = b; \
b = t; \
}
#define sort(data, n) std::sort(data, data + n)
//#define mod(a,b) b==0 ? 0 : a==0 ? 0 :(a>0 ? a%b : b + a % b) //what the hell
//is this...
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void reverse(char *data, int n) {
int k = n >> 1;
repi(k) {
char tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
void reverse(int *data, int n) {
int k = n >> 1;
repi(k) {
int tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
#define _Vec(type, name) \
struct name { \
type *data; \
int size; \
int n; \
}; \
void init(name *t, int size) { \
t->data = (type *)malloc(sizeof(type) * size); \
t->size = size; \
t->n = 0; \
} \
void resize(name *t) { \
int ns = t->size * 1.2f; \
t->data = (type *)realloc(t->data, sizeof(type) * ns); \
t->size = ns; \
} \
void add(name *t, type val) { \
if (t->n >= t->size) \
resize(t); \
int k = t->n; \
t->data[k] = val; \
t->n = k + 1; \
} \
void free(name *t) { free(t->data); }
_Vec(int, Veci) _Vec(long long, Vecll) _Vec(char *, Vecs)
#define _ispal(type, name) \
int name(type *a, type *b, int n) { \
repi(n) { \
if (a[i] != b[n - i - 1]) { \
return 0; \
} \
} \
return 1; \
}
_ispal(int, ispali) _ispal(char, ispalc)
#define _Pair(type, name) \
struct name { \
type x, y; \
}; \
int cmp_##name(const void *_a, const void *_b) { \
name *a = (name *)_a; \
name *b = (name *)_b; \
if (a->x == b->x) { \
if (a->y < b->y) \
return -1; \
else \
return 1; \
} \
if (a->x < b->x) \
return -1; \
else \
return 1; \
} \
void sort_##name(name *d, int n) { qsort(d, n, sizeof(name), cmp_##name); }
_Pair(int, Pairi)
int cmp_Str(const void *_a, const void *_b) {
char *a = *((char **)_a);
char *b = *((char **)_b);
return strcmp(a, b);
}
void sort_Str(char **str, int n) { qsort(str, n, sizeof(char *), cmp_Str); }
ll expmod(ll x, ll n, ll m) {
ll ans = 1;
for (; n;) {
if (n & 1)
ans = (ans * x) % m;
x = (x * x) % m;
n >>= 1;
}
return ans;
}
ll combmod(ll n, ll k, ll m) {
ll ret = 1;
ll div = 1;
for (ll i = 0; i < k; ++i) {
ret = (ret * (n - i) % m) % m;
div = (div * (i + 1)) % m;
}
div = expmod(div, m - 2, m) % m;
return (ret * div) % m;
}
//------------------------------------------
//------------
int main() {
RUN_LOCAL("xxtestcase_05in.txt");
int n = readi();
int target = readi();
double ans = 0.0;
int remain = 0;
for (int roll = 1; roll <= n; ++roll) {
if (roll >= target) {
remain = n - roll;
break;
}
/*int k = 0;
int a = roll;
for (int _k = 1; _k < 32; ++_k)
{
a <<= 1;
if (a >= target)
{
k = _k;
break;
}
}*/
double s = log((double)target / roll) / log(2.0);
int sint = s;
if ((double)sint < s)
sint++;
// printf("%f k:%d\n", pow(0.5, k),k);
ans += pow(0.5, sint);
// ans += pow(0.5, k);
}
ans /= n;
ans += (double)remain / n;
printf("%.10f\n", ans);
return 0;
}
| /*
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.141592653589793238462643383279502884197169399375105820974
#define ten5p1 100001
#define ten6p1 1000001
#define ten8p1 100000001
#define ten9p1 1000000001
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define rep(var, n) for (int var = 0; var < n; ++var)
#define repi(n) rep(i, n)
#define repj(n) rep(j, n)
#define repi1(n) for (int i = 1; i < n; ++i)
#define repj1(n) for (int j = 1; j < n; ++j)
int _min(int a, int b) { return a <= b ? a : b; }
int _min(ll a, ll b) { return a <= b ? a : b; }
int _max(int a, int b) { return a >= b ? a : b; }
int _max(ll a, ll b) { return a >= b ? a : b; }
void zero(int *data, int n) { memset(data, 0, sizeof(int) * n); }
void zero(ll *data, int n) { memset(data, 0, sizeof(ll) * n); }
void zero(char *data, int n) { memset(data, 0, sizeof(char) * n); }
char readc() {
char var;
fscanf(_fin, "%c", &var);
return var;
}
int readi() {
int var;
fscanf(_fin, "%d", &var);
return var;
}
ll readll() {
ll var;
fscanf(_fin, "%lld", &var);
return var;
}
void repread(int *data, int n) { repi(n) data[i] = readi(); }
void repread(ll *data, int n) { repi(n) data[i] = readll(); }
int reads(char *str, int maxsize) {
for (;;) {
if (fgets(str, maxsize, _fin) == NULL)
break;
if (str[0] != '\n' && str[0] != '\r')
break;
}
int slen = strlen(str);
if (slen == 0)
return 0;
if (str[slen - 1] == '\n' || str[slen - 1] == '\r')
str[--slen] = 0;
return slen;
}
#define writec(var) fprintf(_fout, "%c", var)
#define writecsp(var) fprintf(_fout, "%c ", var)
#define writecln(var) fprintf(_fout, "%c\n", var)
#define writei(var) fprintf(_fout, "%d", var)
#define writeisp(var) fprintf(_fout, "%d ", var)
#define writellsp(var) fprintf(_fout, "%lld ", var)
#define writeiln(var) fprintf(_fout, "%d\n", var)
#define writellln(var) fprintf(_fout, "%lld\n", var)
#define writeulln(var) fprintf(_fout, "%llu\n", var)
#define writefln(var) fprintf(_fout, "%f\n", var)
#define writes(str) fprintf(_fout, "%s", str)
#define writesp() fprintf(_fout, " ")
#define writeln() fprintf(_fout, "\n")
#define RUN_LOCAL(testfilename) \
{ \
_fin = fopen(testfilename, "r"); \
if (_fin == NULL) \
_fin = stdin; \
}
#define swap(type, a, b) \
{ \
type t = a; \
a = b; \
b = t; \
}
#define sort(data, n) std::sort(data, data + n)
//#define mod(a,b) b==0 ? 0 : a==0 ? 0 :(a>0 ? a%b : b + a % b) //what the hell
//is this...
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void reverse(char *data, int n) {
int k = n >> 1;
repi(k) {
char tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
void reverse(int *data, int n) {
int k = n >> 1;
repi(k) {
int tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
#define _Vec(type, name) \
struct name { \
type *data; \
int size; \
int n; \
}; \
void init(name *t, int size) { \
t->data = (type *)malloc(sizeof(type) * size); \
t->size = size; \
t->n = 0; \
} \
void resize(name *t) { \
int ns = t->size * 1.2f; \
t->data = (type *)realloc(t->data, sizeof(type) * ns); \
t->size = ns; \
} \
void add(name *t, type val) { \
if (t->n >= t->size) \
resize(t); \
int k = t->n; \
t->data[k] = val; \
t->n = k + 1; \
} \
void free(name *t) { free(t->data); }
_Vec(int, Veci) _Vec(long long, Vecll) _Vec(char *, Vecs)
#define _ispal(type, name) \
int name(type *a, type *b, int n) { \
repi(n) { \
if (a[i] != b[n - i - 1]) { \
return 0; \
} \
} \
return 1; \
}
_ispal(int, ispali) _ispal(char, ispalc)
#define _Pair(type, name) \
struct name { \
type x, y; \
}; \
int cmp_##name(const void *_a, const void *_b) { \
name *a = (name *)_a; \
name *b = (name *)_b; \
if (a->x == b->x) { \
if (a->y < b->y) \
return -1; \
else \
return 1; \
} \
if (a->x < b->x) \
return -1; \
else \
return 1; \
} \
void sort_##name(name *d, int n) { qsort(d, n, sizeof(name), cmp_##name); }
_Pair(int, Pairi)
int cmp_Str(const void *_a, const void *_b) {
char *a = *((char **)_a);
char *b = *((char **)_b);
return strcmp(a, b);
}
void sort_Str(char **str, int n) { qsort(str, n, sizeof(char *), cmp_Str); }
ll expmod(ll x, ll n, ll m) {
ll ans = 1;
for (; n;) {
if (n & 1)
ans = (ans * x) % m;
x = (x * x) % m;
n >>= 1;
}
return ans;
}
ll combmod(ll n, ll k, ll m) {
ll ret = 1;
ll div = 1;
for (ll i = 0; i < k; ++i) {
ret = (ret * (n - i) % m) % m;
div = (div * (i + 1)) % m;
}
div = expmod(div, m - 2, m) % m;
return (ret * div) % m;
}
//------------------------------------------
//------------
int main() {
RUN_LOCAL("xxtestcase_05in.txt");
int n = readi();
int target = readi();
double ans = 0.0;
int remain = 0;
for (int roll = 1; roll <= n; ++roll) {
if (roll >= target) {
remain = n - roll + 1;
break;
}
/*int k = 0;
int a = roll;
for (int _k = 1; _k < 32; ++_k)
{
a <<= 1;
if (a >= target)
{
k = _k;
break;
}
}*/
double s = log((double)target / roll) / log(2.0);
int sint = s;
if ((double)sint < s)
sint++;
// printf("%f k:%d\n", pow(0.5, k),k);
ans += pow(0.5, sint);
// ans += pow(0.5, k);
}
ans /= n;
ans += (double)remain / n;
printf("%.10f\n", ans);
return 0;
}
| [
"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++) {
int heads_needed = need(i, k);
double second_part = pow(0.5, heads_needed);
total += second_part;
}
return first_part * total;
}
int main() {
int n, k;
cin >> n >> k;
cout << setprecision(8);
cout << solve(n, k) << endl;
}
| #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++) {
int heads_needed = need(i, k);
double second_part = pow(0.5, heads_needed);
total += second_part;
}
return first_part * total;
}
int main() {
int n, k;
cin >> n >> k;
cout << setprecision(9);
cout << solve(n, k) << endl;
}
| [
"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 << float(1.0/N) * powf(0.5, n_j) << endl;;
ans += float(1.0 / N) * powf(0.5, n_j);
if ((i + 1) * pow(2, n_j - 1) >= K)
n_j--;
if (n_j < 0)
n_j = 0;
}
cout << setprecision(10) << ans;
} | #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 << float(1.0/N) * powf(0.5, n_j) << endl;;
ans += double(1.0 / N) * powf(0.5, n_j);
if ((i + 1) * pow(2, n_j - 1) >= K)
n_j--;
if (n_j < 0)
n_j = 0;
}
cout << setprecision(19) << ans;
} | [
"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 << float(1.0/N) * powf(0.5, n_j) << endl;;
ans += float(1.0 / N) * powf(0.5, n_j);
if ((i + 1) * pow(2, n_j - 1) >= K)
n_j--;
if (n_j < 0)
n_j = 0;
}
cout << setprecision(9) << ans;
} | #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 << float(1.0/N) * powf(0.5, n_j) << endl;;
ans += double(1.0 / N) * powf(0.5, n_j);
if ((i + 1) * pow(2, n_j - 1) >= K)
n_j--;
if (n_j < 0)
n_j = 0;
}
cout << setprecision(19) << ans;
} | [
"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>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define pi 3.14159265359;
// %llu %lf
// v:vector type:型 order:greater(大きい順) or less(小さい順)
#define _sort(v, type, order) \
do { \
sort(v.begin(), v.end(), order<type>()); \
} while (0)
/*
◆pairでもソートは可能
vector<pair<int32_t, bool>> pr(n);
sort(pr.begin(), pr.end(),_compare);
bool _compare(pair<int32_t, bool> a, pair<int32_t, bool> b) {
// firstで比較する場合
if (a.first != b.first) {
return a.first < b.first; // 昇順
return a.first > b.first; // 降順
}
// どちらも同じ
return true;
// secondで比較する場合
if (a.second != b.second) {
return a.second < b.second; // 昇順
return a.second > b.second; // 降順
}
// どちらも同じ
return true;
}
*/
// vector 要素の総和算出
// v:vector default_value:初期値
#define _sum(v, default_value) accumulate(v.begin(), v.end(), default_value)
// vector 最大値( return ite )
#define _max_element(v) max_element(v.begin(), v.end())
// vector 最小値( return ite )
#define _min_element(v) min_element(v.begin(), v.end())
// vector 最大値が格納されている要素値
#define _max_element_number(v) \
distance(v.begin(), max_element(v.begin(), v.end()))
// 特定コンテナの中から特定の値をカウントする
#define _count(v, value) count(v.begin(), v.end(), value)
// set<uint32_t> member; // 重複するデータを保持する事はできない
// member.insert(2) member.insert(2) ⇒ member.count(2)は1
// member.emplace(2)とかも同じ
// member.size()で確認すると同じ値の挿入ではサイズ変化はない
// multiset<uint32_t> v; // 重複するデータも保持する事はできる
// member.insert(2) member.insert(2) ⇒ member.count(2)は2
// 丸め
#define _round(v) round(v)
// 2乗 / 3乗
#define _square(v) pow(v, 2)
#define _cube(v) pow(v, 3)
// 大小判定
#define _max(x, y) max(x, y)
#define _min(x, y) min(x, y)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// string ⇒ int
#define _stringtoi(s) stoi(s)
// double 平方根
#define _sqrt(x) sqrt(x)
// double 引数 x 以上で最小の整数値 ex) 3.30303 ⇒ 4
#define _ceil(x) ceil(x)
// 指定された要素 【以上の】 値が現れる最初の位置のイテレータを取得する
#define _lower_bound(v, min) lower_bound(v.begin(), v.end(), min)
// 指定された要素 【より大きい】値が現れる最初の位置のイテレータを取得する
#define _upper_bound(v, min) upper_bound(v.begin(), v.end(), min)
// 順列 n個の数が与えられる
// 0,1,2,...,n-1
// 全ての並べ方を1行ごとに出力する
// ex 0 1 2 / 0 2 1 / 1 0 2 / 1 2 0 / 2 0 1 / 2 1 0
#define _next_permutation(v) \
do { \
for (auto num : v) { \
printf("%d ", num); \
} \
printf("\n"); \
/* ※ 昇順である必要がある */ \
/* ※ pair も pair.firstで可能 */ \
} while (next_permutation(v.begin(), v.end()))
// ■bitset
// 100 桁の 2 進数を定義する。
// bitset<100> bs;
//
// 8桁 の 2進数を定義し、10進数 131で初期化
// bitset<8> bs(131); // 7 ビット目から 0
// ビット目への順番で、10000011 になる
//
// 8桁 の 2進数を定義し、2進数で初期化
// bitset<8> bs("10000011"); // 7 ビット目から 0 ビット目への順番で、10000011
// となる。 string _bs; cin >> _bs; bitset<100> bs(_bs); _bs =
// "10000011"であれば上記と同様
//
// 与えられる数値について、それぞれの和を算出する場合
// 下記コードでビットが立っている要素値＝和の値となる
// ex.) AGC 020 C https://atcoder.jp/contests/agc020/tasks/agc020_c
// bitset<1000> dp;
// p[0] = 1;
// for (int i = 0; i < N; ++i) {
// dp |= (dp << A[i]);
// }
// 絶対値
template <typename T> static T _abs(const T x) { return (x > 0 ? x : -x); }
// 最大公約数
int64_t gcd(int64_t a, int64_t b) {
while (b) {
int64_t c = b;
b = a % b;
a = c;
}
return a;
}
// 最小公倍数
int64_t lcm(int64_t a, int64_t b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
// 多次元 std::vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
// ex) auto dp = make_vec<uint64_t>(SIZE + 1, 2, 2);
//
// 2次元 vector の初期化
// vector< vector<int> > s( n, vector<int>(m, 0) );
// pair
// vector<vector<pair<int32_t,int32_t>>> f(n);
// ⇒ 挿入 f[i].push_back(make_pair(x, y));
// Union Find Tree
class UnionFind {
public:
vector<int32_t> par; // 各元の親を表す配列
vector<int32_t> siz; // 素集合のサイズを表す配列(1 で初期化)
// Constructor 初期では親は自分自身
UnionFind(int32_t sz_) : par(sz_), siz(sz_, 1LL) {
for (int32_t i = 0; i < sz_; ++i)
par[i] = i;
}
void init(int32_t sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL); // resize だとなぜか初期化されなかった
for (int32_t i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Find
int32_t root(int32_t x) {
// x の親の親を x の親とする
while (par[x] != x) {
x = par[x] = par[par[x]];
// printf("%d\n", x);
}
return x;
}
// Union(Unite, Merge)
bool merge(int32_t x, int32_t y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
// 連結判定
bool is_same(int32_t x, int32_t y) { return root(x) == root(y); }
// 素集合のサイズ
int32_t size(int32_t x) { return siz[root(x)]; }
// 参照
void view(void) {
for (size_t i = 0; i < par.size(); i++) {
printf("%d\n", par[i]);
}
}
};
// ■
// UINT32_MAX
// 4294967295 ≒ 4 * 1e9
// ■
// 割り算した結果との比較での丸め対処時
// ABC 161 B
// https://atcoder.jp/contests/abc161/tasks/abc161_b
// double border = _sum(v, 0 / (double)(4 * m);
// ↓
// uint32_t border = (_sum(v, 0) + (4 * m) - 1) / (4 * m);
/*************************************************************/
// ABC 126
// C - Dice and Coin
// https://atcoder.jp/contests/abc126/tasks/abc126_c
/*
■問題文
すぬけ君は 1 〜 N の整数が等確率で出る N
面サイコロと表と裏が等確率で出るコインを持っています。
すぬけ君は、このサイコロとコインを使って今から次のようなゲームをします。
１．まず、サイコロを 1回振り、出た目を現在の得点とする。
２．得点が 1以上 K−1
以下である限り、すぬけ君はコインを振り続ける。表が出たら得点は 2
倍になり、裏が出たら得点は 0になる。 ３．得点が 0になった、もしくは K
以上になった時点でゲームが終了する。このとき、得点が K
以上である場合すぬけ君の勝ち、 0 である場合すぬけ君の負けである。
N と K
が与えられるので、このゲームですぬけ君が勝つ確率を求めてください。
■制約
・1 ≤ N ≤ 1e5
・1 ≤ K ≤ 1e5
・入力はすべて整数
■入力
N K
■出力
すぬけ君が勝つ確率を出力せよ。絶対誤差または相対誤差が 10−9
以下のとき正解とみなされる。
■入力例
3 10
■出力例
0.145833333333
*/
int main() {
int32_t n, k;
cin >> n >> k;
long double result = 0;
for (int32_t i = 1; i <= n; i++) {
long double temp = 1.0 / n;
int32_t dice = i;
while (dice < k) {
temp *= 0.5;
dice = dice << 1;
}
result += temp;
}
printf("%.12f\n", result);
return 0;
}
// プログラムの実行: Ctrl + F5 または [デバッグ] > [デバッグなしで開始] メニュー
// プログラムのデバッグ: F5 または [デバッグ] > [デバッグの開始] メニュー
// 作業を開始するためのヒント:
// 1. ソリューション エクスプローラー
// ウィンドウを使用してファイルを追加/管理します
// 2. チーム エクスプローラー ウィンドウを使用してソース管理に接続します
// 3. 出力ウィンドウを使用して、ビルド出力とその他のメッセージを表示します
// 4. エラー一覧ウィンドウを使用してエラーを表示します
// 5. [プロジェクト] > [新しい項目の追加] と移動して新しいコード
// ファイルを作成するか、[プロジェクト] > [既存の項目の追加]
// と移動して既存のコード ファイルをプロジェクトに追加します
// 6. 後ほどこのプロジェクトを再び開く場合、[ファイル] > [開く] >
// [プロジェクト] と移動して .sln ファイルを選択します
| // 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>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define pi 3.14159265359;
// %llu %lf
// v:vector type:型 order:greater(大きい順) or less(小さい順)
#define _sort(v, type, order) \
do { \
sort(v.begin(), v.end(), order<type>()); \
} while (0)
/*
◆pairでもソートは可能
vector<pair<int32_t, bool>> pr(n);
sort(pr.begin(), pr.end(),_compare);
bool _compare(pair<int32_t, bool> a, pair<int32_t, bool> b) {
// firstで比較する場合
if (a.first != b.first) {
return a.first < b.first; // 昇順
return a.first > b.first; // 降順
}
// どちらも同じ
return true;
// secondで比較する場合
if (a.second != b.second) {
return a.second < b.second; // 昇順
return a.second > b.second; // 降順
}
// どちらも同じ
return true;
}
*/
// vector 要素の総和算出
// v:vector default_value:初期値
#define _sum(v, default_value) accumulate(v.begin(), v.end(), default_value)
// vector 最大値( return ite )
#define _max_element(v) max_element(v.begin(), v.end())
// vector 最小値( return ite )
#define _min_element(v) min_element(v.begin(), v.end())
// vector 最大値が格納されている要素値
#define _max_element_number(v) \
distance(v.begin(), max_element(v.begin(), v.end()))
// 特定コンテナの中から特定の値をカウントする
#define _count(v, value) count(v.begin(), v.end(), value)
// set<uint32_t> member; // 重複するデータを保持する事はできない
// member.insert(2) member.insert(2) ⇒ member.count(2)は1
// member.emplace(2)とかも同じ
// member.size()で確認すると同じ値の挿入ではサイズ変化はない
// multiset<uint32_t> v; // 重複するデータも保持する事はできる
// member.insert(2) member.insert(2) ⇒ member.count(2)は2
// 丸め
#define _round(v) round(v)
// 2乗 / 3乗
#define _square(v) pow(v, 2)
#define _cube(v) pow(v, 3)
// 大小判定
#define _max(x, y) max(x, y)
#define _min(x, y) min(x, y)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// string ⇒ int
#define _stringtoi(s) stoi(s)
// double 平方根
#define _sqrt(x) sqrt(x)
// double 引数 x 以上で最小の整数値 ex) 3.30303 ⇒ 4
#define _ceil(x) ceil(x)
// 指定された要素 【以上の】 値が現れる最初の位置のイテレータを取得する
#define _lower_bound(v, min) lower_bound(v.begin(), v.end(), min)
// 指定された要素 【より大きい】値が現れる最初の位置のイテレータを取得する
#define _upper_bound(v, min) upper_bound(v.begin(), v.end(), min)
// 順列 n個の数が与えられる
// 0,1,2,...,n-1
// 全ての並べ方を1行ごとに出力する
// ex 0 1 2 / 0 2 1 / 1 0 2 / 1 2 0 / 2 0 1 / 2 1 0
#define _next_permutation(v) \
do { \
for (auto num : v) { \
printf("%d ", num); \
} \
printf("\n"); \
/* ※ 昇順である必要がある */ \
/* ※ pair も pair.firstで可能 */ \
} while (next_permutation(v.begin(), v.end()))
// ■bitset
// 100 桁の 2 進数を定義する。
// bitset<100> bs;
//
// 8桁 の 2進数を定義し、10進数 131で初期化
// bitset<8> bs(131); // 7 ビット目から 0
// ビット目への順番で、10000011 になる
//
// 8桁 の 2進数を定義し、2進数で初期化
// bitset<8> bs("10000011"); // 7 ビット目から 0 ビット目への順番で、10000011
// となる。 string _bs; cin >> _bs; bitset<100> bs(_bs); _bs =
// "10000011"であれば上記と同様
//
// 与えられる数値について、それぞれの和を算出する場合
// 下記コードでビットが立っている要素値＝和の値となる
// ex.) AGC 020 C https://atcoder.jp/contests/agc020/tasks/agc020_c
// bitset<1000> dp;
// p[0] = 1;
// for (int i = 0; i < N; ++i) {
// dp |= (dp << A[i]);
// }
// 絶対値
template <typename T> static T _abs(const T x) { return (x > 0 ? x : -x); }
// 最大公約数
int64_t gcd(int64_t a, int64_t b) {
while (b) {
int64_t c = b;
b = a % b;
a = c;
}
return a;
}
// 最小公倍数
int64_t lcm(int64_t a, int64_t b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
// 多次元 std::vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
// ex) auto dp = make_vec<uint64_t>(SIZE + 1, 2, 2);
//
// 2次元 vector の初期化
// vector< vector<int> > s( n, vector<int>(m, 0) );
// pair
// vector<vector<pair<int32_t,int32_t>>> f(n);
// ⇒ 挿入 f[i].push_back(make_pair(x, y));
// Union Find Tree
class UnionFind {
public:
vector<int32_t> par; // 各元の親を表す配列
vector<int32_t> siz; // 素集合のサイズを表す配列(1 で初期化)
// Constructor 初期では親は自分自身
UnionFind(int32_t sz_) : par(sz_), siz(sz_, 1LL) {
for (int32_t i = 0; i < sz_; ++i)
par[i] = i;
}
void init(int32_t sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL); // resize だとなぜか初期化されなかった
for (int32_t i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Find
int32_t root(int32_t x) {
// x の親の親を x の親とする
while (par[x] != x) {
x = par[x] = par[par[x]];
// printf("%d\n", x);
}
return x;
}
// Union(Unite, Merge)
bool merge(int32_t x, int32_t y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
// 連結判定
bool is_same(int32_t x, int32_t y) { return root(x) == root(y); }
// 素集合のサイズ
int32_t size(int32_t x) { return siz[root(x)]; }
// 参照
void view(void) {
for (size_t i = 0; i < par.size(); i++) {
printf("%d\n", par[i]);
}
}
};
// ■
// UINT32_MAX
// 4294967295 ≒ 4 * 1e9
// ■
// 割り算した結果との比較での丸め対処時
// ABC 161 B
// https://atcoder.jp/contests/abc161/tasks/abc161_b
// double border = _sum(v, 0 / (double)(4 * m);
// ↓
// uint32_t border = (_sum(v, 0) + (4 * m) - 1) / (4 * m);
/*************************************************************/
// ABC 126
// C - Dice and Coin
// https://atcoder.jp/contests/abc126/tasks/abc126_c
/*
■問題文
すぬけ君は 1 〜 N の整数が等確率で出る N
面サイコロと表と裏が等確率で出るコインを持っています。
すぬけ君は、このサイコロとコインを使って今から次のようなゲームをします。
１．まず、サイコロを 1回振り、出た目を現在の得点とする。
２．得点が 1以上 K−1
以下である限り、すぬけ君はコインを振り続ける。表が出たら得点は 2
倍になり、裏が出たら得点は 0になる。 ３．得点が 0になった、もしくは K
以上になった時点でゲームが終了する。このとき、得点が K
以上である場合すぬけ君の勝ち、 0 である場合すぬけ君の負けである。
N と K
が与えられるので、このゲームですぬけ君が勝つ確率を求めてください。
■制約
・1 ≤ N ≤ 1e5
・1 ≤ K ≤ 1e5
・入力はすべて整数
■入力
N K
■出力
すぬけ君が勝つ確率を出力せよ。絶対誤差または相対誤差が 10−9
以下のとき正解とみなされる。
■入力例
3 10
■出力例
0.145833333333
*/
int main() {
int32_t n, k;
cin >> n >> k;
double result = 0;
for (int32_t i = 1; i <= n; i++) {
double temp = 1.0 / n;
int32_t dice = i;
while (dice < k) {
temp *= 0.5;
dice = dice << 1;
}
result += temp;
}
printf("%.12f\n", result);
return 0;
}
// プログラムの実行: Ctrl + F5 または [デバッグ] > [デバッグなしで開始] メニュー
// プログラムのデバッグ: F5 または [デバッグ] > [デバッグの開始] メニュー
// 作業を開始するためのヒント:
// 1. ソリューション エクスプローラー
// ウィンドウを使用してファイルを追加/管理します
// 2. チーム エクスプローラー ウィンドウを使用してソース管理に接続します
// 3. 出力ウィンドウを使用して、ビルド出力とその他のメッセージを表示します
// 4. エラー一覧ウィンドウを使用してエラーを表示します
// 5. [プロジェクト] > [新しい項目の追加] と移動して新しいコード
// ファイルを作成するか、[プロジェクト] > [既存の項目の追加]
// と移動して既存のコード ファイルをプロジェクトに追加します
// 6. 後ほどこのプロジェクトを再び開く場合、[ファイル] > [開く] >
// [プロジェクト] と移動して .sln ファイルを選択します
| [
"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 <= k) {
t *= 2;
cnt++;
}
ans += 1 / n * pow(0.5, cnt);
}
printf("%.10f\n", ans);
} | #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;
while (t < k) {
t *= 2;
cnt++;
}
ans += 1 / n * pow(0.5, cnt);
}
printf("%.10f\n", ans);
} | [
"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>
#include <unordered_map>
#include <vector>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(), a.end())
#define ff first
#define ss second
#define pii pair<int, int>
#define lcm(a, b) (a * b) / __gcd(a, b)
using namespace std;
inline void solve() {
int n, k;
cin >> n >> k;
ld ans = 0.0;
for (int i = 1; i <= n; i++) {
int h = i, p = 1;
while (h <= k) {
h *= 2;
p *= 2;
}
ans += (1.0 / (p * n));
}
cout.precision(20);
cout << ans << endl;
}
signed main() {
int n = 1; // cin>>n;
while (n--)
solve();
return 0;
}
| /*------------------------------------
........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>
#include <unordered_map>
#include <vector>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(), a.end())
#define ff first
#define ss second
#define pii pair<int, int>
#define lcm(a, b) (a * b) / __gcd(a, b)
using namespace std;
inline void solve() {
int n, k;
cin >> n >> k;
ld ans = 0.0;
for (int i = 1; i <= n; i++) {
int h = i, p = 1;
while (h < k) {
h *= 2;
p *= 2;
}
ans += (1.0 / (p * n));
}
cout.precision(20);
cout << ans << endl;
}
signed main() {
int n = 1; // cin>>n;
while (n--)
solve();
return 0;
}
| [
"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.