problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03043 | #include <bits/stdc++.h>
#define 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 << "["... | #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 << "["... | [
"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 (... | #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 (... | [
"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... | #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... | [
"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++;
... | #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++;
... | [
"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
... | #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
... | [
"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--)
#... | // 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--)
#... | [
"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--)
#... | // 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--)
#... | [
"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;
... | #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;
} els... | [
"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 * ... | #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 /... | [
"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... | #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... | [
"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_s... | #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_s... | [
"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;
pr... | #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 += tm... | [
"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> ... | #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> ... | [
"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;
}
c... | #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 ... | [
"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++) {... | #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++) {... | [
"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++) {... | #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++) {... | [
"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... | #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... | [
"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... | #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... | [
"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 ... | #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 <... | [
"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>;
... | #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>;
... | [
"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>;
... | #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>;
... | [
"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++){... | #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++){... | [
"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 =... | #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;... | [
"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<<": "<<co... | #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<<": "<<c... | [
"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;... | #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;... | [
"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()
#defi... | #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()
#defi... | [
"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 ... | #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 ... | [
"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;
// コインを振る回数
... | #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;
// コインを振る回数
... | [
"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", an... | #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... | #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... | [
"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... | #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... | [
"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... | #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... | [
"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;
i... | #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;
i... | [
"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;
i... | #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;
i... | [
"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)));
els... | #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)));
els... | [
"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) {
... | //#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) {
... | [
"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("%.10... | #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... | [
"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, ... | #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, ... | [
"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;
an... | #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;
an... | [
"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;... | #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;... | [
"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;... | #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;... | [
"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)
#defin... | #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)
#defin... | [
"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(... | #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(... | [
"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) << r... | #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) << ... | [
"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;
... | #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;
... | [
"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) << a... | #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) << ... | [
"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";
}
su... | #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 = s... | [
"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<<" "... | #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<<" "... | [
"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... | #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... | [
"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... | #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... | [
"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;
re... | #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;
re... | [
"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;
retur... | #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;
re... | [
"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;
}
}
... | #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;
}
}
... | [
"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 << en... | #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 << en... | [
"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 ... | #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 ... | [
"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;
... | #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;... | [
"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 << ... | #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 << ... | [
"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>... | #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>... | [
"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, ... | #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, ... | [
"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 ( ... | #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 ( ... | [
"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 l... | #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 l... | [
"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... | #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 +... | [
"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 << " " <... | #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 << " " <... | [
"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 << " " <... | #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 << " " <... | [
"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 << fixe... | #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 ... | [
"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 ... | #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 ... | [
"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 << fixe... | #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 << fixe... | [
"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++;
}
d... | #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++;
}
d... | [
"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 <... | #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 <... | [
"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... | #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... | [
"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;
r... | #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;
r... | [
"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... | #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... | [
"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) {
cou... | #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) {
cou... | [
"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" << ... | #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" << ... | [
"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++... | #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++... | [
"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) {
... | #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) {
... | [
"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", "AMBIGIO... | #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", "AMBIGUO... | [
"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... | #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... | [
"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)
c... | #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 &&... | [
"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
#defi... | #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
#defi... | [] | 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;
}
r... | #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;
}
r... | [
"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 (... | #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 (... | [
"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;... | #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;... | [
"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[... | #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[... | [
"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 = ... | #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 = ... | [
"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` `` `` ```````... | /* Aa^~ kokoro ga pyonpyon suru n jaa^~
// ZZZXXkXkkkZ!``` ``` ``` ``` ``` ``` ``` ``` ``` ``` ```
```?Wfpppbpbbpbbpbbbkbkk
// ppbbbpbbpVr`` `` ` ` ` ` ```` `` ` ` `` ` ` ` ` ` ` ` ` `
dppbbkkkkkkkkkkqkqkk
// HkqqqqqkkWr`` ` ` ``` ``` `?G, ` ` ``.JC!```` ` ` `` ``
````(Wpbkkkkkkkkqkkkkkqk
// mmmmmqqqqpr` `` `` ```````... | [
"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... | #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... | [
"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 ... | #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 ... | [
"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++)
typede... | #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++)
typede... | [
"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;
in... | #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;
in... | [
"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;
in... | #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;
in... | [
"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 ... | #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;... | [
"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.