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 |
|---|---|---|---|---|---|---|---|
p03045 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 863,451 | 863,452 | u607229598 | cpp |
p03045 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define mod 1000000007
typedef long long ll;
using namespace std;
class UnionFind {
publi... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define mod 1000000007
typedef long long ll;
using namespace std;
class UnionFind {
publi... | [
"call.arguments.change"
] | 863,457 | 863,458 | u238205921 | cpp |
p03045 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i... | [
"call.add",
"call.arguments.change"
] | 863,459 | 863,460 | u892687772 | cpp |
p03045 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define dump(x) cerr << #x <<... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define dump(x) cerr << #x <<... | [
"call.arguments.change"
] | 863,461 | 863,462 | u172873334 | cpp |
p03045 | // -----------------------------------
// Author : MatsuTaku
// Affiliation: Tokushima University
// Country : Japan
// Date : 04/09/2020
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct UF {
vector<int> vec;
UF(int size) : vec(size) {... | // -----------------------------------
// Author : MatsuTaku
// Affiliation: Tokushima University
// Country : Japan
// Date : 04/09/2020
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct UF {
vector<int> vec;
UF(int size) : vec(size) {... | [
"identifier.change",
"expression.operation.binary.change"
] | 863,463 | 863,464 | u500092662 | cpp |
p03045 | /*input
6 5
1 2 1
2 3 2
1 3 3
4 5 4
5 6 5
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second
#define FOR(i, n) fo... | /*input
3 1
1 2 1
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second
#define FOR(i, n) for (int i = 0; i < n; i++... | [
"expression.operation.binary.add"
] | 863,477 | 863,478 | u367694521 | cpp |
p03045 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [
"identifier.change",
"expression.operation.binary.change"
] | 863,479 | 863,480 | u810735437 | cpp |
p03045 | #include <set>
#include <stdio.h>
using namespace std;
int parent[100001];
int find(int u) {
if (parent[u] == u)
return u;
return parent[u] = find(parent[u]);
}
void merge(int u, int v) {
u = find(u), v = find(v);
if (u == v)
return;
if (u < v)
parent[v] = u;
else
parent[u] = v;
}
int ... | #include <set>
#include <stdio.h>
using namespace std;
int parent[100001];
int find(int u) {
if (parent[u] == u)
return u;
return parent[u] = find(parent[u]);
}
void merge(int u, int v) {
u = find(u), v = find(v);
if (u == v)
return;
if (u < v)
parent[v] = u;
else
parent[u] = v;
}
int ... | [
"call.arguments.change"
] | 863,481 | 863,482 | u328348656 | cpp |
p03045 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | [
"call.arguments.change"
] | 863,483 | 863,484 | u423143252 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
struct UnionFind {
int parent[N], rnk[N];
UnionFind(int n) {
for (int i = 0; i <= n; i++) {
parent[i] = i;
rnk[i] = 1;
}
}
int root(int x) {
if (parent[x] != x)
parent[x] = root(parent[x]);
return parent[x];
... | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
struct UnionFind {
int parent[N], rnk[N];
UnionFind(int n) {
for (int i = 0; i <= n; i++) {
parent[i] = i;
rnk[i] = 1;
}
}
int root(int x) {
if (parent[x] != x)
parent[x] = root(parent[x]);
return parent[x];
... | [
"literal.string.change",
"call.arguments.change"
] | 863,485 | 863,486 | u407892169 | cpp |
p03045 | #include <algorithm>
#include <chrono>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for ... | #include <algorithm>
#include <chrono>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for ... | [
"call.add",
"call.arguments.change"
] | 863,491 | 863,492 | u982234424 | cpp |
p03045 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pi... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pi... | [
"call.arguments.change"
] | 863,499 | 863,500 | u008229752 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
#define all(a) (a).begin(), (a).end()
#define rep(i, n) reps(i, 0, n)
#define reps(i, m, n) for (int i = (m); i < (n); i++)
// UnionFind
#define MAXN 200010
ll par[MAXN]; // 親
ll deep[MAXN]; // 深さ
// in要素で... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
#define all(a) (a).begin(), (a).end()
#define rep(i, n) reps(i, 0, n)
#define reps(i, m, n) for (int i = (m); i < (n); i++)
// UnionFind
#define MAXN 200010
ll par[MAXN]; // 親
ll deep[MAXN]; // 深さ
// in要素で... | [
"call.arguments.change"
] | 863,501 | 863,502 | u987476436 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | [
"identifier.change",
"call.function.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 863,503 | 863,504 | u703503553 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | [
"literal.number.change",
"call.arguments.change",
"identifier.change",
"call.function.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 863,505 | 863,504 | u703503553 | cpp |
p03045 | #include <iostream>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
/*ここから*/
// 10^6程度の扱いが可能
//縮約まで完了済み
int V; //頂点の個数
int E; //辺の個数
P e[2000010]; //辺の組み
int conn = 0; //連結数
int t[2000010]; //親情報の記録媒体
void Conn() {
for (int i = 1; i <= V; i++) {
t[i... | #include <iostream>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
/*ここから*/
// 10^6程度の扱いが可能
//縮約まで完了済み
int V; //頂点の個数
int E; //辺の個数
P e[2000010]; //辺の組み
int conn = 0; //連結数
int t[2000010]; //親情報の記録媒体
void Conn() {
for (int i = 1; i <= V; i++) {
t[i... | [
"variable_declaration.add"
] | 863,506 | 863,507 | u992779443 | cpp |
p03045 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | [] | 863,520 | 863,521 | u341447450 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 863,525 | 863,526 | u322177979 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
#define repi(n) for (int i = 0; i < (n); i++)
#define repj(n) for (int j = 0; j < (n); j++)
#define repk(n) for (int k = 0; k < (n); k++)
#define repl(n) for (int l = 0; l < (n); l++)
#define rep(i, n) for (int i = 0; (... | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
#define repi(n) for (int i = 0; i < (n); i++)
#define repj(n) for (int j = 0; j < (n); j++)
#define repk(n) for (int k = 0; k < (n); k++)
#define repl(n) for (int l = 0; l < (n); l++)
#define rep(i, n) for (int i = 0; (... | [
"call.add",
"call.arguments.change"
] | 863,533 | 863,534 | u600091079 | cpp |
p03045 | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1); // 3.1415926535897932384626433832795028...
const ll SIZE... | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1); // 3.1415926535897932384626433832795028...
const ll SIZE... | [
"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"
] | 863,541 | 863,542 | u539402331 | cpp |
p03045 | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1); // 3.1415926535897932384626433832795028...
const ll SIZE... | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1); // 3.1415926535897932384626433832795028...
const ll SIZE... | [
"literal.number.change",
"variable_declaration.array_dimensions.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"
] | 863,543 | 863,542 | u539402331 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
struct DSU {
int n;
vector<int> ps;
vector<int> rank;
int num_components;
DSU(int n) : n(n), ps(n), num_components(n) {
for (int i = 0; i < n; ++i) {
ps[i] = i;
rank[i] = 0;
}
}
int parent(int i) {
if (ps[i] == i) {
return i;
... | #include <bits/stdc++.h>
using namespace std;
struct DSU {
int n;
vector<int> ps;
vector<int> rank;
int num_components;
DSU(int n) : n(n), ps(n), num_components(n), rank(n) {
for (int i = 0; i < n; ++i) {
ps[i] = i;
rank[i] = 0;
}
}
int parent(int i) {
if (ps[i] == i) {
ret... | [] | 863,544 | 863,545 | u813181182 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000007;
const int mod = 10000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000007;
const int mod = 10000... | [
"expression.operation.binary.add"
] | 863,561 | 863,562 | u422633119 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main() {
int N, M;
cin >> N >> M;
Graph edge(M);
rep(i, M) {
int x, y, z;
cin >> x >> y >> z;
--x;
--y;
e... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main() {
int N, M;
cin >> N >> M;
Graph edge(N);
rep(i, M) {
int x, y, z;
cin >> x >> y >> z;
--x;
--y;
e... | [] | 863,563 | 863,564 | u104057163 | cpp |
p03045 | #include <cstdlib>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
typedef struct _xyz {
int x;
int y;
int z;
} xyz;
typedef struct _node {
std::vector<int> nbr; // zero-based numbering (node_arr[nbr]
} node;
int main(void) {
int n, m;
scanf("%d%d", &n, &m);
xyz *xyz_arr = (xy... | #include <cstdlib>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
typedef struct _xyz {
int x;
int y;
int z;
} xyz;
typedef struct _node {
std::vector<int> nbr; // zero-based numbering (node_arr[nbr]
} node;
int main(void) {
int n, m;
scanf("%d%d", &n, &m);
xyz *xyz_arr = (xy... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 863,568 | 863,569 | u450601883 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define ll long long
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) { rep(i, N) par[i] = i; }
int root(int x) {
if (par[x] == x)
return x;
return par[x] ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define ll long long
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) { rep(i, N) par[i] = i; }
int root(int x) {
if (par[x] == x)
return x;
return par[x] ... | [
"expression.operation.binary.add"
] | 863,576 | 863,577 | u154756110 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | [
"call.arguments.change"
] | 863,580 | 863,581 | u139031151 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | [
"identifier.change",
"expression.operation.binary.change"
] | 863,588 | 863,589 | u052332717 | cpp |
p03045 | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | [
"call.arguments.change"
] | 863,592 | 863,593 | u757738907 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
int num_groups, p[100000], n, m, a, b, c;
int par(int x) { return (p[x] == x) ? x : p[x] = par(p[x]); }
bool isSameGroup(int a, int b) { return par(a) == par(b); }
void merge(int a, int b) {
num_groups -= (!isSameGroup(a, b));
p[par(a)] = par(b);
}
int main() {
cin ... | #include <bits/stdc++.h>
using namespace std;
int num_groups, p[100000], n, m, a, b, c;
int par(int x) { return (p[x] == x) ? x : p[x] = par(p[x]); }
bool isSameGroup(int a, int b) { return par(a) == par(b); }
void merge(int a, int b) {
num_groups -= (!isSameGroup(a, b));
p[par(a)] = par(b);
}
int main() {
cin ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 863,598 | 863,599 | u913008467 | cpp |
p03045 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
const int MAX = 200005;
int parent[MAX];
void parinit(... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
const int MAX = 200005;
int parent[MAX];
void parinit(... | [
"call.add",
"call.arguments.change"
] | 863,600 | 863,601 | u076566148 | cpp |
p03045 | #include <iostream>
using namespace std;
int f[100001], cnt[100001], ans, n, m;
int find(int x) {
if (f[x] == x)
return x;
return f[x] = find(f[x]);
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
f[i] = i;
}
for (int i = 1; i <= m; i++) {
int x, y, z;
cin >> x >> y >> z;
f[... | #include <iostream>
using namespace std;
int f[100001], cnt[100001], ans, n, m;
int find(int x) {
if (f[x] == x)
return x;
return f[x] = find(f[x]);
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
f[i] = i;
}
for (int i = 1; i <= m; i++) {
int x, y, z;
cin >> x >> y >> z;
f[... | [
"call.add",
"call.arguments.change"
] | 863,608 | 863,609 | u875054522 | cpp |
p03045 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int parent[100000];
void init(int N) {
for (int i = 0; i < N; i++) {
parent[i] = i;
}
}
int find(int node) {
int temp = parent[node];
if (temp == node) {
return temp;... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int parent[100000];
void init(int N) {
for (int i = 0; i < N; i++) {
parent[i] = i;
}
}
int find(int node) {
int temp = parent[node];
if (temp == node) {
return temp;... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 863,614 | 863,615 | u048945791 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 1;
vector<int> nxt[MAXN];
bool vis[MAXN];
void dfs(int v) {
vis[v] = 1;
for (int w : nxt[v])
if (!vis[w])
dfs(w);
}
int main() {
ios_base::sync_with_stdio(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 1;
vector<int> nxt[MAXN];
bool vis[MAXN];
void dfs(int v) {
vis[v] = 1;
for (int w : nxt[v])
if (!vis[w])
dfs(w);
}
int main() {
ios_base::sync_with_stdio(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x... | [
"variable_declaration.add"
] | 863,616 | 863,617 | u939951826 | cpp |
p03045 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAX_N = 200000;
int N;
int paren... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAX_N = 200000;
int N;
int paren... | [
"call.arguments.change"
] | 863,628 | 863,629 | u194385557 | cpp |
p03045 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, M;
ll i, j, k, l;
ll anss[101010], ans;
ll mk[101010], mkr[101010];
... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, M;
ll i, j, k, l;
ll anss[101010], ans;
ll mk[101010], mkr[101010];
... | [
"call.add",
"call.arguments.change"
] | 863,638 | 863,639 | u259396003 | cpp |
p03045 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define MAX 100010
int p[MAX] = {0};
int parent(int i) {
if (p[i] == i)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define MAX 100010
int p[MAX] = {0};
int parent(int i) {
if (p[i] == i)... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 863,642 | 863,643 | u249988228 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (lli i = a; i < b... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (lli i = a; i < b... | [
"variable_access.subscript.index.change"
] | 863,644 | 863,645 | u774144672 | cpp |
p03045 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <unordered_set>
#include <vector>
using namespace std;
int par[100000];
int rnk[100000];
int find(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <unordered_set>
#include <vector>
using namespace std;
int par[100000];
int rnk[100000];
int find(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false... | [
"call.arguments.change"
] | 863,646 | 863,647 | u550574002 | cpp |
p03045 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef long long int lli;
using namespace std;
typedef pair<int, int> ii;
typedef priority_queue<int, vector<int>, greater<int>> he... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef long long int lli;
using namespace std;
typedef pair<int, int> ii;
typedef priority_queue<int, vector<int>, greater<int>> he... | [
"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"
] | 863,648 | 863,649 | u576106056 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = (int)1e9 + 7;
const int INF = (int)100100100;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) {
if (par[x] == x)
return x;
retu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = (int)1e9 + 7;
const int INF = (int)100100100;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) {
if (par[x] == x)
return x;
retu... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 863,652 | 863,653 | u593555034 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const int maxn = 2e5 + 2;
int n, m;
struct UF {
int sz;
vi r, p;
UF(int n) : r(n, 0), p(n, 0), sz(n) { iota(p.begin(), p.end(), 0); }
int f(int x) { return (p[x] == x ? x : p[x] = f(p[x])); }
void u(int i, int j) {
int x = f(i),... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const int maxn = 2e5 + 2;
int n, m;
struct UF {
int sz;
vi r, p;
UF(int n) : r(n, 0), p(n, 0), sz(n) { iota(p.begin(), p.end(), 0); }
int f(int x) { return (p[x] == x ? x : p[x] = f(p[x])); }
void u(int i, int j) {
int x = f(i),... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 863,658 | 863,659 | u884136989 | cpp |
p03045 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
const long long INF = 1LL << 60;
int par[100010];
i... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
const long long INF = 1LL << 60;
int par[100010];
i... | [
"call.arguments.change"
] | 863,662 | 863,663 | u553605501 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
struct unionfind {
vector<int> par, rank;
unionfind(int x) {
par.resize(x);
rank.resize(x);
for (int i = 0; i < x; i++)
par[i] = i, rank[i] = 0;
}
int root(int x) {
if (par[x] == x)
return x;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
struct unionfind {
vector<int> par, rank;
unionfind(int x) {
par.resize(x);
rank.resize(x);
for (int i = 0; i < x; i++)
par[i] = i, rank[i] = 0;
}
int root(int x) {
if (par[x] == x)
return x;... | [
"variable_declaration.value.change"
] | 863,677 | 863,678 | u129667379 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) ... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) ... | [
"call.arguments.change"
] | 863,681 | 863,682 | u337054478 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) ... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) ... | [
"call.arguments.change"
] | 863,683 | 863,682 | u337054478 | cpp |
p03045 | #include <bits/stdc++.h>
#define X first
#define Y second
#define pb emplace_back
#define FOR(i, a, b) for (int(i) = (a); i < (b); ++(i))
#define EFOR(i, a, b) for (int(i) = (a); i <= (b); ++(i))
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define REP rep
#define rrep(X, Y) for (int(X) = (Y)-1; (X) >= 0; --(X)... | #include <bits/stdc++.h>
#define X first
#define Y second
#define pb emplace_back
#define FOR(i, a, b) for (int(i) = (a); i < (b); ++(i))
#define EFOR(i, a, b) for (int(i) = (a); i <= (b); ++(i))
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define REP rep
#define rrep(X, Y) for (int(X) = (Y)-1; (X) >= 0; --(X)... | [
"variable_declaration.add"
] | 863,684 | 863,685 | u756607506 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
#define INF 1000000000000000000
typedef long long ll;
vector<int> uni(100010, -1);
int root(int a) {
if (uni[a < 0])
return a;
return uni[a] = root(uni[a]);
}
bool connect(int a, int b) {
a = roo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
#define INF 1000000000000000000
typedef long long ll;
vector<int> uni(100010, -1);
int root(int a) {
if (uni[a] < 0)
return a;
return uni[a] = root(uni[a]);
}
bool connect(int a, int b) {
a = roo... | [
"control_flow.branch.if.condition.change"
] | 863,688 | 863,689 | u503870829 | cpp |
p03045 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <string>
using namespace std;
#define MAX_N 200000
class union_find {
private:
int par[MAX_N];
int tree_rank[MAX_N];
int set_num;
public:
union_find(int n); // const
int find(int x);
void unite(in... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <string>
using namespace std;
#define MAX_N 200000
class union_find {
private:
int par[MAX_N];
int tree_rank[MAX_N];
int set_num;
public:
union_find(int n); // const
int find(int x);
void unite(in... | [
"control_flow.loop.for.condition.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 863,694 | 863,695 | u594244257 | cpp |
p03045 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define range(i) (i).begin(), (i).end()
#define rrange(i) (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define range(i) (i).begin(), (i).end()
#define rrange(i) (... | [] | 863,698 | 863,699 | u356489231 | cpp |
p03045 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
class unionFind {
int nodeSize;
vector<int> parent;
public:
unionFind(int n) : nodeSize(n) { parent = vector<int>(n + 1, -1); }
int getRoot(int a) {
if (parent[a] < 0) {
return a;
}
return parent[a] = getRoot(a... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
class unionFind {
int nodeSize;
vector<int> parent;
public:
unionFind(int n) : nodeSize(n) { parent = vector<int>(n + 1, -1); }
int getRoot(int a) {
if (parent[a] < 0) {
return a;
}
return parent[a] = getRoot(p... | [
"call.arguments.change",
"function.return_value.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 863,704 | 863,703 | u369508054 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int N, M;
vector<int> adj[MAXN];
bool vis[MAXN];
void dfs(int cur) {
if (vis[cur])
return;
vis[cur] = true;
for (int nxt : adj[cur]) {
dfs(nxt);
}
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> N ... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int N, M;
vector<int> adj[MAXN];
bool vis[MAXN];
void dfs(int cur) {
if (vis[cur])
return;
vis[cur] = true;
for (int nxt : adj[cur]) {
dfs(nxt);
}
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> N ... | [
"identifier.change",
"call.arguments.change"
] | 863,705 | 863,706 | u242534780 | cpp |
p03045 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(v) v.beg... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(v) v.beg... | [
"call.arguments.change"
] | 863,707 | 863,708 | u505831576 | cpp |
p03045 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
struct UnionFind {
vector<int> data;
UnionFind(int sz) { data.assign(sz, -1); }
bool unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return (false);
if (data[x] > data[y])
swap(x, y);
data[x] += da... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
struct UnionFind {
vector<int> data;
UnionFind(int sz) { data.assign(sz, -1); }
bool unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return (false);
if (data[x] > data[y])
swap(x, y);
data[x] += da... | [
"expression.operation.binary.add"
] | 863,715 | 863,716 | u672765904 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double s = 0;
for (int i = 1; i < N; i++) {
double ss = 1;
int b = i;
while (b < K) {
ss /= 2;
b *= 2;
}
s += ss;
}
s /= N;
cout << fixed << setprecision(10) << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double s = 0;
for (int i = 1; i < N + 1; i++) {
double ss = 1;
int b = i;
while (b < K) {
ss /= 2;
b *= 2;
}
s += ss;
}
s /= N;
cout << fixed << setprecision(10) << s << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 863,727 | 863,728 | u973991908 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double s = 0;
for (int i = 1; i < N; i++) {
double ss = 1;
int b = i;
while (b < K) {
ss /= 2;
b *= 2;
}
s += ss;
}
s /= 3;
cout << fixed << setprecision(10) << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double s = 0;
for (int i = 1; i < N + 1; i++) {
double ss = 1;
int b = i;
while (b < K) {
ss /= 2;
b *= 2;
}
s += ss;
}
s /= N;
cout << fixed << setprecision(10) << s << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 863,729 | 863,728 | u973991908 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double s = 0;
for (int i = 1; i < N + 1; i++) {
double ss = 1;
int b = i;
while (b < K) {
ss /= 2;
b *= 2;
}
s += ss;
}
s /= 3;
cout << fixed << setprecision(10) << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double s = 0;
for (int i = 1; i < N + 1; i++) {
double ss = 1;
int b = i;
while (b < K) {
ss /= 2;
b *= 2;
}
s += ss;
}
s /= N;
cout << fixed << setprecision(10) << s << endl;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 863,730 | 863,728 | u973991908 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define boost \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define boost \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"type_conversion.add"
] | 863,738 | 863,739 | u202858603 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, now;
double ans = 0.0;
double one_n, temp;
cin >> n >> k;
one_n = 1.0 / n;
for (int i = 1; i <= n; i++) {
now = i;
temp = one_n;
while (now < k) {
now *= 2.0;
temp /= 2.0;
}
ans += temp;
}
cout << ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, now;
double ans = 0.0;
double one_n, temp;
cin >> n >> k;
one_n = 1.0 / n;
for (int i = 1; i <= n; i++) {
now = i;
temp = one_n;
while (now < k) {
now *= 2.0;
temp /= 2.0;
}
ans += temp;
}
cout << set... | [
"io.output.change"
] | 863,740 | 863,741 | u745852541 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 999999999;
int main() {
int N, K;
cin >> ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 999999999;
int main() {
int N, K;
cin >> ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 863,742 | 863,743 | u239023686 | cpp |
p03043 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define fio ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define fio ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 863,744 | 863,745 | u716033247 | cpp |
p03043 | //#pragma warning(disable:4996)
#include <stdio.h>
//#include <math.h>
int main() {
int n, k;
scanf("%d %d", &n, &k);
double answer = 0;
for (int i = 1; i <= n; i++) {
int a = 1;
a *= n;
int b = i;
while (b <= k) {
b *= 2;
a *= 2;
}
answer += (double)1.0 / a;
}
printf("... | //#pragma warning(disable:4996)
#include <stdio.h>
//#include <math.h>
int main() {
int n, k;
scanf("%d %d", &n, &k);
double answer = 0;
for (int i = 1; i <= n; i++) {
int a = 1;
a *= n;
int b = i;
while (b < k) {
b *= 2;
a *= 2;
}
answer += (double)1.0 / a;
}
printf("%... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 863,746 | 863,747 | u691912637 | cpp |
p03043 | //#pragma warning(disable:4996)
#include <stdio.h>
//#include <math.h>
int main() {
int n, k;
scanf("%d %d", &n, &k);
double answer = 0;
for (int i = 1; i <= n; i++) {
int a = 1;
a *= n;
int b = i;
while (b <= k) {
b *= 2;
a *= 2;
}
answer += (double)1 / a;
}
printf("%l... | //#pragma warning(disable:4996)
#include <stdio.h>
//#include <math.h>
int main() {
int n, k;
scanf("%d %d", &n, &k);
double answer = 0;
for (int i = 1; i <= n; i++) {
int a = 1;
a *= n;
int b = i;
while (b < k) {
b *= 2;
a *= 2;
}
answer += (double)1.0 / a;
}
printf("%... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 863,748 | 863,747 | u691912637 | cpp |
p03043 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
double n, k, ans;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
double t = i, temp = 1 / n;
while (t < k) {
t *= 2;
temp /= 2;
}
ans += temp;
}
printf("%12f", ans);
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
double n, k, ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
double t = i, temp = 1 / n;
while (t < k) {
t *= 2;
temp /= 2;
}
ans += temp;
}
printf("%.12f", ans);
} | [
"variable_declaration.value.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 863,771 | 863,772 | u950603962 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main() {
double N, K;
cin >> N >> K;
double ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main() {
double N, K;
cin >> N >> K;
int k;
... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 863,777 | 863,778 | u468862268 | cpp |
p03043 | /*coderanant*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define f1(i, a, b) for (i = a; i < b; i++)
#define f2(i, a, b) for (i = a; i >= b; i--)
#define endl '\n'
#define pb push_back
#define gp " "
#define ff first
#define ss second
#define mp make_pair
const int mod =... | /*coderanant*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define f1(i, a, b) for (i = a; i < b; i++)
#define f2(i, a, b) for (i = a; i >= b; i--)
#define endl '\n'
#define pb push_back
#define gp " "
#define ff first
#define ss second
#define mp make_pair
const int mod =... | [
"io.output.change"
] | 863,781 | 863,782 | u087436629 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double kakuritu = 0.0;
for (int i = 0; i < N; i++) {
int tokuten = i + 1;
int kai = 0;
while (tokuten < K) {
tokuten *= 2;
kai++;
}
if (kai != 0) {
kakuritu += ((1.0 / N) * (1 / pow(2, kai))... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double kakuritu = 0.0;
for (int i = 0; i < N; i++) {
int tokuten = i + 1;
int kai = 0;
while (tokuten < K) {
tokuten *= 2;
kai++;
}
if (kai != 0) {
kakuritu += ((1.0 / N) * (1 / pow(2, kai))... | [
"io.output.change",
"call.arguments.add"
] | 863,783 | 863,784 | u120711599 | cpp |
p03043 | /*************************
author : coldbeer
2019-05-20 10:38:08 PM IST
*************************/
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long double n;
int k;
cin >> n >> k;
long double ans = 0;
for (int i = 1; i < n + ... | /*************************
author : coldbeer
2019-05-20 10:38:08 PM IST
*************************/
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long double n;
int k;
cin >> n >> k;
long double ans = 0;
for (int i = 1; i < n + ... | [] | 863,785 | 863,786 | u257192613 | cpp |
p03043 | /*************************
author : coldbeer
2019-05-20 10:38:08 PM IST
*************************/
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long double n, k;
cin >> n >> k;
long double ans = 0;
for (int i = 1; i < n + 1; i++... | /*************************
author : coldbeer
2019-05-20 10:38:08 PM IST
*************************/
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long double n;
int k;
cin >> n >> k;
long double ans = 0;
for (int i = 1; i < n + ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 863,787 | 863,786 | u257192613 | cpp |
p03043 | /*************************
author : coldbeer
2019-05-20 10:38:08 PM IST
*************************/
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long double n, k;
cin >> n >> k;
long double ans = 0;
for (int i = 1; i < n + 1; i++... | /*************************
author : coldbeer
2019-05-20 10:38:08 PM IST
*************************/
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long double n;
int k;
cin >> n >> k;
long double ans = 0;
for (int i = 1; i < n + ... | [
"variable_declaration.type.change"
] | 863,788 | 863,786 | u257192613 | cpp |
p03043 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int inf = 1e9;
const ll linf = 1e18;
const ll mod = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
double ans = 0.;
for (int i = 1; i <= N; i++) {
int num = i;
int cnt = 0;
while (num < K) {
num *= 2;
cnt++;
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int inf = 1e9;
const ll linf = 1e18;
const ll mod = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
double ans = 0.;
for (int i = 1; i <= N; i++) {
int num = i;
int cnt = 0;
while (num < K) {
num *= 2;
cnt++;
... | [
"io.output.change"
] | 863,793 | 863,794 | u394759653 | cpp |
p03043 | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int i_tmp = i;
int count = 0;
if (i_tmp < k) {
while (i_tmp <= k) {
i_tmp *= 2;
count++;
}
}
ans += ... | #include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int i_tmp = i;
int count = 0;
if (i_tmp < k) {
while (i_tmp < k) {
i_tmp *= 2;
count++;
}
}
ans += p... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 863,795 | 863,796 | u675125216 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
double ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
int temp = i;
int count = 0;
while (temp <= k) {
temp <<= 1;
count++;
}
ans += 1... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
double ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
int temp = i;
int count = 0;
while (temp < k) {
temp <<= 1;
count++;
}
ans += 1... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 863,804 | 863,805 | u163200127 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
long double n, k, ans = 0;
cin >> n >> k;
for (long double i = 1; i <= n; i++) {
long double temp = i, x = 0;
while (temp < k) {
temp *= 2;
++x;
}
long double ttmp = 1 / (pow((long double)2, x) * n);
ans += ttmp;
}
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
long double n, k, ans = 0;
cin >> n >> k;
for (long double i = 1; i <= n; i++) {
long double temp = i, x = 0;
while (temp < k) {
temp *= 2;
++x;
}
long double ttmp = 1 / (pow((long double)2, x) * n);
ans += ttmp;
}
co... | [
"identifier.change",
"io.output.change"
] | 863,806 | 863,807 | u592099403 | cpp |
p03043 | #include <algorithm>
#include <array>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
... | #include <algorithm>
#include <array>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.c... | 863,808 | 863,809 | u531752502 | cpp |
p03043 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
double N, K;
double sum = 0, ans;
double y = 0;
cin >> N >> K;
for (double i = 1; i <= N; i++) {
double x = i;
ans = 1.0;
w... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
double N, K;
double sum = 0, ans;
double y = 0;
cin >> N >> K;
for (double i = 1; i <= N; i++) {
double x = i;
ans = 1.0;
w... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.number.change",
"assignment.value.change"
] | 863,810 | 863,811 | u831873811 | cpp |
p03043 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"expression.operation.binary.remove"
] | 863,812 | 863,813 | u874996917 | cpp |
p03043 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*
* AND WATCH OUT FOR OFF BY ONE!!!
*/
#include <bits/stdc++.h>
const bool unsyncedio = std::ios::sync_with_stdio(false);
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define... | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*
* AND WATCH OUT FOR OFF BY ONE!!!
*/
#include <bits/stdc++.h>
const bool unsyncedio = std::ios::sync_with_stdio(false);
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define... | [
"io.output.change"
] | 863,814 | 863,815 | u014617387 | cpp |
p03043 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort(v.begin(), v.end())
#define vrev(v) reverse(v.begin(), v.end())
#d... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort(v.begin(), v.end())
#define vrev(v) reverse(v.begin(), v.end())
#d... | [
"expression.operation.unary.arithmetic.remove"
] | 863,823 | 863,824 | u493080913 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int t = i, cnt = 0;
while (t < k) {
t *= 2;
cnt++;
}
if (cnt)
ans += (1.0 / (double)pow(2, cnt)) * (1.0 / (double)n);
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
int t = i, cnt = 0;
while (t < k) {
t *= 2;
cnt++;
}
ans += (1.0 / (double)pow(2, cnt)) * (1.0 / (double)n);
}
printf("%.... | [] | 863,838 | 863,839 | u344122377 | cpp |
p03043 | /* << IN THE NAME OF GOD >> */
#include <bits/stdc++.h>
using namespace std;
#define err(x) cerr << #x << " = " << x << '\n'
#define out(x) cout << x << '\n'
#define forp(i, r, l) for (int i = int(r); i < int(l); i++)
#define forn(i, r, l) for (int i = int(r); i > int(l); i--)
#define FAST ... | /* << IN THE NAME OF GOD >> */
#include <bits/stdc++.h>
using namespace std;
#define err(x) cerr << #x << " = " << x << '\n'
#define out(x) cout << x << '\n'
#define forp(i, r, l) for (int i = int(r); i < int(l); i++)
#define forn(i, r, l) for (int i = int(r); i > int(l); i--)
#define FAST ... | [
"assignment.change"
] | 863,840 | 863,841 | u085966074 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define MD 1000000007
typedef long long int ll;
typedef pair<ll, ll> P;
template <typename T> std::string tostr(const T &t) {
std::ostringstream os;
os << t;
return os.str();
}
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k... | #include <bits/stdc++.h>
using namespace std;
#define MD 1000000007
typedef long long int ll;
typedef pair<ll, ll> P;
template <typename T> std::string tostr(const T &t) {
std::ostringstream os;
os << t;
return os.str();
}
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 863,844 | 863,845 | u287060310 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | [
"variable_declaration.type.narrow.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 863,846 | 863,847 | u107995903 | cpp |
p03043 | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 863,848 | 863,847 | u107995903 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = pair<... | #include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = pair<... | [
"io.output.change"
] | 863,851 | 863,852 | u458798873 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout.precision(12);
cout.setf(ios_base::fixed, ios_base::floatfield);
int n, k;
cin >> n >> k;
double ans = 0.0;
for (int i = 1; i <= n; i++) {
if (i >= k)
ans += 1.0;
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout.precision(12);
cout.setf(ios_base::fixed, ios_base::floatfield);
int n, k;
cin >> n >> k;
double ans = 0.0;
for (int i = 1; i <= n; i++) {
if (i >= k)
ans += 1.0;
else {
... | [
"control_flow.branch.else.add"
] | 863,860 | 863,861 | u726604439 | cpp |
p03043 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define nummax 110000
using namespace std;
int main() {
double ans = 0.0, y, i, N, K, x;
cin >> N >> K;
for (i = 1; i <= N; i++) {
x = 0;
while (1) {
if (i * pow(2, (double)x) >= K)
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define nummax 110000
using namespace std;
int main() {
double ans = 0.0, y, i, N, K, x;
cin >> N >> K;
for (i = 1; i <= N; i++) {
x = 0;
while (1) {
if (i * pow(2, (double)x) >= K)
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 863,873 | 863,874 | u541884637 | cpp |
p03043 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
int a, b;
cin >> a >> b;
double ret = 0;
for (int i = 1; i <= 1; i++) {
double tmp = 1.0 / a;
int now = i;
while (now < b) {
now *= 2;
tmp /= 2;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
int a, b;
cin >> 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;
}
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 863,882 | 863,883 | u568419568 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
int root(int i, vector<int> &par) {
if (par[i] == i)
return i;
return par[i] = root(par[i], par);
}
void unite(int i, int j, vector<int> &par) {
int ri = root(i, par);
int rj = root(j, par);
par[rj] = ri;
}
int main(void) {
int N, M;
cin >> N >> M;
v... | #include <bits/stdc++.h>
using namespace std;
int root(int i, vector<int> &par) {
if (par[i] == i)
return i;
return par[i] = root(par[i], par);
}
void unite(int i, int j, vector<int> &par) {
int ri = root(i, par);
int rj = root(j, par);
par[rj] = ri;
}
int main(void) {
int N, M;
cin >> N >> M;
v... | [
"call.arguments.change",
"call.arguments.add"
] | 864,068 | 864,069 | u898331860 | cpp |
p03045 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, n) for (int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for (int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(), (x).end()
#define MOD 100000000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, n) for (int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for (int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(), (x).end()
#define MOD 100000000... | [
"control_flow.return.add"
] | 864,070 | 864,071 | u405923605 | cpp |
p03047 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define rrep(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef lon... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define rrep(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef lon... | [
"expression.operation.binary.remove"
] | 864,443 | 864,444 | u418810472 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << b - a + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a - b + 1 << endl;
} | [
"expression.operation.binary.remove"
] | 864,445 | 864,446 | u225777148 | cpp |
p03047 | #include <stdio.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", a - b);
} | #include <stdio.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", a - b + 1);
}
| [
"expression.operation.binary.add"
] | 864,459 | 864,460 | u561639627 | cpp |
p03047 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << min(n - k + 1, 0) << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << max(n - k + 1, 0) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 864,475 | 864,476 | u112318601 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N, K;
cout << N - K + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << N - K + 1 << endl;
} | [] | 864,493 | 864,494 | u280966279 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << n + k - 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << n - k + 1 << endl;
} | [
"expression.operation.binary.remove"
] | 864,507 | 864,508 | u459105164 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
cout << n - k - 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
cout << n - k + 1 << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 864,513 | 864,514 | u561143568 | cpp |
p03047 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 ... | [
"expression.operation.binary.add"
] | 864,515 | 864,516 | u057611820 | cpp |
p03047 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int INF = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, K;
cin >> N, K;
cout << N - K + 1 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int INF = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
cout << N - K + 1 << endl;
} | [] | 864,526 | 864,527 | u415916075 | cpp |
p03047 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int k, n;
cin >> n >> k;
cout << n - k << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int k, n;
cin >> n >> k;
cout << n - k + 1 << "\n";
return 0;
} | [
"expression.operation.binary.add"
] | 864,528 | 864,529 | u211227348 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.