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 |
|---|---|---|---|---|---|---|---|
p03224 | // luogu-judger-enable-o2
#include <bits/stdc++.h>
#define rep(i, j, k) for (int i = j; i <= k; ++i)
#define dep(i, j, k) for (int i = j; i >= k; --i)
#define SIZE(x) (int)(x.size())
#define to(x) (x > n ? x - n : x)
typedef long long ll;
using namespace std;
const int maxn = 2e5 + 5;
int n, a[maxn], b[maxn], L, R,... | // luogu-judger-enable-o2
#include <bits/stdc++.h>
#define rep(i, j, k) for (int i = j; i <= k; ++i)
#define dep(i, j, k) for (int i = j; i >= k; --i)
#define SIZE(x) (int)(x.size())
#define to(x) (x > n ? x - n : x)
typedef long long ll;
using namespace std;
const int maxn = 2e5 + 5;
int n, a[maxn], b[maxn], L, R,... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,019,605 | 1,019,604 | u543464869 | cpp |
p03227 | #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... | [] | 1,019,616 | 1,019,617 | u341447450 | cpp |
p03227 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
if (s.size() == 3)
sort(s.rbegin(), s.rend());
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
if (s.size() == 3)
reverse(s.begin(), s.end());
cout << s << endl;
return 0;
} | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 1,019,618 | 1,019,619 | u321168841 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
using f64 = double;
constexpr i64 INF = INT_FAST64_MAX / 2;
constexpr f64 EPS = DBL_EPSILON;
void solve() {
string s;
cin >> s;
if (s.size())
reverse(begin(s), end(s));
cout << s << endl;
}
int main() {
cin.tie(nullptr);
ios_bas... | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
using f64 = double;
constexpr i64 INF = INT_FAST64_MAX / 2;
constexpr f64 EPS = DBL_EPSILON;
void solve() {
string s;
cin >> s;
if (s.size() == 3)
reverse(begin(s), end(s));
cout << s << endl;
}
int main() {
cin.tie(nullptr);
io... | [
"control_flow.branch.if.condition.change"
] | 1,019,622 | 1,019,623 | u820225607 | cpp |
p03227 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
int m... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
int m... | [
"expression.operation.binary.add"
] | 1,019,624 | 1,019,625 | u907470767 | cpp |
p03227 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() == 2) {
cout << s << endl;
} else {
for (int i = 0; i < 3; i++) {
cout << s... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() == 2) {
cout << s << endl;
} else {
for (int i = 0; i < 3; i++) {
cout << s... | [] | 1,019,628 | 1,019,629 | u809967037 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.size() == 2)
cout << S << endl;
else
cout << S.at(2) + S.at(1) + S.at(0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.size() == 2)
cout << S << endl;
else
cout << S.at(2) << S.at(1) << S.at(0) << endl;
} | [
"io.output.change"
] | 1,019,630 | 1,019,631 | u820224016 | cpp |
p03227 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | [] | 1,019,634 | 1,019,635 | u590927341 | cpp |
p03227 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a... | [
"io.output.change"
] | 1,019,636 | 1,019,637 | u820341516 | cpp |
p03224 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | [] | 1,019,737 | 1,019,738 | u762921614 | cpp |
p03224 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <st... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <st... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 1,019,749 | 1,019,750 | u629650917 | cpp |
p03224 | /***********************************************************
*This code By @1353055672(Ligen) *
*[Warning]You're not excepted to understand this code! *
*RP++ *
***********************************************************/
//#pragma GCC ... | /***********************************************************
*This code By @1353055672(Ligen) *
*[Warning]You're not excepted to understand this code! *
*RP++ *
***********************************************************/
//#pragma GCC ... | [
"literal.string.change",
"call.arguments.change",
"function.return_value.change",
"io.output.change"
] | 1,019,751 | 1,019,752 | u379604713 | cpp |
p03224 | #include <bits/stdc++.h>
using namespace std;
/*
const long long MaxSize = 1e5 + 17;
long long n;
long long solve(vector<long long>& v)
{
vector<long long> answer(n, 0);
answer[n / 2] = v[0];
long long mmx = n - 1, mmn = 2;
for(long long i = n / 2 + 1, j = 1; i < n; ++i, ++j)
{
if(j & 1)... | #include <bits/stdc++.h>
using namespace std;
/*
const long long MaxSize = 1e5 + 17;
long long n;
long long solve(vector<long long>& v)
{
vector<long long> answer(n, 0);
answer[n / 2] = v[0];
long long mmx = n - 1, mmn = 2;
for(long long i = n / 2 + 1, j = 1; i < n; ++i, ++j)
{
if(j & 1)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,019,757 | 1,019,758 | u768111431 | cpp |
p03224 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
const int maxN = 1e5 + 10;
int a[maxN];
int b[maxN];
int c[maxN];
vector<int> w[maxN];
int n;
int main() {
scanf("%d", &n);
for (int i = 2; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
const int maxN = 1e5 + 10;
int a[maxN];
int b[10 * maxN];
int c[10 * maxN];
vector<int> w[maxN];
int n;
int main() {
scanf("%d", &n);
for (i... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 1,019,776 | 1,019,777 | u807919574 | cpp |
p03224 | #include <bits/stdc++.h>
#define INF 214000000
#define MOD 998244353
#define MaxN 1005
using namespace std;
/*#ifdef INFOARENA
FILE* IN=fopen("bacterii2.in","r"), *OUT=fopen("bacterii2.out","w");
#else
FILE* IN=fopen("test.in","r"), *OUT=fopen("test.out","w");
#endif*/
int N, M, Mat[MaxN][MaxN];
int main() {
M =... | #include <bits/stdc++.h>
#define INF 214000000
#define MOD 998244353
#define MaxN 1005
using namespace std;
/*#ifdef INFOARENA
FILE* IN=fopen("bacterii2.in","r"), *OUT=fopen("bacterii2.out","w");
#else
FILE* IN=fopen("test.in","r"), *OUT=fopen("test.out","w");
#endif*/
int N, M, Mat[MaxN][MaxN];
int main() {
M =... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,019,864 | 1,019,865 | u083314595 | cpp |
p03227 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e9)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long lon... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e9)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long lon... | [] | 1,019,875 | 1,019,876 | u222293734 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
if (N.size() == 2) {
cout << N << endl;
} else {
reverse(N.begin(), N.end());
cout << N << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
if (N.size() == 2) {
cout << N << endl;
} else {
reverse(N.begin(), N.end());
cout << N << endl;
}
}
| [] | 1,019,877 | 1,019,878 | u091026689 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#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 begin()
#define en end()
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#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 begin()
#define en end()
#... | [] | 1,019,881 | 1,019,882 | u322177979 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.length() == 2)
reverse(s.begin(), s.end());
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.length() == 3)
reverse(s.begin(), s.end());
cout << s << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,019,883 | 1,019,884 | u218759384 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999
#define rep(i, m, n) for (int i = m; i < n; i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << end... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999
#define rep(i, m, n) for (int i = m; i < n; i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << end... | [] | 1,019,885 | 1,019,886 | u618604643 | cpp |
p03227 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
if (s.size() == 2) {
cout << s << endl;
} else {
cout << s.at(2) << s.at(1) << s.at(0) << endl;
}
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() == 2) {
cout << s << endl;
} else {
cout << s.at(2) << s.at(1) << s.at(0) << endl;
}
} | [] | 1,019,891 | 1,019,892 | u392569193 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() == 2) {
cout << "s" << endl;
} else if (s.size() == 3) {
cout << s[2] << s[1] << s[0] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() == 2) {
cout << s << endl;
} else if (s.size() == 3) {
cout << s[2] << s[1] << s[0] << endl;
}
}
| [] | 1,019,899 | 1,019,900 | u974931918 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
if (s.length() == 2) {
cout << s << endl;
} else {
for (int i = 3; i > 0; --i) {
cout << s[i];
}
cout << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
if (s.length() == 2) {
cout << s << endl;
} else {
for (int i = 2; i >= 0; --i) {
cout << s[i];
}
cout << endl;
}
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,019,903 | 1,019,904 | u464540027 | cpp |
p03227 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
if (S.size() == 2)
cout << S << endl;
else
cout << S[2] << S[1] << S[0] << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
if (S.size() == 2)
cout << S << endl;
else
cout << S[2] << S[1] << S[0] << endl;
} | [] | 1,019,916 | 1,019,917 | u454087021 | cpp |
p03227 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | [] | 1,019,918 | 1,019,919 | u811004127 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() == 2)
cout << s << endl;
else
reverse(s.begin(), s.end());
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() == 2)
cout << s << endl;
else
reverse(s.begin(), s.end()), cout << s << endl;
return 0;
}
| [] | 1,019,922 | 1,019,923 | u345731720 | cpp |
p03227 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() == 2)
cout << s << endl;
else
cout << s[2] + s[1] + s[0] << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() == 2)
cout << s << endl;
else
cout << s[2] << s[1] << s[0] << endl;
return 0;
}
| [
"io.output.change"
] | 1,019,924 | 1,019,925 | u905715926 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
string s;
cin >> s;
string t = s;
if (s.size() == 3) {
for (int i = 0; i < 2; i++) {
t[i] = s[2 - i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
string s;
cin >> s;
string t = s;
if (s.size() == 3) {
for (int i = 0; i <= 2; i++) {
t[i] = s[2 - i];
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,019,956 | 1,019,957 | u980655160 | cpp |
p03227 | #include <bits/stdc++.h>
#define INF 0x7fffffff
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 1e5 + 5;
char s[5];
int len;
int main() {
cin >> s + 1;
len = strlen(s + 1);
if (len & 1 == 0)
pri... | #include <bits/stdc++.h>
#define INF 0x7fffffff
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 1e5 + 5;
char s[5];
int len;
int main() {
cin >> s + 1;
len = strlen(s + 1);
if (!(len & 1))
print... | [
"control_flow.branch.if.condition.change"
] | 1,019,975 | 1,019,976 | u554106628 | cpp |
p03227 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s.length() == 2)
cout << s;
if (s.length() == 3) {
for (int i = 2; i > 0; i--) {
cout << s[i];
}
}
} | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s.length() == 2)
cout << s;
if (s.length() == 3) {
for (int i = 2; i >= 0; i--) {
cout << s[i];
}
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,019,983 | 1,019,984 | u533620702 | cpp |
p03227 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string S;
cin >> S;
if (S.size() == 2)
cout << S << endl;
else {
for (int i = 0; i >= 0; i--)
cout << S[i];
cout << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string S;
cin >> S;
if (S.size() == 2)
cout << S << endl;
else {
for (int i = 2; i >= 0; i--)
cout << S[i];
cout << endl;
}
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 1,019,985 | 1,019,986 | u330913290 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string a;
cin >> a;
if (a.size() == 2) {
cout << a << endl;
} else {
for (int i = 0; i < 3; i++) {
cout << a[a.size() - i - 1] << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string a;
cin >> a;
if (a.size() == 2) {
cout << a << endl;
} else {
for (int i = 0; i < 3; i++) {
cout << a[a.size() - i - 1];
}
cout << endl;
}
} | [] | 1,019,987 | 1,019,988 | u764234894 | cpp |
p03227 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <v... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <v... | [
"control_flow.branch.if.condition.change"
] | 1,019,991 | 1,019,992 | u273352618 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
const long long INF = 1LL << 60;
int main() {
ll A, B, K;
cin >> A >> B >> K;
rep(i, K) {
if (i % 2 == 1) {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
const long long INF = 1LL << 60;
int main() {
ll A, B, K;
cin >> A >> B >> K;
rep(i, K) {
if (i % 2 == 1) {... | [] | 1,020,000 | 1,020,001 | u983563612 | cpp |
p03228 | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#define debug(x) c... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#define debug(x) c... | [
"expression.operation.binary.add"
] | 1,020,002 | 1,020,003 | u378419207 | cpp |
p03227 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> pi;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s;
if (s.size() == 3)
s[0] = s[2];
cout << s;
} | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> pi;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s;
if (s.size() == 3)
swap(s[0], s[2]);
cout << s;
} | [
"call.add",
"call.arguments.change"
] | 1,020,017 | 1,020,018 | u921940646 | cpp |
p03227 | #include <iostream>
#include <string.h>
using namespace std;
string s;
int main() {
if (s.size() == 2) {
cout << s;
} else
cout << s[2] << s[1] << s[0];
return 0;
} | #include <iostream>
#include <string.h>
using namespace std;
string s;
int main() {
cin >> s;
if (s.size() == 2) {
cout << s;
} else
cout << s[2] << s[1] << s[0];
return 0;
} | [] | 1,020,026 | 1,020,027 | u366973955 | cpp |
p03227 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vec... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vec... | [] | 1,020,032 | 1,020,033 | u196798307 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
string str;
int main() {
cin >> str;
if (str.size() == 2)
cout << str << endl;
else {
if (str.size() == 3)
for (int i = str.size() - 1; i >= 0; --i)
cout << str[i] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
string str;
int main() {
cin >> str;
if (str.size() == 2)
cout << str << endl;
else {
if (str.size() == 3)
for (int i = str.size() - 1; i >= 0; --i)
cout << str[i];
}
} | [
"expression.operation.binary.remove"
] | 1,020,046 | 1,020,047 | u857596000 | cpp |
p03227 | #include <algorithm>
#include <array>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
// AtCoderC++.cpp
using namespace std;
void Show(vector<vector<int>> Ns) {
for (int i = 0; i < Ns.size(); i++) {
for (int j = 0; j < Ns[i].siz... | #include <algorithm>
#include <array>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
// AtCoderC++.cpp
using namespace std;
void Show(vector<vector<int>> Ns) {
for (int i = 0; i < Ns.size(); i++) {
for (int j = 0; j < Ns[i].siz... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,020,056 | 1,020,057 | u822155101 | cpp |
p03227 | #include <cstdio>
#include <cstring>
using namespace std;
char s[105][105];
int main() {
scanf("%s", &s[1]);
int len = strlen(s[1]);
if (len == 2) {
printf("%s", s[1]);
} else if (len == 3) {
for (int m = len; m >= 1; m--) {
printf("%c\n", s[1][m - 1]);
};
};
return 0;
}
| #include <cstdio>
#include <cstring>
using namespace std;
char S[105][105];
int main() {
scanf("%s", &S[1]);
int len = strlen(S[1]);
if (len == 2) {
printf("%s", S[1]);
} else if (len == 3) {
for (int m = len; m >= 1; m--) {
printf("%c", S[1][m - 1]);
};
};
return 0;
}
| [
"identifier.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"io.output.change",
"literal.string.change",
"io.output.newline.remove"
] | 1,020,062 | 1,020,063 | u899392172 | cpp |
p03227 | #include <iostream>
using namespace std;
int main() {
char str[4];
cin >> str;
if (str[3] == '\0') {
char ren[4];
ren[3] = '\0';
for (int i = 0; i < 3; i++) {
ren[i] = str[2 - i];
}
cout << ren << endl;
return 0;
}
cout << str << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
char str[4];
cin >> str;
if (str[2] != '\0') {
char ren[4];
ren[3] = '\0';
for (int i = 0; i < 3; i++) {
ren[i] = str[2 - i];
}
cout << ren << endl;
return 0;
}
cout << str << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 1,020,064 | 1,020,065 | u902428263 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
void y() { cout << "yes"; }
void Y() { cout << "Yes"; }
void n() { cout << "no"; }
void N() { cout << "No"; }
int main() {
int num = 0, max = 1000000;
char c[3];
c[2] = '0';
cin >> c[0] >> c[1] >> c[2];
if (c[2] != '0')
cout << c[2] << c[1] << c[0];
else
... | #include <bits/stdc++.h>
using namespace std;
void y() { cout << "yes"; }
void Y() { cout << "Yes"; }
void n() { cout << "no"; }
void N() { cout << "No"; }
int main() {
int num = 0, max = 1000000;
char c[3];
c[2] = '0';
cin >> c[0] >> c[1] >> c[2];
if (c[2] != '0')
cout << c[2] << c[1] << c[0];
else
... | [
"expression.operation.binary.remove",
"io.output.change"
] | 1,020,071 | 1,020,072 | u029166898 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
void y() { cout << "yes"; }
void Y() { cout << "Yes"; }
void n() { cout << "no"; }
void N() { cout << "No"; }
int main() {
int num = 0, max = 1000000;
char c[3];
c[2] = 0;
cin >> c[0] >> c[1] >> c[2];
if (c[2] != '0')
cout << c[2] << c[1] << c[0];
else
c... | #include <bits/stdc++.h>
using namespace std;
void y() { cout << "yes"; }
void Y() { cout << "Yes"; }
void n() { cout << "no"; }
void N() { cout << "No"; }
int main() {
int num = 0, max = 1000000;
char c[3];
c[2] = '0';
cin >> c[0] >> c[1] >> c[2];
if (c[2] != '0')
cout << c[2] << c[1] << c[0];
else
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,020,073 | 1,020,072 | u029166898 | cpp |
p03228 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | [
"expression.operator.change"
] | 1,020,076 | 1,020,077 | u882039496 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a... | [
"io.output.change"
] | 1,020,078 | 1,020,079 | u552357043 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a... | [
"control_flow.branch.if.condition.change",
"io.output.change"
] | 1,020,080 | 1,020,079 | u552357043 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll coc[2];
int K;
cin >> coc[0] >> coc[1] >> K;
for (int i = 0; i < K; i++) {
int j = i % 2;
int k = (j + 1) % 2;
coc[j] /= 2;
coc[k] += coc[j];
}
cout << coc[0] << coc[1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll coc[2];
int K;
cin >> coc[0] >> coc[1] >> K;
for (int i = 0; i < K; i++) {
int j = i % 2;
int k = (j + 1) % 2;
coc[j] /= 2;
coc[k] += coc[j];
}
cout << coc[0] << ' ' << coc[1] << endl;
}
| [
"io.output.change"
] | 1,020,081 | 1,020,082 | u058186113 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using st = string;
using ch = char;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using st = string;
using ch = char;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#def... | [] | 1,020,087 | 1,020,088 | u328811800 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
a = a / 2;
b += a / 2;
} else {
b = b / 2;
a += b / 2;
}
}
cout << a << " " << b;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
a = a / 2;
b += a;
} else {
b = b / 2;
a += b;
}
}
cout << a << " " << b;
}
| [
"expression.operation.binary.remove"
] | 1,020,089 | 1,020,090 | u222643545 | cpp |
p03228 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 1) {
if (A % 2 == 0)
A--;
int half = A / 2;
A -= half;
B += half;
} else {
if (B % 2 == 1)
B--;
int half = B / 2;
A ... | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 == 1)
A--;
int half = A / 2;
A -= half;
B += half;
} else {
if (B % 2 == 1)
B--;
int half = B / 2;
A ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,020,093 | 1,020,094 | u624475441 | cpp |
p03228 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 == 0)
A--;
int half = A / 2;
A -= half;
B += half;
} else {
if (B % 2 == 0)
B--;
int half = B / 2;
A ... | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 == 1)
A--;
int half = A / 2;
A -= half;
B += half;
} else {
if (B % 2 == 1)
B--;
int half = B / 2;
A ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,020,095 | 1,020,094 | u624475441 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << end... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << end... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,020,096 | 1,020,097 | u071019032 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
using ll = long long; // ll は long long と同じとする。
int main() {
ll A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
B += A / 2;
A /= 2;
} else {
A += B / 2;
B /= 2;
}
}
cout << A << B << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long; // ll は long long と同じとする。
int main() {
ll A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
B += A / 2;
A /= 2;
} else {
A += B / 2;
B /= 2;
}
}
cout << A << ' ' << B << endl;
}
| [
"io.output.change"
] | 1,020,098 | 1,020,099 | u629548179 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
namespace FAST_IO {
template <typename T> void read(T &a) {
a = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') {
f = -1;
}
c = getchar();
}
while (isdigit(c)) {
a = a * 10 + c - '0';
c = getchar();
}
a = a * f... | #include <bits/stdc++.h>
using namespace std;
namespace FAST_IO {
template <typename T> void read(T &a) {
a = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') {
f = -1;
}
c = getchar();
}
while (isdigit(c)) {
a = a * 10 + c - '0';
c = getchar();
}
a = a * f... | [] | 1,020,100 | 1,020,101 | u207310767 | cpp |
p03228 | #include <iostream>
using namespace std;
int main() {
int a, b, k, i;
cin >> a >> b >> k;
for (i = 0; i < k; i++) {
if (i % 2 == 0) {
b += a / 2;
a /= 2;
} else
a += b / 2;
b /= 2;
}
cout << a << " " << b << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, k, i;
cin >> a >> b >> k;
for (i = 0; i < k; i++) {
if (i % 2 == 0) {
b += a / 2;
a /= 2;
} else {
a += b / 2;
b /= 2;
}
}
cout << a << " " << b << endl;
} | [] | 1,020,102 | 1,020,103 | u670898337 | cpp |
p03228 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | [
"identifier.change"
] | 1,020,104 | 1,020,105 | u516525290 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return ... | [
"expression.operation.binary.remove"
] | 1,020,106 | 1,020,107 | u414947284 | cpp |
p03228 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const double pi = acos(-1);
int main() {
ll a, b, k;
cin >> a >> b >> k;
rep(i, k) {
if (i % 2 == 0) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const double pi = acos(-1);
int main() {
ll a, b, k;
cin >> a >> b >> k;
rep(i, k) {
if (i % 2 == 0) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,020,110 | 1,020,111 | u371149954 | cpp |
p03228 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define PER(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define ... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define PER(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,020,112 | 1,020,113 | u154645927 | cpp |
p03228 | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod = 1000000007;
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
... | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod = 1000000007;
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,020,118 | 1,020,119 | u192903163 | cpp |
p03228 | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#defin... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#defin... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,020,120 | 1,020,121 | u521723672 | cpp |
p03228 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
ll a, b, k;
cin >> a >> b >> k;
rep(i, k) {
if (i % 2) {
if (a % 2)
a--;
b += (a /= 2);
} else {
if (b % 2)
b--;
a += (b /= 2);
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
ll a, b, k;
cin >> a >> b >> k;
rep(i, k) {
if (i % 2 == 0) {
if (a % 2)
a--;
b += (a /= 2);
} else {
if (b % 2)
b--;
a += (b /= 2);
... | [
"control_flow.branch.if.condition.change"
] | 1,020,126 | 1,020,127 | u021358975 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int now = 0;
for (int i = 0; i < k; i++) {
if (now == 0) {
int tmp = a / 2;
a = tmp;
b += tmp;
now = 1;
} else {
int tmp = b / 2;
b = tmp;
a += tmp;
}
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int now = 0;
for (int i = 0; i < k; i++) {
if (now == 0) {
int tmp = a / 2;
a = tmp;
b += tmp;
now = 1;
} else {
int tmp = b / 2;
b = tmp;
a += tmp;
now = 0;
}... | [
"assignment.add"
] | 1,020,128 | 1,020,129 | u013408661 | cpp |
p03228 | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
ll a, b;
int k;
cin >> a >> b >> k;
rep(i, k) {
if (k % 2 == 0) {
b += a / 2;
a /= 2;
} else {
a += b / 2;
b /= 2;
... | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
ll a, b;
int k;
cin >> a >> b >> k;
rep(i, k) {
if (i % 2 == 0) {
b += a / 2;
a /= 2;
} else {
a += b / 2;
b /= 2;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,020,130 | 1,020,131 | u648009244 | cpp |
p03228 | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
ll a, b;
int k;
cin >> a >> b >> k;
rep(i, k) {
if (k % 2 == 0) {
b += a / 2;
a /= 2;
} else
a += b / 2;
b /= 2;
}
co... | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
ll a, b;
int k;
cin >> a >> b >> k;
rep(i, k) {
if (i % 2 == 0) {
b += a / 2;
a /= 2;
} else {
a += b / 2;
b /= 2;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,020,132 | 1,020,131 | u648009244 | cpp |
p03228 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typede... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typede... | [] | 1,020,133 | 1,020,134 | u824337972 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b;
int k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (k % 2 == 0) {
a /= 2;
b += a;
} else {
b /= 2;
a += b;
}
}
cout << a << ' ' << b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b;
int k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
a /= 2;
b += a;
} else {
b /= 2;
a += b;
}
}
cout << a << ' ' << b << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,020,139 | 1,020,140 | u072080927 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, i;
cin >> a >> b >> k;
for (i = 0; i < k; i++) {
if (k % 2) {
if (b ^ 0)
--b;
b /= 2;
a += b;
} else {
if (a ^ 0)
--a;
a /= 2;
b += a;
}
}
cout << a << " " << b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, i;
cin >> a >> b >> k;
for (i = 0; i < k; i++) {
if (i % 2) {
if (b & 0)
--b;
b /= 2;
a += b;
} else {
if (a & 0)
--a;
a /= 2;
b += a;
}
}
cout << a << " " << b << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,020,147 | 1,020,148 | u373958718 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
#define int 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 repo(i, o, n) for (int i = o; i < (int)(n); +... | #include <bits/stdc++.h>
using namespace std;
#define int 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 repo(i, o, n) for (int i = o; i < (int)(n); +... | [
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 1,020,159 | 1,020,160 | u721367699 | cpp |
p03228 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"assignment.change"
] | 1,020,161 | 1,020,162 | u656771711 | cpp |
p03228 | #include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> a >> b >> n;
for (int i = 0; i > n; i++) {
if (i % 2 == 0) {
a = a / 2;
b += a;
} else {
b /= 2;
a += b;
}
}
cout << a << " " << b << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> a >> b >> n;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
a = a / 2;
b += a;
} else {
b /= 2;
a += b;
}
}
cout << a << " " << b << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,020,163 | 1,020,164 | u179970156 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, x = 0;
vector<int> da(2);
cin >> da[0] >> da[1] >> k;
for (int i = 0; i < k; i++) {
if (da[x] % 2 == 1)
da[x]--;
da[1 - x] += da[x] / 2;
da[x] -= da[x] / 2;
x = 1 - x;
}
cout << da[0] << da[1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int k, x = 0;
vector<int> da(2);
cin >> da[0] >> da[1] >> k;
for (int i = 0; i < k; i++) {
if (da[x] % 2 == 1)
da[x]--;
da[1 - x] += da[x] / 2;
da[x] -= da[x] / 2;
x = 1 - x;
}
cout << da[0] << ' ' << da[1] << endl;
}
| [
"io.output.change"
] | 1,020,165 | 1,020,166 | u057079894 | cpp |
p03228 | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
B += A / 2;
A /= 2;
} else {
A += B / 2;
B /= 2;
}
}
cout << A << B;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
B += A / 2;
A /= 2;
} else {
A += B / 2;
B /= 2;
}
}
cout << A << " " << B;
return 0;
} | [
"io.output.change"
] | 1,020,167 | 1,020,168 | u344810256 | cpp |
p03228 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
int k;
cin >> k;
r(i, k) {
if (i % 2 == 0) {
if (a % 2) {
a--;
}
b += a / 2;
a /= 2;
} else {
if (b % 2) {
... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
int k;
cin >> k;
r(i, k) {
if (i % 2 == 0) {
if (a % 2) {
a--;
}
b += a / 2;
a /= 2;
} else {
if (b % 2) {
... | [] | 1,020,174 | 1,020,175 | u777468981 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
b += a / 2;
a /= 2;
} else {
a += b / 2;
b /= 2;
}
}
cout << a << b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
b += a / 2;
a /= 2;
} else {
a += b / 2;
b /= 2;
}
}
cout << a << ' ' << b << endl;
return 0;
} | [
"io.output.change"
] | 1,020,182 | 1,020,183 | u354638986 | cpp |
p03228 | #include <iostream>
using namespace std;
int cal(int &cookie, int &count) {
if (cookie % 2)
cookie -= 1;
count += 1;
return cookie / 2;
}
int main() {
int A, B, K, d;
cin >> A >> B >> K;
int count = 0;
while (count < K) {
d = cal(A, count);
A -= d;
B += d;
if (count == K)
break... | #include <iostream>
using namespace std;
int cal(int &cookie, int &count) {
if (cookie % 2)
cookie -= 1;
count += 1;
return cookie / 2;
}
int main() {
int A, B, K, d;
cin >> A >> B >> K;
int count = 0;
while (count < K) {
d = cal(A, count);
A -= d;
B += d;
if (count == K)
break... | [] | 1,020,186 | 1,020,187 | u396824275 | cpp |
p03228 | #include <iostream>
using namespace std;
void f(int &a, int &b) {
if (a & 1) {
--a;
}
b += a / 2;
a /= 2;
}
int main() {
int A, B, K;
cin >> A >> B >> K;
while (K > 0) {
f(A, B);
--K;
if (K == 0)
break;
f(B, A);
--K;
}
cout << A << B << endl;
} | #include <iostream>
using namespace std;
void f(int &a, int &b) {
if (a & 1) {
--a;
}
b += a / 2;
a /= 2;
}
int main() {
int A, B, K;
cin >> A >> B >> K;
while (K > 0) {
f(A, B);
--K;
if (K == 0)
break;
f(B, A);
--K;
}
cout << A << " " << B << endl;
} | [
"io.output.change"
] | 1,020,190 | 1,020,191 | u982123883 | cpp |
p03228 | #include <iostream>
using namespace std;
int A, B, K;
int main() {
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (K % 2 == 0) {
if (A % 2 == 1)
A--;
A /= 2;
B += A;
} else {
if (B % 2 == 1)
B--;
B /= 2;
A += B;
}
}
cout << A << " " << B << e... | #include <iostream>
using namespace std;
int A, B, K;
int main() {
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 == 1)
A--;
A /= 2;
B += A;
} else {
if (B % 2 == 1)
B--;
B /= 2;
A += B;
}
}
cout << A << " " << B << e... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,020,194 | 1,020,195 | u623954643 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int out = 0, fh = 1;
char jp = getchar();
while ((jp > '9' || jp < '0') && jp != '-')
jp = getchar();
if (jp == '-') {
fh = -1;
jp = getchar();
}
while (jp >= '0' && jp <= '9') {
out = out * 10 + jp - '0';
jp = getchar();
... | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int out = 0, fh = 1;
char jp = getchar();
while ((jp > '9' || jp < '0') && jp != '-')
jp = getchar();
if (jp == '-') {
fh = -1;
jp = getchar();
}
while (jp >= '0' && jp <= '9') {
out = out * 10 + jp - '0';
jp = getchar();
... | [] | 1,020,209 | 1,020,210 | u351568836 | cpp |
p03220 | #include <math.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct kouho {
int index;
int hi;
};
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<kouho> H = vector<kouho>(N);
for (int i = 0; i < N; i++) {
cin >> H[i].hi;
H[i].index = i + 1;
}
double s... | #include <algorithm>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct kouho {
int index;
int hi;
};
int main() {
int N, T, A;
cin >> N >> T >> A;
vector<kouho> H = vector<kouho>(N);
for (int i = 0; i < N; i++) {
cin >> H[i].hi;
H[i].index = i... | [
"import.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,020,215 | 1,020,216 | u246838438 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, t, a, ans, tmp;
cin >> N;
cin >> t >> a;
long long h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
tmp = abs(a - (t - (0.006 * h[0])));
ans = 0;
for (int j = 0; j < N; j++) {
if (abs(a - (t - (0.006 * h[j]))) < t... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, t, a, ans;
float tmp;
cin >> N;
cin >> t >> a;
long long h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
tmp = abs(a - (t - (0.006 * h[0])));
ans = 0;
for (int j = 0; j < N; j++) {
if (abs(a - (t - (0.006 * h[j... | [
"variable_declaration.type.change"
] | 1,020,224 | 1,020,225 | u117707850 | cpp |
p03220 | //競技命令に必要な命令を網羅的に追加
//#include "bits/stdc++.h"
//入出力等基本
#include <iostream>
//文字列
#include <string>
//配列
#include <vector>
//配列操作
#include <algorithm>
//箱型構造
#include <stack>
//筒型構造
#include <queue>
//二分探索木
#include <set>
//辞書構造
#include <map>
//数学
#include <cmath>
//真表明用
#include <cassert>
//複数混合型
#include <tuple>
//... | //競技命令に必要な命令を網羅的に追加
//#include "bits/stdc++.h"
//入出力等基本
#include <iostream>
//文字列
#include <string>
//配列
#include <vector>
//配列操作
#include <algorithm>
//箱型構造
#include <stack>
//筒型構造
#include <queue>
//二分探索木
#include <set>
//辞書構造
#include <map>
//数学
#include <cmath>
//真表明用
#include <cassert>
//複数混合型
#include <tuple>
//... | [] | 1,020,226 | 1,020,227 | u491514832 | cpp |
p03220 | //競技命令に必要な命令を網羅的に追加
//#include "bits/stdc++.h"
//入出力等基本
#include <iostream>
//文字列
#include <string>
//配列
#include <vector>
//配列操作
#include <algorithm>
//箱型構造
#include <stack>
//筒型構造
#include <queue>
//二分探索木
#include <set>
//辞書構造
#include <map>
//数学
#include <cmath>
//真表明用
#include <cassert>
//複数混合型
#include <tuple>
//... | //競技命令に必要な命令を網羅的に追加
//#include "bits/stdc++.h"
//入出力等基本
#include <iostream>
//文字列
#include <string>
//配列
#include <vector>
//配列操作
#include <algorithm>
//箱型構造
#include <stack>
//筒型構造
#include <queue>
//二分探索木
#include <set>
//辞書構造
#include <map>
//数学
#include <cmath>
//真表明用
#include <cassert>
//複数混合型
#include <tuple>
//... | [] | 1,020,228 | 1,020,227 | u491514832 | cpp |
p03220 | //競技命令に必要な命令を網羅的に追加
//#include "bits/stdc++.h"
//入出力等基本
#include <iostream>
//文字列
#include <string>
//配列
#include <vector>
//配列操作
#include <algorithm>
//箱型構造
#include <stack>
//筒型構造
#include <queue>
//二分探索木
#include <set>
//辞書構造
#include <map>
//数学
#include <cmath>
//真表明用
#include <cassert>
//複数混合型
#include <tuple>
//... | //競技命令に必要な命令を網羅的に追加
//#include "bits/stdc++.h"
//入出力等基本
#include <iostream>
//文字列
#include <string>
//配列
#include <vector>
//配列操作
#include <algorithm>
//箱型構造
#include <stack>
//筒型構造
#include <queue>
//二分探索木
#include <set>
//辞書構造
#include <map>
//数学
#include <cmath>
//真表明用
#include <cassert>
//複数混合型
#include <tuple>
//... | [] | 1,020,229 | 1,020,227 | u491514832 | cpp |
p03220 | //競技命令に必要な命令を網羅的に追加
//#include "bits/stdc++.h"
//入出力等基本
#include <iostream>
//文字列
#include <string>
//配列
#include <vector>
//配列操作
#include <algorithm>
//箱型構造
#include <stack>
//筒型構造
#include <queue>
//二分探索木
#include <set>
//辞書構造
#include <map>
//数学
#include <cmath>
//真表明用
#include <cassert>
//複数混合型
#include <tuple>
//... | //競技命令に必要な命令を網羅的に追加
//#include "bits/stdc++.h"
//入出力等基本
#include <iostream>
//文字列
#include <string>
//配列
#include <vector>
//配列操作
#include <algorithm>
//箱型構造
#include <stack>
//筒型構造
#include <queue>
//二分探索木
#include <set>
//辞書構造
#include <map>
//数学
#include <cmath>
//真表明用
#include <cassert>
//複数混合型
#include <tuple>
//... | [] | 1,020,226 | 1,020,230 | u491514832 | cpp |
p03220 | //競技命令に必要な命令を網羅的に追加
//#include "bits/stdc++.h"
//入出力等基本
#include <iostream>
//文字列
#include <string>
//配列
#include <vector>
//配列操作
#include <algorithm>
//箱型構造
#include <stack>
//筒型構造
#include <queue>
//二分探索木
#include <set>
//辞書構造
#include <map>
//数学
#include <cmath>
//真表明用
#include <cassert>
//複数混合型
#include <tuple>
//... | //競技命令に必要な命令を網羅的に追加
//#include "bits/stdc++.h"
//入出力等基本
#include <iostream>
//文字列
#include <string>
//配列
#include <vector>
//配列操作
#include <algorithm>
//箱型構造
#include <stack>
//筒型構造
#include <queue>
//二分探索木
#include <set>
//辞書構造
#include <map>
//数学
#include <cmath>
//真表明用
#include <cassert>
//複数混合型
#include <tuple>
//... | [] | 1,020,228 | 1,020,230 | u491514832 | cpp |
p03220 | //競技命令に必要な命令を網羅的に追加
//#include "bits/stdc++.h"
//入出力等基本
#include <iostream>
//文字列
#include <string>
//配列
#include <vector>
//配列操作
#include <algorithm>
//箱型構造
#include <stack>
//筒型構造
#include <queue>
//二分探索木
#include <set>
//辞書構造
#include <map>
//数学
#include <cmath>
//真表明用
#include <cassert>
//複数混合型
#include <tuple>
//... | //競技命令に必要な命令を網羅的に追加
//#include "bits/stdc++.h"
//入出力等基本
#include <iostream>
//文字列
#include <string>
//配列
#include <vector>
//配列操作
#include <algorithm>
//箱型構造
#include <stack>
//筒型構造
#include <queue>
//二分探索木
#include <set>
//辞書構造
#include <map>
//数学
#include <cmath>
//真表明用
#include <cassert>
//複数混合型
#include <tuple>
//... | [] | 1,020,229 | 1,020,230 | u491514832 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
double a = 1, b = 0, c = 100, d = 0, e = 0, maxy = 0, min = 0, ans = 1,
count = 0;
int yoko = 0, tate = 0;
int array[1001] = {0};
std::string output, output2, output3, inp... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
double a = 1, b = 0, c = 100, d = 0, e = 0, maxy = 0, min = 0, ans = 1,
count = 0;
int yoko = 0, tate = 0;
int array[1001] = {0};
std::string output, output2, output3, inp... | [
"expression.operation.binary.remove"
] | 1,020,232 | 1,020,233 | u635557235 | cpp |
p03220 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; ... | [
"assignment.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,020,234 | 1,020,235 | u591824072 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> v;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
v.push_back(abs(12 - 0.006 * c - a));
}
cout << (min_element(v.beg... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> v;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
v.push_back(abs(t - 0.006 * c - a));
}
cout << (min_element(v.begi... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,020,238 | 1,020,239 | u729473347 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> v;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
v.push_back(abs(12 - 1000 * c - a));
}
cout << (min_element(v.begi... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
vector<double> v;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
v.push_back(abs(t - 0.006 * c - a));
}
cout << (min_element(v.begi... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 1,020,240 | 1,020,239 | u729473347 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[100010];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
double distance;
double last_dist = (1 << 16);
int now_top;
for (int j = 0; j < N; j++) {
distance = abs(A - (T - H[j] * 0.006));
if (l... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T, A;
cin >> N >> T >> A;
int H[100010];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
double distance;
double last_dist = (1 << 16);
int now_top;
for (int j = 0; j < N; j++) {
distance = abs(A - (T - H[j] * 0.006));
if (l... | [] | 1,020,241 | 1,020,242 | u345731720 | cpp |
p03220 | //#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#de... | //#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#de... | [
"assignment.change"
] | 1,020,247 | 1,020,248 | u413090011 | cpp |
p03220 | #include <iostream>
using namespace std;
int main(void) {
int n;
double t, a;
cin >> n;
cin >> t;
cin >> a;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int sa[n];
for (int i = 0; i < n; i++) {
sa[i] = a - (t - h[i] * 0.006);
if (sa[i] < 0) {
sa[i] = -sa[i];
}
}
... | #include <iostream>
using namespace std;
int main(void) {
int n;
double t, a;
cin >> n;
cin >> t;
cin >> a;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
double sa[n];
for (int i = 0; i < n; i++) {
sa[i] = a - (t - h[i] * 0.006);
if (sa[i] < 0) {
sa[i] = -sa[i];
}
... | [
"variable_declaration.type.primitive.change"
] | 1,020,251 | 1,020,252 | u790821044 | cpp |
p03220 | #include <math.h>
#include <stdio.h>
int h[100000];
int main() {
int n, t, a, b, i;
scanf("%d", &n);
scanf("%d%d", &t, &a);
for (i = 0; i < n; i++) {
scanf("%d", &h[i]);
h[i] = t - h[i] * 0.006;
}
double min = 10000000000.0;
for (i = 0; i < n; i++) {
if (fabs(h[i] - a) <= min) {
min = fa... | #include <math.h>
#include <stdio.h>
double h[100000];
int main() {
int n, t, a, b, i;
scanf("%d", &n);
scanf("%d%d", &t, &a);
for (i = 0; i < n; i++) {
scanf("%lf", &h[i]);
h[i] = t - h[i] * 0.006;
}
double min = 10000000000.0;
for (i = 0; i < n; i++) {
if (fabs(h[i] - a) <= min) {
min ... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change"
] | 1,020,253 | 1,020,254 | u334053632 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
int T, A;
cin >> N;
cin >> T >> A;
double H;
int min = 2147483647;
int num = 0;
double d = 0;
for (int i = 1; i <= N; i++) {
// cout << abs(A-(T*1000-H[i]*6))/1000 << endl;
// cout << A << endl;
cin >> H;
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
int T, A;
cin >> N;
cin >> T >> A;
double H;
double min = 2147483647;
int num = 0;
double d = 0;
for (int i = 1; i <= N; i++) {
// cout << abs(A-(T*1000-H[i]*6))/1000 << endl;
// cout << A << endl;
cin >> H... | [
"variable_declaration.type.primitive.change"
] | 1,020,257 | 1,020,258 | u945452839 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
int T, A;
cin >> N;
cin >> T >> A;
int H;
int min = 2147483647;
int num = 0;
float d = 0;
for (int i = 1; i <= N; i++) {
// cout << abs(A-(T*1000-H[i]*6))/1000 << endl;
// cout << A << endl;
cin >> H;
d... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
int T, A;
cin >> N;
cin >> T >> A;
double H;
double min = 2147483647;
int num = 0;
double d = 0;
for (int i = 1; i <= N; i++) {
// cout << abs(A-(T*1000-H[i]*6))/1000 << endl;
// cout << A << endl;
cin >> H... | [
"variable_declaration.type.primitive.change"
] | 1,020,259 | 1,020,258 | u945452839 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <vector>
using namespace std;
using str = string;
#define rep(a, l, r) for (int a = (l); a < (r); a++)
#define get ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <vector>
using namespace std;
using str = string;
#define rep(a, l, r) for (int a = (l); a < (r); a++)
#define get ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,020,261 | 1,020,262 | u040380439 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, n, t;
cin >> n >> t >> a;
long d = 100000, h, tem, pos = 0;
for (int i = 0; i < n; i++) {
cin >> h;
tem = abs(a - (t - h * 0.006));
if (d > tem) {
d = tem;
pos = i + 1;
}
}
cout << pos << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, n, t;
cin >> n >> t >> a;
long d = 10000000, h, tem, pos = 0;
for (int i = 0; i < n; i++) {
cin >> h;
tem = abs(a - (t - h * 0.006)) * 1000;
if (d > tem) {
d = tem;
pos = i + 1;
}
}
cout << pos << endl;
retu... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 1,020,263 | 1,020,264 | u376817785 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.