problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02969 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define INF 210000000
static long long gcd(long long a, long long b) {
int amari = a % b;
int c = b;
if (amari == 0) {
return b;
} else {
return gcd(b, amari);
}
}
s... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define INF 210000000
static long long gcd(long long a, long long b) {
int amari = a % b;
int c = b;
if (amari == 0) {
return b;
} else {
return gcd(b, amari);
}
}
s... | [
"expression.operation.binary.remove"
] | 772,715 | 772,716 | u005570675 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { ... | [] | 772,731 | 772,732 | u478997153 | cpp |
p02969 | #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
//-----------------------------------------------------------------------------------
int a;
cin >> a;
cout << 3.0 * a * a << "endl";
} | #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
//-----------------------------------------------------------------------------------
int a;
cin >> a;
cout << 3.0 * a * a << "\n";
} | [
"literal.string.change",
"io.output.change"
] | 772,764 | 772,765 | u373796790 | cpp |
p02969 | #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
//-----------------------------------------------------------------------------------
int a;
cin >> a;
cout << 4.0 * a * a << "endl";
} | #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
//-----------------------------------------------------------------------------------
int a;
cin >> a;
cout << 3.0 * a * a << "\n";
} | [
"literal.number.change",
"io.output.change",
"literal.string.change"
] | 772,766 | 772,765 | u373796790 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
int a;
a = 3 * r ^ 2;
cout << a << endl;
} | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
int a;
a = 3 * r * r;
cout << a << endl;
} | [] | 772,769 | 772,770 | u711816529 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
printf("%ld", (long int)6 * n * n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
printf("%ld", (long int)3 * n * n);
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 772,788 | 772,789 | u173000750 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
int x = 2 * r * r;
cout << x;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
int x = 3 * r * r;
cout << x;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 772,805 | 772,806 | u549517003 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * (r ^ 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * (r * r) << endl;
} | [] | 772,807 | 772,808 | u384561774 | cpp |
p02969 | // atcoder/abc134/A/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typenam... | // atcoder/abc134/A/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typenam... | [
"expression.operation.binary.remove"
] | 772,815 | 772,816 | u768334187 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cout << r * r * 3 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << r * r * 3 << endl;
}
| [] | 772,821 | 772,822 | u653482689 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * pow(r, 3) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * pow(r, 2) << endl;
} | [
"literal.number.change",
"io.output.change"
] | 772,825 | 772,826 | u565692645 | cpp |
p02969 | #include <bits/stdc++.h>
#define LL long long
const int N = 1020;
const long long mod = 998244353;
using namespace std;
LL n;
int main() {
ios_base::sync_with_stdio(0);
// freopen( "input.txt" , "r" , stdin );
// freopen( "output.txt" , "w" , stdout );
cout << 3 * (n * n);
}
| #include <bits/stdc++.h>
#define LL long long
const int N = 1020;
const long long mod = 998244353;
using namespace std;
LL n;
int main() {
ios_base::sync_with_stdio(0);
// freopen( "input.txt" , "r" , stdin );
// freopen( "output.txt" , "w" , stdout );
cin >> n;
cout << 3 * (n * n);
}
| [] | 772,827 | 772,828 | u543498582 | cpp |
p02969 | #include <bits/stdc++.h>
#include <iomanip>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
using namespace std;
const long long INF = 9000000000000000;
const long long mod = 10000000... | #include <bits/stdc++.h>
#include <iomanip>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
using namespace std;
const long long INF = 9000000000000000;
const long long mod = 10000000... | [
"literal.number.change",
"io.output.change"
] | 772,839 | 772,840 | u127856129 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
void solve() {
long long a;
cout << 3 * (a * a) << endl;
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void solve() {
long long a;
cin >> a;
cout << 3 * (a * a) << endl;
}
int main() {
solve();
return 0;
} | [] | 772,845 | 772,846 | u573945813 | cpp |
p02969 | #include <iostream>
int main() {
int r;
std::cin >> r;
std::cout << 3 * r * r * r << std::endl;
return 0;
} | #include <iostream>
int main() {
int r;
std::cin >> r;
std::cout << 3 * r * r << std::endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 772,858 | 772,859 | u675512317 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
cout << 3 * x * x * x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
cout << 3 * x * x << endl;
} | [
"expression.operation.binary.remove"
] | 772,860 | 772,861 | u806503933 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define ll long long
#define FOR(i, n) for (int i = 0; i < n; i++)
// map<key,value>
int main() {
ll r;
cin >> r;
cout << r * r * r;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define ll long long
#define FOR(i, n) for (int i = 0; i < n; i++)
// map<key,value>
int main() {
ll r;
cin >> r;
cout << r * r * 3;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 772,866 | 772,867 | u662665711 | cpp |
p02969 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9
#define MOD 0
//#define int ll
using namespace std;
typedef vector<long long> vl;
signed main(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9
#define MOD 0
//#define int ll
using namespace std;
typedef vector<long long> vl;
signed main(... | [
"expression.operation.binary.remove"
] | 772,872 | 772,873 | u244583418 | cpp |
p02969 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
// Your code here!
int r;
scanf("%d", &r);
printf("%d", 3 * r * r * r);
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
// Your code here!
int r;
scanf("%d", &r);
printf("%d", 3 * r * r);
return 0;
}
| [
"expression.operation.binary.remove"
] | 772,892 | 772,893 | u237374575 | cpp |
p02969 | #include <iostream>
using namespace std;
typedef long long ll;
ll a;
ll bp(ll a, ll n) {
if (n == 0)
return 1ll;
if (n == 1)
return a;
ll res = bp(a, n / 2);
if (n & 1)
return res * res * a;
else
return res * res;
}
int main() {
ll a;
cin >> a;
cout << 3ll * bp(a, 22ll);
return 0;... | #include <iostream>
using namespace std;
typedef long long ll;
ll a;
ll bp(ll a, ll n) {
if (n == 0)
return 1ll;
if (n == 1)
return a;
ll res = bp(a, n / 2);
if (n & 1)
return res * res * a;
else
return res * res;
}
int main() {
ll a;
cin >> a;
cout << 3 * bp(a, 2ll);
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 772,894 | 772,895 | u585969999 | cpp |
p02969 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef unsigned char uchar;
#define umap unordered_map
const static ull INVALID_DIGIT = ~(ull)0;
int main() {... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef unsigned char uchar;
#define umap unordered_map
const static ull INVALID_DIGIT = ~(ull)0;
int main() {... | [
"expression.operation.binary.remove"
] | 772,911 | 772,912 | u097665156 | cpp |
p02969 | #include <stdio.h>
int main(void) {
int r = 0;
scanf("%d", &r);
int ans = 3 * (r * r);
printf("%lf", ans);
return 0;
} | #include <stdio.h>
int main(void) {
int r = 0;
scanf("%d", &r);
int ans = 3 * (r * r);
printf("%d", ans);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 772,931 | 772,932 | u245335950 | cpp |
p02969 | #include <math.h>
#include <stdio.h>
int cul(int r);
int main(void) {
int r, m;
scanf("%d", &r);
m = cul(r);
printf("%d\n", m);
return 0;
}
int cul(int r) {
int m;
m = int(3 * pow(double(r), 3.0));
return m;
} | #include <math.h>
#include <stdio.h>
int cul(int r);
int main(void) {
int r, m;
scanf("%d", &r);
m = cul(r);
printf("%d\n", m);
return 0;
}
int cul(int r) {
int m;
m = int(3 * pow(double(r), 2.0));
return m;
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 772,937 | 772,938 | u456658814 | cpp |
p02969 | #include <stdio.h>
int main() {
int a;
scanf("%d", &a);
printf("%d", 3 * (a ^ 2));
}
| #include <stdio.h>
int main() {
int a;
scanf("%d", &a);
printf("%d", 3 * a * a);
}
| [
"call.arguments.change"
] | 772,945 | 772,946 | u222643545 | cpp |
p02969 | #include <stdio.h>
int main() {
int a;
scanf("%d", &a);
printf("%d", 3 * a ^ 2);
} | #include <stdio.h>
int main() {
int a;
scanf("%d", &a);
printf("%d", 3 * a * a);
}
| [] | 772,947 | 772,946 | u222643545 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << 3 * a * a * a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << 3 * a * a << endl;
} | [
"expression.operation.binary.remove"
] | 772,950 | 772,951 | u936271647 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int i;
cout << 3 * i * i << endl;
} | #include <iostream>
using namespace std;
int main() {
int i;
cin >> i;
cout << 3 * i * i << endl;
} | [] | 772,952 | 772,953 | u621509943 | cpp |
p02969 | #include <bits/stdc++.h>
int main() {
int a;
scanf("%d", &a);
printf("%d\n", 3 * a * a * a);
return 0;
} | #include <bits/stdc++.h>
int main() {
int a;
scanf("%d", &a);
printf("%d\n", 3 * a * a);
return 0;
} | [
"expression.operation.binary.remove"
] | 772,954 | 772,955 | u783764370 | cpp |
p02969 | #include <bits/stdc++.h>
#define int int64_t
using namespace std;
typedef pair<int, int> P;
const int INF = 100000000;
// グローバル変数
// 関数：
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r, s;
cin >> r;
s = 3 * r * r * r;
cout << s << endl;
}
| #include <bits/stdc++.h>
#define int int64_t
using namespace std;
typedef pair<int, int> P;
const int INF = 100000000;
// グローバル変数
// 関数：
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r, s;
cin >> r;
s = 3 * r * r;
cout << s << endl;
}
| [
"expression.operation.binary.remove"
] | 772,958 | 772,959 | u881160582 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int r, ans;
cin >> r;
ans = 3 * r * r;
cout << "ans\n";
} | #include <iostream>
using namespace std;
int main() {
int r, ans;
cin >> r;
ans = 3 * r * r;
cout << ans << endl;
} | [] | 772,964 | 772,965 | u218369588 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int r, ans;
cin >> r;
ans = 3 * r * r;
cout << "and\n";
} | #include <iostream>
using namespace std;
int main() {
int r, ans;
cin >> r;
ans = 3 * r * r;
cout << ans << endl;
} | [] | 772,966 | 772,965 | u218369588 | cpp |
p02969 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
// for(int i = 0; i < n; i++)
int main() {
int r;
cin >> r;
cout << 6 * r * r << endl;
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
// for(int i = 0; i < n; i++)
int main() {
int r;
cin >> r;
cout << 3 * r * r << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 772,969 | 772,970 | u534417782 | cpp |
p02969 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int r;
cout << 3 * pow(r, 3);
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * pow(r, 2);
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 772,975 | 772,976 | u961523950 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int r;
cout << (3 * (r * r)) << endl;
} | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << (3 * (r * r)) << endl;
}
| [] | 772,983 | 772,984 | u646148705 | cpp |
p02969 | #include <bits/stdc++.h>
#define N
using namespace std;
bool cur1;
int n;
inline void Rd(int &res) {
char c;
res = 0;
while (c = getchar(), c < 48)
;
do
res = (res << 3) + (res << 1) + (c ^ 48);
while (c = getchar(), c > 47);
return;
}
bool cur2;
int main() {
// printf("%lf MB\n",(&cur2-&cur1)/102... | #include <bits/stdc++.h>
#define N
using namespace std;
bool cur1;
int n;
inline void Rd(int &res) {
char c;
res = 0;
while (c = getchar(), c < 48)
;
do
res = (res << 3) + (res << 1) + (c ^ 48);
while (c = getchar(), c > 47);
return;
}
bool cur2;
int main() {
// printf("%lf MB\n",(&cur2-&cur1)/102... | [
"expression.operation.binary.remove"
] | 772,994 | 772,995 | u264225633 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
int answer = 3 * r * r * r;
cout << answer << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
int answer = 3 * r * r;
cout << answer << endl;
}
| [
"expression.operation.binary.remove"
] | 772,996 | 772,997 | u273355214 | cpp |
p02969 | #include <bits/stdc++.h>
#include <math.h>
#include <sstream>
#include <string>
using namespace std;
#define endl "\n"
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <math.h>
#include <sstream>
#include <string>
using namespace std;
#define endl "\n"
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"expression.operation.binary.remove"
] | 772,998 | 772,999 | u806556718 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define pb push_back
int main() {
ll r;
cout << 3 * r * r;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define pb push_back
int main() {
ll r;
cin >> r;
cout << 3 * r * r;
return 0;
} | [] | 773,000 | 773,001 | u927396071 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = int(1e8) + 7;
void init() {}
void solve() {
int a;
scanf("%d", &a);
printf("%d\n", a * a * a * 3);
}
const bool mtc = false;
int main() {
int t;
if (mtc) {
scanf("%d", &t);
while (t--)
solve();
} else
s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = int(1e8) + 7;
void init() {}
void solve() {
int a;
scanf("%d", &a);
printf("%d\n", a * a * 3);
}
const bool mtc = false;
int main() {
int t;
if (mtc) {
scanf("%d", &t);
while (t--)
solve();
} else
solve... | [
"expression.operation.binary.remove"
] | 773,017 | 773,018 | u800645121 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << 2 * r * r;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * r * r;
} | [
"literal.number.change",
"io.output.change"
] | 773,019 | 773,020 | u183131551 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vin... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vin... | [
"literal.number.change",
"io.output.change"
] | 773,021 | 773,022 | u547748135 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int r = 0;
cin >> r;
int s = 0;
s = 3 * r * r * r;
cout << s << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r = 0;
cin >> r;
int s = 0;
s = 3 * r * r;
cout << s << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 773,042 | 773,043 | u830087664 | cpp |
p02969 | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * (r ^ 2) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << 3 * r * r << endl;
return 0;
} | [] | 773,048 | 773,049 | u323966851 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(void) {
int a;
cin >> a;
cout << pow(a, 3) * 3 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(void) {
int a;
cin >> a;
cout << pow(a, 2) * 3 << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 773,056 | 773,057 | u030848580 | cpp |
p02969 | //*INDENT-OFF*
#include <bits/stdc++.h>
using namespace std;
template <typename V> bool tomin(V &x, V y) {
if (y < x) {
x = y;
return true;
}
return false;
}
template <typename V> bool tomax(V &x, V y) {
if (x < y) {
x = y;
return true;
}
return false;
}
typedef long long ll;
typedef unsigne... | //*INDENT-OFF*
#include <bits/stdc++.h>
using namespace std;
template <typename V> bool tomin(V &x, V y) {
if (y < x) {
x = y;
return true;
}
return false;
}
template <typename V> bool tomax(V &x, V y) {
if (x < y) {
x = y;
return true;
}
return false;
}
typedef long long ll;
typedef unsigne... | [
"literal.number.change",
"io.output.change"
] | 773,061 | 773,062 | u613623257 | cpp |
p02969 | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define rep(i, n) for (auto i = 0; i < (n); i++)
#define rep1(i, n) for (auto i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
struct init {
init() {
cin.tie(0);
ios::sync_with_stdio(0);
... | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define rep(i, n) for (auto i = 0; i < (n); i++)
#define rep1(i, n) for (auto i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
struct init {
init() {
cin.tie(0);
ios::sync_with_stdio(0);
... | [] | 773,063 | 773,064 | u779159595 | cpp |
p02969 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int r;
int s;
cin >> r;
cout << 3 * r + r;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int r;
int s;
cin >> r;
cout << 3 * r * r;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 773,067 | 773,068 | u941705222 | cpp |
p02969 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
cout << 3 * a * a * a << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
cout << 3 * a * a << endl;
}
| [
"expression.operation.binary.remove"
] | 773,069 | 773,070 | u330689597 | cpp |
p02969 | #pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define int long long
#define ends ' '
#define endl '\n'
#define pb emplace_back
#define x first
#define y second
#define pii pair<int, int... | #pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define int long long
#define ends ' '
#define endl '\n'
#define pb emplace_back
#define x first
#define y second
#define pii pair<int, int... | [
"literal.number.change",
"io.output.change"
] | 773,071 | 773,072 | u845159850 | cpp |
p02969 | #include <bits/stdc++.h>
#define ___ \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define endl '\n'
#define pii pair<in... | #include <bits/stdc++.h>
#define ___ \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define endl '\n'
#define pii pair<in... | [] | 773,077 | 773,078 | u699580536 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, d;
cin >> n >> d;
d = d * 2 + 1;
cout << (n + d + 1) / d;
// your code goes here
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, d;
cin >> n >> d;
d = d * 2 + 1;
cout << (n + d - 1) / d;
// your code goes here
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 773,087 | 773,088 | u166378830 | cpp |
p02970 | #include <bits/stdc++.h>
#define lld long long int
#define vec vector<lld>
#define pll pair<lld, lld>
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
#define mod 1000000007
#define answer cout << endl << "answer : ";
#define maxn 100005
#define messi ... | #include <bits/stdc++.h>
#define lld long long int
#define vec vector<lld>
#define pll pair<lld, lld>
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
#define mod 1000000007
#define answer cout << endl << "answer : ";
#define maxn 100005
#define messi ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 773,109 | 773,110 | u606883845 | cpp |
p02970 | #include <bits/stdc++.h>
#define lld long long int
#define vec vector<lld>
#define pll pair<lld, lld>
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
#define mod 1000000007
#define answer cout << endl << "answer : ";
#define maxn 100005
#define messi ... | #include <bits/stdc++.h>
#define lld long long int
#define vec vector<lld>
#define pll pair<lld, lld>
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
#define mod 1000000007
#define answer cout << endl << "answer : ";
#define maxn 100005
#define messi ... | [
"assignment.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 773,111 | 773,110 | u606883845 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, a;
cin >> n >> d;
a = d * 2 + 1;
cout << ceil(n / a) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double n, d, a;
cin >> n >> d;
a = d * 2 + 1;
cout << ceil(n / a) << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 773,114 | 773,115 | u264265458 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, d;
cin >> n >> d;
int range = 2 * d + 1;
cout << n + (range - 1) / range << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, d;
cin >> n >> d;
int range = 2 * d + 1;
cout << (n + (range - 1)) / range << endl;
return 0;
}
| [] | 773,152 | 773,153 | u442855610 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, d;
cin >> n >> d;
int uni_range = d * 2 + 1;
cout << n + (uni_range - 1) / uni_range << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, d;
cin >> n >> d; // 6 2
int uni_range = d * 2 + 1; // 2*2+1=5
cout << (n + (uni_range - 1)) / uni_range << endl; //(6+4)/5=2
return 0;
}
| [] | 773,154 | 773,155 | u442855610 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, d;
cin >> n >> d;
cout << ceil(n / (1 + d * 2)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, d;
cin >> n >> d;
cout << ceil((double)n / (1 + d * 2)) << endl;
} | [
"type_conversion.add"
] | 773,158 | 773,159 | u582684800 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define all(t) t.begin(), t.end()
#define inrange(i, a, b) (((i) >= min((a), (b))) && ((i) <= max((a), (b))))
typedef vector<ll> vi;
#define fi first
#define se second
#define show(x) cou... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define all(t) t.begin(), t.end()
#define inrange(i, a, b) (((i) >= min((a), (b))) && ((i) <= max((a), (b))))
typedef vector<ll> vi;
#define fi first
#define se second
#define show(x) cou... | [
"expression.operation.binary.remove"
] | 773,163 | 773,164 | u177497208 | cpp |
p02970 | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define Rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, d;
cin >> n >> d;
cout << ceil((dou... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define Rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, d;
cin >> n >> d;
cout << ceil((dou... | [
"expression.operation.binary.add"
] | 773,182 | 773,183 | u154465766 | cpp |
p02970 | #include <bits/stdc++.h>
#define lp(i, a, b) for (int i = a; i < b; i++)
#define ll long long
#define ff first
#define ss second
using namespace std;
void goldenApple() {
int n, d;
cin >> n >> d;
cout << ceil(n / (2 * d + 1));
}
int main() { goldenApple(); } | #include <bits/stdc++.h>
#define lp(i, a, b) for (int i = a; i < b; i++)
#define ll long long
#define ff first
#define ss second
using namespace std;
void goldenApple() {
double n, d;
cin >> n >> d;
cout << ceil(n / (2 * d + 1));
}
int main() { goldenApple(); } | [
"variable_declaration.type.primitive.change"
] | 773,186 | 773,187 | u018679195 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, d;
cin >> n >> d;
int now = 1;
int ans = 0;
while (now < n) {
now += 2 * d + 1;
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, d;
cin >> n >> d;
int now = 0;
int ans = 0;
while (now < n) {
now += 2 * d + 1;
ans++;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 773,211 | 773,212 | u008040394 | cpp |
p02970 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | [
"expression.operation.binary.remove"
] | 773,216 | 773,217 | u179778090 | cpp |
p02970 | #pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include... | #pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include... | [
"expression.operation.binary.remove"
] | 773,230 | 773,231 | u811004127 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
cout << (N + (D * 2 + 1) - 1) / (D * 2 - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
cout << (N + (D * 2 + 1) - 1) / (D * 2 + 1) << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 773,286 | 773,287 | u237390401 | cpp |
p02970 | #include <iostream>
using namespace std;
int main(void) {
int n, d;
cin >> n >> d;
int range = 2 * d - 1;
cout << (n + range - 1) / range;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int n, d;
cin >> n >> d;
int range = 2 * d + 1;
cout << (n + range - 1) / range;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 773,325 | 773,326 | u349165865 | cpp |
p02970 | #include <iostream>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
int main(void) {
int n, d, count = 0;
cin >> n >> d;
for (int i = n; i > 0; i -= i * 2 + 1) {
count++;
}
cout << count << endl;
}
| #include <iostream>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
int main(void) {
int n, d, count = 0;
cin >> n >> d;
for (int i = n; i > 0; i -= d * 2 + 1) {
count++;
}
cout << count << endl;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 773,327 | 773,328 | u829243466 | cpp |
p02970 | #include <iostream>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
int main(void) {
int n, d, count = 0;
cin >> n, d;
for (int i = n; i > 0; i -= i * 2 + 1) {
count++;
}
cout << count << endl;
}
| #include <iostream>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
int main(void) {
int n, d, count = 0;
cin >> n >> d;
for (int i = n; i > 0; i -= d * 2 + 1) {
count++;
}
cout << count << endl;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 773,329 | 773,328 | u829243466 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << (n + (2 * d - 1) - 1) / (2 * d - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << (n + (2 * d + 1) - 1) / (2 * d + 1) << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 773,342 | 773,343 | u371149954 | cpp |
p02970 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
using ll = long long;
using namespace std;
int main() {
double n, d;
cin >> n >> d;
double ans = ceil(n / (2 * d));
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
using ll = long long;
using namespace std;
int main() {
double n, d;
cin >> n >> d;
double ans = ceil(n / (2 * d + 1));
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 773,347 | 773,348 | u394244719 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define enld '\n'
#define rep(i, n) for (int i = 0; i < (n); i++)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define enld '\n'
#define rep(i, n) for (int i = 0; i < (n); i++)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
co... | [
"expression.operation.binary.add"
] | 773,349 | 773,350 | u550014122 | cpp |
p02970 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, d, sum = 1, ans = 0;
cin >> n >> d;
while (sum < n) {
sum += 2 * d + 1;
ans++;
}
cout << ans << e... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, d, sum = 0, ans = 0;
cin >> n >> d;
while (sum < n) {
sum += 2 * d + 1;
ans++;
}
cout << ans << e... | [
"literal.number.change",
"variable_declaration.value.change"
] | 773,351 | 773,352 | u155881803 | cpp |
p02964 | #ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec... | #ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec... | [] | 773,376 | 773,377 | u592686932 | cpp |
p02964 | #include <bits/stdc++.h>
using namespace std;
const int maxa = 200005;
const long long inf = 300000000000000000;
const int too_many_bottles_of_this_wine_we_cant_pronounce = 35;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k;
cin >> n >> k;
k *= n;
vector<long long> a(n), ... | #include <bits/stdc++.h>
using namespace std;
const int maxa = 200005;
const long long inf = 1000000000000000000;
const int too_many_bottles_of_this_wine_we_cant_pronounce = 65;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k;
cin >> n >> k;
k *= n;
vector<long long> a(n),... | [
"literal.number.change",
"variable_declaration.value.change"
] | 773,388 | 773,389 | u855677173 | cpp |
p02964 | #include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for (int i = (l); i < (r); ++i)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define incII(i, l, r) for (int i = (l); i <= (r); ++i)
#define decII(i, l, r) for (int i = (r); i >= (l); --i)
#define inc(i, n) incID... | #include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for (int i = (l); i < (r); ++i)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define incII(i, l, r) for (int i = (l); i <= (r); ++i)
#define decII(i, l, r) for (int i = (r); i >= (l); --i)
#define inc(i, n) incID... | [
"expression.operation.binary.add"
] | 773,420 | 773,421 | u568652083 | cpp |
p02964 | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 773,438 | 773,439 | u030685402 | cpp |
p02964 | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, T... | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, T... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 773,442 | 773,443 | u424655672 | cpp |
p02964 | #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define per(i, s, e) for (int i = (int)(s)-1; i >= (int)(e); --i)
using ll = long long;
template <class T, class U> usi... | #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define per(i, s, e) for (int i = (int)(s)-1; i >= (int)(e); --i)
using ll = long long;
template <class T, class U> usi... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 773,454 | 773,455 | u691380397 | cpp |
p02964 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 773,466 | 773,467 | u071692456 | cpp |
p02964 | #include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
//#define ll __int128
#define ll long long
#define LEFT(a) ((a) << 1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a, b) ((a + b) >> 1)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#d... | #include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
//#define ll __int128
#define ll long long
#define LEFT(a) ((a) << 1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a, b) ((a + b) >> 1)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#d... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 773,486 | 773,487 | u704324882 | cpp |
p02964 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define x first
#define y second
typedef pair<int, int> pii;
typedef long long ll;
const int MOD = 1000000007;
const int N = 2 * 100000 + 1;
const ll oo = 2e18;
const int LOGN = 62;
int n, a[N];
ll k, dp[N][LOGN];
vector<int> g[N], ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define x first
#define y second
typedef pair<int, int> pii;
typedef long long ll;
const int MOD = 1000000007;
const int N = 2 * 100000 + 1;
const ll oo = 2e18;
const int LOGN = 62;
int n, a[N];
ll k, dp[N][LOGN];
vector<int> g[N];
... | [] | 773,488 | 773,489 | u417705043 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define rep0(i, n) for (int i = 1; i <= (int)(n); ++i)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define rep0(i, n) for (int i = 1; i <= (int)(n); ++i)... | [
"variable_declaration.type.primitive.change",
"call.add",
"call.arguments.change"
] | 773,514 | 773,515 | u338193317 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int sum = 0;
int count = 0;
for (int i = 0; sum <= N; i++) {
sum += 2 * D + 1;
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int sum = 0;
int count = 0;
for (int i = 0; sum < N; i++) {
sum += 2 * D + 1;
count++;
}
cout << count << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 773,520 | 773,521 | u262451272 | cpp |
p02970 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef lon... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef lon... | [] | 773,541 | 773,542 | u000212387 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> input(int N) {
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
return vec;
}
int main() {
int n, d;
cin >> n >> d;
cout << (d + 2 * n) / (2 * n + 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> input(int N) {
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
return vec;
}
int main() {
int n, d;
cin >> n >> d;
cout << (n + 2 * d) / (2 * d + 1) << endl;
} | [
"identifier.change",
"io.output.change"
] | 773,544 | 773,545 | u492660436 | cpp |
p02970 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using BigInt = long long;
#define ALL(a) (a).begin(), (a).end()
int cld(int a, int b) { return (a + (b - 1)) / b; }
int main() {
int N, D;
cin >> N >> D;
cout << cld(N--, 2 * D) << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using BigInt = long long;
#define ALL(a) (a).begin(), (a).end()
int cld(int a, int b) { return (a + (b - 1)) / b; }
int main() {
int N, D;
cin >> N >> D;
cout << cld(N, 2 * D + 1) << endl;
} | [
"call.arguments.change"
] | 773,550 | 773,551 | u879294842 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int k = 2 * D + 1;
int i = 0;
while (N < i * k)
i++;
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
int k = 2 * D + 1;
int i = 0;
while (i * k < N)
i++;
cout << i << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.loop.condition.change"
] | 773,554 | 773,555 | u101018317 | cpp |
p02970 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int n, d;
cin >> n >> d;
cout << ceil(n / (2 * d + 1)) << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
double n, d;
cin >> n >> d;
cout << ceil(n / (2 * d + 1)) << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 773,566 | 773,567 | u485925545 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int d;
cin >> d;
cout << (n / ((2 * d) + 1)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
float n;
cin >> n;
float d;
cin >> d;
cout << ceil(n / ((2 * d) + 1)) << endl;
}
| [
"variable_declaration.type.primitive.change",
"call.add"
] | 773,574 | 773,575 | u879949614 | cpp |
p02970 | #include <bits/stdc++.h>
#define ALL(l) (l).begin(), (l).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
// const ll mod = 1000000007;
// const ll maxn = 1000000000;
//-----------------------------------------------------------------------------------------------... | #include <bits/stdc++.h>
#define ALL(l) (l).begin(), (l).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
// const ll mod = 1000000007;
// const ll maxn = 1000000000;
//-----------------------------------------------------------------------------------------------... | [
"expression.operation.binary.remove"
] | 773,600 | 773,601 | u195822478 | cpp |
p02970 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define all(x) (x).begin(), (x).end()
#define P pair<int, int>
typedef long long ll;
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int ans = 0;
while (n >= 0) {
n -= d * 2 + 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define all(x) (x).begin(), (x).end()
#define P pair<int, int>
typedef long long ll;
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int ans = 0;
while (n > 0) {
n -= d * 2 + 1;... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 773,606 | 773,607 | u437779154 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n, d;
cout << (n + 2 * d) / (2 * d + 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << (n + 2 * d) / (2 * d + 1) << endl;
}
| [] | 773,624 | 773,625 | u449123607 | cpp |
p02970 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define strall(v) (v).cbegin(), (v).cend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, cl... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define strall(v) (v).cbegin(), (v).cend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, cl... | [
"assignment.change"
] | 773,626 | 773,627 | u106635407 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, total = 0;
cin >> n >> d;
d *= 2;
total = (n + 2 * d) / (2 * d + 1);
cout << total << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, total = 0;
cin >> n >> d;
total = (n + 2 * d) / (2 * d + 1);
cout << total << endl;
}
| [] | 773,628 | 773,629 | u106635407 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int h = 2 * d + 1;
int am = 0, sh = n / d;
if (n % d > 0) {
am = 1;
}
cout << sh + am << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int h = 2 * d + 1;
int am = 0, sh = n / h;
if (n % h > 0) {
am = 1;
}
cout << sh + am << endl;
}
| [
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 773,632 | 773,633 | u323864528 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 773,657 | 773,658 | u917049698 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, d;
cin >> n >> d;
int c = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
if (c <= i - d) {
c = i + d + 1;
ans++;
}
}
if (c < n - 1)
ans++;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, d;
cin >> n >> d;
int c = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
if (c <= i - d) {
c = i + d + 1;
ans++;
}
}
if (c < n)
ans++;
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 773,662 | 773,663 | u316226687 | cpp |
p02970 | #include "bits/stdc++.h"
using namespace std;
#define ll long long;
// Start Time: 11:41
int main() {
std::ios::sync_with_stdio(false);
int N, D;
cin >> N >> D;
int sum = 0;
int count = 0;
int temp = 0;
for (int x = D + 1; x <= N; x += 2 * D + 1) {
count++;
}
cout << count;
} | #include "bits/stdc++.h"
using namespace std;
#define ll long long;
// Start Time: 11:41
int main() {
std::ios::sync_with_stdio(false);
int N, D;
cin >> N >> D;
int sum = 0;
int count = 0;
int temp = 0;
for (int x = 1; x <= N; x += 2 * D + 1) {
count++;
}
cout << count;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 773,664 | 773,665 | u726771425 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long D) {
int count = 0;
while (N >= 0) {
N -= 2 * D + 1;
count++;
};
cout << count << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove thi... | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long D) {
int count = 0;
while (N > 0) {
N -= 2 * D + 1;
count++;
};
cout << count << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 773,668 | 773,669 | u777890016 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, d;
cin >> n >> d;
cout << ceil(n / 2 * d + 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, d;
cin >> n >> d;
cout << ceil(n / ((2 * d) + 1)) << endl;
} | [
"call.arguments.change"
] | 773,676 | 773,677 | u578871832 | cpp |
p02970 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
cout << ceil(n / 2 * d + 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double n, d;
cin >> n >> d;
cout << ceil(n / ((2 * d) + 1)) << endl;
} | [
"variable_declaration.type.primitive.change",
"call.arguments.change"
] | 773,678 | 773,677 | u578871832 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.