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 |
|---|---|---|---|---|---|---|---|
p03226 | #include <iostream>
#include <set>
#include <vector>
#define llint long long
#define inf 1000000000
#define mod 998244353
using namespace std;
struct UnionFind {
int size;
vector<int> parent;
UnionFind() {}
UnionFind(int size) {
this->size = size;
parent.resize(size + 1);
init();
}
void init(... | #include <iostream>
#include <set>
#include <vector>
#define llint long long
#define inf 1000000000
#define mod 998244353
using namespace std;
struct UnionFind {
int size;
vector<int> parent;
UnionFind() {}
UnionFind(int size) {
this->size = size;
parent.resize(size + 1);
init();
}
void init(... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,020,641 | 1,020,642 | u319282133 | cpp |
p03226 | #include <bits/stdc++.h>
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
int N;
const int MAX_N = 3e5;
const ll MOD = 998244353;
typedef pair<int, int> P;
vector<P> org;
int psm[MAX_N + 1];
int main() {
cin >> N;
REP(i, N) {
int a;
... | #include <bits/stdc++.h>
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
int N;
const int MAX_N = 3e5;
const ll MOD = 998244353;
typedef pair<int, int> P;
vector<P> org;
int psm[MAX_N + 1];
int main() {
cin >> N;
REP(i, N) {
int a;
... | [
"assignment.add"
] | 1,020,643 | 1,020,644 | u533920479 | cpp |
p03226 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,020,647 | 1,020,648 | u483814783 | cpp |
p03226 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
//////////////////////////////////... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
//////////////////////////////////... | [
"control_flow.branch.if.condition.change"
] | 1,020,654 | 1,020,655 | u259396003 | cpp |
p03226 | #include <cstdio>
#include <cstdlib>
#include <cstring>
const int N = 300032;
typedef long long ll;
const ll MOD = 998244353;
ll factor(int n) {
ll s = 1;
while (n > 2)
s = s * n-- % MOD;
return s;
}
struct range {
int l, r;
range() {}
range(int l, int r) : l(l), r(r) {}
int len();
void ins();
} r... | #include <cstdio>
#include <cstdlib>
#include <cstring>
const int N = 300032;
typedef long long ll;
const ll MOD = 998244353;
ll factor(int n) {
ll s = 1;
while (n > 1)
s = s * n-- % MOD;
return s;
}
struct range {
int l, r;
range() {}
range(int l, int r) : l(l), r(r) {}
int len();
void ins();
} r... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 1,020,658 | 1,020,659 | u710674778 | cpp |
p03226 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for (int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for (int ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for (int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for (int ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,020,662 | 1,020,663 | u308650788 | cpp |
p03226 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SIZE 300005
#define MOD 998244353
using namespace std;
typedef long long int ll;
typedef pair... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SIZE 300005
#define MOD 998244353
using namespace std;
typedef long long int ll;
typedef pair... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,020,667 | 1,020,668 | u600916050 | cpp |
p03227 | #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() {
string S;
int a = S.size();
if (a == 2) {
cout << S << endl;
... | #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() {
string S;
cin >> S;
int a = S.size();
if (a == 2) {
cout <<... | [] | 1,020,669 | 1,020,670 | u983563612 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, m, n) for (ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define tmax(x, y, z) max((x), max((y), (z)))
#define tmin(x, y, z) min((x), min((y), (z)))
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, m, n) for (ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define tmax(x, y, z) max((x), max((y), (z)))
#define tmin(x, y, z) min((x), min((y), (z)))
#... | [
"identifier.change",
"call.function.change"
] | 1,020,683 | 1,020,684 | u535010493 | cpp |
p03227 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string A;
char B, C;
if (A.size() == 2) {
cout << A << endl;
} else {
B = A.at(0);
C = A.at(2);
A.at(0)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string A;
cin >> A;
char B, C;
if (A.size() == 2) {
cout << A << endl;
} else {
B = A.at(0);
C = A.at(2);... | [] | 1,020,685 | 1,020,686 | u025773431 | cpp |
p03227 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define repr(i, n) for (ll i = n - 1; i >= 0; --i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
u... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define repr(i, n) for (ll i = n - 1; i >= 0; --i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
u... | [
"control_flow.return.add"
] | 1,020,691 | 1,020,692 | u110044127 | cpp |
p03228 | #include <iostream>
//#include <string>
using namespace std;
int main(void) {
int a, b, k;
cin >> a >> b >> k;
bool flg = 0;
for (int i = 0; i < k; i++) {
if (!flg) {
if (a % 2 == 1)
a--;
a /= 2;
b += a;
flg = 1;
} else {
if (b % 2 == 1)
b--;
b /= 2;... | #include <iostream>
//#include <string>
using namespace std;
int main(void) {
int a, b, k;
cin >> a >> b >> k;
bool flg = 0;
for (int i = 0; i < k; i++) {
if (!flg) {
if (a % 2 == 1)
a--;
a /= 2;
b += a;
flg = 1;
} else {
if (b % 2 == 1)
b--;
b /= 2;... | [
"io.output.change"
] | 1,020,693 | 1,020,694 | u987237500 | cpp |
p03228 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int a, b, k;
int main() {
int t = 1;
cin >> a >> b >> k;
while (k--) {
if (t == 1) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
using namespace std;
ll a, b, k;
int main() {
int t = 1;
cin >> a >> b >> k;
while (k--) {
if (t == 1) {
... | [
"variable_declaration.type.change",
"io.output.change"
] | 1,020,695 | 1,020,696 | u961611557 | cpp |
p03228 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
long long a, b;
int k;
cin >> a >> b >> k;
for (int i = 0; i < k; i = i + 2) {
a = a / 2;
b = b + a;
b = b / 2;
a = b + a;
}
if (k % 2 == 1) {
a = a / 2;
b = b + a;
}
cout << a << " " << b << endl;
r... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
long long a, b;
int k;
cin >> a >> b >> k;
for (int i = 0; i < k - 1; i = i + 2) {
a = a / 2;
b = b + a;
b = b / 2;
a = b + a;
}
if (k % 2 == 1) {
a = a / 2;
b = b + a;
}
cout << a << " " << b << endl;... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,020,697 | 1,020,698 | u724184343 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) ((int)(x).size())
#define in(x) \
int x; \
cin >> x
#define bit(n) (1 << (n))
#define rep(i, n)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) ((int)(x).size())
#define in(x) \
int x; \
cin >> x
#define bit(n) (1 << (n))
#define rep(i, n)... | [
"identifier.change"
] | 1,020,703 | 1,020,702 | u245407321 | cpp |
p03228 | /* Author rumoisen */
/* created 2018/10/20 */
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) so... | /* Author rumoisen */
/* created 2018/10/20 */
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) so... | [
"io.output.change"
] | 1,020,706 | 1,020,707 | u437973379 | cpp |
p03228 | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int A, B, K, i, j;
cin >> A >> B >> K;
for (i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 == 0) {
A -= 1;
}
B += A / 2;
A /= 2;
... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int A, B, K, i, j;
cin >> A >> B >> K;
for (i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 != 0) {
A -= 1;
}
B += A / 2;
A /= 2;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,020,714 | 1,020,715 | u809278162 | cpp |
p03228 | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int A, B, K, i, j;
cin >> A >> B >> K;
for (i = 0; i < K; i++) {
if (K % 2 == 0) {
if (A % 2 == 0) {
A -= 1;
}
B += A / 2;
A /= 2;
... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int A, B, K, i, j;
cin >> A >> B >> K;
for (i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 != 0) {
A -= 1;
}
B += A / 2;
A /= 2;
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 1,020,716 | 1,020,715 | u809278162 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, k;
cin >> n >> m >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
n -= n % 2;
m += n / 2;
n -= n / 2;
} else {
m -= n % 2;
n += m / 2;
m -= m / 2;
}
}
cout << n << ' ' << m;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, k;
cin >> n >> m >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
n -= n % 2;
m += n / 2;
n -= n / 2;
} else {
m -= m % 2;
n += m / 2;
m -= m / 2;
}
}
cout << n << ' ' << m;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,020,719 | 1,020,720 | u345261025 | cpp |
p03228 | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
#define REP(i, n) for (int i = 0; i < 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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.beg... | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
#define REP(i, n) for (int i = 0; i < 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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.beg... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,020,721 | 1,020,722 | u792598082 | 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 == 1)
a--;
b += a / 2;
a /= 2;
} else {
if (b % 2 == 1)
b--;
a += b / 2;
b /= 2;
}
}
cout << a << b ... | #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--;
b += a / 2;
a /= 2;
} else {
if (b % 2 == 1)
b--;
a += b / 2;
b /= 2;
}
}
cout << a << " ... | [
"io.output.change"
] | 1,020,727 | 1,020,728 | u978308394 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, k;
cin >> a >> b >> k;
for (ll i = 0; i < k; i++) {
if (i % 2 == 0) {
if (a % 2 == 1)
a--;
b += a / 2;
a /= 2;
}
if (i % 2 == 0) {
if (b % 2 == 1)
b--;
a += b / 2;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, k;
cin >> a >> b >> k;
for (ll i = 0; i < k; i++) {
if (i % 2 == 0) {
if (a % 2 == 1)
a--;
b += a / 2;
a /= 2;
}
if (i % 2 == 1) {
if (b % 2 == 1)
b--;
a += b / 2;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,020,729 | 1,020,730 | u357265888 | cpp |
p03228 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
for (int i = 0; i < k / 2; i++) {
m += (n / 2);
n /= 2;
n += (m / 2);
m /= 2;
}
if (k - k / 2 * 2) {
m += (n / 2);
n /= 2;
}
cout << n << " " << m << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
for (int i = 0; i < k / 2; i++) {
m += (n / 2);
n /= 2;
n += (m / 2);
m /= 2;
}
if (k - k / 2 * 2) {
m += (n / 2);
n /= 2;
}
cout << n << " " << m << endl;
} | [
"literal.string.change",
"io.output.change"
] | 1,020,733 | 1,020,734 | u269278772 | cpp |
p03228 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
const int INF32 = 1e9 + 10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 == 1) {
A--;
} e... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
const int INF32 = 1e9 + 10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 == 1) {
A--;
}
... | [] | 1,020,739 | 1,020,740 | u028516426 | cpp |
p03229 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii ve... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii ve... | [
"assignment.change"
] | 1,020,746 | 1,020,747 | u682820318 | cpp |
p03229 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [
"call.add"
] | 1,020,757 | 1,020,758 | u370785250 | cpp |
p03223 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#inclu... | [
"expression.operation.unary.arithmetic.remove"
] | 1,020,779 | 1,020,780 | u566864240 | cpp |
p03223 | #include <stdio.h>
#include <stdlib.h>
int compare(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, i, a[111111];
long ans = 0, copy;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
qsort(a, n, sizeof(int), compare);
int flag = 0, s = 0, g = n - 1, p = n /... | #include <stdio.h>
#include <stdlib.h>
int compare(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, i, a[111111];
long ans = 0, copy;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
qsort(a, n, sizeof(int), compare);
int flag = 0, s = 0, g = n - 1, p = n /... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 1,020,812 | 1,020,813 | u933068010 | cpp |
p03223 | #include <bits/stdc++.h>
using namespace std;
int a[100010];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + 1 + n);
long long ans = 0;
int fl = 1, num = n - 1;
int l, r, i, tn = n, t1 = 3;
l = r = a[1];
while (num) {
if (num == 1) {
i... | #include <bits/stdc++.h>
using namespace std;
int a[100010];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + 1 + n);
long long ans = 0;
int fl = 1, num = n - 1;
int l, r, i, tn = n, t1 = 3;
l = r = a[1];
while (num) {
if (num == 1) {
i... | [
"assignment.variable.change",
"identifier.change"
] | 1,020,834 | 1,020,835 | u078202611 | cpp |
p03223 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) ... | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) ... | [
"call.remove"
] | 1,020,855 | 1,020,856 | u876335718 | cpp |
p03229 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, x, n) for (int i =... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, x, n) for (int i =... | [
"call.add"
] | 1,020,859 | 1,020,860 | u093420647 | cpp |
p03229 | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
const int maxn = 2e5 + 100;
LL a[maxn];
int n;
bool cmp(const LL x, const LL y) { return x > y; }
int main() {
// freopen("in.txt","r",stdin);
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
sort(a + 1, a + 1 + n, cmp);
... | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
const int maxn = 2e5 + 100;
LL a[maxn];
int n;
bool cmp(const LL x, const LL y) { return x > y; }
int main() {
// freopen("in.txt","r",stdin);
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
sort(a + 1, a + 1 + n, cmp);
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,020,861 | 1,020,862 | u404238779 | cpp |
p03229 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> arr(n);
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
sort(arr.begin(), arr.end());
vector<ll> a, b, ans1, ans2;
ll sum1 = 0, sum2 = 0;
ll temp1 = 0, temp2 = 0;
if (n & 1) {
ans1.pus... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> arr(n);
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
sort(arr.begin(), arr.end());
vector<ll> a, b, ans1, ans2;
ll sum1 = 0, sum2 = 0;
ll temp1 = 0, temp2 = 0;
if (n & 1) {
ans1.pus... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,020,865 | 1,020,866 | u352799553 | cpp |
p03229 | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N, sum, i;
cin >> N;
int a[N];
for (i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N, greater<int>());
sum = 0;
if (N % 2 == 0) {
sum += a[0] - a[N... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N, i;
long sum;
cin >> N;
int a[N];
for (i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N, greater<int>());
sum = 0;
if (N % 2 == 0) {
sum += a[0... | [
"variable_declaration.remove",
"variable_declaration.add",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,020,879 | 1,020,880 | u809278162 | cpp |
p03229 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ABS(ll a, ll b) {
if (a - b >= 0)
return a - b;
else
return b - a;
}
int main() {
ios_base::... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ABS(ll a, ll b) {
if (a - b >= 0)
return a - b;
else
return b - a;
}
int main() {
ios_base::... | [
"identifier.change",
"call.arguments.change"
] | 1,020,882 | 1,020,883 | u275726913 | cpp |
p03229 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ABS(ll a, ll b) {
if (a - b >= 0)
return a - b;
else
return b - a;
}
int main() {
ios_base::... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ABS(ll a, ll b) {
if (a - b >= 0)
return a - b;
else
return b - a;
}
int main() {
ios_base::... | [
"identifier.change",
"call.arguments.change",
"expression.operation.unary.add",
"control_flow.loop.condition.change"
] | 1,020,884 | 1,020,883 | u275726913 | cpp |
p03229 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF (long long)(1e18)
#define MOD (int)(1e9 + 7)
#define min(a, b) (a > b ? b : a)
#define max(a, b) (a > b ? a : b)
#define yn... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF (long long)(1e18)
#define MOD (int)(1e9 + 7)
#define min(a, b) (a > b ? b : a)
#define max(a, b) (a > b ? a : b)
#define yn... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 1,020,890 | 1,020,891 | u233393801 | cpp |
p03229 | #include <bits/stdc++.h>
#define int long long int
#define mp make_pair
using namespace std;
int32_t main() {
int n;
scanf("%lld", &n);
vector<int> v(n);
for (int i = 0; i < n; ++i) {
scanf("%lld", &v[i]);
}
sort(v.begin(), v.end());
int f = 0, b = n - 1;
int x = 0;
int index = (n + 1) / 2;
in... | #include <bits/stdc++.h>
#define int long long int
#define mp make_pair
using namespace std;
int32_t main() {
int n;
scanf("%lld", &n);
vector<int> v(n);
for (int i = 0; i < n; ++i) {
scanf("%lld", &v[i]);
}
sort(v.begin(), v.end());
int f = 0, b = n - 1;
int x = 0;
int index = (n + 1) / 2;
in... | [] | 1,020,907 | 1,020,908 | u041920892 | cpp |
p03229 | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n;
std::cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
sort(a.begin(), a.end());
ll c1, c2, m1, m2;
c1 = 2 * (n % 2 == 1);
c2 = (n - 2) / 2;
m1 = 2 * (n % 2 == 0);
m2 = (n - 2 + ... | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n;
std::cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
sort(a.begin(), a.end());
ll c1, c2, m1, m2;
c1 = 1 + (n % 2 == 1);
c2 = (n - 2) / 2;
m1 = 1 - (n % 2 == 1);
m2 = (n - 2 + ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,020,930 | 1,020,931 | u121794232 | cpp |
p03229 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
if (N % 2) {
long long ans1 = -A[N / 2] - A[N / 2 + 1];
for (int i = 0; i < N / 2; i++) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
if (N % 2) {
long long ans1 = -A[N / 2] - A[N / 2 + 1];
for (int i = 0; i < N / 2; i++) {
... | [
"expression.operation.binary.remove"
] | 1,020,940 | 1,020,941 | u425351967 | cpp |
p03229 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,020,946 | 1,020,947 | u322177979 | cpp |
p03229 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<int64_t> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int64_t sum_a = 0;
int64_t a = 0;
int64_t b = N - 2;
for (int i = 0; i < (N + 1) / 2 - 1; i++) {
sum_a += a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<int64_t> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int64_t sum_a = 0;
int64_t a = 0;
int64_t b = N - 2;
for (int i = 0; i < (N + 1) / 2 - 1; i++) {
sum_a += a... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,020,948 | 1,020,949 | u835534008 | cpp |
p03229 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<int64_t> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int64_t sum_a = 0;
int64_t a = 0;
int64_t b = N - 2;
for (int i = 0; i < (N + 1) / 2 - 1; i++) {
sum_a += a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<int64_t> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int64_t sum_a = 0;
int64_t a = 0;
int64_t b = N - 2;
for (int i = 0; i < (N + 1) / 2 - 1; i++) {
sum_a += a... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,020,950 | 1,020,949 | u835534008 | cpp |
p03229 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 998244353;
int main() {
ll N, A[100000];
cin >> N;
for (int i(0); i < N; i++)
cin >> A[i];
sort(A, A + N);
if (N % 2 == 0) {
ll tmp(0ll);
tmp += A[N / 2 + 1];
tmp -= A[N / 2];
for (int i(0); i < N / 2 - 1; i++) {... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 998244353;
int main() {
ll N, A[100000];
cin >> N;
for (int i(0); i < N; i++)
cin >> A[i];
sort(A, A + N);
if (N % 2 == 0) {
ll tmp(0ll);
tmp += A[N / 2];
tmp -= A[N / 2 - 1];
for (int i(0); i < N / 2 - 1; i++) {... | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,020,951 | 1,020,952 | u991846372 | cpp |
p03229 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF 1LL << 62
#define MAX 510000
#define rep(i, n) for (ll i = 0; i <... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF 1LL << 62
#define MAX 510000
#define rep(i, n) for (ll i = 0; i <... | [
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,020,968 | 1,020,969 | u242679311 | cpp |
p03229 | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define nin(n) ... | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define nin(n) ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,020,970 | 1,020,971 | u132284673 | cpp |
p03229 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define step(i, s, n, c) for (int i = (s); i < (n); i += (c))
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
#define ea... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define step(i, s, n, c) for (int i = (s); i < (n); i += (c))
#define REP(i, s, n) for (int i = (s); i < (n); ++i)
#define ea... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 1,020,986 | 1,020,987 | u423624748 | cpp |
p03229 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define dump(a) cout << (a) << endl;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define dump(a) cout << (a) << endl;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,020,993 | 1,020,994 | u572665222 | cpp |
p03229 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int k = n / 2;
ll ans = 0;
if (n % 2 == 0) {
for (int i = 0; i < k - 1; i++) {
ans -= a[i] * 2;
}
... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int k = n / 2;
ll ans = 0;
if (n % 2 == 0) {
for (int i = 0; i < k - 1; i++) {
ans -= a[i] * 2;
}
... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,020,995 | 1,020,996 | u179970156 | cpp |
p03229 | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_C main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX / 2)
const int ... | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_C main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX / 2)
const int ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,020,997 | 1,020,998 | u404244809 | cpp |
p03224 | #include <bits/stdc++.h>
using namespace std;
vector<int> g[100055];
int main() {
int n;
cin >> n;
int k = 1;
while (k * (k - 1) / 2 < n)
k++;
if (k * (k - 1) / 2 != n) {
puts("NO");
return 0;
}
printf("YES\n%d\n", k);
int cnt = 0;
for (int i = 0; i < k; i++)
for (int j = i + 1... | #include <bits/stdc++.h>
using namespace std;
vector<int> g[100055];
int main() {
int n;
cin >> n;
int k = 1;
while (k * (k - 1) / 2 < n)
k++;
if (k * (k - 1) / 2 != n) {
puts("No");
return 0;
}
printf("Yes\n%d\n", k);
int cnt = 0;
for (int i = 0; i < k; i++)
for (int j = i + 1... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,021,037 | 1,021,038 | u542172770 | cpp |
p03224 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, s, e) for (int i = (s); i < (e); i++)
#define all(x) x.begin(), x.end()
#define INF 2123456789
#define IINF 9123456789123456789
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, s, e) for (int i = (s); i < (e); i++)
#define all(x) x.begin(), x.end()
#define INF 2123456789
#define IINF 9123456789123456789
#defi... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,021,047 | 1,021,048 | u847501264 | cpp |
p03224 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef l... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef l... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,021,055 | 1,021,056 | u287305727 | cpp |
p03230 | #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.add"
] | 1,021,322 | 1,021,323 | u179778090 | cpp |
p03230 |
#define MOD_TYPE 1
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using multiInt = boost::multiprecision::cpp_int;
*/
/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
*/
using ll = long long int;
using ld ... |
#define MOD_TYPE 1
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using multiInt = boost::multiprecision::cpp_int;
*/
/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
*/
using ll = long long int;
using ld ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 1,021,326 | 1,021,327 | u878615689 | cpp |
p03230 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define se cout << "test ok" << endl;
#define sp << " " <<
#define enl "\n"
using namespace std;
using ll = long long;
using ld = long double;
... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define se cout << "test ok" << endl;
#define sp << " " <<
#define enl "\n"
using namespace std;
using ll = long long;
using ld = long double;
... | [
"expression.unary.arithmetic.remove",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,021,391 | 1,021,392 | u026620445 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
vector<ll> v[1000];
int main() {
cin >> N;
if (N < 3) {
cout << "No" << endl;
return 0;
}
N *= 2;
ll n = -1;
for (int i = 1; i * i <= N; i++) {
if (N % i != 0)
continue;
if (N / i != i + 1)
continue;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
vector<ll> v[1000];
int main() {
cin >> N;
if (N < 1) {
cout << "No" << endl;
return 0;
}
N *= 2;
ll n = -1;
for (int i = 1; i * i <= N; i++) {
if (N % i != 0)
continue;
if (N / i != i + 1)
continue;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,021,394 | 1,021,395 | u705230587 | cpp |
p03230 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#includ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#includ... | [] | 1,021,405 | 1,021,406 | u117348081 | cpp |
p03230 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#inclu... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#inclu... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,021,413 | 1,021,414 | u080318287 | cpp |
p03230 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,021,415 | 1,021,416 | u916974091 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define eb(t) emplace_back(t)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1000000009;
void solve() {
ll n;
cin >> n;
if (n == 1) {
cout << "Yes" << endl;
cout << 1 << en... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define eb(t) emplace_back(t)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1000000009;
void solve() {
ll n;
cin >> n;
if (n == 1) {
cout << "Yes" << endl;
cout << 2 << en... | [
"literal.number.change",
"io.output.change"
] | 1,021,419 | 1,021,420 | u272496669 | cpp |
p03230 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w + 1 == n ? '\n' : ' ');
#define YES co... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w + 1 == n ? '\n' : ' ');
#define YES co... | [
"expression.operation.binary.remove"
] | 1,021,430 | 1,021,431 | u812973725 | cpp |
p03230 | #include <iostream>
#include <vector>
using namespace std;
vector<int> ans[1000];
int main() {
int n;
cin >> n;
bool ok = false;
int r, c;
for (int i = 2; i * (i + 1) / 2 < 200005; i++) {
if (i * (i + 1) / 2 == n) {
r = i;
c = r + 1;
ok = true;
break;
}
}
if (!ok) {
... | #include <iostream>
#include <vector>
using namespace std;
vector<int> ans[1000];
int main() {
int n;
cin >> n;
bool ok = false;
int r, c;
for (int i = 1; i * (i + 1) / 2 < 200005; i++) {
if (i * (i + 1) / 2 == n) {
r = i;
c = r + 1;
ok = true;
break;
}
}
if (!ok) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,021,434 | 1,021,435 | u126361752 | cpp |
p03230 | #include <iostream>
#include <vector>
using namespace std;
vector<int> ans[500];
int main() {
int n;
cin >> n;
bool ok = false;
int r, c;
for (int i = 2; i * (i + 1) / 2 < 100005; i++) {
if (i * (i + 1) / 2 == n) {
r = i;
c = r + 1;
ok = true;
break;
}
}
if (!ok) {
... | #include <iostream>
#include <vector>
using namespace std;
vector<int> ans[1000];
int main() {
int n;
cin >> n;
bool ok = false;
int r, c;
for (int i = 1; i * (i + 1) / 2 < 200005; i++) {
if (i * (i + 1) / 2 == n) {
r = i;
c = r + 1;
ok = true;
break;
}
}
if (!ok) {
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,021,436 | 1,021,435 | u126361752 | cpp |
p03230 | #include <iostream>
#include <vector>
using namespace std;
vector<int> ans[500];
int main() {
int n;
cin >> n;
bool ok = false;
int r, c;
for (int i = 2; i * (i + 1) < 100005; i++) {
if (i * (i + 1) / 2 == n) {
r = i;
c = r + 1;
ok = true;
break;
}
}
if (!ok) {
cout... | #include <iostream>
#include <vector>
using namespace std;
vector<int> ans[1000];
int main() {
int n;
cin >> n;
bool ok = false;
int r, c;
for (int i = 1; i * (i + 1) / 2 < 200005; i++) {
if (i * (i + 1) / 2 == n) {
r = i;
c = r + 1;
ok = true;
break;
}
}
if (!ok) {
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,021,437 | 1,021,435 | u126361752 | cpp |
p03230 | // https://atcoder.jp/contests/tenka1-2018-beginner/tasks/tenka1_2018_d
// D - Crossing
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
template <class T> b... | // https://atcoder.jp/contests/tenka1-2018-beginner/tasks/tenka1_2018_d
// D - Crossing
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
template <class T> b... | [
"literal.number.change",
"call.arguments.change"
] | 1,021,440 | 1,021,441 | u182321487 | cpp |
p03230 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using llong = long long;
llong n;
bool link[5005][5005];
vecto... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using llong = long long;
llong n;
bool link[5005][5005];
vecto... | [] | 1,021,442 | 1,021,443 | u683588090 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using piii = pair<int, pair<int, int>>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
template <typename T> using Graph = vector<vecto... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using piii = pair<int, pair<int, int>>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
template <typename T> using Graph = vector<vecto... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,021,444 | 1,021,445 | u463243362 | cpp |
p03230 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = 100005;
vector<int> ans[MAX_N];
int main() {
int N;
cin >> N;
int k = -1;
for (int i = 1; i <= N; ++i) {
if (i * (i - 1) == 2 * N)
k = i;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = 100005;
vector<int> ans[MAX_N];
int main() {
int N;
cin >> N;
int k = -1;
for (int i = 1; i <= 2 * N; ++i) {
if (i * (i - 1) == 2 * N)
k = i;
... | [
"control_flow.loop.for.condition.change"
] | 1,021,469 | 1,021,470 | u352969025 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k = -1;
for (int i = 1; i < n; i++) {
if ((i * (i + 1)) == 2 * n) {
k = i;
break;
}
}
if (k == -1)
cout << "No" << endl;
else {
vector<vector<int>> res(k + 1, vector<int>(k, 0));
int cnt = 1;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k = -1;
for (int i = 1; i <= n; i++) {
if ((i * (i + 1)) == 2 * n) {
k = i;
break;
}
}
if (k == -1)
cout << "No" << endl;
else {
vector<vector<int>> res(k + 1, vector<int>(k, 0));
int cnt = 1;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,021,473 | 1,021,474 | u747390421 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
ll n;
cin >> n;
for (ll i = 3; i * (i - 1) / 2 <= n; i++) {
if (i * (i - 1) / 2 == n) {
cout << "Yes" << endl;
cout << i << endl;
vector<vector<ll>> a(i - 1, vector<ll>(i - 1));
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
ll n;
cin >> n;
for (ll i = 2; i * (i - 1) / 2 <= n; i++) {
if (i * (i - 1) / 2 == n) {
cout << "Yes" << endl;
cout << i << endl;
vector<vector<ll>> a(i - 1, vector<ll>(i - 1));
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,021,483 | 1,021,484 | u718758485 | cpp |
p03230 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
ret... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
ret... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,021,487 | 1,021,488 | u318042557 | cpp |
p03230 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | [
"control_flow.loop.for.condition.change"
] | 1,021,489 | 1,021,490 | u103850114 | cpp |
p03230 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"control_flow.loop.for.condition.change"
] | 1,021,491 | 1,021,490 | u103850114 | cpp |
p03230 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,021,492 | 1,021,490 | u103850114 | cpp |
p03230 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using ll = long long;
using graph = std::vector<std::vector<ll>>;
using namespace std;
int val(int x, int y, int k) {
return (k * (y - 1) - (((y - 2) * (y - 1)) / 2) + x);
}
int main() {
ll... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using ll = long long;
using graph = std::vector<std::vector<ll>>;
using namespace std;
int val(int x, int y, int k) {
return (k * (y - 1) - (((y - 2) * (y - 1)) / 2) + x);
}
int main() {
ll... | [
"expression.operation.binary.add"
] | 1,021,504 | 1,021,505 | u204973596 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
int k;
bool can =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
int k;
bool can =... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,021,506 | 1,021,507 | u366398972 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 1,021,514 | 1,021,515 | u228295160 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
int main(void) {
ll n;
cin >> n;
rep(i, 1, n) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
int main(void) {
ll n;
cin >> n;
rep(i, 1, n + ... | [
"expression.operation.binary.add"
] | 1,021,525 | 1,021,526 | u326152409 | cpp |
p03230 | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m; i >= n; i--)
template <class T> bool maxi(T &a, const T &b) {
if (a < b) {
... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m; i >= n; i--)
template <class T> bool maxi(T &a, const T &b) {
if (a < b) {
... | [
"literal.number.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 1,021,527 | 1,021,528 | u556276145 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using edge = pair<int, ll>;
using graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using edge = pair<int, ll>;
using graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,021,529 | 1,021,530 | u335667012 | cpp |
p03230 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int n;
int main() {
cin >> n;
int ans = 0;
rep(i, n + 2) {
if (i * i - i == n * 2) {
ans = i;
}
}
if (!ans) {
cout << "No\n";
return 0;
}
cout << ans << endl << ans - 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int n;
int main() {
cin >> n;
int ans = 0;
rep(i, n + 2) {
if (i * i - i == n * 2) {
ans = i;
}
}
if (!ans) {
cout << "No\n";
return 0;
}
cout << "Yes\n" << ans << endl... | [
"io.output.change"
] | 1,021,535 | 1,021,536 | u047554023 | cpp |
p03230 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, s, n) for (int i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define res(n) resize(n)
#define rev(v) reverse(v.begin(), v.end())
#define sor(v) sort(v.begin(), v.end())
#define outve(v) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, s, n) for (int i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define res(n) resize(n)
#define rev(v) reverse(v.begin(), v.end())
#define sor(v) sort(v.begin(), v.end())
#define outve(v) ... | [
"call.add"
] | 1,021,537 | 1,021,538 | u668191971 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
for (ll i = 1; i < N; i++) {
if (((i * (i + 1)) / 2 == N)) {
cout << "Yes" << endl << i + 1 << endl;
vector<vector<int>> S(i, vector<int>(i + 1, 0));
int cnt = 1;
for (int j = 0; j < i; j+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
for (ll i = 1; i <= N; i++) {
if (((i * (i + 1)) / 2 == N)) {
cout << "Yes" << endl << i + 1 << endl;
vector<vector<int>> S(i, vector<int>(i + 1, 0));
int cnt = 1;
for (int j = 0; j < i; j... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,021,550 | 1,021,551 | u280114218 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
for (ll i = 1; i < N; i++) {
if (((i * (i + 1)) / 2 == N)) {
cout << "Yes" << endl << i + 1 << endl;
vector<vector<int>> S(i, vector<int>(i + 1, 0));
int cnt = 1;
for (int j = 0; j < i; j+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
for (ll i = 1; i <= N; i++) {
if (((i * (i + 1)) / 2 == N)) {
cout << "Yes" << endl << i + 1 << endl;
vector<vector<int>> S(i, vector<int>(i + 1, 0));
int cnt = 1;
for (int j = 0; j < i; j... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,021,552 | 1,021,551 | u280114218 | cpp |
p03230 | #include <iostream>
#include <set>
using namespace std;
int N;
set<int> ret[100000], zero;
int calc_k(int N) {
for (int i = 1; i <= N; i++) {
if (i * (i - 1) == 2 * N) {
return i;
}
}
return -1;
}
int main() {
cin >> N;
int k = calc_k(N);
if (k == -1) {
cout << "No" << endl;
retur... | #include <iostream>
#include <set>
using namespace std;
int N;
set<int> ret[100000], zero;
int calc_k(int N) {
for (int i = 1; i <= 2 * N; i++) {
if (i * (i - 1) == 2 * N) {
return i;
}
}
return -1;
}
int main() {
cin >> N;
int k = calc_k(N);
if (k == -1) {
cout << "No" << endl;
r... | [
"control_flow.loop.for.condition.change"
] | 1,021,553 | 1,021,554 | u425351967 | cpp |
p03230 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#de... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#de... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,021,555 | 1,021,556 | u698883164 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Yes\n2\n1 1\n1 1\n";
return 0;
}
if (N == 2) {
cout << "No\n";
return 0;
}
int t = 2;
while (t * (t - 1) / 2 < N)
t++;
if (t * (t - 1 / 2 > N)) {
cout << "No... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Yes\n2\n1 1\n1 1\n";
return 0;
}
if (N == 2) {
cout << "No\n";
return 0;
}
int t = 2;
while (t * (t - 1) / 2 < N)
t++;
if (t * (t - 1) / 2 > N) {
cout << "No... | [
"control_flow.branch.if.condition.change"
] | 1,021,557 | 1,021,558 | u548834738 | cpp |
p03230 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
signed main() {
ll n, k, tmp, num;
cin >> n;
tmp = 2;
num = 3;
while (num < n) {
tmp++;
num = (tmp * (tmp + 1)) / 2;
}
if (num != n) {
cout << "No\n";
... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
signed main() {
ll n, k, tmp, num;
cin >> n;
tmp = 1;
num = 1;
while (num < n) {
tmp++;
num = (tmp * (tmp + 1)) / 2;
}
if (num != n) {
cout << "No\n";
... | [
"literal.number.change",
"assignment.value.change"
] | 1,021,559 | 1,021,560 | u352248517 | cpp |
p03230 | #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;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define... | #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;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,021,561 | 1,021,562 | u592686932 | cpp |
p03230 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INFint (1 << 30)
#define BOUND 2718... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INFint (1 << 30)
#define BOUND 2718... | [
"control_flow.loop.for.condition.change"
] | 1,021,563 | 1,021,564 | u991664217 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll n, k;
cin >> n;
bool ok = 0;
rep(i, n) {
if (n == ((i + 1) * i) / 2) {
k = i + 1;
ok = 1;
cout << "Yes" << endl;
break;
}
}
if (!ok) {
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll n, k;
cin >> n;
bool ok = 0;
rep(i, n + 1) {
if (n == ((i + 1) * i) / 2) {
k = i + 1;
ok = 1;
cout << "Yes" << endl;
break;
}
}
if (!ok) {
... | [
"expression.operation.binary.add"
] | 1,021,573 | 1,021,574 | u419307948 | cpp |
p03230 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != m... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != m... | [
"expression.operation.binary.add"
] | 1,021,579 | 1,021,580 | u969116807 | cpp |
p03230 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,021,589 | 1,021,590 | u917282863 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)
#define rFOR(i, a, n) for (int(i) = (n)-1; (i) >= (a); (i)--)
#define erFOR(i, a, n) fo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); (i)++)
#define rFOR(i, a, n) for (int(i) = (n)-1; (i) >= (a); (i)--)
#define erFOR(i, a, n) fo... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,021,595 | 1,021,596 | u863044225 | cpp |
p03230 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,021,610 | 1,021,611 | u261965335 | cpp |
p03230 | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // p... | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // p... | [
"io.output.change"
] | 1,021,616 | 1,021,617 | u933068010 | cpp |
p03230 | /**
*
*/
// header {{{
#include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
#define SFINAE(pred...) std::enable_if_t<(pred), std::nullptr_t> = nullptr
#define ASSERT(expr...) assert((expr))... | /**
*
*/
// header {{{
#include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
#define SFINAE(pred...) std::enable_if_t<(pred), std::nullptr_t> = nullptr
#define ASSERT(expr...) assert((expr))... | [
"identifier.change",
"call.arguments.change"
] | 1,021,621 | 1,021,622 | u254456372 | cpp |
p03230 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iostream>
#include <math.h>
#include <numeric>
#include <utility>
#include <vector>
// #include <atcoder/all>
#define int long long
struct edge {
int to;
int cost;
};
using namespace std;
// using ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iostream>
#include <math.h>
#include <numeric>
#include <utility>
#include <vector>
// #include <atcoder/all>
#define int long long
struct edge {
int to;
int cost;
};
using namespace std;
// using ... | [
"call.add"
] | 1,021,112 | 1,021,113 | u593307566 | cpp |
p03230 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF = 1e18;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
template <class T> inline... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF = 1e18;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
template <class T> inline... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,021,121 | 1,021,122 | u345188429 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.