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 |
|---|---|---|---|---|---|---|---|
p03043 | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T, class Cmp>
ostream &operator<<(ostream &out, const set<T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream &operator<<(ostream &out, const map<U, T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &p : a) {
out << (first ? "" : ", ");
out << p.first << ":" << p.second;
first = 0;
}
out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
#define int long long
using P = pair<int, int>;
//#########################################
signed main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
double tmp = 1;
int cnt = 0;
int now = i;
while (now < k) {
now *= 2;
cnt++;
}
tmp /= pow(2.0, cnt);
ans += tmp;
}
printf("%12lf", ans / n);
return 0;
}
| #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T, class Cmp>
ostream &operator<<(ostream &out, const set<T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream &operator<<(ostream &out, const map<U, T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &p : a) {
out << (first ? "" : ", ");
out << p.first << ":" << p.second;
first = 0;
}
out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
#define int long long
using P = pair<int, int>;
//#########################################
signed main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
double tmp = 1;
int cnt = 0;
int now = i;
while (now < k) {
now *= 2;
cnt++;
}
tmp /= pow(2.0, cnt);
ans += tmp;
}
printf("%12.12lf", ans / n);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,400 | 860,401 | u818349438 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
const int MOD = 1000000007;
void solve() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int temp = i;
int count = 0;
while (temp < k) {
temp *= 2;
count++;
}
ans += pow(0.5, count);
}
ans /= n;
cout << ans << endl;
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
const int MOD = 1000000007;
void solve() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int temp = i;
int count = 0;
while (temp < k) {
temp *= 2;
count++;
}
ans += pow(0.5, count);
}
ans /= n;
cout << setprecision(10) << ans << endl;
}
int main() {
solve();
return 0;
} | [
"io.output.change"
] | 860,404 | 860,405 | u280175105 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
// typedef
// -----------------------------------------------------------------------------
typedef long long ll;
typedef long double ld;
// container util
// -----------------------------------------------------------------------------
#define ALL(c) (c).begin(), (c).end()
#define SZ(c) ((ll)(c).size())
#define MAX(c) *max_element(ALL(c))
#define MIN(c) *min_element(ALL(c))
#define SORT(c) sort((c).begin(), (c).end())
// repetition
// -----------------------------------------------------------------------------
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
// -----------------------------------------------------------------------------
const int INF = 1e9;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
const double PI = acos(-1.0);
// debug
// -----------------------------------------------------------------------------
#define DUMP(x) cerr << #x << " = " << (x) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
ll N, K;
cin >> N >> K;
ld ans = 0;
for (ll i = 1; i <= N; i++) {
ll c = 0;
if (i < K) {
c = ceil(log2l(K / i));
}
ans += 1 / (N * pow(2, c));
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
// typedef
// -----------------------------------------------------------------------------
typedef long long ll;
typedef long double ld;
// container util
// -----------------------------------------------------------------------------
#define ALL(c) (c).begin(), (c).end()
#define SZ(c) ((ll)(c).size())
#define MAX(c) *max_element(ALL(c))
#define MIN(c) *min_element(ALL(c))
#define SORT(c) sort((c).begin(), (c).end())
// repetition
// -----------------------------------------------------------------------------
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
// -----------------------------------------------------------------------------
const int INF = 1e9;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
const double PI = acos(-1.0);
// debug
// -----------------------------------------------------------------------------
#define DUMP(x) cerr << #x << " = " << (x) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
ld N, K;
cin >> N >> K;
ld ans = 0;
for (ld i = 1; i <= N; i++) {
ld c = 0;
if (i < K) {
c = ceil(log2l(K / i));
}
ans += 1 / (N * pow(2, c));
}
cout << ans << "\n";
} | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 860,408 | 860,409 | u811321379 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N, K;
cin >> N >> K;
long double rate = 0.0;
for (int i = 1; i <= N; i++) {
ll n = i;
ll t = 0;
while (n <= K) {
n *= 2;
t++;
// cout<<n<<endl;
}
// cout<<t<<endl;
long double d = (long double)1.0 / (long double)N;
rate += d * pow((long double)0.5, (long double)t);
// cout<< fixed << setprecision(15) <<(1/N)+pow(0.5,t)<<endl;
}
cout << fixed << setprecision(15) << rate << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N, K;
cin >> N >> K;
long double rate = 0.0;
for (int i = 1; i <= N; i++) {
ll n = i;
ll t = 0;
while (n < K) {
n *= 2;
t++;
// cout<<n<<endl;
}
// cout<<t<<endl;
long double d = (long double)1.0 / (long double)N;
rate += d * pow((long double)0.5, (long double)t);
// cout<< fixed << setprecision(15) <<(1/N)+pow(0.5,t)<<endl;
}
cout << fixed << setprecision(15) << rate << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,419 | 860,420 | u998287969 | cpp |
p03043 | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j, k
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(), a.end())
#define push(a, b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a, b) (a, vector<ll>(b))
#define llpvec vector<pair<ll, ll>>
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗*/ ll llpow(ll x, ll n) {
ll i, ans = 1;
rep(i, 0, n) ans *= x;
return ans;
}
/*float n乗*/ ll floatpow(float x, ll n) {
ll i;
float ans = 1;
rep(i, 0, n) ans *= x;
return ans;
}
/*階乗*/ ll fact(ll x) {
ll i, ans = 1;
rep(i, 0, x) ans *= (x - i);
return ans;
}
/*nCr*/ ll ncr(ll n, ll r) { return fact(n) / fact(r) / fact(n - r); }
/*nPr*/ ll npr(ll n, ll r) { return fact(n) / fact(n - r); }
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll i;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
double ans = 0;
llfor; ///////////////////////////////////////////////////////////
int main() {
ll n, k;
ll times;
double prob = 1;
sc(n);
sc(k);
rep(i, 1, n + 1) {
prob = 1;
rep(j, 0, k) { //何回サイコロを振ればよいか
if (i * llpow(2, j) >= k) {
times = j;
break;
}
}
rep(j, 0, times) prob *= 0.5;
ans += prob / (double)n;
// cout<<i<<" "<<times<<" "<<ans<<endl;
}
printf("%lf\n", ans);
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j, k
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(), a.end())
#define push(a, b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a, b) (a, vector<ll>(b))
#define llpvec vector<pair<ll, ll>>
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗*/ ll llpow(ll x, ll n) {
ll i, ans = 1;
rep(i, 0, n) ans *= x;
return ans;
}
/*float n乗*/ ll floatpow(float x, ll n) {
ll i;
float ans = 1;
rep(i, 0, n) ans *= x;
return ans;
}
/*階乗*/ ll fact(ll x) {
ll i, ans = 1;
rep(i, 0, x) ans *= (x - i);
return ans;
}
/*nCr*/ ll ncr(ll n, ll r) { return fact(n) / fact(r) / fact(n - r); }
/*nPr*/ ll npr(ll n, ll r) { return fact(n) / fact(n - r); }
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll i;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
double ans = 0;
llfor; ///////////////////////////////////////////////////////////
int main() {
ll n, k;
ll times;
double prob = 1;
sc(n);
sc(k);
rep(i, 1, n + 1) {
prob = 1;
rep(j, 0, k) { //何回サイコロを振ればよいか
if (i * llpow(2, j) >= k) {
times = j;
break;
}
}
rep(j, 0, times) prob *= 0.500;
ans += prob / (double)n;
// cout<<i<<" "<<times<<" "<<ans<<endl;
}
printf("%.9lf\n", ans);
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,428 | 860,429 | u006717664 | cpp |
p03043 | #include <iostream>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
double ret = 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;
printf("%.12f\n", ret);
}
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
double ret = 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;
}
printf("%.12f\n", ret);
}
| [] | 860,438 | 860,439 | u466018786 | cpp |
p03043 | // Author : Hardik Upadhyay
// college: SVNIT
// slogan : Ab to phod dunga
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define sq(a) (a) * (a)
#define nl "\n"
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
const int MAXN = 100005;
ll mod = 1000000007;
long double power(double a, double b) {
if (b == 0)
return 1.0;
long double res = 1;
res = pow(a, b / 2);
res *= res;
if ((int)b % 2 == 1) {
res *= a;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
double res = 0;
double x = (double)1 / n;
bool f = 0;
for (int i = 1; i <= n; i++) {
double st = i;
int tmp = x;
while (st < k) {
st = st * 2;
tmp = tmp / 2;
}
res += (tmp);
}
printf("%.15f", res);
return 0;
}
| // Author : Hardik Upadhyay
// college: SVNIT
// slogan : Ab to phod dunga
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define sq(a) (a) * (a)
#define nl "\n"
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
const int MAXN = 100005;
ll mod = 1000000007;
long double power(double a, double b) {
if (b == 0)
return 1.0;
long double res = 1;
res = pow(a, b / 2);
res *= res;
if ((int)b % 2 == 1) {
res *= a;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
double res = 0;
double x = (double)1 / n;
bool f = 0;
for (int i = 1; i <= n; i++) {
double st = i;
double tmp = x;
while (st < k) {
st = st * 2;
tmp = tmp / 2;
}
res += (tmp);
}
printf("%.15f", res);
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 860,440 | 860,441 | u933442616 | cpp |
p03043 | // Author : Hardik Upadhyay
// college: SVNIT
// slogan : Ab to phod dunga
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define sq(a) (a) * (a)
#define nl "\n"
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
const int MAXN = 100005;
ll mod = 1000000007;
long double power(double a, double b) {
if (b == 0)
return 1.0;
long double res = 1;
res = pow(a, b / 2);
res *= res;
if ((int)b % 2 == 1) {
res *= a;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
double res = 0;
double x = (double)1 / n;
bool f = 0;
for (int i = 1; i <= n; i++) {
double st = i;
int tmp = x;
while (st < k) {
st = st * 2;
x = x / 2;
}
res += (x);
}
printf("%.15lf", res);
return 0;
}
| // Author : Hardik Upadhyay
// college: SVNIT
// slogan : Ab to phod dunga
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define sq(a) (a) * (a)
#define nl "\n"
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
const int MAXN = 100005;
ll mod = 1000000007;
long double power(double a, double b) {
if (b == 0)
return 1.0;
long double res = 1;
res = pow(a, b / 2);
res *= res;
if ((int)b % 2 == 1) {
res *= a;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
double res = 0;
double x = (double)1 / n;
bool f = 0;
for (int i = 1; i <= n; i++) {
double st = i;
double tmp = x;
while (st < k) {
st = st * 2;
tmp = tmp / 2;
}
res += (tmp);
}
printf("%.15f", res);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,442 | 860,441 | u933442616 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double P = 0;
rep(i, n) {
double p = 1 / double(n);
if (i < min(k, n)) {
int m = i;
while (m < k) {
p *= 0.5;
m *= 2;
}
P += p;
} else
P += p;
}
cout << fixed << setprecision(10) << P << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double P = 0;
rep(i, n) {
double p = 1 / double(n);
if (i < k) {
int m = i;
while (m < k) {
p *= 0.5;
m *= 2;
}
P += p;
} else
P += p;
}
cout << fixed << setprecision(12) << P << endl;
} | [
"call.remove",
"call.arguments.change",
"literal.number.change",
"io.output.change"
] | 860,445 | 860,446 | u252211543 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef vector<int> vec;
int main() {
double n, k;
cin >> n >> k;
long double ans = 0;
rep(i, n) {
if (i + 1 >= k)
ans += 2;
else
ans += 1 / (pow(2, int(log2(ceil(k / (i + 1))))));
}
ans /= 2 * n;
cout << fixed << setprecision(10);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef vector<int> vec;
int main() {
double n, k;
cin >> n >> k;
long double ans = 0;
rep(i, n) {
if (i + 1 >= k)
ans += 2;
else
ans += 1 / (pow(2, -1 + ceil(log2(ceil(k / (i + 1))))));
}
ans /= 2 * n;
cout << fixed << setprecision(10);
cout << ans << endl;
}
| [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 860,447 | 860,448 | u441296840 | cpp |
p03043 | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
std::cout << std::fixed << std::setprecision(12);
int N, K;
cin >> N >> K;
double ans = 0;
double rate = 1.0 / N;
int cnt;
int temp;
for (int i = 1; i <= N; i++) {
rate = 1.0 / N;
cnt = 0;
temp = i;
while (temp <= K) {
temp *= 2;
cnt++;
}
rate *= pow(0.5, cnt);
ans += rate + EPS;
}
cout << ans << "\n";
return (0);
} | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
std::cout << std::fixed << std::setprecision(10);
int N, K;
cin >> N >> K;
double ans = 0;
double rate = 1.0 / N;
int cnt;
int temp;
for (int i = 1; i <= N; i++) {
rate = 1.0 / N;
cnt = 0;
temp = i;
while (temp < K) {
temp *= 2;
cnt++;
}
rate *= pow(0.50, cnt);
ans += rate;
}
cout << ans << "\n";
return (0);
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 860,453 | 860,454 | u027946359 | cpp |
p03043 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a, i, j, v) \
for (ll k = i; k <= j; k++) { \
a[k] = v; \
}
int main() {
int n, k;
cin >> n >> k;
double res = 0;
FOR(i, 1, n) {
if (i < k) {
res += (1 / (double)n) * pow((1 / (double)2), ceil(log2(k / i)));
} else {
res += (1 / (double)n);
}
}
cout.precision(17);
cout << fixed << res << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a, i, j, v) \
for (ll k = i; k <= j; k++) { \
a[k] = v; \
}
int main() {
int n, k;
cin >> n >> k;
double res = 0;
FOR(i, 1, n) {
if (i < k) {
res += (1 / (double)n) * pow((1 / (double)2), ceil(log2(k / (double)i)));
} else {
res += (1 / (double)n);
}
}
cout.precision(17);
cout << fixed << res << endl;
return 0;
} | [
"assignment.change"
] | 860,461 | 860,462 | u358055446 | cpp |
p03043 | #include <iostream>
using namespace std;
int main(void) {
long long n, k;
double ans = 0.0;
cin >> n >> k;
for (long long i = 1; i <= n; i++) {
double sum = i;
double tmp = n;
while (sum <= k) {
sum *= 2.0;
tmp *= 2.0;
}
ans += (1.0 / tmp);
}
// cout << ans << endl;
printf("%.16f\n", ans);
}
| #include <iostream>
using namespace std;
int main(void) {
long long n, k;
long double ans = 0.0;
cin >> n >> k;
for (long long i = 1; i <= n; i++) {
long double sum = i;
long double tmp = n;
while (sum <= k - 1) {
sum *= 2.0;
tmp *= 2.0;
}
ans += (1.0 / tmp);
// ans += tmp;
}
// cout << ans << endl;
printf("%.16Lf\n", ans);
}
| [
"variable_declaration.type.widen.change",
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,463 | 860,464 | u094155508 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, s, n) for (int i = s; i < n; i++)
#define per(i, s, n) for (int i = n - 1; i >= s; i--)
#define fi first
#define se second
#define all(c) c.begin(), c.end()
typedef long long int ll;
typedef pair<int, int> P;
typedef long double ld;
void Ans(bool x) {
if (x)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
const ll INF = 1001001001;
const ll mod = 1000000007;
int main() {
ld n, k;
cin >> n >> k;
ld a = 0.5;
ld ans = 0;
Rep(i, 1, n + 1) {
ll now = i;
ld na = 1.0;
while (now < k) {
na *= a;
now *= 2;
}
ans += na;
}
cout << fixed << setprecision(10);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, s, n) for (int i = s; i < n; i++)
#define per(i, s, n) for (int i = n - 1; i >= s; i--)
#define fi first
#define se second
#define all(c) c.begin(), c.end()
typedef long long int ll;
typedef pair<int, int> P;
typedef long double ld;
void Ans(bool x) {
if (x)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
const ll INF = 1001001001;
const ll mod = 1000000007;
int main() {
ld n, k;
cin >> n >> k;
ld a = 0.5;
ld ans = 0;
Rep(i, 1, n + 1) {
ll now = i;
ld na = 1.0;
while (now < k) {
na *= a;
now *= 2;
}
ans += na;
}
ans /= n;
cout << fixed << setprecision(10);
cout << ans << endl;
}
| [
"assignment.add"
] | 860,472 | 860,473 | u564204618 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
rep(i, n + 1) {
double p = 1;
int x = i + 1;
while (x < k) {
p *= 0.5;
x *= 2;
}
ans += p / n;
}
cout << fixed << setprecision(15) << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
rep(i, n) {
double p = 1;
int x = i + 1;
while (x < k) {
p *= 0.5;
x *= 2;
}
ans += p / n;
}
cout << fixed << setprecision(15) << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 860,474 | 860,475 | u442855610 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; i++) {
if (i >= k)
ans += 1 / n;
else {
double j = k / i;
int l = 0;
while (j >= 1) {
// cout<<j<<endl;
j /= 2;
l++;
}
ans += 1 / (n * pow(2, l));
}
}
cout << fixed << setprecision(15) << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; i++) {
if (i >= k)
ans += 1 / n;
else {
double j = k / i;
int l = 0;
while (j > 1) {
// cout<<j<<endl;
j /= 2;
l++;
}
ans += 1 / (n * pow(2, l));
}
}
cout << fixed << setprecision(15) << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,495 | 860,496 | u877494916 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; i++) {
if (i >= k)
ans += 1 / n;
else {
double j = k / i;
int l = 0;
while (j >= 1) {
// cout<<j<<endl;
j /= 2;
l++;
}
ans += 1 / (n * pow(2, l));
}
}
cout << fixed << setprecision(10) << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; i++) {
if (i >= k)
ans += 1 / n;
else {
double j = k / i;
int l = 0;
while (j > 1) {
// cout<<j<<endl;
j /= 2;
l++;
}
ans += 1 / (n * pow(2, l));
}
}
cout << fixed << setprecision(15) << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.number.change",
"io.output.change"
] | 860,497 | 860,496 | u877494916 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int n, k;
// dp[i] = 整数iの状態から勝つ確率
double dp[100005];
double solve(int i) {
if (dp[i] >= 0)
return dp[i];
return dp[i] = solve(2 * i) / 2.0;
}
int main() {
cin >> n >> k;
rep(i, 100005) dp[i] = -1.0;
for (int i = k; i < 100005; i++)
dp[i] = 1.0;
double ans = 0.0;
for (int i = n; i >= 1; i--) {
ans += solve(i);
}
ans /= n;
printf("%.10f\n", ans);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int n, k;
// dp[i] = 整数iの状態から勝つ確率
double dp[200005];
double solve(int i) {
if (dp[i] >= 0)
return dp[i];
return dp[i] = solve(2 * i) / 2.0;
}
int main() {
cin >> n >> k;
rep(i, 100005) dp[i] = -1.0;
for (int i = k; i < 200005; i++)
dp[i] = 1.0;
double ans = 0.0;
for (int i = n; i >= 1; i--) {
ans += solve(i);
}
ans /= n;
printf("%.10f\n", ans);
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 860,500 | 860,501 | u194930818 | cpp |
p03043 | #include <stdio.h>
int main(void) {
int a, b;
scanf("%d %d", &a, &b);
double ret = 0;
for (int loop = 1; loop <= a; loop++) {
double tmp = 1.0 * a;
int now = loop;
while (now < b) {
now *= 2;
tmp /= 2;
}
ret += tmp;
}
printf("%.12f\n", ret);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b;
scanf("%d %d", &a, &b);
double ret = 0;
for (int loop = 1; loop <= a; loop++) {
double tmp = 1.0 / a;
int now = loop;
while (now < b) {
now *= 2;
tmp /= 2;
}
ret += tmp;
}
printf("%.12f\n", ret);
return 0;
} | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 860,507 | 860,508 | u716903426 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define FOR(i, l, r) for (i = l; i < r; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define P pair<ll, ll>
#define F first
#define S second
signed main() {
double N, K, i, ans;
cin >> N >> K;
REP(i, N) {
ll A = i + 1, S = 1;
while (A >= K) {
A *= 2;
S *= 2;
}
ans += 1.000000000000 / (double)S;
}
printf("%.12lf\n", ans / N);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define FOR(i, l, r) for (i = l; i < r; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define P pair<ll, ll>
#define F first
#define S second
signed main() {
double N, K, i, ans;
cin >> N >> K;
REP(i, N) {
ll A = i + 1, S = 1;
while (A < K) {
A *= 2;
S *= 2;
}
ans += 1.000000000000 / (double)S;
}
printf("%.12lf\n", ans / N);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,516 | 860,517 | u820224016 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, k;
cin >> n >> k;
double kotae = 0;
for (int i = 1; i <= n; i++) {
double p = 1;
int kazu = i;
while (kazu <= k) {
p *= 0.5;
kazu *= 2;
}
kotae += p / (double)n;
}
cout << fixed << setprecision(12) << kotae << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, k;
cin >> n >> k;
double kotae = 0;
for (int i = 1; i <= n; i++) {
double p = 1;
int kazu = i;
while (kazu < k) {
p *= 0.5;
kazu *= 2;
}
kotae += p / (double)n;
}
cout << fixed << setprecision(12) << kotae << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,522 | 860,523 | u406647332 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using VI = vector<ll>;
using VD = vector<ld>;
using VVI = vector<VI>;
using VC = vector<char>;
using VVC = vector<VC>;
using VS = vector<string>;
using PLL = pair<ll, ll>;
using PLD = pair<ld, ld>;
using VPLL = vector<PLL>;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element((x).begin(), (x).end())
#define MIN(x) *min_element((x).begin(), (x).end())
#define SORTR(x) sort((x).rbegin(), (x).rend())
#define SORT(x) sort((x).begin(), (x).end())
#define SUM(x) accumulate((x).begin(), (x).end(), 0)
#define FILL(x, a) fill(x.begin(), x.end(), a)
#define EACH(i, x) \
for (typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
const int INF = 1 << 30;
const ld EPS = 1e-10;
const int MOD = int(1e9) + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class BidirectionalIterator>
bool next_partial_permutation(BidirectionalIterator first,
BidirectionalIterator middle,
BidirectionalIterator last) {
reverse(middle, last);
return next_permutation(first, last);
}
#define COUT(x) cout << x << "\n"
void Main() {
ld N, K;
ld result = 0;
cin >> N >> K;
FOR(i, 1, N) {
ll n = 0;
while (pow(2, n) <= K / (ld)i) {
n++;
}
result += pow((ld)(0.5), n);
}
result /= N;
cout << result << "\n";
return;
}
int main() {
std::cin.tie(0);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using VI = vector<ll>;
using VD = vector<ld>;
using VVI = vector<VI>;
using VC = vector<char>;
using VVC = vector<VC>;
using VS = vector<string>;
using PLL = pair<ll, ll>;
using PLD = pair<ld, ld>;
using VPLL = vector<PLL>;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element((x).begin(), (x).end())
#define MIN(x) *min_element((x).begin(), (x).end())
#define SORTR(x) sort((x).rbegin(), (x).rend())
#define SORT(x) sort((x).begin(), (x).end())
#define SUM(x) accumulate((x).begin(), (x).end(), 0)
#define FILL(x, a) fill(x.begin(), x.end(), a)
#define EACH(i, x) \
for (typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
const int INF = 1 << 30;
const ld EPS = 1e-10;
const int MOD = int(1e9) + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class BidirectionalIterator>
bool next_partial_permutation(BidirectionalIterator first,
BidirectionalIterator middle,
BidirectionalIterator last) {
reverse(middle, last);
return next_permutation(first, last);
}
#define COUT(x) cout << x << "\n"
void Main() {
ld N, K;
ld result = 0;
cin >> N >> K;
FOR(i, 1, N) {
ll n = 0;
while (pow(2, n) < K / (ld)i) {
n++;
}
result += pow((ld)(0.5), n);
}
result /= N;
cout << result << "\n";
return;
}
int main() {
std::cin.tie(0);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,524 | 860,525 | u170054586 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using VI = vector<ll>;
using VD = vector<ld>;
using VVI = vector<VI>;
using VC = vector<char>;
using VVC = vector<VC>;
using VS = vector<string>;
using PLL = pair<ll, ll>;
using PLD = pair<ld, ld>;
using VPLL = vector<PLL>;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element((x).begin(), (x).end())
#define MIN(x) *min_element((x).begin(), (x).end())
#define SORTR(x) sort((x).rbegin(), (x).rend())
#define SORT(x) sort((x).begin(), (x).end())
#define SUM(x) accumulate((x).begin(), (x).end(), 0)
#define FILL(x, a) fill(x.begin(), x.end(), a)
#define EACH(i, x) \
for (typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
const int INF = 1 << 30;
const ld EPS = 1e-10;
const int MOD = int(1e9) + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class BidirectionalIterator>
bool next_partial_permutation(BidirectionalIterator first,
BidirectionalIterator middle,
BidirectionalIterator last) {
reverse(middle, last);
return next_permutation(first, last);
}
#define COUT(x) cout << x << "\n"
void Main() {
ll N, K;
ld result = 0;
cin >> N >> K;
FOR(i, 1, N) {
ll n = 0;
while (pow(2, n) <= K / i) {
n++;
}
result += pow((ld)(0.5), n);
}
result /= N;
cout << result << "\n";
return;
}
int main() {
std::cin.tie(0);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using VI = vector<ll>;
using VD = vector<ld>;
using VVI = vector<VI>;
using VC = vector<char>;
using VVC = vector<VC>;
using VS = vector<string>;
using PLL = pair<ll, ll>;
using PLD = pair<ld, ld>;
using VPLL = vector<PLL>;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element((x).begin(), (x).end())
#define MIN(x) *min_element((x).begin(), (x).end())
#define SORTR(x) sort((x).rbegin(), (x).rend())
#define SORT(x) sort((x).begin(), (x).end())
#define SUM(x) accumulate((x).begin(), (x).end(), 0)
#define FILL(x, a) fill(x.begin(), x.end(), a)
#define EACH(i, x) \
for (typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
const int INF = 1 << 30;
const ld EPS = 1e-10;
const int MOD = int(1e9) + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class BidirectionalIterator>
bool next_partial_permutation(BidirectionalIterator first,
BidirectionalIterator middle,
BidirectionalIterator last) {
reverse(middle, last);
return next_permutation(first, last);
}
#define COUT(x) cout << x << "\n"
void Main() {
ld N, K;
ld result = 0;
cin >> N >> K;
FOR(i, 1, N) {
ll n = 0;
while (pow(2, n) < K / (ld)i) {
n++;
}
result += pow((ld)(0.5), n);
}
result /= N;
cout << result << "\n";
return;
}
int main() {
std::cin.tie(0);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
}
| [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,526 | 860,525 | u170054586 | cpp |
p03043 | #include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
#define maxn 100000
int main() {
// int N,u[maxn],v[maxn],w[maxn],col[maxn];
// cin>>N;
// for(int i(0);i<N;i++){
// cin>>u[i]>>c[i]>>w[i];
// }
// col[0]=1;
//
// for(int i(0);i<N;i++){
//
// }
long double sum(0);
int N, K;
cin >> N >> K;
for (int i(1); i <= N; i++) {
int tmp = i;
int cnt(0);
for (int j(1); j <= K; j++) {
if (tmp >= K) {
break;
}
tmp *= 2;
cnt += 1;
}
sum += (long double)1.0 / powl((long double)2.0, (long double)cnt);
}
cout << setprecision(2) << (long double)sum / N;
// string S;
// cin>>S;
// int y1=atoi((S[0]+S[1]).c_str()),y2=atoi((S[2]+S[3]).c_str());
// if (y1!=0 && y1<=12){
// if (y2!=0 && y2<=12){
// cout << "AMBIGUOUS";
// }else{
// cout<<"MMYY";
// }
// }else{
// if (y2!=0 && y2<=12){
// cout << "YYMM";
// }else{
// cout<<"NA";
// }
// }
return 0;
}
| #include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
#define maxn 100000
int main() {
// int N,u[maxn],v[maxn],w[maxn],col[maxn];
// cin>>N;
// for(int i(0);i<N;i++){
// cin>>u[i]>>c[i]>>w[i];
// }
// col[0]=1;
//
// for(int i(0);i<N;i++){
//
// }
long double sum(0);
int N, K;
cin >> N >> K;
for (int i(1); i <= N; i++) {
int tmp = i;
int cnt(0);
for (int j(1); j <= K; j++) {
if (tmp >= K) {
break;
}
tmp *= 2;
cnt += 1;
}
sum += (long double)1.0 / powl((long double)2.0, (long double)cnt);
}
cout << setprecision(15) << (long double)sum / N;
// string S;
// cin>>S;
// int y1=atoi((S[0]+S[1]).c_str()),y2=atoi((S[2]+S[3]).c_str());
// if (y1!=0 && y1<=12){
// if (y2!=0 && y2<=12){
// cout << "AMBIGUOUS";
// }else{
// cout<<"MMYY";
// }
// }else{
// if (y2!=0 && y2<=12){
// cout << "YYMM";
// }else{
// cout<<"NA";
// }
// }
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 860,527 | 860,528 | u991846372 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int INF = 2147483647; // int max
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
double res = 0.0;
for (int i = 1; i <= n; i++) {
double now = i;
double temp = 1.0 / n;
while (now <= k) {
now *= 2;
temp /= 2;
}
res += temp;
}
cout << fixed << setprecision(10) << res << endl;
return 0;
}
/*
やっほい！
やほほい！
+ *
∧∧ . ∧∞∧ *
* ヽ(=´ω｀)人(´ω｀*)ﾉ
.～（ O x.） （ O)～ +
。* ∪ ∪
*/ | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int INF = 2147483647; // int max
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
double res = 0.0;
for (int i = 1; i <= n; i++) {
int now = i;
double temp = 1.0 / n;
while (now < k) {
now *= 2;
temp /= 2;
}
res += temp;
}
cout << fixed << setprecision(12) << res << endl;
return 0;
}
/*
やっほい！
やほほい！
+ *
∧∧ . ∧∞∧ *
* ヽ(=´ω｀)人(´ω｀*)ﾉ
.～（ O x.） （ O)～ +
。* ∪ ∪
*/ | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.number.change",
"io.output.change"
] | 860,531 | 860,532 | u901555384 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
double sum = 0;
for (int i = 1; i <= N; i++) {
//サイコロの目がiだった時、勝てる確率を求める
int count = 0;
int point = i;
while (point < K - 1) {
point *= 2;
count++;
}
// cout<<i<<": "<<count<<endl;
sum += pow(0.50000000000000, count);
// cout << fixed << setprecision(15) << sum<< endl;
}
// cout << fixed << setprecision(15) << sum << endl;
sum /= N;
cout << fixed << setprecision(15) << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
double sum = 0;
for (int i = 1; i <= N; i++) {
//サイコロの目がiだった時、勝てる確率を求める
int count = 0;
int point = i;
while (point <= K - 1) {
point *= 2;
count++;
}
// cout<<i<<": "<<count<<endl;
sum += pow(0.50000000000000, count);
// cout << fixed << setprecision(15) << sum<< endl;
}
// cout << fixed << setprecision(15) << sum << endl;
sum /= N;
cout << fixed << setprecision(15) << sum << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,537 | 860,538 | u711676593 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
double coin(double a, int score, int k) {
if (score >= k)
return a;
bool ok = true;
if (ok) {
a *= 0.5;
score *= 2;
coin(a, score, k);
}
}
int main() {
int n, k;
cin >> n >> k;
int score;
double rate = (double)1 / n;
double ans = 0;
for (int i = 1; i <= n; i++) {
score = n;
double c = coin(rate, score, k);
ans += c;
}
printf("%.10f", ans);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
double coin(double a, int score, int k) {
if (score >= k)
return a;
bool ok = true;
if (ok) {
a *= 0.5;
score *= 2;
coin(a, score, k);
}
}
int main() {
int n, k;
cin >> n >> k;
int score;
double rate = (double)1 / n;
double ans = 0;
for (int i = 1; i <= n; i++) {
score = i;
double c = coin(rate, score, k);
ans += c;
}
printf("%.10f", ans);
} | [
"assignment.value.change",
"identifier.change"
] | 860,545 | 860,546 | u726957641 | cpp |
p03043 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define isYes(x) printf("%s\n", (x) ? "Yes" : "No")
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define INF (1 << 29)
#define Sp(p) cout << setprecision(25) << fixed << p << endl
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define X first
#define Y second
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
template <class T> void print(T &x) { cout << x << '\n'; }
const int MOD = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const int MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMint() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
if (a > b) {
swap(a, b);
}
return gcd(a, b % a);
}
ll lcm(ll a, ll b) {
ll g;
g = gcd(a, b);
return a * b / g;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
bool compare_by_a(pair<int, int> a, pair<int, int> b) {
if (a.first != b.first) {
return a.first < b.first;
} else {
return a.second < b.second;
}
}
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 RS(ll N, ll P, ll M) {
if (P == 0) {
return 1;
} else {
if (P % 2 == 0) {
ll t = RS(N, P / 2, M);
return t * t % M;
} else {
return N * RS(N, P - 1, M) % M;
}
}
}
int N;
string S;
bool notequal(char a, char b, char c) {
if (a == b || a == c || b == c)
return false;
return true;
}
int main() {
ios::sync_with_stdio(false);
int N = in();
int K = in();
double ans = 0;
REP1(i, N) {
if (i >= K) {
ans += 1;
} else {
double omote = 1;
int tokuten = i;
while (tokuten <= K) {
omote /= 2;
tokuten *= 2;
}
// debug(i);debug(omote);
ans += omote;
}
}
Sp(ans / N);
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define isYes(x) printf("%s\n", (x) ? "Yes" : "No")
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define INF (1 << 29)
#define Sp(p) cout << setprecision(25) << fixed << p << endl
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define X first
#define Y second
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
template <class T> void print(T &x) { cout << x << '\n'; }
const int MOD = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const int MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMint() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
if (a > b) {
swap(a, b);
}
return gcd(a, b % a);
}
ll lcm(ll a, ll b) {
ll g;
g = gcd(a, b);
return a * b / g;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
bool compare_by_a(pair<int, int> a, pair<int, int> b) {
if (a.first != b.first) {
return a.first < b.first;
} else {
return a.second < b.second;
}
}
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 RS(ll N, ll P, ll M) {
if (P == 0) {
return 1;
} else {
if (P % 2 == 0) {
ll t = RS(N, P / 2, M);
return t * t % M;
} else {
return N * RS(N, P - 1, M) % M;
}
}
}
int N;
string S;
bool notequal(char a, char b, char c) {
if (a == b || a == c || b == c)
return false;
return true;
}
int main() {
ios::sync_with_stdio(false);
int N = in();
int K = in();
double ans = 0;
REP1(i, N) {
if (i >= K) {
ans += 1;
} else {
double omote = 1;
int tokuten = i;
while (tokuten < K) {
omote /= 2;
tokuten *= 2;
}
// debug(i);debug(omote);
ans += omote;
}
}
Sp(ans / N);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,555 | 860,556 | u311671153 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (double i = 1; i < n + 1; i++)
#define ll long long int
int log2(int n) { return log(n) / log(2) + 1; }
int main() {
double N, K;
cin >> N >> K;
double count = 0;
rep(i, N) {
double I = i, tem = (double)1 / N;
while (I < K) {
I *= 2;
tem /= 2;
}
count += tem;
}
cout << fixed << count << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (double i = 1; i < n + 1; i++)
#define ll long long int
int log2(int n) { return log(n) / log(2) + 1; }
int main() {
double N, K;
cin >> N >> K;
double count = 0;
rep(i, N) {
double I = i, tem = (double)1 / N;
while (I < K) {
I *= 2;
tem /= 2;
}
count += tem;
}
cout << fixed << setprecision(12) << count << endl;
return 0;
}
| [
"io.output.change"
] | 860,569 | 860,570 | u776439373 | cpp |
p03043 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double ans = 0;
for (int i = 1; i <= N; i++) {
int point = i;
double prob = 1;
while (point < K) {
point *= 2;
prob *= 0.5;
}
ans += prob / N;
}
printf("%g\n", ans);
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double ans = 0;
for (int i = 1; i <= N; i++) {
int point = i;
double prob = 1;
while (point < K) {
point *= 2;
prob *= 0.5;
}
ans += prob / N;
}
printf("%.10f\n", ans);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,578 | 860,579 | u868132236 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 60;
int main(void) {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int tensu = i;
int count = 0;
// コインを振る回数
while (tensu <= k) {
tensu *= 2;
count++;
}
// cout << count << endl;
ll coin = 1;
rep(j, count) { coin *= 2; }
coin *= n;
// cout << coin << endl;
ans += (1.0 / coin);
}
// ans /= n;
printf("%.12lf\n", ans);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 60;
int main(void) {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int tensu = i;
int count = 0;
// コインを振る回数
while (tensu <= k - 1) {
tensu *= 2;
count++;
}
// cout << count << endl;
ll coin = 1;
rep(j, count) { coin *= 2; }
coin *= n;
// cout << coin << endl;
ans += (1.0 / coin);
}
// ans /= n;
printf("%.12lf\n", ans);
return 0;
}
| [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 860,580 | 860,581 | u462639463 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, k;
cin >> n >> k;
double ans = 0.0;
for (int i = 1; i <= n; i++) {
double tmp = k;
if (i < k) {
while (tmp >= i) {
tmp /= 2.0;
}
ans += tmp / (n * k);
} else
ans += 1 / n;
}
printf("%.13f\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, k;
cin >> n >> k;
double ans = 0.0;
for (int i = 1; i <= n; i++) {
double tmp = k;
if (i < k) {
while (tmp > i) {
tmp /= 2.0;
}
ans += tmp / (n * k);
} else
ans += 1 / n;
}
printf("%.13f\n", ans);
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,586 | 860,587 | u057810841 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 100010;
const double eps = 1e-6;
int n, k;
int main() {
scanf("%d%d", &n, &k);
double res = 0.0;
for (int i = 1; i <= n; i++) {
int s = i;
double rate = 1.0;
while (s < k) {
s *= 2;
rate *= 0.5;
}
res += rate;
}
printf("%f\n", res / (double)n);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 100010;
const double eps = 1e-6;
int n, k;
int main() {
scanf("%d%d", &n, &k);
double res = 0.0;
for (int i = 1; i <= n; i++) {
int s = i;
double rate = 1.0;
while (s < k) {
s *= 2;
rate *= 0.5;
}
res += rate;
}
printf("%.9f\n", res / (double)n);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,592 | 860,593 | u866538547 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 100010;
const double eps = 1e-6;
int n, k;
int main() {
scanf("%d%d", &n, &k);
double res = 0.0;
for (int i = 1; i <= n; i++) {
int s = i;
double rate = 1.0;
while (s < k) {
s *= 2.0;
rate *= 0.5;
}
res += rate;
}
printf("%f\n", res / (double)n);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 100010;
const double eps = 1e-6;
int n, k;
int main() {
scanf("%d%d", &n, &k);
double res = 0.0;
for (int i = 1; i <= n; i++) {
int s = i;
double rate = 1.0;
while (s < k) {
s *= 2;
rate *= 0.5;
}
res += rate;
}
printf("%.9f\n", res / (double)n);
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,594 | 860,593 | u866538547 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 100010;
const double eps = 1e-6;
int n, k;
int main() {
scanf("%d%d", &n, &k);
double res = 0.0;
for (int i = 1; i <= n; i++) {
int s = i;
double rate = 1.0;
while (s < k) {
s *= 2.0;
rate *= 0.5;
}
res += rate;
}
printf("%f\n", res / (double)n);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 100010;
const double eps = 1e-6;
int n, k;
int main() {
scanf("%d%d", &n, &k);
double res = 0.0;
for (int i = 1; i <= n; i++) {
int s = i;
double rate = 1.0;
while (s < k) {
s *= 2;
rate *= 0.5;
}
res += rate;
}
printf("%.12f\n", res / (double)n);
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,594 | 860,595 | u866538547 | cpp |
p03043 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a = 0, b = 0, c, d, n, k;
string s, t;
int main() {
cin >> n >> k;
long double sum = 0;
for (int i = 1; i <= n; i++) {
int x = i;
long double z = 1;
while (x < k) {
x *= 2;
z /= 2.0;
}
sum += z;
}
sum = sum / n;
printf("%.12lf\n", sum);
return 0;
} | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a = 0, b = 0, c, d, n, k;
string s, t;
int main() {
cin >> n >> k;
long double sum = 0;
for (int i = 1; i <= n; i++) {
int x = i;
long double z = 1;
while (x < k) {
x *= 2;
z /= 2.0;
}
sum += z;
}
sum = sum / n;
printf("%.12Lf\n", sum);
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 860,596 | 860,597 | u465760322 | cpp |
p03043 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a = 0, b = 0, c, d, n, k;
string s, t;
int main() {
cin >> n >> k;
long double sum = 0;
for (int i = 1; i <= n; i++) {
int x = i;
long double z = 1;
while (x < k) {
x *= 2;
z /= 2.0;
}
sum += z;
}
sum = sum / n;
printf("%.12f\n", sum);
return 0;
} | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a = 0, b = 0, c, d, n, k;
string s, t;
int main() {
cin >> n >> k;
long double sum = 0;
for (int i = 1; i <= n; i++) {
int x = i;
long double z = 1;
while (x < k) {
x *= 2;
z /= 2.0;
}
sum += z;
}
sum = sum / n;
printf("%.12Lf\n", sum);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,598 | 860,597 | u465760322 | cpp |
p03043 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
int main(void) {
double n, k;
cin >> n >> k;
double p = 0;
for (int i = 1; i <= n; i++) {
if (k > i)
p += 1.0 / n * pow(.5, ceil(log(k / i) / log(2)));
else
p += 1.0 / n;
}
printf("%.7lf\n", p);
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
int main(void) {
double n, k;
cin >> n >> k;
double p = 0;
for (int i = 1; i <= n; i++) {
if (k > i)
p += 1.0 / n * pow(.5, ceil(log(k / i) / log(2)));
else
p += 1.0 / n;
}
printf("%.10lf\n", p);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,599 | 860,600 | u755121033 | cpp |
p03043 | //#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 100;
char s[N];
int n, k;
double p;
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
double pp = 1.0 / n;
int tmp = i;
while (tmp <= k)
tmp <<= 1, pp /= 2;
p += pp;
}
printf("%.10f\n", p);
return 0;
} | //#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 100;
char s[N];
int n, k;
double p;
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
double pp = 1.0 / n;
int tmp = i;
while (tmp < k)
tmp <<= 1, pp /= 2;
p += pp;
}
printf("%.10f\n", p);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,603 | 860,604 | u186902062 | cpp |
p03043 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
double now = 0;
long long pt = 0;
for (int i = 1; i <= n; i++) {
pt = i;
now = 1.0;
while (pt <= k) {
pt *= 2;
now /= 2.0;
}
ans += now / n;
}
printf("%.10f\n", ans);
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
double now = 0;
long long pt = 0;
for (int i = 1; i <= n; i++) {
pt = i;
now = 1.0;
while (pt < k) {
pt *= 2;
now /= 2.0;
}
ans += now / n;
}
printf("%.10f\n", ans);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,605 | 860,606 | u955202970 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) \
; \
for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// 最小公倍数を求める
int euqlid(int a, int b) {
int temp;
temp = a % b;
if (temp == 0)
return b;
return euqlid(b, temp);
}
int sumation(int a) { return (1 + a) * a / 2; }
int main() {
double n, k;
cin >> n >> k;
double total = 0;
for (int i = 1; i < n + 1; i++) {
int hoge = i;
int count = 0;
while (hoge <= k) {
hoge *= 2;
count++;
}
total += pow(0.5, count) / n;
}
// cout << fixed << setprecision(12) << total << endl;
printf("%.12f\n", total);
} | #include <bits/stdc++.h>
#define rep(i, n) \
; \
for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// 最小公倍数を求める
int euqlid(int a, int b) {
int temp;
temp = a % b;
if (temp == 0)
return b;
return euqlid(b, temp);
}
int sumation(int a) { return (1 + a) * a / 2; }
int main() {
double n, k;
cin >> n >> k;
double total = 0;
for (int i = 1; i < n + 1; i++) {
int hoge = i;
int count = 0;
while (hoge < k) {
hoge *= 2;
count++;
}
total += pow(0.5, count) / n;
}
// cout << fixed << setprecision(12) << total << endl;
printf("%.12f\n", total);
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,607 | 860,608 | u239316561 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000000
typedef long long ll;
int main(void) {
double n, k;
cin >> n >> k;
double sum = 1 / n;
double ans = 0;
int bai;
for (int i = 1; i <= n; i++) {
if (i >= k) {
sum = 1 / n;
ans += sum;
continue;
}
bai = i;
while (1) {
bai *= 2;
sum *= 0.5;
if (bai > k) {
ans += sum;
sum = 1 / n;
break;
}
}
}
cout << setprecision(12) << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000000
typedef long long ll;
int main(void) {
double n, k;
cin >> n >> k;
double sum = 1 / n;
double ans = 0;
int bai;
for (int i = 1; i <= n; i++) {
if (i >= k) {
sum = 1 / n;
ans += sum;
continue;
}
bai = i;
while (1) {
bai *= 2;
sum *= 0.5;
if (bai >= k) {
ans += sum;
sum = 1 / n;
break;
}
}
}
cout << setprecision(12) << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 860,623 | 860,624 | u950411977 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
double p = 1;
int x = 1;
while (x < k) {
p *= 0.5;
x *= 2;
}
ans += p / n;
}
printf("%.10f\n", ans);
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
double p = 1;
int x = i;
while (x < k) {
p *= 0.5;
x *= 2;
}
ans += p / n;
}
printf("%.10f\n", ans);
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 860,633 | 860,634 | u934529721 | cpp |
p03043 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
int main() {
int N, K;
scanf("%d", &N);
scanf("%d", &K);
double ans = 0.0;
for (int i = 1; i <= N; i++) {
if (i >= K) {
ans += 1.0;
} else {
ans += pow(0.5, int(log2((double)K / i)) + 1);
}
}
ans = ans / (double)N;
printf("%.15lf\n", ans);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
int main() {
int N, K;
scanf("%d", &N);
scanf("%d", &K);
double ans = 0.0;
for (int i = 1; i <= N; i++) {
if (i >= K) {
ans += 1.0;
} else {
ans += pow(0.5, int(log2((double)K / i) + 0.999999999999));
}
}
ans = ans / (double)N;
printf("%.15lf\n", ans);
return 0;
}
| [
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 860,642 | 860,643 | u339419997 | cpp |
p03043 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
int main() {
int N, K;
scanf("%d", &N);
scanf("%d", &K);
double ans = 0.0;
for (int i = 1; i <= N; i++) {
if (i >= K) {
ans += 1.0;
} else {
ans += pow(0.5, int(log2((double)K / i)) + 1);
}
}
ans = ans / (double)N;
printf("%.10lf\n", ans);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
int main() {
int N, K;
scanf("%d", &N);
scanf("%d", &K);
double ans = 0.0;
for (int i = 1; i <= N; i++) {
if (i >= K) {
ans += 1.0;
} else {
ans += pow(0.5, int(log2((double)K / i) + 0.999999999999));
}
}
ans = ans / (double)N;
printf("%.15lf\n", ans);
return 0;
}
| [
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"io.output.change"
] | 860,644 | 860,643 | u339419997 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; ++i) {
int pt = i;
double coin = 1;
while (pt < k) {
pt *= 2;
coin /= 2;
}
ans += coin / n;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; ++i) {
int pt = i;
double coin = 1;
while (pt < k) {
pt *= 2;
coin /= 2;
}
ans += coin / n;
}
cout << setprecision(10) << ans << endl;
} | [
"io.output.change"
] | 860,660 | 860,661 | u540724932 | cpp |
p03043 | #include <bits/stdc++.h>
#define I int
#define S(a) scanf("%d", &a)
#define S2(a, b) scanf("%d%d", &a, &b)
#define P(a) printf("%d\n", a)
#define PL(a) printf("%lld\n", a)
#define PT(t) printf("Case %d: ", t)
#define PB(a) push_back(a)
#define SET(a) memset(a, 0, sizeof a)
#define SETR(a) memset(a, -1, sizeof a)
#define ll long long
using namespace std;
#define mx 500004
#define md 1000000007ll
typedef pair<int, int> P;
typedef vector<ll> V;
////////define value/////
template <class T> inline T BM(T p, T e, T M) {
ll ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T mdINV(T a, T M) { return BM(a, M - 2, M); }
template <class T> inline T PW(T p, T e) {
ll ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p);
p = (p * p);
}
return (T)ret;
}
template <class T> bool ISLEFT(T a, T b, T c) {
if (((a.xx - b.xx) * (b.yy - c.yy) - (b.xx - c.xx) * (a.yy - b.yy)) < 0.0)
return 1; // Uporer dike //A,b,c, x okkher ordera sorted
else
return 0;
}
int main() {
int n, m;
cin >> n >> m;
double res = 0;
for (int i = 1; i <= n; i++) {
int cnt = 0;
for (int j = i; j <= m; j *= 2)
cnt++;
double am = 1;
for (int j = 1; j <= cnt; j++)
am *= .5;
double sum = (am) / (double)n;
res += sum;
}
printf("%.10lf\n", res);
// cout<<res<<endl;
return 0;
} | #include <bits/stdc++.h>
#define I int
#define S(a) scanf("%d", &a)
#define S2(a, b) scanf("%d%d", &a, &b)
#define P(a) printf("%d\n", a)
#define PL(a) printf("%lld\n", a)
#define PT(t) printf("Case %d: ", t)
#define PB(a) push_back(a)
#define SET(a) memset(a, 0, sizeof a)
#define SETR(a) memset(a, -1, sizeof a)
#define ll long long
using namespace std;
#define mx 500004
#define md 1000000007ll
typedef pair<int, int> P;
typedef vector<ll> V;
////////define value/////
template <class T> inline T BM(T p, T e, T M) {
ll ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T mdINV(T a, T M) { return BM(a, M - 2, M); }
template <class T> inline T PW(T p, T e) {
ll ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p);
p = (p * p);
}
return (T)ret;
}
template <class T> bool ISLEFT(T a, T b, T c) {
if (((a.xx - b.xx) * (b.yy - c.yy) - (b.xx - c.xx) * (a.yy - b.yy)) < 0.0)
return 1; // Uporer dike //A,b,c, x okkher ordera sorted
else
return 0;
}
int main() {
int n, m;
cin >> n >> m;
double res = 0;
for (int i = 1; i <= n; i++) {
int cnt = 0;
for (int j = i; j < m; j *= 2)
cnt++;
double am = 1;
for (int j = 1; j <= cnt; j++)
am *= .5;
double sum = (am) / (double)n;
res += sum;
}
printf("%.10lf\n", res);
// cout<<res<<endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 860,668 | 860,669 | u449403739 | cpp |
p03043 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265358979323846
int N, K;
int main() {
cin >> N >> K;
double sum = 0;
for (int i = 1; i < N; i++) {
double tmp = (double)1 / (double)N;
int point = i;
while (point < K) {
point *= 2;
tmp /= (double)2;
}
sum += tmp;
}
cout << setprecision(15) << sum << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265358979323846
int N, K;
int main() {
cin >> N >> K;
double sum = 0;
for (int i = 1; i < N + 1; i++) {
double tmp = (double)1 / (double)N;
int point = i;
while (point < K) {
point *= 2;
tmp /= (double)2;
}
sum += tmp;
}
cout << setprecision(15) << sum << endl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 860,676 | 860,677 | u397070717 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<double> dp(max(n, k) + 1, 1);
for (int i = k - 1; i >= 0; i--) {
dp[i] = dp[min(k, i * 2)] / 2;
}
double res = 0;
for (int i = 0; i < n; i++) {
res += dp[i] / n;
}
cout << fixed << setprecision(12) << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<double> dp(max(n, k) + 1, 1);
for (int i = k - 1; i >= 0; i--) {
dp[i] = dp[min(k, i * 2)] / 2;
}
double res = 0;
for (int i = 1; i <= n; i++) {
res += dp[i] / n;
}
cout << fixed << setprecision(12) << res << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 860,685 | 860,686 | u946322619 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; i += 1) {
if (i >= k) {
ans += 1.0 / n;
} else {
double t = 1.0 / n;
int cur = i;
while (cur <= k) {
cur *= 2;
t /= 2.0;
}
ans += t;
}
}
cout << fixed << setprecision(15) << ans;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
double n, k;
cin >> n >> k;
double ans = 0;
for (double i = 1; i <= n; i += 1) {
if (i >= k) {
ans += 1.0 / n;
} else {
double t = 1.0 / n;
int cur = i;
while (cur < k) {
cur *= 2;
t /= 2.0;
}
ans += t;
}
}
cout << fixed << setprecision(15) << ans;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,689 | 860,690 | u472645805 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
double f(double n, double k, double n2) {
if (n2 > k) {
return 1 / n;
}
return f(n, k, n2 * 2) / 2;
}
int main() {
double n, k, ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
ans += f(n, k, i);
}
cout << fixed;
cout << setprecision(12) << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
double f(double n, double k, double n2) {
if (n2 >= k) {
return 1 / n;
}
return f(n, k, n2 * 2) / 2;
}
int main() {
double n, k, ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
ans += f(n, k, i);
}
cout << fixed;
cout << setprecision(12) << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 860,691 | 860,692 | u761994361 | cpp |
p03043 | #include <iostream>
using namespace std;
#include <iomanip>
int main() {
int k, i, j, u;
double sum = 0.0, z, n;
cin >> n >> k;
for (i = 1; i <= n; i++) {
u = 0;
for (j = i; j <= k - 1; j *= 2) {
u++;
}
z = 1 << u;
if (z != 1)
sum = sum + (1 / z);
// cout<<sum<<"\n";
}
sum = sum * ((1 / n));
cout << fixed << setprecision(12) << sum;
// cout<<"\n";
// cout<<z;
// cout<<sum;
return 0;
} | #include <iostream>
using namespace std;
#include <iomanip>
int main() {
int k, i, j, u;
double sum = 0.0, z, n;
cin >> n >> k;
for (i = 1; i <= n; i++) {
u = 0;
for (j = i; j <= k - 1; j *= 2) {
u++;
}
z = 1 << u;
if (z)
sum = sum + (1 / z);
// cout<<sum<<"\n";
}
sum = sum * ((1 / n));
cout << fixed << setprecision(12) << sum;
// cout<<"\n";
// cout<<z;
// cout<<sum;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 860,696 | 860,697 | u476054945 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
double n, cnt = 0;
cin >> n >> k;
for (int i = 1; i < n + 1; i++) {
if (i >= k)
cnt += 1;
else {
int a = i;
double coin = 1;
while (a < k) {
a *= 2;
coin /= 2;
// cout<<a<<" "<<coin<<" ";
}
cnt += coin;
// cout<<cnt<<endl;
}
}
cout << cnt / n << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
double n, cnt = 0;
cin >> n >> k;
for (int i = 1; i < n + 1; i++) {
if (i >= k)
cnt += 1;
else {
int a = i;
double coin = 1;
while (a < k) {
a *= 2;
coin /= 2;
// cout<<a<<" "<<coin<<" ";
}
cnt += coin;
// cout<<cnt<<endl;
}
}
cout << setprecision(15) << cnt / n << endl;
}
| [
"io.output.change"
] | 860,709 | 860,710 | u263220374 | cpp |
p03043 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (ll i = j; i < (n); i++)
#define CLR(mat, f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a <= x && x < b)
#define out(ans) cout << ans << endl
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
const int INF = 1000000;
const double PI = 3.14159265359;
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
rep(i, 1, n + 1) {
int p = 0;
while (1) {
if ((i << p) >= k)
break;
p++;
}
// out((1>>p));
// ans+=(1>>p);
// out(pow(0.5,p));
ans += pow(0.5, p);
}
cout << setprecision(8) << ans / n << endl;
// out(ans/n);
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (ll i = j; i < (n); i++)
#define CLR(mat, f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a <= x && x < b)
#define out(ans) cout << ans << endl
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
const int INF = 1000000;
const double PI = 3.14159265359;
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
rep(i, 1, n + 1) {
int p = 0;
while (1) {
// cout<<p<<":"<<(i<<p)<<endl;
if ((i << p) >= k)
break;
p++;
}
// cout<<endl;
ans += pow(0.5, p);
}
cout << setprecision(16) << ans / n << endl;
// out(ans/n);
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 860,732 | 860,733 | u139458416 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define MOD 1000000007
#define int long long
int func1(int X) {
int i = 1;
while (i < X)
i *= 2;
return i;
}
signed main() {
int N, K;
cin >> N >> K;
double ans = 0;
rep(i, 1, N + 1) ans += 1.0 / N / func1((i + K - 1) / i);
printf("%.7f\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define MOD 1000000007
#define int long long
int func1(int X) {
int i = 1;
while (i < X)
i *= 2;
return i;
}
signed main() {
int N, K;
cin >> N >> K;
double ans = 0;
rep(i, 1, N + 1) ans += 1.0 / N / func1((i + K - 1) / i);
printf("%.10f\n", ans);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,740 | 860,741 | u347057617 | cpp |
p03043 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double ans = 0;
if (K == 1) {
ans = 1;
cout << setprecision(12) << ans << endl;
return 0;
}
int a;
int needThrow;
for (int i = 1; i <= N; i++) {
a = i;
needThrow = 0;
if (i >= K) {
ans += 1 / N;
} else {
while (a <= K) {
a *= 2;
needThrow++;
}
ans += (1 / N) * pow(0.5, needThrow);
}
}
cout << setprecision(12) << ans << endl;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double ans = 0;
if (K == 1) {
ans = 1;
cout << setprecision(12) << ans << endl;
return 0;
}
int a;
int needThrow;
for (int i = 1; i <= N; i++) {
a = i;
needThrow = 0;
if (a >= K) {
ans += 1 / N;
} else {
while (a < K) {
a *= 2;
needThrow++;
}
ans += (1 / N) * pow(0.5, needThrow);
}
}
cout << setprecision(12) << ans << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,742 | 860,743 | u428132025 | cpp |
p03043 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double ans = 0;
if (K == 1) {
ans = 1;
cout << setprecision(12) << ans << endl;
return 0;
}
int a;
int needThrow;
for (int i = 1; i <= N; i++) {
a = i;
needThrow = 0;
if (i >= K) {
ans += 1 / N;
} else {
while (a <= K) {
a *= 2;
needThrow++;
}
ans += (1 / N) * pow(0.5, needThrow);
}
}
cout << setprecision(12) << ans << endl;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double ans = 0;
if (K == 1) {
ans = 1;
cout << setprecision(12) << ans << endl;
return 0;
}
int a;
int needThrow;
for (int i = 1; i <= N; i++) {
a = i;
needThrow = 0;
if (a >= K) {
ans += 1 / N;
} else {
while (a < K) {
a *= 2;
needThrow++;
}
ans += (1 / N) * pow(0.5, needThrow);
}
}
cout << setprecision(12) << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 860,744 | 860,743 | u428132025 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double pro = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < k) {
for (int j = 0; j < 1000; j++) {
if (pow(2, (j + 1)) * (i + 1) >= k) {
pro += pow(0.5, (j + 1));
break;
}
}
} else {
pro += 1.0;
}
}
cout << pro / n << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double pro = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < k) {
for (int j = 0; j < 1000; j++) {
if (pow(2, (j + 1)) * (i + 1) >= k) {
pro += pow(0.5, (j + 1));
break;
}
}
} else {
pro += 1.0;
}
}
cout << setprecision(10) << pro / n << endl;
} | [
"io.output.change"
] | 860,749 | 860,750 | u955282280 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << x << endl
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define maxch(x, y) x = mmax(x, y)
#define minch(x, y) x = mmin(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt __builtin_popcountll
#define INF 1e16
#define mod 1000000007
int main() {
ll n, k;
cin >> n >> k;
float ans = 0;
rep(i, n) {
ll num = i + 1;
if (num >= k)
ans += 1;
else {
float cnt = 1;
while (num < k) {
cnt *= 0.5;
num *= 2;
}
ans += cnt;
}
}
cout << std::setprecision(18) << ans / n << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << x << endl
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define maxch(x, y) x = mmax(x, y)
#define minch(x, y) x = mmin(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt __builtin_popcountll
#define INF 1e16
#define mod 1000000007
int main() {
double n, k;
cin >> n >> k;
double ans = 0;
rep(i, n) {
double num = i + 1;
if (num >= k)
ans += 1;
else {
double cnt = 1;
while (num < k) {
cnt *= 0.5;
num *= 2;
}
ans += cnt;
}
}
cout << std::setprecision(12) << ans / n << endl;
return 0;
} | [
"variable_declaration.type.change",
"variable_declaration.type.primitive.change",
"literal.number.change",
"io.output.change"
] | 860,751 | 860,752 | u819300485 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define LAST(x) (x)[(x).size() - 1]
#define GI(name) \
int(name); \
scanf("%d", &(name))
#define GI2(name1, name2) \
int(name1), (name2); \
scanf("%d %d", &(name1), &(name2))
#define GI3(name1, name2, name3) \
int(name1), (name2), (name3); \
scanf("%d %d %d", &(name1), &(name2), &(name3))
#define GVI(name, size) \
vector<int>(name)(size); \
FOR(i, (size)) scanf("%d", &(name)[i])
#define GS(name) \
string(name); \
cin >> (name);
#define MOD 1000000007
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
string to_string(string s) { return s; }
template <class T> string to_string(vector<T> v) {
string ret = "{";
FOR(i, v.size() - 1) { ret += to_string(v[i]) + ","; }
if (v.size() > 0) {
ret += to_string(LAST(v));
}
ret += "}";
return ret;
}
void debug() { cerr << endl; }
template <class Head, class... Tail> void debug(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug(tail...);
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
int main() {
GI2(N, K);
double ans = 0;
FORIN(i, 1, N + 1) {
double per = 1.0 / N;
int now = i;
while (now < K) {
now *= 2;
per /= 2.0;
}
ans += per;
}
printf("%1.8f", ans);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define LAST(x) (x)[(x).size() - 1]
#define GI(name) \
int(name); \
scanf("%d", &(name))
#define GI2(name1, name2) \
int(name1), (name2); \
scanf("%d %d", &(name1), &(name2))
#define GI3(name1, name2, name3) \
int(name1), (name2), (name3); \
scanf("%d %d %d", &(name1), &(name2), &(name3))
#define GVI(name, size) \
vector<int>(name)(size); \
FOR(i, (size)) scanf("%d", &(name)[i])
#define GS(name) \
string(name); \
cin >> (name);
#define MOD 1000000007
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
string to_string(string s) { return s; }
template <class T> string to_string(vector<T> v) {
string ret = "{";
FOR(i, v.size() - 1) { ret += to_string(v[i]) + ","; }
if (v.size() > 0) {
ret += to_string(LAST(v));
}
ret += "}";
return ret;
}
void debug() { cerr << endl; }
template <class Head, class... Tail> void debug(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug(tail...);
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
int main() {
GI2(N, K);
double ans = 0;
FORIN(i, 1, N + 1) {
double per = 1.0 / N;
int now = i;
while (now < K) {
now *= 2;
per /= 2.0;
}
ans += per;
}
printf("%1.10f", ans);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,757 | 860,758 | u656771711 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
// i+1はサイコロの目
long long ans = 0;
for (int i = 0; i < n; i++) {
// j+1は表が出る回数
long long score = i + 1;
long long a = 1.0;
if (score < k) {
for (int j = 0; j < k; j++) {
score *= 2;
a /= 2.0;
if (score >= k) {
break;
}
}
}
ans += a / (n * 1.0);
}
cout << fixed << setprecision(20);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double n, k;
cin >> n >> k;
// i+1はサイコロの目
double ans = 0;
for (int i = 0; i < n; i++) {
// j+1は表が出る回数
long long score = i + 1;
double a = 1.0;
if (score < k) {
for (int j = 0; j < k; j++) {
score *= 2;
a /= 2.0;
if (score >= k) {
break;
}
}
}
ans += a / (n * 1.0);
}
cout << fixed << setprecision(20);
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 860,771 | 860,772 | u882039496 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
double temp, shift;
double ans = 0;
cin >> n >> k;
int count;
for (int i = 1; i < n + 1; i++) {
temp = (double)i;
count = 0;
while (temp < k) {
count += 1;
temp *= 2.0;
}
shift = 1 << count;
// cout << shift << endl;
ans += (1.0 / n) / shift;
}
cout << setprecision(7) << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
double temp, shift;
double ans = 0;
cin >> n >> k;
int count;
for (int i = 1; i < n + 1; i++) {
temp = (double)i;
count = 0;
while (temp < k) {
count += 1;
temp *= 2.0;
}
shift = 1 << count;
// cout << shift << endl;
ans += (1.0 / n) / shift;
}
cout << setprecision(10) << ans << endl;
} | [
"literal.number.change",
"io.output.change"
] | 860,794 | 860,795 | u364916333 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
double ans = 0;
for (int i = 1; i <= a; i++) {
double x = 1.0 / a;
int now = i;
while (now < b) {
now *= 2;
x /= 2;
}
ans += x;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
double ans = 0;
for (int i = 1; i <= a; i++) {
double x = 1.0 / a;
int now = i;
while (now < b) {
now *= 2;
x /= 2;
}
ans += x;
}
cout << setprecision(15) << ans << endl;
} | [
"io.output.change"
] | 860,796 | 860,797 | u351265848 | cpp |
p03043 | #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> Vl;
typedef vector<int> VI; // VI a(n);
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<VS> VSS;
typedef vector<VC> VCC;
typedef vector<VI> VVI; // VVI a(n,vector<int>(m)) n * m
typedef vector<Vl> VVl;
typedef pair<int, int> PII;
typedef map<int, int> MP; // MP a;
typedef vector<pair<int, int>> PS;
typedef long long ll; // ll とdoubleは違う
// stack<int> st;
// cout << << endl;
// cin >> ;
int main() {
long double b, x = 1, y = 0, d = 0, n, h, w, k, max = -100, ans = 0,
count = 0, sum = 0;
string s;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
b = 1.0 / n;
int m = i;
while (m < k) {
m *= 2;
b /= 2;
}
ans += b;
}
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> Vl;
typedef vector<int> VI; // VI a(n);
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<VS> VSS;
typedef vector<VC> VCC;
typedef vector<VI> VVI; // VVI a(n,vector<int>(m)) n * m
typedef vector<Vl> VVl;
typedef pair<int, int> PII;
typedef map<int, int> MP; // MP a;
typedef vector<pair<int, int>> PS;
typedef long long ll; // ll とdoubleは違う
// stack<int> st;
// cout << << endl;
// cin >> ;
int main() {
long double b, x = 1, y = 0, d = 0, n, h, w, k, max = -100, ans = 0,
count = 0, sum = 0;
string s;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
b = 1.0 / n;
int m = i;
while (m < k) {
m *= 2;
b /= 2;
}
ans += b;
}
cout << setprecision(15) << ans << endl;
return 0;
}
| [
"io.output.change"
] | 860,800 | 860,801 | u718774863 | cpp |
p03043 | #include <algorithm>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 111111111;
const int c_mINF = -111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int c_Dy[4] = {1, -1, 0, 0};
const int c_div = 1000000007; // 10^9 + 7
int need(int num, int target);
int main() {
int N, K;
scanf("%d%d", &N, &K);
double ans = 0;
for (int i = 1; i <= N; i++) {
ans += 1 / (pow(2, need(i, K)) * N);
}
printf("%f", ans);
}
int need(int num, int target) {
int time = 1;
int ret = 0;
while (num * time < target) {
time *= 2;
ret++;
}
return ret;
}
| #include <algorithm>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 111111111;
const int c_mINF = -111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int c_Dy[4] = {1, -1, 0, 0};
const int c_div = 1000000007; // 10^9 + 7
int need(int num, int target);
int main() {
int N, K;
scanf("%d%d", &N, &K);
double ans = 0;
for (int i = 1; i <= N; i++) {
ans += 1 / (pow(2, need(i, K)) * N);
}
printf("%.16f", ans);
}
int need(int num, int target) {
int time = 1;
int ret = 0;
while (num * time < target) {
time *= 2;
ret++;
}
return ret;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,806 | 860,807 | u433195318 | cpp |
p03043 | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (ll i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) \
for ( \
ll i = (a); i >= (b); \
--i) // 終端を0じゃなくて、1まですることによってn回。感覚的に1以上にしておいた。
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR_EQ(i, 0, n)
#define rep_re(i, n) FOR_RE(i, n, 0)
#define DEBUG_VARIABLE(variable) cout << #variable << ":" << variable << endl
#define INFTY (1 << 21) // 10^21
#define INF (1 << 9)
#define WHITE 1 //（未訪問）
#define GRAY \
2 //（訪問）未だに訪問していない頂点への辺を持っている。スタックに退避。
#define BLACK 3 //（訪問完了）未訪問への頂点への辺を持たない
#define MAX 100000
#define N 100
int M[N][N]; // 隣接行列(頂点と頂点が繋がってる、もしくは重みの値)
int color[N]; // その頂点の探索具合
const int TABLEMAX = 510000;
const int MOD = 1000000007;
//二項係数用の各階乗の値とその逆元を記録するための配列．
long long fac[TABLEMAX], finv[TABLEMAX], inv[TABLEMAX];
// 1個上から時計周り
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//上右下左
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1, 0, 1, 0};
static const int NIL = -1;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> Vector;
typedef vector<Vector> DVector;
typedef vector<pair<ll, ll>> Vec_Pair;
// 関数prime_factorizationで使う。
// 因数分解で使う。firstは数。secondは指数。
vector<pair<ll, ll>> prime_factor;
// 関数get_factor_listで使う。因数の一覧を取得で使う。
Vector factor_list;
// ２つともエラトステネスの篩で使う。
vector<bool> prime; // 素数かどうか判定。
Vector prime_num; // 素数を記録。
ll n;
template <class X> void printArray(X *array, ll);
template <class X> void printVector(vector<X> &v);
template <class X> void printDimention(vector<vector<X>> &dv);
template <class X> void printMap(X);
template <class X> void printVecPair(vector<X> &v);
// 何個2がかかっているか
ll factor2(ll);
// nCr方式で組み合わせの数を求める
ll combination(int, int);
// nPrで階乗を求める
int factorial(int, int);
//桁数を返す
int find_digits(int);
// 各桁の和を計算する関数
int findSumOfDigits(int);
//次数を得る
int degree(int);
//四捨五入
int shishagonyu(double);
//切り上げ
int roundUp(double);
//切り捨て
int roundDown(double);
//四捨五入
int roundOff(double);
//最大公約数(Greatest Common Divisor)
ll gcd(ll, ll);
//最小公倍数(Least Common Multiple)
ll lcm(ll, ll);
//素因数分解
void prime_factorization(ll);
//エラトステネスの篩
void Eratosthenes(int);
//偶奇判定。奇数ならtrue。
bool odd_even(int);
// aのmod mにおける逆元を計算する
long long modinv(long long, long long);
// a^n mod を計算する（二分累乗）
long long modpow(long long, long long, long long);
//テーブルを作る前処理
void COMinit();
//二項係数計算 nCk, 1 <= k <= n <= 10^7
long long COM(int, int);
// longlong型で絶対値を帰す。
long long abs_ll(ll);
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll, ll);
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string, vector<X> &v);
// 因数の一覧を取得する
void get_factor_list(ll);
ll time2(ll lim, ll num) {
ll cnt = 0;
while (num < lim) {
cnt++;
num *= 2;
}
return cnt;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
ll k;
cin >> n >> k;
// 1~nが出たそれぞれの場合で考える
// コインを投げる回数が変わる
ll times, now;
double res, tmp;
rep(i, n) {
tmp = 1.0 / n;
now = (i + 1);
while (now < k) {
now *= 2;
tmp /= 2;
}
res += tmp;
}
printf("%f\n", res);
return 0;
}
template <class X> void printArray(X array[], ll n) {
rep(i, n) {
if (i)
cout << " ";
cout << array[i];
}
cout << endl;
}
template <class X> void printVector(vector<X> &v) {
rep(i, (int)v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
//二次元配列の表示
template <class X> void printDimention(vector<vector<X>> &dv) {
rep(i, (ll)dv.size()) {
rep(j, (ll)dv[i].size()) {
if (j)
cout << " ";
cout << dv[i][j];
}
cout << endl;
}
}
// mapの表示
template <class X> void printMap(X mp) {
for (auto it : mp) {
cout << it.first << " " << it.second << endl;
}
}
// 内部にpairを内包したvectorの表示
template <class X> void printVecPair(vector<X> &v) {
rep(i, (int)v.size()) { cout << v[i].first << " " << v[i].second << endl; }
cout << endl;
}
// numの中に何個2がかかってるか
ll factor2(ll num) {
int cnt = 0;
while (num % 2 == 0) {
num /= 2;
cnt++;
}
return cnt;
}
// nCr方式で組み合わせの数を求める
ll combination(int n, int r) {
ll up = 1, down = 1;
// 以下2行はお試し
ll half = n / 2;
if (r >= half)
r = n - r;
ll up_tmp = n, down_tmp = r;
if (r == 0)
return 1;
rep(i, r) {
up *= up_tmp;
up_tmp--;
down *= down_tmp;
down_tmp--;
}
return up / down;
}
// nPr方式で階乗を求める
int factorial(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
} else {
int res = 1;
while (r) {
r--;
res *= n;
n--;
}
return res;
}
}
//桁数を返す
int find_digits(int n) {
int digit = 0;
while (n) {
n /= 10;
digit++;
}
return digit;
}
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
//次数を得る
int degree(int n) {
int count = 0;
while (1) {
if (count <= 0)
break;
count /= 2;
count++;
}
return count;
}
//四捨五入
int shishagonyu(double x) { return (int)(x < 0.0 ? x - 0.5 : x + 0.5); }
//切り上げ
int roundUp(double n) {
if (n >= 0) {
return (int)n + 1;
} else {
return (int)n - 1;
}
}
//切り捨て
int roundDown(double n) { return (int)n; }
//四捨五入
int roundOff(double n) {
double decimal = 0;
decimal = n - (int)n;
if (decimal >= 0.5 || decimal <= -0.5) {
return roundUp(n);
} else {
return roundDown(n);
}
}
//最大公約数(Greatest Common Divisor)
ll gcd(ll m, ll n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
//ユークリッドの互除法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
//最小公倍数(Least Common Multiple)
ll lcm(ll m, ll n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
// lcm = m * n / gcd(m, n)
return ((m / gcd(m, n)) * n);
}
//素因数分解 firstは数。secondは指数。
void prime_factorization(ll n) {
int div = 2, res;
bool flg = false;
if (n < 2) {
cout << "Error" << endl;
return;
}
while (n >= div * div) {
if (n % div == 0) {
res = div;
// resをグローバルな配列に代入すれば記録できる。
if (flg) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(0, 1));
prime_factor[prime_factor.size() - 1].first = res;
}
n /= div;
flg = true;
} else {
div++;
flg = false;
}
}
//ラス1の素因数
res = n;
if (prime_factor[prime_factor.size() - 1].first == res) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(res, 1));
}
}
//エラトステネスの篩
void Eratosthenes(int n) {
// prime_bool の添え字と見たい数は一致させたいので、
// prime_boolやprime_numは１つ多く宣言すること。
prime[0] = false;
prime[1] = false;
for (int i = 2; i < sqrt(n); i++) {
if (prime[i]) {
for (int j = 0; i * (j + 2) < n; j++) {
prime[i * (j + 2)] = false;
}
}
}
// 素数をprime_numに記録
rep(i, n) {
if (prime[i])
prime_num.push_back(i);
}
/*
int cnt = 0;
for(int i = 2; i < n; i++){
if(prime[i]){
cnt++;
}
}
return cnt;
*/
}
//偶奇判定。奇数ならtrue。
bool odd_even(int num) {
bool judge;
if (num % 2) {
judge = true;
} else {
judge = false;
}
return judge;
}
// aのmod mにおける逆元を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// main関数内でCOMinitを呼んだ後，COMを呼ぶ．
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < TABLEMAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算 nCk, nCrのcombinationでも使える
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long abs_ll(ll a) {
if (a >= 0) {
return a;
} else {
return -a;
}
}
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll res, ll div) {
// res 割られる数、div 割る数
return (res + div - 1) / div;
}
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string str, vector<X> &v) {
ll num = stoll(str);
ll it = str.size() - 1;
// 桁を逆にしたい時、下をon
// ll it = 0;
v.resize(str.size());
while (num) {
v[it] = num % 10;
num /= 10;
it--;
// it++;
if (it < 0) {
cout << "reference error" << endl;
break;
}
}
}
// nに数を入れるとその約数の一覧をfactor_listに格納する
void get_factor_list(ll n) {
int div = 1, res;
while (n >= div * div) {
if (n % div == 0) {
res = div;
ll tmp = n / res;
factor_list.push_back(res);
if (tmp != 1)
factor_list.push_back(tmp);
div++;
} else {
div++;
}
}
sort(factor_list.begin(), factor_list.end());
} | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (ll i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) \
for ( \
ll i = (a); i >= (b); \
--i) // 終端を0じゃなくて、1まですることによってn回。感覚的に1以上にしておいた。
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR_EQ(i, 0, n)
#define rep_re(i, n) FOR_RE(i, n, 0)
#define DEBUG_VARIABLE(variable) cout << #variable << ":" << variable << endl
#define INFTY (1 << 21) // 10^21
#define INF (1 << 9)
#define WHITE 1 //（未訪問）
#define GRAY \
2 //（訪問）未だに訪問していない頂点への辺を持っている。スタックに退避。
#define BLACK 3 //（訪問完了）未訪問への頂点への辺を持たない
#define MAX 100000
#define N 100
int M[N][N]; // 隣接行列(頂点と頂点が繋がってる、もしくは重みの値)
int color[N]; // その頂点の探索具合
const int TABLEMAX = 510000;
const int MOD = 1000000007;
//二項係数用の各階乗の値とその逆元を記録するための配列．
long long fac[TABLEMAX], finv[TABLEMAX], inv[TABLEMAX];
// 1個上から時計周り
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//上右下左
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1, 0, 1, 0};
static const int NIL = -1;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> Vector;
typedef vector<Vector> DVector;
typedef vector<pair<ll, ll>> Vec_Pair;
// 関数prime_factorizationで使う。
// 因数分解で使う。firstは数。secondは指数。
vector<pair<ll, ll>> prime_factor;
// 関数get_factor_listで使う。因数の一覧を取得で使う。
Vector factor_list;
// ２つともエラトステネスの篩で使う。
vector<bool> prime; // 素数かどうか判定。
Vector prime_num; // 素数を記録。
ll n;
template <class X> void printArray(X *array, ll);
template <class X> void printVector(vector<X> &v);
template <class X> void printDimention(vector<vector<X>> &dv);
template <class X> void printMap(X);
template <class X> void printVecPair(vector<X> &v);
// 何個2がかかっているか
ll factor2(ll);
// nCr方式で組み合わせの数を求める
ll combination(int, int);
// nPrで階乗を求める
int factorial(int, int);
//桁数を返す
int find_digits(int);
// 各桁の和を計算する関数
int findSumOfDigits(int);
//次数を得る
int degree(int);
//四捨五入
int shishagonyu(double);
//切り上げ
int roundUp(double);
//切り捨て
int roundDown(double);
//四捨五入
int roundOff(double);
//最大公約数(Greatest Common Divisor)
ll gcd(ll, ll);
//最小公倍数(Least Common Multiple)
ll lcm(ll, ll);
//素因数分解
void prime_factorization(ll);
//エラトステネスの篩
void Eratosthenes(int);
//偶奇判定。奇数ならtrue。
bool odd_even(int);
// aのmod mにおける逆元を計算する
long long modinv(long long, long long);
// a^n mod を計算する（二分累乗）
long long modpow(long long, long long, long long);
//テーブルを作る前処理
void COMinit();
//二項係数計算 nCk, 1 <= k <= n <= 10^7
long long COM(int, int);
// longlong型で絶対値を帰す。
long long abs_ll(ll);
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll, ll);
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string, vector<X> &v);
// 因数の一覧を取得する
void get_factor_list(ll);
ll time2(ll lim, ll num) {
ll cnt = 0;
while (num < lim) {
cnt++;
num *= 2;
}
return cnt;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
ll k;
cin >> n >> k;
// 1~nが出たそれぞれの場合で考える
// コインを投げる回数が変わる
ll times, now;
double res, tmp;
rep(i, n) {
tmp = 1.0 / n;
now = (i + 1);
while (now < k) {
now *= 2;
tmp /= 2;
}
res += tmp;
}
printf("%.12f\n", res);
return 0;
}
template <class X> void printArray(X array[], ll n) {
rep(i, n) {
if (i)
cout << " ";
cout << array[i];
}
cout << endl;
}
template <class X> void printVector(vector<X> &v) {
rep(i, (int)v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
//二次元配列の表示
template <class X> void printDimention(vector<vector<X>> &dv) {
rep(i, (ll)dv.size()) {
rep(j, (ll)dv[i].size()) {
if (j)
cout << " ";
cout << dv[i][j];
}
cout << endl;
}
}
// mapの表示
template <class X> void printMap(X mp) {
for (auto it : mp) {
cout << it.first << " " << it.second << endl;
}
}
// 内部にpairを内包したvectorの表示
template <class X> void printVecPair(vector<X> &v) {
rep(i, (int)v.size()) { cout << v[i].first << " " << v[i].second << endl; }
cout << endl;
}
// numの中に何個2がかかってるか
ll factor2(ll num) {
int cnt = 0;
while (num % 2 == 0) {
num /= 2;
cnt++;
}
return cnt;
}
// nCr方式で組み合わせの数を求める
ll combination(int n, int r) {
ll up = 1, down = 1;
// 以下2行はお試し
ll half = n / 2;
if (r >= half)
r = n - r;
ll up_tmp = n, down_tmp = r;
if (r == 0)
return 1;
rep(i, r) {
up *= up_tmp;
up_tmp--;
down *= down_tmp;
down_tmp--;
}
return up / down;
}
// nPr方式で階乗を求める
int factorial(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
} else {
int res = 1;
while (r) {
r--;
res *= n;
n--;
}
return res;
}
}
//桁数を返す
int find_digits(int n) {
int digit = 0;
while (n) {
n /= 10;
digit++;
}
return digit;
}
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
//次数を得る
int degree(int n) {
int count = 0;
while (1) {
if (count <= 0)
break;
count /= 2;
count++;
}
return count;
}
//四捨五入
int shishagonyu(double x) { return (int)(x < 0.0 ? x - 0.5 : x + 0.5); }
//切り上げ
int roundUp(double n) {
if (n >= 0) {
return (int)n + 1;
} else {
return (int)n - 1;
}
}
//切り捨て
int roundDown(double n) { return (int)n; }
//四捨五入
int roundOff(double n) {
double decimal = 0;
decimal = n - (int)n;
if (decimal >= 0.5 || decimal <= -0.5) {
return roundUp(n);
} else {
return roundDown(n);
}
}
//最大公約数(Greatest Common Divisor)
ll gcd(ll m, ll n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
//ユークリッドの互除法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
//最小公倍数(Least Common Multiple)
ll lcm(ll m, ll n) {
//引数に0がある場合は0を返す
if (m == 0 || n == 0)
return 0;
// lcm = m * n / gcd(m, n)
return ((m / gcd(m, n)) * n);
}
//素因数分解 firstは数。secondは指数。
void prime_factorization(ll n) {
int div = 2, res;
bool flg = false;
if (n < 2) {
cout << "Error" << endl;
return;
}
while (n >= div * div) {
if (n % div == 0) {
res = div;
// resをグローバルな配列に代入すれば記録できる。
if (flg) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(0, 1));
prime_factor[prime_factor.size() - 1].first = res;
}
n /= div;
flg = true;
} else {
div++;
flg = false;
}
}
//ラス1の素因数
res = n;
if (prime_factor[prime_factor.size() - 1].first == res) {
prime_factor[prime_factor.size() - 1].second++;
} else {
prime_factor.push_back(make_pair(res, 1));
}
}
//エラトステネスの篩
void Eratosthenes(int n) {
// prime_bool の添え字と見たい数は一致させたいので、
// prime_boolやprime_numは１つ多く宣言すること。
prime[0] = false;
prime[1] = false;
for (int i = 2; i < sqrt(n); i++) {
if (prime[i]) {
for (int j = 0; i * (j + 2) < n; j++) {
prime[i * (j + 2)] = false;
}
}
}
// 素数をprime_numに記録
rep(i, n) {
if (prime[i])
prime_num.push_back(i);
}
/*
int cnt = 0;
for(int i = 2; i < n; i++){
if(prime[i]){
cnt++;
}
}
return cnt;
*/
}
//偶奇判定。奇数ならtrue。
bool odd_even(int num) {
bool judge;
if (num % 2) {
judge = true;
} else {
judge = false;
}
return judge;
}
// aのmod mにおける逆元を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// main関数内でCOMinitを呼んだ後，COMを呼ぶ．
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < TABLEMAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算 nCk, nCrのcombinationでも使える
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long abs_ll(ll a) {
if (a >= 0) {
return a;
} else {
return -a;
}
}
// 割り算した時に余りが有る時だけ、+1の商を返す。
long long div_one(ll res, ll div) {
// res 割られる数、div 割る数
return (res + div - 1) / div;
}
// Stringの各桁をvectorの配列に入れる。でかい桁が添字0。
template <class X> void StringtoVec(string str, vector<X> &v) {
ll num = stoll(str);
ll it = str.size() - 1;
// 桁を逆にしたい時、下をon
// ll it = 0;
v.resize(str.size());
while (num) {
v[it] = num % 10;
num /= 10;
it--;
// it++;
if (it < 0) {
cout << "reference error" << endl;
break;
}
}
}
// nに数を入れるとその約数の一覧をfactor_listに格納する
void get_factor_list(ll n) {
int div = 1, res;
while (n >= div * div) {
if (n % div == 0) {
res = div;
ll tmp = n / res;
factor_list.push_back(res);
if (tmp != 1)
factor_list.push_back(tmp);
div++;
} else {
div++;
}
}
sort(factor_list.begin(), factor_list.end());
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,814 | 860,815 | u669551866 | cpp |
p03043 | #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
int main() {
int a, b;
cin >> a >> b;
int p;
double sum = 0;
for (int i = 1; i <= a; i++) {
double per = 1.0 / a;
int now = i;
while (now < b) {
now *= 2;
per /= 2;
}
sum += per;
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
int main() {
int a, b;
cin >> a >> b;
int p;
double sum = 0;
for (int i = 1; i <= a; i++) {
double per = 1.0 / a;
int now = i;
while (now < b) {
now *= 2;
per /= 2;
}
sum += per;
}
cout << setprecision(15) << sum << endl;
}
| [
"io.output.change"
] | 860,816 | 860,817 | u540741303 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int in() {
int x;
scanf("%d", &x);
return x;
}
static const int MAX = 100;
int main() {
int N = in(), K = in(), x, y;
long double ans = 0;
rep2(i, 1, N + 1) {
x = i;
y = N;
while (x < K) {
x *= 2;
y *= 2;
}
ans += 1 / y;
}
printf("%.10lf\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int in() {
int x;
scanf("%d", &x);
return x;
}
static const int MAX = 100;
int main() {
int N = in(), K = in(), x;
double y, ans = 0;
rep2(i, 1, N + 1) {
x = i;
y = N;
while (x < K) {
x *= 2;
y *= 2;
}
ans += 1 / y;
}
printf("%.10lf\n", ans);
} | [
"variable_declaration.remove",
"variable_declaration.type.narrow.change",
"variable_declaration.add"
] | 860,825 | 860,826 | u378125390 | cpp |
p03043 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
typedef long long ll;
#define PB push_back
#define FOR(n) for (int i = 0; i < n; ++i)
#define RFOR(n) for (int i = n; i >= 0; --i)
#define FORR(start, end) for (int i = start; i < end; ++i)
#define COUT(n) cout << n << " " << flush
#define vi(v) vector<int> v
#define vii(v) vector<pair<int, int>> v
#define mkp(a, b) make_pair(a, b)
#define ALL(obj) obj.begin(), obj.end()
using namespace std;
long double p(int n) {
long double re = 1;
FOR(n)
re /= 2;
return re;
}
int c(int n, int k) {
int co = 0;
while (n < k) {
co++;
n *= 2;
}
return co;
}
int main() {
int n, k;
long double d = 0;
cin >> n >> k;
FORR(1, n + 1) { d += (1.0 / n) * p(c(i, k)); }
printf("%.9lf\n", d);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
typedef long long ll;
#define PB push_back
#define FOR(n) for (int i = 0; i < n; ++i)
#define RFOR(n) for (int i = n; i >= 0; --i)
#define FORR(start, end) for (int i = start; i < end; ++i)
#define COUT(n) cout << n << " " << flush
#define vi(v) vector<int> v
#define vii(v) vector<pair<int, int>> v
#define mkp(a, b) make_pair(a, b)
#define ALL(obj) obj.begin(), obj.end()
using namespace std;
double p(int n) {
double re = 1;
FOR(n)
re /= 2;
return re;
}
int c(int n, int k) {
int co = 0;
while (n < k) {
co++;
n *= 2;
}
return co;
}
int main() {
int n, k;
double d = 0;
cin >> n >> k;
FORR(1, n + 1) { d += (1.0 / n) * p(c(i, k)); }
printf("%.9lf\n", d);
return 0;
} | [
"variable_declaration.type.narrow.change"
] | 860,829 | 860,830 | u273004731 | cpp |
p03043 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
typedef long long ll;
#define PB push_back
#define FOR(n) for (int i = 0; i < n; ++i)
#define RFOR(n) for (int i = n; i >= 0; --i)
#define FORR(start, end) for (int i = start; i < end; ++i)
#define COUT(n) cout << n << " " << flush
#define vi(v) vector<int> v
#define vii(v) vector<pair<int, int>> v
#define mkp(a, b) make_pair(a, b)
#define ALL(obj) obj.begin(), obj.end()
using namespace std;
long double p(int n) {
long double re = 1;
FOR(n)
re /= 2;
return re;
}
int c(int n, int k) {
int co = 0;
while (n < k) {
co++;
n *= 2;
}
return co;
}
int main() {
int n, k;
long double d = 0;
cin >> n >> k;
FORR(1, n + 1) { d += (1.0 / n) * p(c(i, k)); }
printf("%.9f\n", d);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
typedef long long ll;
#define PB push_back
#define FOR(n) for (int i = 0; i < n; ++i)
#define RFOR(n) for (int i = n; i >= 0; --i)
#define FORR(start, end) for (int i = start; i < end; ++i)
#define COUT(n) cout << n << " " << flush
#define vi(v) vector<int> v
#define vii(v) vector<pair<int, int>> v
#define mkp(a, b) make_pair(a, b)
#define ALL(obj) obj.begin(), obj.end()
using namespace std;
double p(int n) {
double re = 1;
FOR(n)
re /= 2;
return re;
}
int c(int n, int k) {
int co = 0;
while (n < k) {
co++;
n *= 2;
}
return co;
}
int main() {
int n, k;
double d = 0;
cin >> n >> k;
FORR(1, n + 1) { d += (1.0 / n) * p(c(i, k)); }
printf("%.9lf\n", d);
return 0;
} | [
"variable_declaration.type.narrow.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,831 | 860,830 | u273004731 | cpp |
p03043 | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
double res = 1.0;
long long N, K;
cin >> N >> K;
for (long long i = 1; i <= N; ++i) {
long long cnt = i;
double tmp = 1.0;
while (cnt < K) {
cnt *= 2;
tmp /= 2.0;
}
res += tmp;
}
res /= N;
cout << fixed << setprecision(10) << res << endl;
}
| #include <iomanip>
#include <iostream>
using namespace std;
int main() {
double res = 0.0;
long long N, K;
cin >> N >> K;
for (long long i = 1; i <= N; ++i) {
long long cnt = i;
double tmp = 1.0;
while (cnt < K) {
cnt *= 2;
tmp /= 2;
}
res += tmp;
}
res /= N;
cout << fixed << setprecision(10) << res << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 860,832 | 860,833 | u506858457 | cpp |
p03043 | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
double ans = 1.0;
long long N, K;
cin >> N >> K;
for (long long i = 1; i <= N; ++i) {
long long cnt = i;
double tmp = 1.0;
while (cnt < K) {
cnt *= 2;
tmp /= 2;
}
ans += tmp;
}
ans /= N;
cout << fixed << setprecision(10) << ans << endl;
}
| #include <iomanip>
#include <iostream>
using namespace std;
int main() {
double res = 0.0;
long long N, K;
cin >> N >> K;
for (long long i = 1; i <= N; ++i) {
long long cnt = i;
double tmp = 1.0;
while (cnt < K) {
cnt *= 2;
tmp /= 2;
}
res += tmp;
}
res /= N;
cout << fixed << setprecision(10) << res << endl;
}
| [
"variable_declaration.name.change",
"identifier.change",
"literal.number.change",
"variable_declaration.value.change",
"assignment.variable.change",
"io.output.change"
] | 860,834 | 860,833 | u506858457 | cpp |
p03043 | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
double res = 1.0;
long long N, K;
cin >> N >> K;
for (long long i = 1; i <= N; ++i) {
long long cnt = i;
double tmp = 1.0;
while (cnt < K) {
cnt *= 2;
tmp /= 2.0;
}
res += tmp;
}
res /= N;
cout << fixed << setprecision(10) << res << endl;
}
| #include <iomanip>
#include <iostream>
using namespace std;
int main() {
double res = 0.0;
long long N, K;
cin >> N >> K;
for (long long i = 1; i <= N; ++i) {
long long cnt = i;
double tmp = 1.0;
while (cnt < K) {
cnt *= 2;
tmp /= 2.0;
}
res += tmp;
}
res /= N;
cout << fixed << setprecision(10) << res << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 860,832 | 860,835 | u506858457 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double ans = 0;
for (int i = 1; i < N + 1; i++) {
int index;
double num = i / 2.0;
int j = 0;
while (true) {
num *= 2;
if (num >= K) {
index = j;
break;
}
j++;
}
double x = 1.0 / N;
for (int l = 0; l < index; l++)
x /= 2.0;
ans += x;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double ans = 0;
for (int i = 1; i < N + 1; i++) {
int index;
double num = i / 2.0;
int j = 0;
while (true) {
num *= 2;
if (num >= K) {
index = j;
break;
}
j++;
}
double x = 1.0 / N;
for (int l = 0; l < index; l++)
x /= 2.0;
ans += x;
}
cout << setprecision(10) << ans << endl;
}
| [
"io.output.change"
] | 860,840 | 860,841 | u105533331 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
int p;
for (int i = 1; i <= n; i++) {
if (i >= k)
ans += (double)1 / n;
else {
p = 0;
while (i * pow(2, p) < k)
p++;
ans += (double)1 / pow(2, p) / n;
}
}
cout << setprecision(15) << ans / n << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
int p;
for (int i = 1; i <= n; i++) {
if (i >= k)
ans += (double)1 / n;
else {
p = 0;
while (i * pow(2, p) < k)
p++;
ans += (double)1 / pow(2, p) / n;
}
}
cout << setprecision(15) << ans << endl;
} | [
"expression.operation.binary.remove"
] | 860,844 | 860,845 | u013408661 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
char S[4];
cin >> S;
string ans;
int A = (S[0] - '0') * 10 + S[1] - '0';
int B = (S[2] - '0') * 10 + S[3] - '0';
if (0 < A && A <= 12 && 0 < B && B <= 12)
ans = "AMBIGUOUS";
else if (0 < A && A <= 12)
ans = "YYMM";
else if (0 < B && B <= 12)
ans = "MMYY";
else
ans = "NA";
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
char S[4];
cin >> S;
string ans;
int A = (S[0] - '0') * 10 + S[1] - '0';
int B = (S[2] - '0') * 10 + S[3] - '0';
if (0 < A && A <= 12 && 0 < B && B <= 12)
ans = "AMBIGUOUS";
else if (0 < A && A <= 12)
ans = "MMYY";
else if (0 < B && B <= 12)
ans = "YYMM";
else
ans = "NA";
cout << ans << endl;
return 0;
}
| [
"literal.string.change",
"assignment.value.change"
] | 860,847 | 860,848 | u147571984 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
bool IsM(int a) {
if (a > 0 && a < 13)
return true;
else
return false;
}
int main() {
string S;
cin >> S;
int l = (S[0] - '0') * 10 + S[1] - '0';
int r = (S[2] - '0') * 10 + S[3] - '0';
if (IsM(l) && IsM(r)) {
cout << "AMBIGUOUS" << endl;
return 0;
} else if (IsM(l) && !IsM(r)) {
cout << "MMYY" << endl;
return 0;
} else if (!IsM(l) && IsM(r)) {
cout << "YYMM" << endl;
return 0;
} else if (!IsM(l) && !IsM(r)) {
cout << "NO" << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
bool IsM(int a) {
if (a > 0 && a < 13)
return true;
else
return false;
}
int main() {
string S;
cin >> S;
int l = (S[0] - '0') * 10 + S[1] - '0';
int r = (S[2] - '0') * 10 + S[3] - '0';
if (IsM(l) && IsM(r)) {
cout << "AMBIGUOUS" << endl;
return 0;
} else if (IsM(l) && !IsM(r)) {
cout << "MMYY" << endl;
return 0;
} else if (!IsM(l) && IsM(r)) {
cout << "YYMM" << endl;
return 0;
} else if (!IsM(l) && !IsM(r)) {
cout << "NA" << endl;
return 0;
}
} | [
"literal.string.change",
"io.output.change"
] | 860,855 | 860,856 | u751675422 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define sq(x) ((x) * (x))
#define bit(x) bitset<32>(x)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<llint>())
#define debug(x) cout << #x << " " << (x) << endl
#define ci cin
#define co cout
#define en endl
#define ln cout << '\n'
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
typedef long long int llint;
typedef pair<int, int> pii;
typedef pair<llint, llint> pll;
typedef vector<int> vi;
typedef vector<llint> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
template <typename Tn> Tn __lcm(Tn a, Tn b) { return a / __gcd(a, b) * b; }
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
string s;
ci >> s;
string a = "";
a += s[0];
a += s[1];
string b = "";
b += s[2];
b += s[3];
if ("00" < a && a < "13" && "00" < b && b < "13") {
co << "AMBIGUOS" << en;
} else if ("00" < a && a < "13") {
co << "MMYY" << en;
} else if ("00" < b && b < "13") {
co << "YYMM" << en;
} else {
co << "NA" << en;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define sq(x) ((x) * (x))
#define bit(x) bitset<32>(x)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<llint>())
#define debug(x) cout << #x << " " << (x) << endl
#define ci cin
#define co cout
#define en endl
#define ln cout << '\n'
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
typedef long long int llint;
typedef pair<int, int> pii;
typedef pair<llint, llint> pll;
typedef vector<int> vi;
typedef vector<llint> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
template <typename Tn> Tn __lcm(Tn a, Tn b) { return a / __gcd(a, b) * b; }
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
string s;
ci >> s;
string a = "";
a += s[0];
a += s[1];
string b = "";
b += s[2];
b += s[3];
if ("00" < a && a < "13" && "00" < b && b < "13") {
co << "AMBIGUOUS" << en;
} else if ("00" < a && a < "13") {
co << "MMYY" << en;
} else if ("00" < b && b < "13") {
co << "YYMM" << en;
} else {
co << "NA" << en;
}
return 0;
}
| [
"literal.string.change",
"expression.operation.binary.change"
] | 860,864 | 860,865 | u966921248 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int upper = atoi(S.substr(0, 2).c_str());
int lower = atoi(S.substr(2, 2).c_str());
if (1 <= upper && upper <= 12 && 1 <= lower && lower <= 12) {
cout << "AMBIGIOUS" << endl;
} else if (1 <= upper && upper <= 12) {
cout << "MMYY" << endl;
} else if (1 <= lower && lower <= 12) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int upper = atoi(S.substr(0, 2).c_str());
int lower = atoi(S.substr(2, 2).c_str());
if (1 <= upper && upper <= 12 && 1 <= lower && lower <= 12) {
cout << "AMBIGUOUS" << endl;
} else if (1 <= upper && upper <= 12) {
cout << "MMYY" << endl;
} else if (1 <= lower && lower <= 12) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
} | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 860,877 | 860,878 | u111653921 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int a, b;
a = s % 100;
b = s / 100;
int x = 0, y = 0;
if (a == 0 || 12 < a)
x = 1;
else if (a != 0)
x = 2;
if (b == 0 || 12 < b)
y = 1;
else if (b != 0)
y = 2;
if (a == 1 && b == 1)
cout << "NA" << endl;
else if (a == 2 && b == 1)
cout << "YYMM" << endl;
else if (a == 1 && b == 2)
cout << "MMYY" << endl;
else
cout << "AMBIGUOUS" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int a, b;
a = s % 100;
b = s / 100;
int x = 0, y = 0;
if (a == 0 || 12 < a)
x = 1;
else if (a != 0)
x = 2;
if (b == 0 || 12 < b)
y = 1;
else if (b != 0)
y = 2;
if (x == 1 && y == 1)
cout << "NA" << endl;
else if (x == 2 && y == 1)
cout << "YYMM" << endl;
else if (x == 1 && y == 2)
cout << "MMYY" << endl;
else
cout << "AMBIGUOUS" << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 860,883 | 860,884 | u640800420 | cpp |
p03042 | #include <algorithm>
#include <array>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) Rep(i, 0, b)
#define rrep(i, a) for (int i = a; i >= 0; i--)
#define allof(a) (a).begin(), (a).end()
typedef long long ll;
const int inf = 1e9 + 7;
const ll infll = 1ll << 60ll;
const ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 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 / gcd(a, b) * b;
}*/
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int s;
cin >> s;
// 月をみる
// 死も二けた
int a = 0;
a += s % 10;
s /= 10;
a += (s % 10) * 10;
s /= 10;
int b = 0;
b += s % 10;
s /= 10;
b += (s % 10) * 10;
bool canb = true;
bool cana = true;
if (b >= 13 || b == 0)
canb = false;
if (a >= 13 || a == 0)
cana = false;
if (canb && canb) {
cout << "AMBIGUOUS" << endl;
return 0;
} else if (cana && !canb) {
cout << "YYMM" << endl;
return 0;
} else if (!cana && canb) {
cout << "MMYY" << endl;
return 0;
} else {
cout << "NA" << endl;
return 0;
}
return 0;
}
| #include <algorithm>
#include <array>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) Rep(i, 0, b)
#define rrep(i, a) for (int i = a; i >= 0; i--)
#define allof(a) (a).begin(), (a).end()
typedef long long ll;
const int inf = 1e9 + 7;
const ll infll = 1ll << 60ll;
const ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 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 / gcd(a, b) * b;
}*/
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int s;
cin >> s;
// 月をみる
// 死も二けた
int a = 0;
a += s % 10;
s /= 10;
a += (s % 10) * 10;
s /= 10;
int b = 0;
b += s % 10;
s /= 10;
b += (s % 10) * 10;
bool canb = true;
bool cana = true;
if (b >= 13 || b == 0)
canb = false;
if (a >= 13 || a == 0)
cana = false;
if (cana && canb) {
cout << "AMBIGUOUS" << endl;
return 0;
} else if (cana && !canb) {
cout << "YYMM" << endl;
return 0;
} else if (!cana && canb) {
cout << "MMYY" << endl;
return 0;
} else {
cout << "NA" << endl;
return 0;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 860,885 | 860,886 | u725458677 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int number;
cin >> number;
int YYMM = 0;
int MMYY = 0;
int first = number / 100;
int rear = number - first * 100;
if (0 <= rear && rear <= 12) {
YYMM++;
}
if (0 <= first && first <= 12) {
MMYY++;
}
if (YYMM == 1 && MMYY == 1) {
cout << "AMBIGUOUS" << endl;
} else if (YYMM == 1) {
cout << "YYMM" << endl;
} else if (MMYY == 1) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int number;
cin >> number;
int YYMM = 0;
int MMYY = 0;
int first = number / 100;
int rear = number - first * 100;
if (1 <= rear && rear <= 12) {
YYMM++;
}
if (1 <= first && first <= 12) {
MMYY++;
}
if (YYMM == 1 && MMYY == 1) {
cout << "AMBIGUOUS" << endl;
} else if (YYMM == 1) {
cout << "YYMM" << endl;
} else if (MMYY == 1) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 860,891 | 860,892 | u728628785 | cpp |
p03042 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000007;
const long long inf = 1ll << 61;
typedef pair<int, int> P;
typedef pair<double, P> PP;
struct edge {
int to;
int cost;
};
string ans[] = {"NA", "MMYY", "YYMM", "AMBIGIOUS"};
signed main() {
string s;
cin >> s;
int a = (s[0] - '0') * 10 + (s[1] - '0');
int b = (s[2] - '0') * 10 + (s[3] - '0');
int flg = 0;
if (1 <= a && a <= 12)
flg++;
if (1 <= b && b <= 12)
flg += 2;
cout << ans[flg] << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000007;
const long long inf = 1ll << 61;
typedef pair<int, int> P;
typedef pair<double, P> PP;
struct edge {
int to;
int cost;
};
string ans[] = {"NA", "MMYY", "YYMM", "AMBIGUOUS"};
signed main() {
string s;
cin >> s;
int a = (s[0] - '0') * 10 + (s[1] - '0');
int b = (s[2] - '0') * 10 + (s[3] - '0');
int flg = 0;
if (1 <= a && a <= 12)
flg++;
if (1 <= b && b <= 12)
flg += 2;
cout << ans[flg] << endl;
} | [
"misc.typo",
"literal.string.change"
] | 860,893 | 860,894 | u722628899 | cpp |
p03042 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
int main(void) {
string s;
cin >> s;
int mae, ato;
mae = (s[0] - '0') * 10 + s[1] - '0';
ato = (s[2] - '0') * 10 + s[3] - '0';
bool ok1, ok2;
ok1 = mae >= 1 && mae <= 12;
ok2 = ato >= 1 && ato <= 12;
if (ok1 && ok2) {
cout << "AMBIGOUS" << endl;
} else if (ok1) {
cout << "MMYY" << endl;
} else if (ok2) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
return 0;
}
| #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
int main(void) {
string s;
cin >> s;
int mae, ato;
mae = (s[0] - '0') * 10 + s[1] - '0';
ato = (s[2] - '0') * 10 + s[3] - '0';
bool ok1, ok2;
ok1 = mae >= 1 && mae <= 12;
ok2 = ato >= 1 && ato <= 12;
if (ok1 && ok2) {
cout << "AMBIGUOUS" << endl;
} else if (ok1) {
cout << "MMYY" << endl;
} else if (ok2) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 860,895 | 860,896 | u838742270 | cpp |
p03042 | #include <iostream>
using namespace std;
#define int long long
int32_t main() {
int n;
cin >> n;
int t = n % 10;
n = n / 10;
t += 10 * (n % 10);
int t2 = n % 10;
n = n / 10;
t2 += 10 * (n % 10);
if (t <= 12 && t2 <= 12 && t > 0 && t2 > 0)
cout << "AMBIGUOUS";
else if (t2 <= 12 && t2 > 0)
cout << "MMYY";
else if (t <= 12 && t > 0)
cout << "YYMM";
else
cout << "NA";
}
| #include <iostream>
using namespace std;
#define int long long
int32_t main() {
int n;
cin >> n;
int t = n % 10;
n = n / 10;
t += 10 * (n % 10);
n = n / 10;
int t2 = n % 10;
n = n / 10;
t2 += 10 * (n % 10);
if (t <= 12 && t2 <= 12 && t > 0 && t2 > 0)
cout << "AMBIGUOUS";
else if (t2 <= 12 && t2 > 0)
cout << "MMYY";
else if (t <= 12 && t > 0)
cout << "YYMM";
else
cout << "NA";
}
| [
"assignment.add"
] | 860,906 | 860,907 | u133134242 | cpp |
p03042 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define MOD 1000000007
#define INF 2000000000
#define LINF 9000000000000000000
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define du(x) cout << #x << '=' << x << endl
#define du2(x, y) \
cout << #x << '=' << x << ' ' << #y << '=' << y << '\n' << endl
#define du3(x, y, z) \
cout << #x << '=' << x << ' ' << #y << '=' << y << ' ' << #z << '=' << z \
<< '\n' \
<< endl
#define darr(arr, n) \
rep(i, (n - arr)) { cout << *(arr + i) << ' '; } \
cout << endl
#define ddarr(arr, a, b) \
rep(i, a) { \
rep(j, b) { cout << *(arr + i * b + j) << ' '; } \
cout << endl; \
}
#define ddd \
ifstream in("Text.txt"); \
cin.rdbuf(in.rdbuf());
string nu[12] = {"01", "02", "03", "04", "05", "06",
"07", "08", "09", "10", "11", "12"};
int main() {
string S;
cin >> S;
bool f1 = false, f2 = false;
rep(i, S.size()) {
rep(j, 12) {
if (S[i] == nu[j][0] && S[i + 1] == nu[j][1]) {
if (i == 0)
f1 = true;
if (i == 2)
f2 = true;
i++;
}
}
}
if (f1 && !f2) {
cout << "MMYY" << endl;
return 0;
}
if (f2 && !f1) {
cout << "YYMM" << endl;
return 0;
}
if (f1 && f2) {
cout << "AMBIGUOUS" << endl;
return 0;
}
cout << "NA" << endl;
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define MOD 1000000007
#define INF 2000000000
#define LINF 9000000000000000000
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define du(x) cout << #x << '=' << x << endl
#define du2(x, y) \
cout << #x << '=' << x << ' ' << #y << '=' << y << '\n' << endl
#define du3(x, y, z) \
cout << #x << '=' << x << ' ' << #y << '=' << y << ' ' << #z << '=' << z \
<< '\n' \
<< endl
#define darr(arr, n) \
rep(i, (n - arr)) { cout << *(arr + i) << ' '; } \
cout << endl
#define ddarr(arr, a, b) \
rep(i, a) { \
rep(j, b) { cout << *(arr + i * b + j) << ' '; } \
cout << endl; \
}
#define ddd \
ifstream in("Text.txt"); \
cin.rdbuf(in.rdbuf());
string nu[12] = {"01", "02", "03", "04", "05", "06",
"07", "08", "09", "10", "11", "12"};
int main() {
string S;
cin >> S;
bool f1 = false, f2 = false;
rep(i, S.size()) {
rep(j, 12) {
if (S[i] == nu[j][0] && S[i + 1] == nu[j][1]) {
if (i == 0)
f1 = true;
if (i == 2)
f2 = true;
}
}
i++;
}
if (f1 && !f2) {
cout << "MMYY" << endl;
return 0;
}
if (f2 && !f1) {
cout << "YYMM" << endl;
return 0;
}
if (f1 && f2) {
cout << "AMBIGUOUS" << endl;
return 0;
}
cout << "NA" << endl;
} | [] | 860,920 | 860,921 | u281384315 | cpp |
p03042 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define ff first
#define ss second
using namespace std;
// ll arr[1000002];
/*ll power(ll x,ll y)
{
ll res=1;
while(y>0)
{
if(y%2==1)
res=(res*x)%mod;
x=(x*x)%mod;
y=y/2;
}
return res;
}*/
int main() {
string s;
cin >> s;
ll a, b;
a = (s[0] - '0') * 10 + (s[1] - '0');
b = (s[2] - '0') * 10 + (s[3] - '0');
if (a >= 1 && a <= 12 && b >= 1 && b <= 12)
cout << "AMBIGOUS" << endl;
else if (a >= 1 && a <= 12 && (b < 1 || b > 12))
cout << "MMYY" << endl;
else if (b >= 1 && b <= 12 && (a < 1 || a > 12))
cout << "YYMM" << endl;
else if ((a < 1 || a > 12) && (b < 1 || b > 12))
cout << "NA" << endl;
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define ff first
#define ss second
using namespace std;
// ll arr[1000002];
/*ll power(ll x,ll y)
{
ll res=1;
while(y>0)
{
if(y%2==1)
res=(res*x)%mod;
x=(x*x)%mod;
y=y/2;
}
return res;
}*/
int main() {
string s;
cin >> s;
ll a, b;
a = (s[0] - '0') * 10 + (s[1] - '0');
b = (s[2] - '0') * 10 + (s[3] - '0');
if (a >= 1 && a <= 12 && b >= 1 && b <= 12)
cout << "AMBIGUOUS" << endl;
else if (a >= 1 && a <= 12 && (b < 1 || b > 12))
cout << "MMYY" << endl;
else if (b >= 1 && b <= 12 && (a < 1 || a > 12))
cout << "YYMM" << endl;
else if ((a < 1 || a > 12) && (b < 1 || b > 12))
cout << "NA" << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 860,924 | 860,925 | u579531291 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool a = false, b = false;
if (s.at(0) == '0') {
if (s.at(1) != '0')
a = true;
} else if (s.at(0) == '1') {
if (s.at(1) == '0' || s.at(1) == '1' || s.at(1) == '2')
a = true;
}
if (s.at(2) == '0') {
if (s.at(2) != '0')
b = true;
} else if (s.at(2) == '1') {
if (s.at(3) == '0' || s.at(3) == '1' || s.at(3) == '2')
b = true;
}
if (a && b)
cout << "AMBIGUOUS" << endl;
else if (a && !b)
cout << "MMYY" << endl;
else if (!a && b)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool a = false, b = false;
if (s.at(0) == '0') {
if (s.at(1) != '0')
a = true;
} else if (s.at(0) == '1') {
if (s.at(1) == '0' || s.at(1) == '1' || s.at(1) == '2')
a = true;
}
if (s.at(2) == '0') {
if (s.at(3) != '0')
b = true;
} else if (s.at(2) == '1') {
if (s.at(3) == '0' || s.at(3) == '1' || s.at(3) == '2')
b = true;
}
if (a && b)
cout << "AMBIGUOUS" << endl;
else if (a && !b)
cout << "MMYY" << endl;
else if (!a && b)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 860,932 | 860,933 | u952865396 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int s;
cin >> s;
int a = s / 100, b = s % 100;
bool f1 = false, f2 = false;
if (a > 0 && a <= 12)
f1 = true;
if (b > 0 && b <= 12)
f2 = true;
if (f1 && f2) {
cout << "AMBIGUOUS" << endl;
} else if (!f1 && f2) {
cout << "MMYY" << endl;
} else if (f1 && !f2) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int s;
cin >> s;
int a = s / 100, b = s % 100;
bool f1 = false, f2 = false;
if (a > 0 && a <= 12)
f1 = true;
if (b > 0 && b <= 12)
f2 = true;
if (f1 && f2) {
cout << "AMBIGUOUS" << endl;
} else if (f1 && !f2) {
cout << "MMYY" << endl;
} else if (!f1 && f2) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
return 0;
}
| [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change",
"expression.operation.unary.add"
] | 860,952 | 860,953 | u480806810 | cpp |
p03042 | #include <stdio.h>
#include <string.h>
#pragma warning(disable : 4996)
int min(int a, int b) {
if (a < b)
return a;
return b;
}
int main(void) {
char s[4 + 1];
scanf("%s", &s[0]);
int n[4];
for (int i = 0; i < 4; ++i) {
n[i] = s[i] - '0';
}
int i0 = s[0] * 10 + s[1];
int i1 = s[2] * 10 + s[3];
if ((i0 >= 1) && (i0 <= 12)) {
if ((i1 >= 1) && (i1 <= 12)) {
printf("AMBIGUOUS");
return 0;
} else {
printf("MMYY");
return 0;
}
} else if ((i1 >= 1) && (i1 <= 12)) {
printf("YYMM");
return 0;
} else {
printf("NA");
return 0;
}
return 0;
} | #include <stdio.h>
#include <string.h>
#pragma warning(disable : 4996)
int min(int a, int b) {
if (a < b)
return a;
return b;
}
int main(void) {
char s[4 + 1];
scanf("%s", &s[0]);
int n[4];
for (int i = 0; i < 4; ++i) {
n[i] = s[i] - '0';
}
int i0 = n[0] * 10 + n[1];
int i1 = n[2] * 10 + n[3];
if ((i0 >= 1) && (i0 <= 12)) {
if ((i1 >= 1) && (i1 <= 12)) {
printf("AMBIGUOUS");
return 0;
} else {
printf("MMYY");
return 0;
}
} else if ((i1 >= 1) && (i1 <= 12)) {
printf("YYMM");
return 0;
} else {
printf("NA");
return 0;
}
return 0;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 860,954 | 860,955 | u217348908 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
int main() {
int S;
cin >> S;
int a = S % 100;
int b = S / 100;
string ans;
if ((a >= 1 && a <= 12) && (b == 0 || b > 12))
ans = "YYMM";
if ((b >= 1 && b <= 12) && (a == 0 || a > 12))
ans = "MMYY";
if ((a >= 1 && a <= 12) && (b >= 1 && b <= 12))
ans = "AMBIGUOUS";
if ((a == 0 || a > 12) && (b == 0 || b > 12))
ans = "MA";
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
int main() {
int S;
cin >> S;
int a = S % 100;
int b = S / 100;
string ans;
if ((a >= 1 && a <= 12) && (b == 0 || b > 12))
ans = "YYMM";
if ((b >= 1 && b <= 12) && (a == 0 || a > 12))
ans = "MMYY";
if ((a >= 1 && a <= 12) && (b >= 1 && b <= 12))
ans = "AMBIGUOUS";
if ((a == 0 || a > 12) && (b == 0 || b > 12))
ans = "NA";
cout << ans << endl;
} | [
"literal.string.change",
"assignment.value.change"
] | 860,958 | 860,959 | u314008046 | cpp |
p03042 | /* Aa^~ kokoro ga pyonpyon suru n jaa^~
// ZZZXXkXkkkZ!``` ``` ``` ``` ``` ``` ``` ``` ``` ``` ```
```?Wfpppbpbbpbbpbbbkbkk
// ppbbbpbbpVr`` `` ` ` ` ` ```` `` ` ` `` ` ` ` ` ` ` ` ` `
dppbbkkkkkkkkkkqkqkk
// HkqqqqqkkWr`` ` ` ``` ``` `?G, ` ` ``.JC!```` ` ` `` ``
````(Wpbkkkkkkkkqkkkkkqk
// mmmmmqqqqpr` `` `` ```````.+zT=`` `` 7TO-.```````` `` ``
```(yppbkkkkkkkkkkkkkkk
// ggmgmmqqqH$ ``````````....````` ` ````````.`````` ``
``````.yfpppbbbbkkkkqqqqqH
// gmmmmmqqqkW<```` `````...````` .,.` ````....````` ```````
(Wbqqmgmmgmggggggggg
// qmmmqqqqkkWk.``````````````````` ;:<``
`````.`````````````-_<-?WHHqmmmmmmgmmgggg
// @@@@@@@gggHH6- ``````````````` `` _ `` ````````````````
._~~_.`-?Wkqmmmmmmmggg@g
// @@@@g@gggHY~.-<_- ``````````````````````````````````
._~~(<-``.`.(WHqqqmmggggmmm
// @@g@gggHH=.`..._<-___..```````````````````````. .-_~~~_(!``-.``.``
OHHWUWHmqHWXW
// gggggmqK1.``..~.. _<<+-(____.. ```````` ..__~~_((<<!.`.``` .``.``
j0C1XUHmHIdW
// ggmmqH0!,_``.>`````` _<<;<v<<<++((((((((((<<<<<<~_. (-.``~``.>..```
jOuWHHqHIdH
// gmmqkW!`(_ J>` `` ` _~<`_~~~~<<<<<<<~~__````````` ?1. ._`(__``` zXWHg@HkXH
// gHHWS{``(lJ<!``.``.```(:+>`._`````.` <..`` - ``. ` _ ?&._.I`_``````
.XyVfppppW
// HHHSv``.(X:_..... _..(;+<!.(<..-.....-.-_..+_`..<.`.`..`_IJd}
.`..````jqg@@@@@@
// XHWZ{..<Jk~!.`..
(<.-(+>(_.(1.(_..`.`.`.<_.+<_..<<-..._..-zy>.`_`...```.WH@HHHHH
// bkWt~.-jCz(_..`.(+<.(;<
._-<=_(<_..-....(_.<1<..(<<.`._..-JUS-._.`...```dHmH9VUH
// WUUO..(f.(c...__+z<-(+~`
_-+<_(><..__.`.(<._.z_.(1;_..__.(C(zT-(..`...``(WHR<+Xk
//
kkkk._(_.->..._(z;:_><.._>_+_<(1>_._<...(v<<.(<.(+z<..-_(Z~_<_j+_..`...`(WHKz1ZW
//
@@gR._+_..~..-<+z<<?<>```_.<_.(+1><_;_..(1_:`.<<??1z--(+Z!..<_.j<....`..(bgHAAQX
// @@mR.(j:..~.._<z!`.(>~```
~(_.(+<1><><_.(((_`.<__`.<_.(X>...<_.(<.....`.JUWWWyWW
//
@gmH_(zl..(.._+>```<+_````.~>``(+.<?>>_._(<```(<<``(__<>....<.._<.......dXkkkHHH
//
mmqHl(dk_.(_.-=~`.`.1-..._~-1.``_:`(??<_~(`.--.&_.`.<(;<...._.._<..`..._Xg@@@@@@
//
qHkpk(dX<.(;..j_```.(((JJ&a&-~``````.1<_```-(((e+.-(/`(>...._..(<......(Wmggg@@g
// HVHbWcz><__+_.(_.(dWWHHH@HHc~````````.+~``
(jHMMMHHHm&.?..._<..(<_..._.(WqqHHmHg
// 0>vWWkzZwl~<o.__`__~X@@HM@Hb ```.`.``. ````
d@@HHH@@K?76...(<..(<_...(_(ppWWWWHq
// X0XWHKXXw$<(z<.( ``
WHHMHHHH_``````````````.WHHMNMHHH_`(...(<_.(z_..._<(fWVC174W
//
XuXWHHWWz>__+z+.!`..??CZYCOX_`````````````.`~.OvTUZUS_`~.._+?_.(_~_.._zjO=1+~+jy
// kkkkkkkkX:._<z=1(_`` << ``->``.``.``.``.```` ?<``
(v!`._..(??_.(1._.._=dUOOzzzwX
// @@@@@@@@H<...1O=v<_...__ -_````````````````.`` `` ~.``
:.~+=?~.(;_(...jdQQQQQkkk
//
H@@@@@@@H~...(==>.~~~~~....`.`````````.`````.`........->.(===~~<<.(...(dg@@@@@@@
//
@@@H@@HHH_.__(=l>~.~~~~~....``.``.``.```..`......~~~~~(<_+=l=~_<.->..~_dqggggg@g
//
@H@@@@MHH_._<(=l>...........```````````````.`...~~~~~~+<(=lz=~((j=z_..~jWqmmgggm
//
@@H@@HHWH_._<(lll-.......```.````.``.`..`````........_z<+llZz~(lOO=<...(VYUUUW9Y
//
@@HMMHWZf>~_=:=llw+.`````````.`.```__~~_``.`````.....(z+llOOz_zllOlz~..~<<1+dW>_
//
MMM#MHHWXl~_=>1ltwOl&.`.``.`````.``````````````.````.(llttwtz(OltwOz<..__zwOwwOz
//
HM#HMHUUI<._1z+ttOZttlt&....``.``.`.````.``...``...(zZtttOktzjttttwlz_._<(Xkkkkk
//
HHHmHSZu:(_~+OztttXtttOZZttO+-..............-(+ztOttwttttd0tOZttttwOl<~.(_dMMHHH
//
rvuuXuuI~~<~(uttttwvOwwwkQQHMMHHHHHHHHHMMMNmgey?OwwwrtttwXOtwttttttXtO-~.((wZyyy
// HHHHHHK>(~(-(dOrtrrl(QgMHMMMHHHHHHHHHHHHHHHH##HMNkX0rrrrXXrd%``
(Ctwwtz_~.<(Wg@H
// NNNNNHD(~(zo~zXrrrQdHHMMNMHHHHHHHHHHHHHHHHHHHHHH##HNmyrdKkwZ `
_``-zwrt1~~_<(MNM
// MMMMM#<<_jwr:(Z4QHHMMHMHHHHHHHHHHHHHHHHHHHHHHHHHHHH###NHSXZ>`
~````.OXtt>~._<?MM
*/
#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FF first
#define SS second
template <class S, class T> istream &operator>>(istream &is, pair<S, T> &p) {
return is >> p.FF >> p.SS;
}
template <class T> istream &operator>>(istream &is, vector<T> &xs) {
for (auto &x : xs)
is >> x;
return is;
}
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << p.FF << " " << p.SS;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &xs) {
for (unsigned int i = 0; i < xs.size(); ++i)
os << (i ? " " : "") << xs[i];
return os;
}
template <class T> void maxi(T &x, T y) {
if (x < y)
x = y;
}
template <class T> void mini(T &x, T y) {
if (x > y)
x = y;
}
void debug(istringstream &) {}
template <char sep = ',', class Head, class... Tail>
void debug(istringstream &iss, Head &&head, Tail &&...tail) {
string name;
getline(iss, name, ',');
cout << sep << name << "=" << head;
debug(iss, forward<Tail>(tail)...);
}
#ifdef PYONPOI
#define DEBUG(...) \
do { \
istringstream ss(#__VA_ARGS__); \
debug<' '>(ss, __VA_ARGS__); \
cout << endl; \
} while (0)
#else
#define DEBUG
#endif
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string s;
cin >> s;
int d1 = stoi(s.substr(0, 2));
int d2 = stoi(s.substr(0, 2));
bool yy = (0 < d2 && d2 <= 12);
bool mm = (0 < d1 && d1 <= 12);
if (yy && mm)
cout << "AMBIGUOUS";
else if (yy)
cout << "YYMM";
else if (mm)
cout << "MMYY";
else
cout << "NA";
cout << endl;
return 0;
} | /* Aa^~ kokoro ga pyonpyon suru n jaa^~
// ZZZXXkXkkkZ!``` ``` ``` ``` ``` ``` ``` ``` ``` ``` ```
```?Wfpppbpbbpbbpbbbkbkk
// ppbbbpbbpVr`` `` ` ` ` ` ```` `` ` ` `` ` ` ` ` ` ` ` ` `
dppbbkkkkkkkkkkqkqkk
// HkqqqqqkkWr`` ` ` ``` ``` `?G, ` ` ``.JC!```` ` ` `` ``
````(Wpbkkkkkkkkqkkkkkqk
// mmmmmqqqqpr` `` `` ```````.+zT=`` `` 7TO-.```````` `` ``
```(yppbkkkkkkkkkkkkkkk
// ggmgmmqqqH$ ``````````....````` ` ````````.`````` ``
``````.yfpppbbbbkkkkqqqqqH
// gmmmmmqqqkW<```` `````...````` .,.` ````....````` ```````
(Wbqqmgmmgmggggggggg
// qmmmqqqqkkWk.``````````````````` ;:<``
`````.`````````````-_<-?WHHqmmmmmmgmmgggg
// @@@@@@@gggHH6- ``````````````` `` _ `` ````````````````
._~~_.`-?Wkqmmmmmmmggg@g
// @@@@g@gggHY~.-<_- ``````````````````````````````````
._~~(<-``.`.(WHqqqmmggggmmm
// @@g@gggHH=.`..._<-___..```````````````````````. .-_~~~_(!``-.``.``
OHHWUWHmqHWXW
// gggggmqK1.``..~.. _<<+-(____.. ```````` ..__~~_((<<!.`.``` .``.``
j0C1XUHmHIdW
// ggmmqH0!,_``.>`````` _<<;<v<<<++((((((((((<<<<<<~_. (-.``~``.>..```
jOuWHHqHIdH
// gmmqkW!`(_ J>` `` ` _~<`_~~~~<<<<<<<~~__````````` ?1. ._`(__``` zXWHg@HkXH
// gHHWS{``(lJ<!``.``.```(:+>`._`````.` <..`` - ``. ` _ ?&._.I`_``````
.XyVfppppW
// HHHSv``.(X:_..... _..(;+<!.(<..-.....-.-_..+_`..<.`.`..`_IJd}
.`..````jqg@@@@@@
// XHWZ{..<Jk~!.`..
(<.-(+>(_.(1.(_..`.`.`.<_.+<_..<<-..._..-zy>.`_`...```.WH@HHHHH
// bkWt~.-jCz(_..`.(+<.(;<
._-<=_(<_..-....(_.<1<..(<<.`._..-JUS-._.`...```dHmH9VUH
// WUUO..(f.(c...__+z<-(+~`
_-+<_(><..__.`.(<._.z_.(1;_..__.(C(zT-(..`...``(WHR<+Xk
//
kkkk._(_.->..._(z;:_><.._>_+_<(1>_._<...(v<<.(<.(+z<..-_(Z~_<_j+_..`...`(WHKz1ZW
//
@@gR._+_..~..-<+z<<?<>```_.<_.(+1><_;_..(1_:`.<<??1z--(+Z!..<_.j<....`..(bgHAAQX
// @@mR.(j:..~.._<z!`.(>~```
~(_.(+<1><><_.(((_`.<__`.<_.(X>...<_.(<.....`.JUWWWyWW
//
@gmH_(zl..(.._+>```<+_````.~>``(+.<?>>_._(<```(<<``(__<>....<.._<.......dXkkkHHH
//
mmqHl(dk_.(_.-=~`.`.1-..._~-1.``_:`(??<_~(`.--.&_.`.<(;<...._.._<..`..._Xg@@@@@@
//
qHkpk(dX<.(;..j_```.(((JJ&a&-~``````.1<_```-(((e+.-(/`(>...._..(<......(Wmggg@@g
// HVHbWcz><__+_.(_.(dWWHHH@HHc~````````.+~``
(jHMMMHHHm&.?..._<..(<_..._.(WqqHHmHg
// 0>vWWkzZwl~<o.__`__~X@@HM@Hb ```.`.``. ````
d@@HHH@@K?76...(<..(<_...(_(ppWWWWHq
// X0XWHKXXw$<(z<.( ``
WHHMHHHH_``````````````.WHHMNMHHH_`(...(<_.(z_..._<(fWVC174W
//
XuXWHHWWz>__+z+.!`..??CZYCOX_`````````````.`~.OvTUZUS_`~.._+?_.(_~_.._zjO=1+~+jy
// kkkkkkkkX:._<z=1(_`` << ``->``.``.``.``.```` ?<``
(v!`._..(??_.(1._.._=dUOOzzzwX
// @@@@@@@@H<...1O=v<_...__ -_````````````````.`` `` ~.``
:.~+=?~.(;_(...jdQQQQQkkk
//
H@@@@@@@H~...(==>.~~~~~....`.`````````.`````.`........->.(===~~<<.(...(dg@@@@@@@
//
@@@H@@HHH_.__(=l>~.~~~~~....``.``.``.```..`......~~~~~(<_+=l=~_<.->..~_dqggggg@g
//
@H@@@@MHH_._<(=l>...........```````````````.`...~~~~~~+<(=lz=~((j=z_..~jWqmmgggm
//
@@H@@HHWH_._<(lll-.......```.````.``.`..`````........_z<+llZz~(lOO=<...(VYUUUW9Y
//
@@HMMHWZf>~_=:=llw+.`````````.`.```__~~_``.`````.....(z+llOOz_zllOlz~..~<<1+dW>_
//
MMM#MHHWXl~_=>1ltwOl&.`.``.`````.``````````````.````.(llttwtz(OltwOz<..__zwOwwOz
//
HM#HMHUUI<._1z+ttOZttlt&....``.``.`.````.``...``...(zZtttOktzjttttwlz_._<(Xkkkkk
//
HHHmHSZu:(_~+OztttXtttOZZttO+-..............-(+ztOttwttttd0tOZttttwOl<~.(_dMMHHH
//
rvuuXuuI~~<~(uttttwvOwwwkQQHMMHHHHHHHHHMMMNmgey?OwwwrtttwXOtwttttttXtO-~.((wZyyy
// HHHHHHK>(~(-(dOrtrrl(QgMHMMMHHHHHHHHHHHHHHHH##HMNkX0rrrrXXrd%``
(Ctwwtz_~.<(Wg@H
// NNNNNHD(~(zo~zXrrrQdHHMMNMHHHHHHHHHHHHHHHHHHHHHH##HNmyrdKkwZ `
_``-zwrt1~~_<(MNM
// MMMMM#<<_jwr:(Z4QHHMMHMHHHHHHHHHHHHHHHHHHHHHHHHHHHH###NHSXZ>`
~````.OXtt>~._<?MM
*/
#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FF first
#define SS second
template <class S, class T> istream &operator>>(istream &is, pair<S, T> &p) {
return is >> p.FF >> p.SS;
}
template <class T> istream &operator>>(istream &is, vector<T> &xs) {
for (auto &x : xs)
is >> x;
return is;
}
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << p.FF << " " << p.SS;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &xs) {
for (unsigned int i = 0; i < xs.size(); ++i)
os << (i ? " " : "") << xs[i];
return os;
}
template <class T> void maxi(T &x, T y) {
if (x < y)
x = y;
}
template <class T> void mini(T &x, T y) {
if (x > y)
x = y;
}
void debug(istringstream &) {}
template <char sep = ',', class Head, class... Tail>
void debug(istringstream &iss, Head &&head, Tail &&...tail) {
string name;
getline(iss, name, ',');
cout << sep << name << "=" << head;
debug(iss, forward<Tail>(tail)...);
}
#ifdef PYONPOI
#define DEBUG(...) \
do { \
istringstream ss(#__VA_ARGS__); \
debug<' '>(ss, __VA_ARGS__); \
cout << endl; \
} while (0)
#else
#define DEBUG
#endif
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string s;
cin >> s;
int d1 = stoi(s.substr(0, 2));
int d2 = stoi(s.substr(2, 2));
bool yy = (0 < d2 && d2 <= 12);
bool mm = (0 < d1 && d1 <= 12);
if (yy && mm)
cout << "AMBIGUOUS";
else if (yy)
cout << "YYMM";
else if (mm)
cout << "MMYY";
else
cout << "NA";
cout << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 860,962 | 860,963 | u157085392 | cpp |
p03042 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i <= n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define SORT(v, n) sort(v, v + n)
#define VSORT(v) sort(begin(v), end(v))
#define REV(v) reverse(begin(v), end(v))
#define VI vector<int>
#define PB(x) push_back(x)
#define SZ(x) end(x) - begin(x)
#define DEBUG(x) cerr << __LINE__ << ":" << #x << ": " << x << "\n";
//#define int long long
using namespace std;
using lint = long long;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} fast;
const int INF = INT_MAX;
const lint LINF = LLONG_MAX;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
inline void CO(auto &a) { REP(i, SZ(a)) cout << i << ": " << a[i] << "\n"; }
// if (IO > 1e5){lint a; scanf(%lld, &a); printf("%lld\n", a);}
signed main() {
int s;
cin >> s;
VI a;
a.PB(s / 100);
a.PB(s - a[0] * 100);
cout << a[0] << ":" << a[1] << endl;
bool mm = false;
if (1 <= a[0] and a[0] <= 12) {
mm = true;
}
if (1 <= a[1] and a[1] <= 12) {
if (mm) {
cout << "AMBIGUOUS" << endl;
return 0;
}
cout << "YYMM" << endl;
return 0;
}
if (mm) {
cout << "MMYY" << endl;
return 0;
}
cout << "NA" << endl;
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 - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define SORT(v, n) sort(v, v + n)
#define VSORT(v) sort(begin(v), end(v))
#define REV(v) reverse(begin(v), end(v))
#define VI vector<int>
#define PB(x) push_back(x)
#define SZ(x) end(x) - begin(x)
#define DEBUG(x) cerr << __LINE__ << ":" << #x << ": " << x << "\n";
//#define int long long
using namespace std;
using lint = long long;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} fast;
const int INF = INT_MAX;
const lint LINF = LLONG_MAX;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
inline void CO(auto &a) { REP(i, SZ(a)) cout << i << ": " << a[i] << "\n"; }
// if (IO > 1e5){lint a; scanf(%lld, &a); printf("%lld\n", a);}
signed main() {
int s;
cin >> s;
VI a;
a.PB(s / 100);
a.PB(s - a[0] * 100);
cerr << a[0] << ":" << a[1] << endl;
bool mm = false;
if (1 <= a[0] and a[0] <= 12) {
mm = true;
}
if (1 <= a[1] and a[1] <= 12) {
if (mm) {
cout << "AMBIGUOUS" << endl;
return 0;
}
cout << "YYMM" << endl;
return 0;
}
if (mm) {
cout << "MMYY" << endl;
return 0;
}
cout << "NA" << endl;
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 860,978 | 860,979 | u013120980 | cpp |
p03042 | #include <bits/stdc++.h>
/// TONI BO$$ was here
/// #MLC
using namespace std;
int main() {
int n, f1, f2;
char a, b, c, d;
scanf("%c%c%c%c", &a, &b, &c, &d);
a -= '0';
b -= '0';
c -= '0';
d -= '0';
f1 = f2 = 0;
if (a * 10 + b <= 12 && a * 10 + b > 0)
f1 = 1;
if (c * 10 + d <= 12 && c * 10 + d > 0)
f2 = 1;
if (f1 && f2)
printf("AMBIGOUS");
if (!f1 && !f2)
printf("NA");
if (f1 && !f2)
printf("MMYY");
if (!f1 && f2)
printf("YYMM");
return 0;
}
| #include <bits/stdc++.h>
/// TONI BO$$ was here
/// #MLC
using namespace std;
int main() {
int n, f1, f2;
char a, b, c, d;
scanf("%c%c%c%c", &a, &b, &c, &d);
a -= '0';
b -= '0';
c -= '0';
d -= '0';
f1 = f2 = 0;
if (a * 10 + b <= 12 && a * 10 + b > 0)
f1 = 1;
if (c * 10 + d <= 12 && c * 10 + d > 0)
f2 = 1;
if (f1 && f2)
printf("AMBIGUOUS");
if (!f1 && !f2)
printf("NA");
if (f1 && !f2)
printf("MMYY");
if (!f1 && f2)
printf("YYMM");
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 860,984 | 860,985 | u503211001 | cpp |
p03043 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
/*int P[10010];
void init(int n){
for(int i=0;i<n;++i)P[i]=i;
}
int root(int a) {
if(P[a]==a)return a;
return (P[a]=root(P[a]));
}
bool is_same_set(int a,int b){
return root(a) == root(b);//代表元を求める
}
void unite(int a,int b){
P[root(a)]=root(b);
}//対set,グラフ？
//セグメント木？？？
*/
double dot_product(xy_t a, xy_t b) { return (conj(a) * b).real(); } //内積
double cross_product(xy_t a, xy_t b) { return (conj(a) * b).imag(); } //外積
xy_t projection(xy_t p, xy_t b) {
return b * dot_product(p, b) / norm(b);
} //投影
//対図形
#define mod 1000000007
/*ll f[2001];
//int n,k とかしておく
ll pw(ll x, ll y){//euclidの互除法より
ll a= 1;
while(y){
if(y&1){//奇数なら
a = a*x%mod;
}
x = x*x%mod;
y /= 2;
}
return a;
}
ll modinv(ll x){//逆元を求める
return pw(x, mod - 2 );
}
ll comb(int n,int r){
if(n<r){
return 0;
}
return f[n] * modinv(f[r])%mod*modinv(f[n-r])%mod;
}//対combination//ただしfは用意してね
*/
struct BIT {
vector<int> dat;
int sz;
BIT(int n) {
for (sz = 1; sz < n; sz *= 2)
;
dat.resize(++sz);
}
int q(int n) {
int ret = 0;
for (int i = n; i > 0; i -= i & -i)
ret += dat[i]; //和の計算 iから最後の１のbit(i&-i 多分＆はビット積)を減算
for (int i = n; i < sz; i += i & -i)
dat[i]++; //値の加算 iから最後mの１のbitを加算
return ret;
}
};
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
rep2(i, n) {
int c = i;
int num = 0;
while (c < k) {
c *= 2;
num++;
}
double l = 1;
while (num) {
l *= 0.5;
num--;
}
ans += l / n;
}
printf("%12f\n", ans);
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
/*int P[10010];
void init(int n){
for(int i=0;i<n;++i)P[i]=i;
}
int root(int a) {
if(P[a]==a)return a;
return (P[a]=root(P[a]));
}
bool is_same_set(int a,int b){
return root(a) == root(b);//代表元を求める
}
void unite(int a,int b){
P[root(a)]=root(b);
}//対set,グラフ？
//セグメント木？？？
*/
double dot_product(xy_t a, xy_t b) { return (conj(a) * b).real(); } //内積
double cross_product(xy_t a, xy_t b) { return (conj(a) * b).imag(); } //外積
xy_t projection(xy_t p, xy_t b) {
return b * dot_product(p, b) / norm(b);
} //投影
//対図形
#define mod 1000000007
/*ll f[2001];
//int n,k とかしておく
ll pw(ll x, ll y){//euclidの互除法より
ll a= 1;
while(y){
if(y&1){//奇数なら
a = a*x%mod;
}
x = x*x%mod;
y /= 2;
}
return a;
}
ll modinv(ll x){//逆元を求める
return pw(x, mod - 2 );
}
ll comb(int n,int r){
if(n<r){
return 0;
}
return f[n] * modinv(f[r])%mod*modinv(f[n-r])%mod;
}//対combination//ただしfは用意してね
*/
struct BIT {
vector<int> dat;
int sz;
BIT(int n) {
for (sz = 1; sz < n; sz *= 2)
;
dat.resize(++sz);
}
int q(int n) {
int ret = 0;
for (int i = n; i > 0; i -= i & -i)
ret += dat[i]; //和の計算 iから最後の１のbit(i&-i 多分＆はビット積)を減算
for (int i = n; i < sz; i += i & -i)
dat[i]++; //値の加算 iから最後mの１のbitを加算
return ret;
}
};
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
rep2(i, n) {
int c = i;
int num = 0;
while (c < k) {
c *= 2;
num++;
}
double l = 1.0;
while (num) {
l *= 0.5;
num--;
}
ans += l / n;
}
printf("%.12f\n", ans);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,012 | 861,013 | u300866293 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
double N, M, A = 0, b, c = 0;
cin >> N >> M;
for (int i = 1; i <= N; i++) {
A = 1 / N;
b = i;
while (b < M - 1) {
b *= 2;
A /= 2;
}
c += A;
}
printf("%.12f", c);
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
double N, M, A = 0, b, c = 0;
cin >> N >> M;
for (int i = 1; i <= N; i++) {
A = 1 / N;
b = i;
while (b < M) {
b *= 2;
A /= 2;
}
c += A;
}
printf("%.12f", c);
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 861,017 | 861,018 | u768204022 | cpp |
p03043 | #include "bits/stdc++.h"
using namespace std;
int main() {
double n, k, p = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
double a = i + 1;
double c = 0;
while (a <= k) {
a *= 2;
c++;
}
p += 1 / (pow(2, c) * n);
}
cout << setprecision(13) << p << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
double n, k, p = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
double a = i + 1;
double c = 0;
while (a < k) {
a *= 2;
c++;
}
p += 1 / (pow(2, c) * n);
}
cout << setprecision(13) << p << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,025 | 861,026 | u038307191 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define SORT(c) sort((c).begin(), (c).end())
#define MOD 1000000007 // S.size() 配列名.Length()
using namespace std;
typedef unsigned long long ll;
int main(void) {
int n, k;
cin >> n >> k;
n *= 1.0;
k *= 1.0;
double ans = 0.0;
int cnt = 0, num;
for (int i = 0; i < n; i++) {
cnt = 0;
num = i + 1;
while (num < k) {
num *= 2;
cnt++;
}
ans += (double)1.0 / pow(2.0, cnt) / n;
// cout << cnt << " " << pow(2.0,cnt) << " " << ans << endl;
}
printf("%lf", ans);
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define SORT(c) sort((c).begin(), (c).end())
#define MOD 1000000007 // S.size() 配列名.Length()
using namespace std;
typedef unsigned long long ll;
int main(void) {
int n, k;
cin >> n >> k;
n *= 1.0;
k *= 1.0;
double ans = 0.0;
int cnt = 0, num;
for (int i = 0; i < n; i++) {
cnt = 0;
num = i + 1;
while (num < k) {
num *= 2;
cnt++;
}
ans += (double)1.0 / pow(2.0, cnt) / n;
// cout << cnt << " " << pow(2.0,cnt) << " " << ans << endl;
}
printf("%.12f", ans);
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,027 | 861,028 | u174509352 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define SORT(c) sort((c).begin(), (c).end())
#define MOD 1000000007 // S.size() 配列名.Length()
using namespace std;
typedef unsigned long long ll;
int main(void) {
int n, k;
cin >> n >> k;
n *= 1.0;
k *= 1.0;
double ans = 0.0;
int cnt = 0, num;
for (int i = 0; i < n; i++) {
cnt = 0;
num = i + 1;
while (num < k) {
num *= 2;
cnt++;
}
ans += (double)1.0 / pow(2.0, cnt) / n;
// cout << cnt << " " << pow(2.0,cnt) << " " << ans << endl;
}
printf("%f", ans);
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define SORT(c) sort((c).begin(), (c).end())
#define MOD 1000000007 // S.size() 配列名.Length()
using namespace std;
typedef unsigned long long ll;
int main(void) {
int n, k;
cin >> n >> k;
n *= 1.0;
k *= 1.0;
double ans = 0.0;
int cnt = 0, num;
for (int i = 0; i < n; i++) {
cnt = 0;
num = i + 1;
while (num < k) {
num *= 2;
cnt++;
}
ans += (double)1.0 / pow(2.0, cnt) / n;
// cout << cnt << " " << pow(2.0,cnt) << " " << ans << endl;
}
printf("%.12f", ans);
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 861,029 | 861,028 | u174509352 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
double res = 0;
for (int i = 1; i <= N; i++) {
double temp = 1.0 / double(N);
int score = i;
while (score < K - 1) {
score *= 2;
temp /= 2.0;
}
res += temp;
}
cout << setprecision(12);
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
double res = 0;
for (int i = 1; i <= N; i++) {
double temp = 1.0 / N;
int score = i;
while (score <= K - 1) {
score *= 2;
temp /= 2.0;
}
res += temp;
}
cout << setprecision(12);
cout << res << endl;
return 0;
} | [
"call.remove",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 861,030 | 861,031 | u703503553 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.