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 |
|---|---|---|---|---|---|---|---|
p03089 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const int MAX = 1e6;
static const int NIL = -1;
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
bool compPair(const pair<int, int> &arg1, const pair<int, int> &arg2) {
return arg1.first > arg2.first;
}
int main(void) {
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const int MAX = 1e6;
static const int NIL = -1;
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
bool compPair(const pair<int, int> &arg1, const pair<int, int> &arg2) {
return arg1.first > arg2.first;
}
int main(void) {
int ... | [] | 904,073 | 904,074 | u616090453 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#defi... | [
"control_flow.branch.else.remove"
] | 904,075 | 904,076 | u995725911 | cpp |
p03089 | #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... | [
"call.remove"
] | 904,079 | 904,080 | u824337972 | cpp |
p03089 | #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... | [
"call.arguments.change"
] | 904,081 | 904,080 | u824337972 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
vector<int> r(N);
for (int i = N - 1; i >= 0; i--) {
int p = -1;
for (int j = 0; j < N; j++) {
if (v[j] == j + 1)
p = j;
}
if (p == -1) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
vector<int> r(N);
for (int i = N - 1; i >= 0; i--) {
int p = -1;
for (int j = 0; j < v.size(); j++) {
if (v[j] == j + 1)
p = j;
}
if (p ==... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 904,082 | 904,083 | u946322619 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000000 + 7;
//マクロ
//型エイリアス
using ll = long long;
using P = pair<long long, long long>;
using vl = vector<long long>;
//ショートカット
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, k, n) for (int i = k; i < n; i++)
#define all(v) v.begin()... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000000 + 7;
//マクロ
//型エイリアス
using ll = long long;
using P = pair<long long, long long>;
using vl = vector<long long>;
//ショートカット
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, k, n) for (int i = k; i < n; i++)
#define all(v) v.begin()... | [
"misc.opposites",
"assignment.value.change"
] | 904,086 | 904,087 | u652009496 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
int main() {
//
int num;
cin >> num;
vector<int> vec(num);
vector<int> vec2;
for (int i = 0; i < num; i++)
cin >> vec.at(i), vec.at(i)--;
for (int i = 0; i < num; i++) {
int ans = -1;
for (int j = vec.size() - 1; j >= 0; j--) {
if (vec.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
//
int num;
cin >> num;
vector<int> vec(num);
vector<int> vec2;
for (int i = 0; i < num; i++)
cin >> vec.at(i), vec.at(i)--;
for (int i = 0; i < num; i++) {
int ans = -1;
for (int j = vec.size() - 1; j >= 0; j--) {
if (vec.at... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 904,102 | 904,101 | u367131219 | cpp |
p03089 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> b(n);
vector<int> ans;
rep(i, n) { cin >> b[i]; }
int k, k2 = 0;
rep(i, n) {
k = n - i;
rep(j, n) {
if (b[... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> b(n);
vector<int> ans;
rep(i, n) { cin >> b[i]; }
int k, k2 = 0;
rep(i, n) {
k = n - i;
rep(j, n) {
// cou... | [
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 904,110 | 904,111 | u992471673 | cpp |
p03089 | #include <bits/stdc++.h>
#ifdef __DEBUG__
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll =... | #include <bits/stdc++.h>
#ifdef __DEBUG__
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll =... | [
"identifier.change",
"call.function.change"
] | 904,114 | 904,115 | u858670323 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define rrep(i, cc, n) for (int i = cc; i >= n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
int n;
vector<int> a;
v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define rrep(i, cc, n) for (int i = cc; i >= n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
int n;
vector<int> a;
v... | [
"identifier.change",
"call.arguments.change"
] | 904,118 | 904,119 | u330518333 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, start, count) for (int i = (start); i < (int)(count); ++i)
#define rep(i, count) REP(i, 0, count)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<long long> vecll;
typede... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, start, count) for (int i = (start); i < (int)(count); ++i)
#define rep(i, count) REP(i, 0, count)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<long long> vecll;
typede... | [] | 904,124 | 904,125 | u159231764 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> b(N), ans(N, 0);
for (int i = 0; i < N; i++) {
cin >> b[i];
if (b[i] > i + 1) {
cout << -1 << endl;
return 0;
}
}
int num, loc;
for (int i = N - 1; i >= 0; i--) {
num = i - (b[i] - 1);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> b(N), ans(N, 0);
for (int i = 0; i < N; i++) {
cin >> b[i];
if (b[i] > i + 1) {
cout << -1 << endl;
return 0;
}
}
int num, loc;
for (int i = N - 1; i >= 0; i--) {
num = i - (b[i] - 1) + 1;... | [
"assignment.change",
"expression.operation.binary.remove"
] | 904,128 | 904,129 | u912534104 | cpp |
p03087 | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
using namespace std;
int main() {
int n, q;
int x[100010];
for (int r = 0; r < 100010; r++) {
x[r] = 0;
}
cin >> n >> q;
string s;
cin >> s;
pair<int, int> len[q];
for (int i = 0; i < q; i++) {
cin >> l... | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
using namespace std;
int main() {
int n, q;
int x[100010];
for (int r = 0; r < 100010; r++) {
x[r] = 0;
}
cin >> n >> q;
string s;
cin >> s;
pair<int, int> len[q];
for (int i = 0; i < q; i++) {
cin >> l... | [
"control_flow.loop.for.condition.change",
"call.add"
] | 904,138 | 904,139 | u127856129 | cpp |
p03087 | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
using namespace std;
int main() {
int n, q;
int x[100010];
for (int r = 0; r < 100010; r++) {
x[r] = 0;
}
cin >> n >> q;
string s;
cin >> s;
pair<int, int> len[q];
for (int i = 0; i < q; i++) {
cin >> l... | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
using namespace std;
int main() {
int n, q;
int x[100010];
for (int r = 0; r < 100010; r++) {
x[r] = 0;
}
cin >> n >> q;
string s;
cin >> s;
pair<int, int> len[q];
for (int i = 0; i < q; i++) {
cin >> l... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 904,138 | 904,141 | u127856129 | cpp |
p03089 | // 2019.5.15 by ljz
#include <bits/stdc++.h>
using namespace std;
#define res register int
#define LL long long
#define inf 0x3f3f3f3f
#define eps 1e-10
#define RG register
inline int read() {
res s = 0, ch = getchar(), w = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
... | // 2019.5.15 by ljz
#include <bits/stdc++.h>
using namespace std;
#define res register int
#define LL long long
#define inf 0x3f3f3f3f
#define eps 1e-10
#define RG register
inline int read() {
res s = 0, ch = getchar(), w = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
... | [
"identifier.change",
"call.function.change"
] | 904,170 | 904,171 | u920156500 | cpp |
p03089 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int b_tmp;
vector<int> b;
for (int i = 0; i < N; i++) {
cin >> b_tmp;
b.push_back(b_tmp);
}
vector<int> operate;
bool is_continue = true, is_erase = false;
while (is_continue) {
is_erase = false;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int b_tmp;
vector<int> b;
for (int i = 0; i < N; i++) {
cin >> b_tmp;
b.push_back(b_tmp);
}
vector<int> operate;
bool is_continue = true, is_erase = false;
while (is_continue) {
is_erase = false;
... | [
"control_flow.break.add"
] | 904,177 | 904,176 | u785644520 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> b(n), a(n);
for (int i = 0; i < n; i++)
cin >> b[i];
for (int j = 0; j < n; j++) {
for (int i = n - 1; i >= 0; i--) {
if (i + 1 == b[i]) {
a[j] = b[i];
b.erase(b.begin() + i);
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> b(n), a(n);
for (int i = 0; i < n; i++)
cin >> b[i];
for (int j = 0; j < n; j++) {
for (int i = b.size() - 1; i >= 0; i--) {
if (i + 1 == b[i]) {
a[j] = b[i];
b.erase(b.begin() + i);
b... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.add"
] | 904,186 | 904,187 | u513726585 | cpp |
p03089 | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
#define REP(i, N) for (int i = 0; i < N; ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> line(N);
REP(i, N) { cin >> line[i]; }
vector<int> ans;
while (!line.empty()) {
int pl = -1;
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
#define REP(i, N) for (int i = 0; i < N; ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> line(N);
REP(i, N) { cin >> line[i]; }
vector<int> ans;
while (!line.empty()) {
int pl = -1;
... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 904,192 | 904,193 | u074014027 | cpp |
p03089 | /*
-----------------------------------------------------------------------------
Author : ---------------------------------------------------------
UTKARSH SAXENA ---------------------------------------------------------
GOOGLE ---------------------------------------------------------
-----... | /*
-----------------------------------------------------------------------------
Author : ---------------------------------------------------------
UTKARSH SAXENA ---------------------------------------------------------
GOOGLE ---------------------------------------------------------
-----... | [] | 904,201 | 904,202 | u525782412 | cpp |
p03089 | #if defined(LOCAL)
const double _max_double_error = 1e-9;
#include "testutils.h"
#define L(x...) (debug(x, #x))
#define I(x, ...) (x)
#define C(x...) CHECK(x)
#else
#define L(x, ...) (x)
#define I(x, ...) (x)
#define C(x, ...) ;
#endif
#include <algorithm>
#include <bitset>
#include <chrono>
#include <iomanip>
#include... | #if defined(LOCAL)
const double _max_double_error = 1e-9;
#include "testutils.h"
#define L(x...) (debug(x, #x))
#define I(x, ...) (x)
#define C(x...) CHECK(x)
#else
#define L(x, ...) (x)
#define I(x, ...) (x)
#define C(x, ...) ;
#endif
#include <algorithm>
#include <bitset>
#include <chrono>
#include <iomanip>
#include... | [
"control_flow.return.add"
] | 904,203 | 904,204 | u934544251 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
void solve(vector<int> a, vector<int> &b) {
if (a.size() == 0)
return;
for (int i = a.size() - 1; i >= 0; i--) {
if (a[i] == i) {
b.push_back(i);
vector<int> na;
for (int j = 0; j < i; j++)
na.push_back(a[j]);
for (int j = i + 1; ... | #include <bits/stdc++.h>
using namespace std;
void solve(vector<int> a, vector<int> &b) {
if (a.size() == 0)
return;
for (int i = a.size() - 1; i >= 0; i--) {
if (a[i] == i) {
b.push_back(i);
vector<int> na;
for (int j = 0; j < i; j++)
na.push_back(a[j]);
for (int j = i + 1; ... | [
"expression.operation.binary.add"
] | 904,205 | 904,206 | u251828455 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
void solve(vector<int> a, vector<int> &b) {
if (a.size() == 0)
return;
for (int i = a.size() - 1; i >= 0; i--) {
if (a[i] == i) {
b.push_back(i);
vector<int> na;
for (int j = 0; j < i; j++)
na.push_back(a[j]);
for (int j = i + 1; ... | #include <bits/stdc++.h>
using namespace std;
void solve(vector<int> a, vector<int> &b) {
if (a.size() == 0)
return;
for (int i = a.size() - 1; i >= 0; i--) {
if (a[i] == i) {
b.push_back(i);
vector<int> na;
for (int j = 0; j < i; j++)
na.push_back(a[j]);
for (int j = i + 1; ... | [
"expression.operation.binary.add"
] | 904,207 | 904,206 | u251828455 | cpp |
p03089 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int *a, *b, *c;
b = new int[n];
a = new int[n];
c = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
bool flag = 0;
if (a[0])
c[0] = 1;
else
c... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int *a, *b, *c;
b = new int[n];
a = new int[n];
c = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
bool flag = 0;
if (a[0])
c[0] = 1;
else
c... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 904,210 | 904,211 | u211694760 | cpp |
p03089 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main() {
std::cin.sync_with_stdio(false);
std::cin.tie(0);
int n;
cin >> n;
list<char> b;
for (int i = 0; i < n; i++) {
char a;
cin >> a;
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main() {
std::cin.sync_with_stdio(false);
std::cin.tie(0);
int n;
cin >> n;
list<int> b;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change",
"call.remove",
"control_flow.branch.if.condition.change"
] | 904,215 | 904,216 | u487641373 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? ... | [] | 904,217 | 904,218 | u342051078 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 904,219 | 904,218 | u342051078 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? ... | [
"call.arguments.change"
] | 904,220 | 904,221 | u342051078 | cpp |
p03089 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> b(N);
vector<int> ans(N);
ans[0] = 1;
for (int i = 0; i < N; i++) {
cin >> b[i];
}
int j = N - 1;
for (int i = 0; i < N; i++) {
if (b[i] > i + 1) {
cout << -1;
return 0;
}
}... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> b(N);
vector<int> ans(N);
ans[0] = 1;
for (int i = 0; i < N; i++) {
cin >> b[i];
}
int j = N - 1;
for (int i = 0; i < N; i++) {
if (b[i] > i + 1) {
cout << -1;
return 0;
}
}... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.add"
] | 904,226 | 904,227 | u117615163 | cpp |
p03089 | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, n) repi(i, 0, n)
#define rerepi(i, a, b) for (int i = int(a) - 1; i >= b; --i)
#define rerep(i, n) rerepi(i, n, 0)
template <class T> inline bool... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, n) repi(i, 0, n)
#define rerepi(i, a, b) for (int i = int(a) - 1; i >= b; --i)
#define rerep(i, n) rerepi(i, n, 0)
template <class T> inline bool... | [
"expression.operation.binary.add"
] | 904,230 | 904,231 | u952022797 | cpp |
p03089 | // ConsoleApplication1.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, n) repi(i, 0, n)
#define rerepi(i, a, b) for (int i = int(a... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, n) repi(i, 0, n)
#define rerepi(i, a, b) for (int i = int(a) - 1; i >= b; --i)
#define rerep(i, n) rerepi(i, n, 0)
template <class T> inline bool... | [
"expression.operation.binary.add"
] | 904,232 | 904,231 | u952022797 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
int judge(vector<int> array, int n) {
for (int i = 0; i < n; i++) {
if (array.at(i) > i + 1)
return -1;
}
return 1;
}
int find(vector<int> array, int n) {
int ans;
for (int i = n - 1; i > 0; i--) {
if (array[i] == i + 1) {
ans = i;
bre... | #include <bits/stdc++.h>
using namespace std;
int judge(vector<int> array, int n) {
for (int i = 0; i < n; i++) {
if (array.at(i) > i + 1)
return -1;
}
return 1;
}
int find(vector<int> array, int n) {
int ans;
for (int i = n - 1; i >= 0; i--) {
if (array[i] == i + 1) {
ans = i;
br... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 904,233 | 904,234 | u803481017 | cpp |
p03089 | #include <bits/stdc++.h>
#define _ (*istream_iterator<int>(cin))
#define eb emplace_back
#define em emplace
using namespace std;
const int mxn = 1e2 + 10;
vector<int> v(mxn);
stack<int> stk;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n = _;
for (int i = 1; i <= n; i++)
v[i]... | #include <bits/stdc++.h>
#define _ (*istream_iterator<int>(cin))
#define eb emplace_back
#define em emplace
using namespace std;
const int mxn = 1e2 + 10;
vector<int> v(mxn);
stack<int> stk;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n = _;
for (int i = 1; i <= n; i++)
v[i]... | [
"call.function.change",
"control_flow.branch.if.condition.change"
] | 904,240 | 904,241 | u080609335 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
int n, a[100010], b[100010], nn, cnt;
int main() {
cin >> n;
nn = n;
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = i; i <= n; i++) {
int j = nn;
for (; j >= 1; j--)
if (b[j] == j)
break;
if (!j) {
puts("-1");
return... | #include <bits/stdc++.h>
using namespace std;
int n, a[100010], b[100010], nn, cnt;
int main() {
cin >> n;
nn = n;
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = 1; i <= n; i++) {
int j = nn;
for (; j >= 1; j--)
if (b[j] == j)
break;
if (!j) {
puts("-1");
return... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change"
] | 904,253 | 904,254 | u759808436 | cpp |
p03089 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vec... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vec... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 904,258 | 904,259 | u898651494 | cpp |
p03089 | #pragma GCC optimize("Ofast")
#pragma comment(linker, "/stack:200000000")
#include <algorithm>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
const int N = 5100;
const int MOD = 1e9 + 7;... | #pragma GCC optimize("Ofast")
#pragma comment(linker, "/stack:200000000")
#include <algorithm>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
const int N = 5100;
const int MOD = 1e9 + 7;... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 904,260 | 904,261 | u217145434 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | [
"control_flow.branch.if.condition.change"
] | 904,262 | 904,263 | u759266806 | cpp |
p03089 | #include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 904,266 | 904,267 | u419874471 | cpp |
p03089 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pl4 = pair<ll, ll>;
using str = string;
using vpl4 = vector<pair<ll, ll>>;
#define sz size()
#define be begin()
#define en end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define llin... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pl4 = pair<ll, ll>;
using str = string;
using vpl4 = vector<pair<ll, ll>>;
#define sz size()
#define be begin()
#define en end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define llin... | [
"function.return_value.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 904,270 | 904,271 | u614421689 | cpp |
p03089 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ll N;
cin >> N;
vector<ll> a(N), b(N);
vector<ll> d(N);
for (int i = 0; i < N; ++i) {
cin >> b[i];
d[i] = i + 1 - b[i];
... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ll N;
cin >> N;
vector<ll> a(N), b(N);
vector<ll> d(N);
for (int i = 0; i < N; ++i) {
cin >> b[i];
d[i] = i + 1 - b[i];
... | [
"identifier.change",
"io.output.change"
] | 904,290 | 904,291 | u155128304 | cpp |
p03089 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 904,292 | 904,293 | u406225550 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, b;
bool z = true;
cin >> N;
int a[N] = {};
for (int i = 0; i < N; i++) {
cin >> b;
if (b <= i + 1) {
for (int j = i; j < b - 1; j--) {
a[j] = a[j - 1];
}
a[b - 1] = b;
} else {
cout << -1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, b;
bool z = true;
cin >> N;
int a[N] = {};
for (int i = 0; i < N; i++) {
cin >> b;
if (b <= i + 1) {
for (int j = i; j > b - 1; j--) {
a[j] = a[j - 1];
}
a[b - 1] = b;
} else {
cout << -1 << endl;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 904,305 | 904,306 | u785409986 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, b;
bool z = true;
cin >> N;
int a[N] = {};
for (int i = 0; i < N; i++) {
cin >> b;
if (b <= i + 1) {
for (int j = i; j <= b - 1; j--) {
a[j] = a[j - 1];
}
a[b - 1] = b;
} else {
cout << -1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, b;
bool z = true;
cin >> N;
int a[N] = {};
for (int i = 0; i < N; i++) {
cin >> b;
if (b <= i + 1) {
for (int j = i; j > b - 1; j--) {
a[j] = a[j - 1];
}
a[b - 1] = b;
} else {
cout << -1 << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 904,307 | 904,306 | u785409986 | cpp |
p03089 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#inclu... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#inclu... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 904,315 | 904,316 | u495699318 | cpp |
p03089 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> v2(n);
for (int i = 0; i < n; i++) {... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> v2(n);
for (int i = 0; i < n; i++) {... | [
"assignment.value.change",
"identifier.change"
] | 904,317 | 904,318 | u625725849 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
vector<int> ans;
while (b.size() > 0) {
for (int i = b.size() - 1; i >= 0; i--) {
if (b[i] == i + 1) {
ans.push_back(b[i]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
vector<int> ans;
while (b.size() > 0) {
for (int i = b.size() - 1; i >= 0; i--) {
if (b[i] == i + 1) {
ans.push_back(b[i]);
... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.add"
] | 904,319 | 904,320 | u203062059 | cpp |
p03089 | #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
vector<int> V, ans;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = (x << 1) + (x << 3) + ch - '0... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
vector<int> V, ans;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = (x << 1) + (x << 3) + ch - '0... | [
"control_flow.loop.for.initializer.change"
] | 904,337 | 904,338 | u811313083 | cpp |
p03089 | /***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<int, int>
#... | /***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<int, int>
#... | [
"control_flow.break.add"
] | 904,339 | 904,340 | u977365687 | cpp |
p03089 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"identifier.change"
] | 904,345 | 904,346 | u050698451 | cpp |
p03089 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort(v.begin(), v.end())
#define vrev(v) reverse(v.begin(), v.end())
#define P pair
// stoi(s): string to i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort(v.begin(), v.end())
#define vrev(v) reverse(v.begin(), v.end())
#define P pair
// stoi(s): string to i... | [
"call.add"
] | 904,359 | 904,360 | u493080913 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(... | [
"call.remove"
] | 904,361 | 904,362 | u334351654 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
#define forup(i, a, b) for (int i = a; i < b; i++)
#define fordown(i, a, b) for (int i = b - 1; i >= a; i--)
#define foreach(i, c) for (auto &i : (c))
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#ifdef DEBUG
#define dump(v) cerr << "[" #v << ":" << (... | #include <bits/stdc++.h>
using namespace std;
#define forup(i, a, b) for (int i = a; i < b; i++)
#define fordown(i, a, b) for (int i = b - 1; i >= a; i--)
#define foreach(i, c) for (auto &i : (c))
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#ifdef DEBUG
#define dump(v) cerr << "[" #v << ":" << (... | [
"identifier.change",
"io.output.change",
"expression.operation.binary.change"
] | 904,365 | 904,366 | u346692517 | cpp |
p03089 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [
"control_flow.break.add"
] | 904,380 | 904,381 | u468700753 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<vector<int>> G(n + 1);
vector<pair<int, int>> ans;
if (n % 2 == 0) {
for (int now = 1; now <= n; now++) {
for (int to = 1; to < n + 1; to++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<vector<int>> G(n + 1);
vector<pair<int, int>> ans;
if (n % 2 == 0) {
for (int now = 1; now <= n; now++) {
for (int to = 1; to < n + 1; to++... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 904,393 | 904,394 | u619557935 | cpp |
p03090 | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
//#include<atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
//#include<atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per... | [
"assignment.change"
] | 904,395 | 904,396 | u722640678 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> PLL;
typedef pair<P, P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P, VECP, greater<P>> PQP;
typedef priority_queue<ll, VECLL, greater<ll>> PQll;
#define rep(i, a, n) for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> PLL;
typedef pair<P, P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P, VECP, greater<P>> PQP;
typedef priority_queue<ll, VECLL, greater<ll>> PQll;
#define rep(i, a, n) for (... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 904,397 | 904,398 | u129134470 | cpp |
p03090 | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (ll i = 0; i < n; i++)
#define IREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define SENTINEL 2000000000
#define NIL -1
using namespace std;
typedef long long ll;
const ll MAX =... | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (ll i = 0; i < n; i++)
#define IREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define SENTINEL 2000000000
#define NIL -1
using namespace std;
typedef long long ll;
const ll MAX =... | [
"literal.number.change",
"io.output.change"
] | 904,399 | 904,400 | u118875091 | cpp |
p03090 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(var) \
do { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(var) \
do { ... | [
"control_flow.loop.for.initializer.change"
] | 904,401 | 904,402 | u697968316 | cpp |
p03090 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
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++)
#define Clear(a) a = decltype(a)() // queueのclear
#define all(s) (s).begin(), (s).end()
typedef long long ll;
typedef pair<int, int> p;
// co... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
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++)
#define Clear(a) a = decltype(a)() // queueのclear
#define all(s) (s).begin(), (s).end()
typedef long long ll;
typedef pair<int, int> p;
// co... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 904,405 | 904,406 | u425758699 | cpp |
p03090 |
/*****/
#define TRUE true
//#define FALSE false
#include <bits/stdc++.h>
/**/
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
/**/
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<long long, long long>;
templa... |
/*****/
#define TRUE true
//#define FALSE false
#include <bits/stdc++.h>
/**/
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
/**/
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<long long, long long>;
templa... | [
"expression.unary.arithmetic.add"
] | 904,409 | 904,410 | u588369531 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
// const int INF = 2e9;
// const ll INF = 9e18;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
set<pair<int, int>> p;
if (N % 2 == 0) {
for (int i = 1; i <= N / 2; i++) {
p.inse... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
// const int INF = 2e9;
// const ll INF = 9e18;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
set<pair<int, int>> p;
if (N % 2 == 0) {
for (int i = 1; i <= N / 2; i++) {
p.inse... | [
"expression.operation.binary.add"
] | 904,411 | 904,412 | u904131021 | cpp |
p03090 | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
vector<pii> ans;
int n;
int main() {
ios::sync_with_stdio(false);
int i, j;
cin >> n;
if (n & 1) {
for (i = 1; i < n; i++)
ans.push_back(make_pair(i, n));
}
n--;
for (i = 1; i <= n; i++)
... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
vector<pii> ans;
int n;
int main() {
ios::sync_with_stdio(false);
int i, j;
cin >> n;
if (n & 1) {
for (i = 1; i < n; i++)
ans.push_back(make_pair(i, n));
n--;
}
for (i = 1; i <= n; i++)
... | [] | 904,413 | 904,414 | u173958549 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 904,415 | 904,416 | u378702452 | cpp |
p03090 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i > b; i--)
... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i > b; i--)
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 904,417 | 904,418 | u558667782 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, m, n) for (long long i = m; i < n; i++)
#define REP(i, m, n, p) for (long long i = m; i < n; i += p)
#define all(v) v.begin(), v.end()
#define pq priority_queue
#define bcnt(n) __builtin_popcountll(n)
using... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, m, n) for (long long i = m; i < n; i++)
#define REP(i, m, n, p) for (long long i = m; i < n; i += p)
#define all(v) v.begin(), v.end()
#define pq priority_queue
#define bcnt(n) __builtin_popcountll(n)
using... | [
"io.output.newline.add"
] | 904,429 | 904,430 | u513211419 | cpp |
p03090 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"expression.unary.arithmetic.add"
] | 904,431 | 904,432 | u814715203 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N % 2 == 0) {
cout << (N * (N - 2)) / 2 << endl;
for (int i = 1; i <= N - 1; i++) {
for (int j = i + 1; j <= N; j++) {
if (j != N + 1 - i) {
cout << i << " " << j << endl;
}
}
}
} el... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N % 2 == 0) {
cout << (N * (N - 2)) / 2 << endl;
for (int i = 1; i <= N - 1; i++) {
for (int j = i + 1; j <= N; j++) {
if (j != N + 1 - i) {
cout << i << " " << j << endl;
}
}
}
} el... | [
"control_flow.loop.for.initializer.change"
] | 904,439 | 904,440 | u101018317 | cpp |
p03090 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; ... | [
"expression.operation.binary.remove"
] | 904,445 | 904,446 | u449123607 | cpp |
p03090 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 904,449 | 904,450 | u193815565 | cpp |
p03090 | #include "bits/stdc++.h"
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
fo... | #include "bits/stdc++.h"
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
fo... | [
"control_flow.branch.if.condition.change"
] | 904,451 | 904,452 | u554988565 | cpp |
p03090 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < static_cast<long long>(n); i++)
#define repi(i, a, b) \
for (long long i = static_cast<long long>(a); i < static_cast<long long>(b); ... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < static_cast<long long>(n); i++)
#define repi(i, a, b) \
for (long long i = static_cast<long long>(a); i < static_cast<long long>(b); ... | [
"identifier.change",
"call.arguments.change"
] | 904,453 | 904,454 | u897282055 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF (1000000000)
#define MOD (1000000007)
#define MAX (100000)
#define pii pair<int, int>
/////////////////////////////////////////////////////////
class XY... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF (1000000000)
#define MOD (1000000007)
#define MAX (100000)
#define pii pair<int, int>
/////////////////////////////////////////////////////////
class XY... | [
"expression.operation.binary.remove"
] | 904,457 | 904,458 | u855985627 | cpp |
p03090 | #include <algorithm> //STLͨ���㷨
#include <cmath> //������ѧ����
#include <cstdio> //��������/�������
#include <cstring> //�ַ�������
#include <ctime> //�������ʱ��ĺ���
#include <iostream> //����������/���
#include <string> //�ַ�����
#define itn int
#define fro for
#define ll long long
#define reg register... | #include <algorithm> //STLͨ���㷨
#include <cmath> //������ѧ����
#include <cstdio> //��������/�������
#include <cstring> //�ַ�������
#include <ctime> //�������ʱ��ĺ���
#include <iostream> //����������/���
#include <string> //�ַ�����
#define itn int
#define fro for
#define ll long long
#define reg register... | [
"call.arguments.change"
] | 904,459 | 904,460 | u794315108 | cpp |
p03090 | // https://atcoder.jp/contests/agc032/tasks/agc032_b
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pii> v;
if (n % 2 == 1) {
// 五角形のノード 5 は「全部」
for (int i = 1; i < n; i++) {
v.push_back({... | // https://atcoder.jp/contests/agc032/tasks/agc032_b
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pii> v;
if (n % 2 == 1) {
// 五角形のノード 5 は「全部」
for (int i = 1; i < n; i++) {
v.push_back({... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.remove"
] | 904,465 | 904,466 | u858107870 | cpp |
p03090 | // https://atcoder.jp/contests/agc032/tasks/agc032_b
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pii> v;
if (n % 2 == 1) {
for (int i = 1; i < n; i++) {
v.push_back({i, n});
}
}
for... | // https://atcoder.jp/contests/agc032/tasks/agc032_b
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pii> v;
if (n % 2 == 1) {
// 五角形のノード 5 は「全部」
for (int i = 1; i < n; i++) {
v.push_back({... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 904,467 | 904,466 | u858107870 | cpp |
p03090 | // https://atcoder.jp/contests/agc032/tasks/agc032_b
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pii> v;
if (n % 2 == 1) {
for (int i = 1; i < n; i++) {
v.push_back({i, n});
}
}
for... | // https://atcoder.jp/contests/agc032/tasks/agc032_b
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pii> v;
if (n % 2 == 1) {
for (int i = 1; i < n; i++) {
v.push_back({i, n});
}
}
for... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 904,467 | 904,468 | u858107870 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int M = N * (N - 1) / 2 - N / 2;
cout << M << "\n";
if (N % 2 == 1) {
for (int i = 1; i < N; ++i) {
cout << i << " " << N << "\n";
}
N--;
}
for (int i = 1; i <= N / 2; ++i) {
for (int j... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int M = N * (N - 1) / 2 - N / 2;
cout << M << "\n";
if (N % 2 == 1) {
for (int i = 1; i < N; ++i) {
cout << i << " " << N << "\n";
}
N--;
}
for (int i = 1; i < N; ++i) {
for (int j = i ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 904,469 | 904,470 | u590088474 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
// cout << fixed << setprecision(20);
int N;
signed main(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
// cout << fixed << setprecision(20);
int N;
signed main(... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 904,471 | 904,472 | u450832845 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
const unsigned long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = tot * ba... | #include <bits/stdc++.h>
using namespace std;
const unsigned long long MOD = 1000000007LL;
long long GCD(long long a, long long b) { return b == 0 ? a : GCD(b, a % b); }
long long fast_exp(long long base, long long exp) {
long long tot = 1;
for (; exp > 0; exp >>= 1) {
if ((exp & 1) == 1)
tot = tot * ba... | [
"expression.operation.binary.remove"
] | 904,480 | 904,481 | u276568758 | cpp |
p03090 |
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1000000007;
int main() {
int N;
scanf("%d", &N);
if (N % 2 == 0) {
printf("%d\n", N * (N - 2) / 2);
for (int i = 1; i <= N; i++) {
for (int j = i + 1; j <= N; j++) {
if (j != N ... |
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1000000007;
int main() {
int N;
scanf("%d", &N);
if (N % 2 == 0) {
printf("%d\n", N * (N - 2) / 2);
for (int i = 1; i <= N; i++) {
for (int j = i + 1; j <= N; j++) {
if (j != N ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 904,482 | 904,483 | u617987447 | cpp |
p03090 |
#include <bits/stdc++.h>
using namespace std;
// types - only for stuff used a lot
using ll = long long;
#define vv vector
#define Pp pair
// IO
#define get(x) scanf("%d", &x)
#define getl(x) scanf("%lld", &x);
// Operations
#define pb push_back
#define pob pop_back
#define sz(a) int(a.size())
#define re(a, b) a =... |
#include <bits/stdc++.h>
using namespace std;
// types - only for stuff used a lot
using ll = long long;
#define vv vector
#define Pp pair
// IO
#define get(x) scanf("%d", &x)
#define getl(x) scanf("%lld", &x);
// Operations
#define pb push_back
#define pob pop_back
#define sz(a) int(a.size())
#define re(a, b) a =... | [
"assignment.change",
"identifier.change",
"call.arguments.change"
] | 904,486 | 904,487 | u027091475 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
const ll MOD = 1000000007;
const ll HI... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
const ll MOD = 1000000007;
const ll HI... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"expression.operation.binary.remove"
] | 904,488 | 904,489 | u077337864 | cpp |
p03090 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = n * (n - 1) / 2 - n / 2;
cout << ans << endl;
int a[ans], b[ans];
int k = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (i + j != n + 1) {
a[k] = i;
b[k] = j;
k++;
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = n * (n - 1) / 2 - n / 2;
cout << ans << endl;
int a[ans], b[ans];
int k = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (i + j != n / 2 * 2 + 1) {
a[k] = i;
b[k] = j;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 904,492 | 904,493 | u179970156 | cpp |
p03090 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = n * (n - 1) / 2 - n / 2;
cout << ans << endl;
int a[ans], b[ans];
int k = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (i + j != n) {
a[k] = i;
b[k] = j;
k++;
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = n * (n - 1) / 2 - n / 2;
cout << ans << endl;
int a[ans], b[ans];
int k = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (i + j != n / 2 * 2 + 1) {
a[k] = i;
b[k] = j;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 904,494 | 904,493 | u179970156 | cpp |
p03090 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int N = 100 + 10;
int n, cnt;
int main() {
// freopen("a.in","r",stdin);
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int N = 100 + 10;
int n, cnt;
int main() {
// freopen("a.in","r",stdin);
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 904,495 | 904,496 | u076546810 | cpp |
p03090 | #include <algorithm>
#include <cstdio>
#include <cstring>
const int maxn = 100 + 3;
inline int getint() {
bool flag = 0;
register int n = 0;
register char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
flag = 1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
n = ch - '0... | #include <algorithm>
#include <cstdio>
#include <cstring>
const int maxn = 100 + 3;
inline int getint() {
bool flag = 0;
register int n = 0;
register char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
flag = 1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
n = ch - '0... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 904,505 | 904,506 | u424325979 | cpp |
p03090 | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 904,514 | 904,515 | u010004797 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<bool>> edges(n + 1, vector<bool>(n + 1));
int num = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
edges[i][j] = true;
++num;
}
}
if (n % 2 == 0) {
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<bool>> edges(n + 1, vector<bool>(n + 1));
int num = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
edges[i][j] = true;
++num;
}
}
if (n % 2 == 1) {
for (int i = 1; i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 904,516 | 904,517 | u855388123 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
int a[10005], b[10005], cnt;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++) {
if ((n & 1) && j != n + 1 - i || ((n & 1) ^ 1) && j != n - i)
a[++cnt] = i, b[cnt] = j;
}
cout << cnt << endl;
for (int... | #include <bits/stdc++.h>
using namespace std;
int a[10005], b[10005], cnt;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++) {
if ((n & 1) && j != n - i || ((n & 1) ^ 1) && j != n + 1 - i)
a[++cnt] = i, b[cnt] = j;
}
cout << cnt << endl;
for (int... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 904,524 | 904,525 | u088346989 | cpp |
p03090 | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
printf("%d\n", n * (n - 1) / 2 - n / 2);
for (int i = 1; i < n; ++i)
for (int j = i + 1; j <= n; ++j)
if (i + j != n + 1)
printf("%d %d\n", i, j);
return 0;
}
| #include <cstdio>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
printf("%d\n", n * (n - 1) / 2 - n / 2);
for (int i = 1; i < n; ++i)
for (int j = i + 1; j <= n; ++j)
if (i + j != n + 1 - n % 2)
printf("%d %d\n", i, j);
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 904,526 | 904,527 | u359025499 | cpp |
p03090 | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
printf("%d\n", n * (n - 1) / 2 - 2);
for (int i = 1; i < n; ++i)
for (int j = i + 1; j <= n; ++j)
if (i + j != n + 1)
printf("%d %d\n", i, j);
return 0;
}
| #include <cstdio>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
printf("%d\n", n * (n - 1) / 2 - n / 2);
for (int i = 1; i < n; ++i)
for (int j = i + 1; j <= n; ++j)
if (i + j != n + 1 - n % 2)
printf("%d %d\n", i, j);
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 904,528 | 904,527 | u359025499 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
int n;
set<pair<int, int>> s;
int main() {
ios::sync_with_stdio(false);
cin >> n;
if (n & 1) {
for (int i = 1; i < n; i++) {
int x = i;
int y = n - i;
if (x > y)
swap(x, y);
s.insert(make_pair(x, y));
}
} else {
for (int... | #include <bits/stdc++.h>
using namespace std;
int n;
set<pair<int, int>> s;
int main() {
ios::sync_with_stdio(false);
cin >> n;
if (n & 1) {
for (int i = 1; i < n; i++) {
int x = i;
int y = n - i;
if (x > y)
swap(x, y);
s.insert(make_pair(x, y));
}
} else {
for (int... | [
"assignment.change"
] | 904,529 | 904,530 | u353573192 | cpp |
p03090 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> g(n);
if (n % 2 == 0) {
for (int i = 0; i < n / 2; ++i) {
g[i] = i;
g[n - i - 1] = i;
}
} else {
for (int i = 0; i < n / 2; ++i) {
g[i] = i;
g[n - i - 2] = i;
}
g[n ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> g(n);
if (n % 2 == 0) {
for (int i = 0; i < n / 2; ++i) {
g[i] = i;
g[n - i - 1] = i;
}
} else {
for (int i = 0; i < n / 2; ++i) {
g[i] = i;
g[n - i - 2] = i;
}
g[n ... | [
"expression.operation.binary.add"
] | 904,533 | 904,534 | u837745858 | cpp |
p03090 | #include <algorithm>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = ((int)a); i < ((int)n); i++)
#define lli long long int
#define MAX 100000000
#define DEBUG
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1... | #include <algorithm>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = ((int)a); i < ((int)n); i++)
#define lli long long int
#define MAX 100000000
//#define DEBUG
int dx[] = {0, 0, 1, -1};
int dy[] = {1, ... | [] | 904,535 | 904,536 | u992432716 | cpp |
p03090 | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define xx first.first
#define yy first.second
#define __V vector
#define all(x) x.begin(), x.end()
#define mod 998244353ll
// using namespace __gn... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define xx first.first
#define yy first.second
#define __V vector
#define all(x) x.begin(), x.end()
#define mod 998244353ll
// using namespace __gn... | [
"control_flow.branch.if.condition.change"
] | 904,537 | 904,538 | u084411645 | cpp |
p03090 | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#d... | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#d... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 904,541 | 904,542 | u432688695 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long d = n / 2 * 2;
vector<pair<long long, long long>> vp;
for (long long i = 0; i < n; i++) {
for (long long j = i + 1; j < n; j++) {
if (i + j == d + 1)
continue;
vp.push_back(make_pair(i, j));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long d = n / 2 * 2;
vector<pair<long long, long long>> vp;
for (long long i = 0; i < n; i++) {
for (long long j = i + 1; j < n; j++) {
if (i + j + 2 == d + 1)
continue;
vp.push_back(make_pair(i, j));... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 904,543 | 904,544 | u717021668 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> b(N);
for (int i = 0; i < N; i++) {
cin >> b[i];
}
bool can = true;
vector<int> ans(N);
while (b.size() > 0) {
int tmpb = 0;
int tmp = 100000;
for (int i = 0; i < b.size(); i++) {
if (i + 1 == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> b(N);
for (int i = 0; i < N; i++) {
cin >> b[i];
}
bool can = true;
vector<int> ans;
while (b.size() > 0) {
int tmpb = 0;
int tmp = 100000;
for (int i = 0; i < b.size(); i++) {
if (i + 1 == b[i... | [] | 904,549 | 904,550 | u665871498 | cpp |
p03089 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rep(i, j) for (ll i = 0; i < j; i++)
#define repf(i, m, j) for (ll i = m; i < j; i++)
#define pb push_back
#define sort(a) sort(all(a))
int main() {
vector<int> a(100);
vector<int> b(100);
ll N;
ll ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rep(i, j) for (ll i = 0; i < j; i++)
#define repf(i, m, j) for (ll i = m; i < j; i++)
#define pb push_back
#define sort(a) sort(all(a))
int main() {
vector<int> a(100);
vector<int> b(100);
ll N;
ll ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 904,551 | 904,552 | u530497183 | cpp |
p03089 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> b(n);
rep(i, n) cin >> b[i];
vector<int> v;
while (!b.empty()) {
bool ok = false;
for (int i = b.size() - 1; i >= 0; i--) {
if (b[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> b(n);
rep(i, n) cin >> b[i];
vector<int> v;
while (!b.empty()) {
bool ok = false;
for (int i = b.size() - 1; i >= 0; i--) {
if (b[i... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 904,559 | 904,560 | u781091740 | cpp |
p03089 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define ... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.add"
] | 904,561 | 904,562 | u314008046 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.