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;
#define FOR(i, begin, end) for (ll i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (ll i = (begin)-1; i >= (end); i--)
#define IREP(i, n) IFOR(i, n, 0)
#define SORT(a) sort(a.begin(), a.end())
#define ISORT(a) sort(a.begin(), a.en... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, begin, end) for (ll i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (ll i = (begin)-1; i >= (end); i--)
#define IREP(i, n) IFOR(i, n, 0)
#define SORT(a) sort(a.begin(), a.end())
#define ISORT(a) sort(a.begin(), a.en... | [
"call.remove"
] | 904,563 | 904,564 | u973797979 | cpp |
p03089 | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> b(n);
std::vector<int> ans(n);
for (int i = 0; i < n; ++i) {
std::cin >> b[i];
--b[i];
}
for (int i = 0; i < n; ++i) {
int upd = -1;
for (int j = 0, p = 0; j < n; ++j) {
if (b[j] >= 0)
... | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> b(n);
std::vector<int> ans(n);
for (int i = 0; i < n; ++i) {
std::cin >> b[i];
--b[i];
}
for (int i = 0; i < n; ++i) {
int upd = -1;
for (int j = 0, p = 0; j < n; ++j) {
if (b[j] < 0)
c... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 904,565 | 904,566 | u313111801 | cpp |
p03089 | #include <algorithm> // sort
#include <cstring>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
using Graph = vector<vector<ll>>; // グラフ型
//数の書かれた N 個のボ... | #include <algorithm> // sort
#include <cstring>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
using Graph = vector<vector<ll>>; // グラフ型
//数の書かれた N 個のボ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 904,571 | 904,572 | u485731913 | cpp |
p03089 | #include <bits/stdc++.h>
using namespace std;
using lint = int64_t;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) begin(v), end(v)
#define in \
[] { \
lint n... | #include <bits/stdc++.h>
using namespace std;
using lint = int64_t;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) begin(v), end(v)
#define in \
[] { \
lint n... | [
"expression.operation.binary.remove"
] | 904,575 | 904,576 | u151724181 | cpp |
p03089 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N;
cin >> N;
vector<int> v(N), ans;
REP(i, N) cin >> v[i];
for (int i = N; i >= 1; --i) {
int pos = -1;
fo... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N;
cin >> N;
vector<int> v(N), ans;
REP(i, N) cin >> v[i];
for (int i = N; i >= 1; --i) {
int pos = -1;
fo... | [
"control_flow.loop.for.initializer.change"
] | 904,577 | 904,578 | u843175622 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define hash dhsjakhd
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define hash dhsjakhd
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 904,590 | 904,591 | u791622911 | cpp |
p03090 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vec... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vec... | [
"expression.operation.binary.add"
] | 904,606 | 904,607 | u276479653 | cpp |
p03090 | #include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main() {
int n;
cin >> n;
if (n & 1) {
cout << (n - 1) * (n - 3) / 2 + n - 1 << endl;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (i + j != n) {
cout << i << " " << j << endl;
... | #include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main() {
int n;
cin >> n;
if (n & 1) {
cout << (n - 1) * (n - 3) / 2 + n - 1 << endl;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (i + j != n) {
cout << i << " " << j << endl;
... | [
"literal.number.change",
"io.output.change"
] | 904,608 | 904,609 | u891482208 | cpp |
p03090 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define ll long long
#define mp make_pair
using namespace std;
ll read() {
ll x = 0, f ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define ll long long
#define mp make_pair
using namespace std;
ll read() {
ll x = 0, f ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.for.initializer.change"
] | 904,610 | 904,611 | u543967420 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 904,614 | 904,615 | u744755176 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
int l[1200000], r[1200000];
int a[1200], tot, n, ans[1200];
int solve() {
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (i + j != n + 1) {
tot++;
l[tot] = i;
r[tot] = j;
}
}
}
printf("%d\n", tot);
fo... | #include <bits/stdc++.h>
using namespace std;
int l[1200000], r[1200000];
int a[1200], tot, n, ans[1200];
int solve() {
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (i + j != n + 1) {
tot++;
l[tot] = i;
r[tot] = j;
}
}
}
printf("%d\n", tot);
fo... | [
"call.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"call.add"
] | 904,616 | 904,617 | u218946416 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
int l[1200000], r[1200000];
int a[1200], tot, n, ans[1200];
int solve() {
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (i + j != n + 1) {
tot++;
l[tot] = i;
r[tot] = j;
}
}
}
printf("%d\n", tot);
fo... | #include <bits/stdc++.h>
using namespace std;
int l[1200000], r[1200000];
int a[1200], tot, n, ans[1200];
int solve() {
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (i + j != n + 1) {
tot++;
l[tot] = i;
r[tot] = j;
}
}
}
printf("%d\n", tot);
fo... | [
"control_flow.branch.if.condition.change",
"call.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"call.add"
] | 904,618 | 904,617 | u218946416 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
int l[1200], r[1200];
int a[1200], tot, n, ans[1200];
int solve() {
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (i + j != n + 1) {
tot++;
l[tot] = i;
r[tot] = j;
}
}
}
printf("%d\n", tot);
for (int... | #include <bits/stdc++.h>
using namespace std;
int l[1200000], r[1200000];
int a[1200], tot, n, ans[1200];
int solve() {
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (i + j != n + 1) {
tot++;
l[tot] = i;
r[tot] = j;
}
}
}
printf("%d\n", tot);
fo... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change",
"call.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"call.add"
] | 904,619 | 904,617 | u218946416 | cpp |
p03090 | #include <iostream>
using namespace std;
int main() {
int N, i, j;
cin >> N;
cout << N * (N - 1) - N / 2 << endl;
for (i = 0; i < N - 1; i++) {
for (j = i + 1; j < N; j++) {
if (i + j != N / 2 * 2 - 1)
cout << i + 1 << " " << j + 1 << endl;
}
}
}
| #include <iostream>
using namespace std;
int main() {
int N, i, j;
cin >> N;
cout << N * (N - 1) / 2 - N / 2 << endl;
for (i = 0; i < N - 1; i++) {
for (j = i + 1; j < N; j++) {
if (i + j != N / 2 * 2 - 1)
cout << i + 1 << " " << j + 1 << endl;
}
}
}
| [
"expression.operation.binary.add"
] | 904,620 | 904,621 | u956908227 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define caseout(i, x) cout << "Case #" << i << ": " << x << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define caseout(i, x) cout << "Case #" << i << ": " << x << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
... | [
"expression.operation.binary.remove"
] | 904,623 | 904,624 | u604231488 | cpp |
p03090 | #include <iostream>
using namespace std;
int main() {
int n, e;
cin >> n;
e = (n / 2 ? n : n + 1);
cout << n * (n - 1) / 2 - (n - 2) << endl;
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
if (i + j != e)
cout << i << " " << j << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, e;
cin >> n;
e = (n % 2 ? n : (n + 1));
cout << n * (n - 1) / 2 - n / 2 << endl;
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
if (i + j != e)
cout << i << " " << j << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"io.output.change"
] | 904,627 | 904,628 | u612175324 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const char sp = ' ';
const char cmm = ',';
const int MOD = 1000000007;
using ll = long long;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const char sp = ' ';
const char cmm = ',';
const int MOD = 1000000007;
using ll = long long;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return ... | [] | 904,633 | 904,634 | u306142032 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a) for (int i = 0; i < (a); i++)
const ll MOD = 1000000007;
int E[111][111];
int main() {
int N;
cin >> N;
int cnt = 0;
rep(i, N) rep(j, N) {
if (i >= j)
continue;
if (N % 2 && i + j + 2 != N)
E[i][j] = 1, c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a) for (int i = 0; i < (a); i++)
const ll MOD = 1000000007;
int E[111][111];
int main() {
int N;
cin >> N;
int cnt = 0;
rep(i, N) rep(j, N) {
if (i >= j)
continue;
if (N % 2 && i + j + 2 != N)
E[i][j] = 1, c... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 904,637 | 904,638 | u046768272 | cpp |
p03090 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <iterator>
#include <set>
using namespace std;
using namespace __gnu_pbds;
#define ft first
#define sd second
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#defi... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <iterator>
#include <set>
using namespace std;
using namespace __gnu_pbds;
#define ft first
#define sd second
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#defi... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 904,639 | 904,640 | u888735570 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
typedef long long ll;
typedef pair<int, int> P;
typedef struct {
int first;
int second;
int third;
} T;
//昇順
bool comp_Se(T &l, T &r) { return l.second < r.second; }
int main(void) {
int N;
cin >> N;
cout << N * (N - 1... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
typedef long long ll;
typedef pair<int, int> P;
typedef struct {
int first;
int second;
int third;
} T;
//昇順
bool comp_Se(T &l, T &r) { return l.second < r.second; }
int main(void) {
int N;
cin >> N;
cout << N * (N - 1... | [] | 904,647 | 904,648 | u069450081 | cpp |
p03090 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
u... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
u... | [
"expression.operation.binary.remove"
] | 904,653 | 904,654 | u050865477 | cpp |
p03090 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N;
cin >> N;
int graph[N][N];
rep(i, 0, N) rep(j, 0, N) graph[i][j] = 1;
rep(i, 0, N) graph[i][i] ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N;
cin >> N;
int graph[N][N];
rep(i, 0, N) rep(j, 0, N) graph[i][j] = 1;
rep(i, 0, N) graph[i][i] ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 904,661 | 904,662 | u157322125 | cpp |
p03090 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
vector<int> a, b;
if (n % 2 == 1) {
for (int i = 0; i < n - 1; i++) {
a.push_back(i + 1);
b.push_back(n);
}
for (int i = 1; i <= n - 1; i++) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
vector<int> a, b;
if (n % 2 == 1) {
for (int i = 0; i < n - 1; i++) {
a.push_back(i + 1);
b.push_back(n);
}
for (int i = 1; i <= n - 1; i++) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 904,674 | 904,673 | u921168761 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pii;
typedef pair<llint, llint> pll;
typedef vector<int> vi;
typedef vector<llint> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define ci cin
#define co cout
#define en endl
#define ln cout << '\n'
#define rep... | #include <bits/stdc++.h>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pii;
typedef pair<llint, llint> pll;
typedef vector<int> vi;
typedef vector<llint> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define ci cin
#define co cout
#define en endl
#define ln cout << '\n'
#define rep... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 904,677 | 904,678 | u966921248 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline void init(T &x) {
x = 0;
char ch = getchar();
bool t = 0;
for (; ch > '9' || ch < '0'; ch = getchar())
if (ch == '-')
t = 1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = (x << 1) + (x << 3) + (ch - 48);
if (t)
x ... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline void init(T &x) {
x = 0;
char ch = getchar();
bool t = 0;
for (; ch > '9' || ch < '0'; ch = getchar())
if (ch == '-')
t = 1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = (x << 1) + (x << 3) + (ch - 48);
if (t)
x ... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 904,685 | 904,686 | u142717651 | cpp |
p03090 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
using lli = long long int... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
using lli = long long int... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 904,689 | 904,690 | u090994275 | cpp |
p03090 | #include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
ll N;
void input() {
// cin >> ... | #include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
ll N;
void input() { cin >> N; }
vo... | [
"assignment.change"
] | 904,697 | 904,698 | u500092662 | cpp |
p03090 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
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 = 1; j < n + 1; j++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
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 + 1; j++) {
... | [
"control_flow.loop.for.initializer.change"
] | 904,700 | 904,701 | u467826805 | cpp |
p03090 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
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 = 1; j < n + 1; j++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
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 + 1; j++) {
... | [
"control_flow.loop.for.initializer.change"
] | 904,702 | 904,701 | u467826805 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N % 2 == 1) {
cout << (N - 1) * (N - 1) / 2 << endl;
for (int i = 1; i < N; i++) {
for (int j = i; j <= N; j++) {
if (i + j != N) {
cout << i << " " << j << endl;
}
}
}
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N % 2 == 1) {
cout << (N - 1) * (N - 1) / 2 << endl;
for (int i = 1; i < N; i++) {
for (int j = i + 1; j <= N; j++) {
if (i + j != N) {
cout << i << " " << j << endl;
}
}
}
} else {... | [
"control_flow.loop.for.initializer.change"
] | 904,712 | 904,713 | u045811375 | cpp |
p03088 | #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... | [] | 904,716 | 904,717 | u406225550 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e2 + 5;
const int mod = 1e9 + 7;
// head
const char s[] = "ATGC";
const int maxsta = 64;
int n, dp[maxn][maxsta];
bool Check(int i, int j, int k) {
string str{s[i], s[j], s[k]};
if (str == "AGC" || str == "GAC" || str == "ACG")
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e2 + 5;
const int mod = 1e9 + 7;
// head
const char s[] = "ATGC";
const int maxsta = 64;
int n, dp[maxn][maxsta];
bool Check(int i, int j, int k) {
string str{s[i], s[j], s[k]};
if (str == "AGC" || str == "GAC" || str == "ACG")
... | [
"control_flow.return.add"
] | 904,726 | 904,727 | u138715738 | cpp |
p03088 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0... | [
"literal.number.change",
"assignment.variable.change",
"expression.operation.binary.change"
] | 904,741 | 904,742 | u908318580 | cpp |
p03088 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[101][4][4][4];
signed main() {
int N;
cin >> N;
//長さ0の文字列は一
//０，１，２に関する制約しかないので
// Sは、333Sと考えても問題ない
dp[0][3][3][3] = 1;
int mod = 1000000000 + 7;
//文字列の文字数
for (int len = 0; len < N; len++) {
//最後から1文字目の文字
for (int c1 ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[101][4][4][4];
signed main() {
int N;
cin >> N;
//長さ0の文字列は一
//０，１，２に関する制約しかないので
// Sは、333Sと考えても問題ない
dp[0][3][3][3] = 1; //グローバルにおいてあげると全部0に初期化せれる。
int mod = 1000000000 + 7;
//文字列の文字数
for (int len = 0; len < N; len++) {
//最... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 904,757 | 904,758 | u577926181 | cpp |
p03088 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[101][4][4][4];
signed main() {
int N;
cin >> N;
//長さ0の文字列は一
//０，１，２に関する制約しかないので
// Sは、333Sと考えても問題ない
dp[0][3][3][3] = 1;
int mod = 1'000'000'000 + 7;
//文字列の文字数
for (int len = 0; len < N; len++) {
//最後から1文字目の文字
for (int ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[101][4][4][4];
signed main() {
int N;
cin >> N;
//長さ0の文字列は一
//０，１，２に関する制約しかないので
// Sは、333Sと考えても問題ない
dp[0][3][3][3] = 1; //グローバルにおいてあげると全部0に初期化せれる。
int mod = 1000000000 + 7;
//文字列の文字数
for (int len = 0; len < N; len++) {
//最... | [
"literal.number.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 904,760 | 904,758 | u577926181 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int n;
ll dp[105][4][4][4];
bool valid(int a, int b, int c, int d) {
if (a == 0 && b == 1 && c == 2)
return false; // AGCX
if (a == 1 && b == 0 && c == 2)
return false; // GACX
if (a == 0 && b == 2 && c =... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
int n;
ll dp[105][4][4][4];
bool valid(int a, int b, int c, int d) {
if (a == 0 && b == 1 && c == 2)
return false; // AGCX
if (a == 1 && b == 0 && c == 2)
return false; // GACX
if (a == 0 && b == 2 && c =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.add"
] | 904,761 | 904,762 | u286318237 | cpp |
p03088 | #ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)... | #ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)... | [
"assignment.add"
] | 904,767 | 904,768 | u528744583 | cpp |
p03088 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000000 + 7;
ll dp[100][625];
bool ng[625];
int f(int a, int b, int c, int d) { return a * 125 + b * 25 + c * 5 + d; }
// a:1, g:2, c:3, t:4
int main() {
ll N;
cin >> N;
dp[0][0] = 1;
for (int i = 0; i < 5; ++i) {
ng[f(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000000 + 7;
ll dp[111][625];
bool ng[625];
int f(int a, int b, int c, int d) { return a * 125 + b * 25 + c * 5 + d; }
// a:1, g:2, c:3, t:4
int main() {
ll N;
cin >> N;
dp[0][0] = 1;
for (int i = 0; i < 5; ++i) {
ng[f... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 904,775 | 904,776 | u084968244 | cpp |
p03092 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
ll dp[6000][6000];
int p[6000];
int main() {
int n, a, b;
cin >> n >> a >> b;
rep(i, n) scanf("%d", &p[i]);
memset(dp, 0x3f, sizeof(dp));... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
ll dp[6000][6000];
int p[6000];
int main() {
int n, a, b;
cin >> n >> a >> b;
rep(i, n) scanf("%d", &p[i]);
memset(dp, 0x3f, sizeof(dp));... | [
"expression.operation.binary.add"
] | 904,785 | 904,786 | u781091740 | cpp |
p03092 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#define N 5001
#include <bitset>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <set>
#define ll long long
#define mp make_pair
using namespace std;
ll read() {... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#define N 5001
#include <bitset>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <set>
#define ll long long
#define mp make_pair
using namespace std;
ll read() {... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 904,787 | 904,788 | u543967420 | cpp |
p03092 | /*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄... | /*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 904,803 | 904,804 | u139147798 | cpp |
p03092 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | [
"identifier.change",
"call.arguments.change"
] | 904,811 | 904,812 | u883692173 | cpp |
p03093 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, m, ans, a[500010], mn;
int pd(int mid) {
int i, j;
for (i = mid * 2 + 1, j = n * 2; i <= n * 2; i++, j--)
if (a[i] + a[j] < m)
return 0;
return 1;
}
int main() {
int i, j, l, r, mid;
scanf("%d%d", &n, &m);
for (i = 1; i <= n... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, m, ans, a[500010], mn;
int pd(int mid) {
int i, j;
for (i = mid * 2 + 1, j = n * 2; i <= n * 2; i++, j--)
if (a[i] + a[j] < m)
return 0;
return 1;
}
int main() {
int i, j, l, r, mid;
scanf("%d%d", &n, &m);
for (i = 1; i <= n... | [
"expression.operation.binary.add"
] | 904,825 | 904,826 | u041115493 | cpp |
p03093 | #include <bits/stdc++.h>
using namespace std;
int arr[200005];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int x = 0; x < 2 * n; x++) {
scanf("%d", &arr[x]);
}
sort(arr, arr + 2 * n);
int l = -1;
int r = n;
while (l + 1 < r) {
int mid = (l + r) / 2;
for (int t = mid * 2; 2 * n - 1 + ... | #include <bits/stdc++.h>
using namespace std;
int arr[200005];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int x = 0; x < 2 * n; x++) {
scanf("%d", &arr[x]);
}
sort(arr, arr + 2 * n);
int l = -1;
int r = n;
while (l + 1 < r) {
int mid = (l + r) / 2;
for (int t = mid * 2; 2 * n - 1 + ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 904,842 | 904,843 | u698054178 | cpp |
p03093 | #include <bits/stdc++.h>
using namespace std;
namespace io {
const int l = 1 << 20;
char buf[l], *s, *t, c;
inline void gc() {
if (s == t) {
t = (s = buf) + fread(buf, 1, l, stdin);
c = s == t ? EOF : *s++;
} else
c = *s++;
}
template <class IT> inline void gi(IT &x) {
x = 0;
gc();
while (c < '0' ... | #include <bits/stdc++.h>
using namespace std;
namespace io {
const int l = 1 << 20;
char buf[l], *s, *t, c;
inline void gc() {
if (s == t) {
t = (s = buf) + fread(buf, 1, l, stdin);
c = s == t ? EOF : *s++;
} else
c = *s++;
}
template <class IT> inline void gi(IT &x) {
x = 0;
gc();
while (c < '0' ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 904,855 | 904,856 | u064646788 | cpp |
p03093 | #include <bits/stdc++.h>
using namespace std;
namespace io {
const int l = 1 << 20;
char buf[l], *s, *t, c;
inline void gc() {
if (s == t) {
t = (s = buf) + fread(buf, 1, l, stdin);
c = s == t ? EOF : *s++;
} else
c = *s++;
}
template <class IT> inline void gi(IT &x) {
x = 0;
gc();
while (c < '0' ... | #include <bits/stdc++.h>
using namespace std;
namespace io {
const int l = 1 << 20;
char buf[l], *s, *t, c;
inline void gc() {
if (s == t) {
t = (s = buf) + fread(buf, 1, l, stdin);
c = s == t ? EOF : *s++;
} else
c = *s++;
}
template <class IT> inline void gi(IT &x) {
x = 0;
gc();
while (c < '0' ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 904,857 | 904,856 | u064646788 | cpp |
p03093 | /*
`
`
... | /*
`
`
... | [
"call.arguments.change"
] | 904,858 | 904,859 | u420065047 | cpp |
p03093 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 904,867 | 904,868 | u685892567 | cpp |
p03093 | #include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int n, a[N], m;
bool check(int x) {
for (int i = x * 2 + 1; i <= 2 * n; i++)
if (a[i] + a[2 * n - i + 2 * x + 1] < m)
return false;
return true;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= 2 * n; i++)
scanf("%d"... | #include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int n, a[N], m;
bool check(int x) {
for (int i = x * 2 + 1; i <= 2 * n; i++)
if (a[i] + a[2 * n - i + 2 * x + 1] < m)
return false;
return true;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= 2 * n; i++)
scanf("%d"... | [
"expression.operation.binary.add"
] | 904,881 | 904,882 | u365377749 | cpp |
p03093 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define uint unsigned
#define pii pair<int, int>
#define pll pair<ll, ll>
#define PB push_back
#define fi first
#define se second
#define For(i, j, k) for (int i = (int)(j); i <= (int)(k); i++)
#define Rep(i, j, k) for (int i = (int)(j); i >= (int)(k... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define uint unsigned
#define pii pair<int, int>
#define pll pair<ll, ll>
#define PB push_back
#define fi first
#define se second
#define For(i, j, k) for (int i = (int)(j); i <= (int)(k); i++)
#define Rep(i, j, k) for (int i = (int)(j); i >= (int)(k... | [
"expression.operation.binary.add"
] | 904,884 | 904,885 | u408603320 | cpp |
p03093 | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, M, a[2 * N];
int main() {
scanf("%d%d", &n, &M);
for (int i = 1; i <= 2 * n; ++i)
scanf("%d", a + i);
sort(a + 1, a + 1 + 2 * n);
int b = 0;
for (int i = 2 * n, j = 0; i; --i) {
while (j < i && a[i] + a[j] < M)
++j;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, M, a[2 * N];
int main() {
scanf("%d%d", &n, &M);
for (int i = 1; i <= 2 * n; ++i)
scanf("%d", a + i);
sort(a + 1, a + 1 + 2 * n);
int b = 0;
for (int i = 2 * n, j = 0; i; --i) {
while (j < i && a[i] + a[j] < M)
++j;
... | [
"control_flow.loop.for.condition.change",
"assignment.change"
] | 904,886 | 904,887 | u760178976 | cpp |
p03093 | #include <bits/stdc++.h>
#define fo(i, x, y) for (int i = x, B = y; i <= B; i++)
#define ff(i, x, y) for (int i = x, B = y; i < B; i++)
#define fd(i, x, y) for (int i = x, B = y; i >= B; i--)
#define ll long long
#define pp printf
#define hh pp("\n")
using namespace std;
const int N = 2e5 + 5;
int n, mo, a[N], as;
i... | #include <bits/stdc++.h>
#define fo(i, x, y) for (int i = x, B = y; i <= B; i++)
#define ff(i, x, y) for (int i = x, B = y; i < B; i++)
#define fd(i, x, y) for (int i = x, B = y; i >= B; i--)
#define ll long long
#define pp printf
#define hh pp("\n")
using namespace std;
const int N = 2e5 + 5;
int n, mo, a[N], as;
i... | [
"assignment.change"
] | 904,891 | 904,892 | u173123334 | cpp |
p03093 | #include <bits/stdc++.h>
using std::max;
using std::min;
int n, m, a[200005], ans = 0, Ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n * 2; i++)
scanf("%d", &a[i]);
std::sort(a + 1, a + 2 * n + 1);
int l = 0, r = n;
while (l <= r) {
int mid = (l + r) >> 1;
bool f = true;
int t ... | #include <bits/stdc++.h>
using std::max;
using std::min;
int n, m, a[200005], ans = 0, Ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n * 2; i++)
scanf("%d", &a[i]);
std::sort(a + 1, a + 2 * n + 1);
int l = 0, r = n;
while (l <= r) {
int mid = (l + r) >> 1;
bool f = true;
int t ... | [
"assignment.value.change",
"identifier.change"
] | 904,899 | 904,900 | u754587701 | cpp |
p03093 | #include <bits/stdc++.h>
using std::max;
using std::min;
int n, m, a[40005], ans = 0, Ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n * 2; i++)
scanf("%d", &a[i]);
std::sort(a + 1, a + 2 * n + 1);
int l = 0, r = n;
while (l <= r) {
int mid = (l + r) >> 1;
bool f = true;
int t =... | #include <bits/stdc++.h>
using std::max;
using std::min;
int n, m, a[200005], ans = 0, Ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n * 2; i++)
scanf("%d", &a[i]);
std::sort(a + 1, a + 2 * n + 1);
int l = 0, r = n;
while (l <= r) {
int mid = (l + r) >> 1;
bool f = true;
int t ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.change"
] | 904,901 | 904,900 | u754587701 | cpp |
p03091 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#i... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 904,911 | 904,912 | u479082130 | cpp |
p03092 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, a, b, num[5007], dp[5007][5007], res = 1e18;
int read() {
int num = 0;
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
num = num * 10 + c - '0', c = getchar();
return num;
}
signed mai... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, a, b, num[5007], dp[5007][5007], res = 1e18;
int read() {
int num = 0;
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
num = num * 10 + c - '0', c = getchar();
return num;
}
signed mai... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 904,925 | 904,926 | u816631826 | cpp |
p03092 | // minamoto
#include <bits/stdc++.h>
#define R register
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
template <class T> inline bool cmax(T &a, const T &b) {
re... | // minamoto
#include <bits/stdc++.h>
#define R register
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
template <class T> inline bool cmax(T &a, const T &b) {
re... | [
"call.arguments.change"
] | 904,933 | 904,934 | u561765782 | cpp |
p03092 | #include <bits/stdc++.h>
#define RI register int
typedef long long LL;
#define int LL
#define FILEIO(name) \
freopen(name ".in", "r", stdin), freopen(name ".out", "w", stdout);
using namespace std;
char buf[1000000], *p1 = buf, *p2 = buf;
inline char gc() {... | #include <bits/stdc++.h>
#define RI register int
typedef long long LL;
#define int LL
#define FILEIO(name) \
freopen(name ".in", "r", stdin), freopen(name ".out", "w", stdout);
using namespace std;
char buf[1000000], *p1 = buf, *p2 = buf;
inline char gc() {... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 904,940 | 904,941 | u465426617 | cpp |
p03092 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N = 5e3 + 10;
int N, P[MAX_N], pre2d[MAX_N][MAX_N];
ll A, B, F[MAX_N];
int count(int x1, int x2, int y1, int y2) {
return pre2d[x2][y2] - pre2d[x2][y1 - 1] - pre2d[x1 - 1][y2] +
pre2d[x1 - 1][y1 - 1];
}
int main() {
sca... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N = 5e3 + 10;
int N, P[MAX_N], pre2d[MAX_N][MAX_N];
ll A, B, F[MAX_N];
int count(int x1, int x2, int y1, int y2) {
return pre2d[x2][y2] - pre2d[x2][y1 - 1] - pre2d[x1 - 1][y2] +
pre2d[x1 - 1][y1 - 1];
}
int main() {
sca... | [
"call.arguments.change"
] | 904,944 | 904,945 | u557835351 | cpp |
p03092 | /*
shiftʵÖÊÉÏÊÇ°ÑÒ»¸öÔªËØÍùÇ°ÒÆ»òÕßÍùºóÒÆ
¿¼ÂÇÈç¹ûÈ·¶¨Ò»Ð©ÔªËز»¶¯µÄ»°£¨ÏÔÈ»ËüÃǵÄϱêºÍÖµ¶¼µ¥Ôö£©£¬ÄÇô¶ÔÓÚÏàÁÚÁ½¸öÈ·¶¨²»¶¯µÄÔªËØaºÍbÖ®¼äµÄÔªËØx£¬»áÓÐÈçÏÂÊ£º
(1)P[x] < P[a]£¬ÄÇôÐèÒª°ÑP[x]ÍùÇ°ÒÆ
(2)P[b] < P[x]£¬ÄÇôÐèÒª°ÑP[x]ÍùºóÒÆ
(3)ʣϵÄËùÓÐP[a] < P[x] < P[b]µÄÔªËØ£¬¿ÉÒÔÈ«ÓÃmin(A, B)µÄ´ú¼ÛÅźÃÐò
Ö±½Ódp¼´¿É
*/
#... | /*
shiftʵÖÊÉÏÊÇ°ÑÒ»¸öÔªËØÍùÇ°ÒÆ»òÕßÍùºóÒÆ
¿¼ÂÇÈç¹ûÈ·¶¨Ò»Ð©ÔªËز»¶¯µÄ»°£¨ÏÔÈ»ËüÃǵÄϱêºÍÖµ¶¼µ¥Ôö£©£¬ÄÇô¶ÔÓÚÏàÁÚÁ½¸öÈ·¶¨²»¶¯µÄϱêaºÍbÖ®¼äµÄϱêx(a
< x < b)£¬»áÓÐÈçÏÂÊ£º (1)P[x] < P[a]£¬ÄÇôÐèÒª°ÑP[x]ÍùÇ°ÒÆ (2)P[b] <
P[x]£¬ÄÇôÐèÒª°ÑP[x]ÍùºóÒÆ (3)ʣϵÄËùÓÐP[a] < P[x] < P[b]µÄÔªËØ£¬¿ÉÒÔÈ«ÓÃmin(A,
B)µÄ´ú¼ÛÅźÃÐò Ö±½Ód... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 904,951 | 904,952 | u710399266 | cpp |
p03092 | // copy from https://atcoder.jp/contests/agc037/submissions/7059910
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define mem(x, v) memset(x, v, sizeof(x))
#define Rep(i, a, b) for (register int i = (a); i <= int(b); ++i)
#define rep(i, a, b) for (register int i = (a); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define mem(x, v) memset(x, v, sizeof(x))
#define Rep(i, a, b) for (register int i = (a); i <= int(b); ++i)
#define rep(i, a, b) for (register int i = (a); i < int(b); ++i)
#define Dep(i, a, b) for (register int i = (a); i >... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 904,956 | 904,957 | u454243544 | cpp |
p03092 | #include <bits/stdc++.h>
#define LL long long
#define pa pair<int, int>
using namespace std;
const int N = 5001;
const int inf = 2147483647;
int _max(int x, int y) { return x > y ? x : y; }
LL _min(LL x, LL y) { return x < y ? x : y; }
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' |... | #include <bits/stdc++.h>
#define LL long long
#define pa pair<int, int>
using namespace std;
const int N = 5001;
const int inf = 2147483647;
int _max(int x, int y) { return x > y ? x : y; }
LL _min(LL x, LL y) { return x < y ? x : y; }
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' |... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 904,966 | 904,967 | u255836250 | cpp |
p03092 | #include <bits/stdc++.h>
using namespace std;
const int N = 5678;
const long long llinf = 1e18;
int n, a, b, p[N];
long long dp[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b;
for (int i = 1; i <= n; ++i) {
cin >> p[i];
}
++n;
p[n] = n;
fill(dp + 1, d... | #include <bits/stdc++.h>
using namespace std;
const int N = 5678;
const long long llinf = 1e18;
int n, a, b, p[N];
long long dp[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b;
for (int i = 1; i <= n; ++i) {
cin >> p[i];
}
++n;
p[n] = n;
fill(dp + 1, d... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 904,968 | 904,969 | u303142406 | cpp |
p03091 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
#define N 100010
int fa[N], du[N];
int a[N], b[N];
vector<int> d4;
int get_fa(int x) { return fa[x] == x ? x : fa[x] = get_fa(fa[x]); }
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
#define N 100010
int fa[N], du[N];
int a[N], b[N];
vector<int> d4;
int get_fa(int x) { return fa[x] == x ? x : fa[x] = get_fa(fa[x]); }
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf(... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 905,009 | 905,010 | u820628270 | cpp |
p03091 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> G[100000];
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> G[100000];
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 905,011 | 905,012 | u989740992 | cpp |
p03091 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> G[100000];
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> G[100000];
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"assignment.variable.change",
"identifier.change"
] | 905,013 | 905,012 | u989740992 | cpp |
p03091 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> G[100000];
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> G[100000];
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 905,014 | 905,012 | u989740992 | cpp |
p03091 | #include <bits/stdc++.h>
#define _ (*istream_iterator<int>(cin))
#define em emplace
using namespace std;
const int N = 1e5 + 10;
set<int> g[N];
int deg[N];
int dfs(int u, int p, int s, int t) {
if (u == s && u != p)
return -1;
if (u == t)
return 1;
for (auto i = g[u].begin(); i != g[u].end();) {
in... | #include <bits/stdc++.h>
#define _ (*istream_iterator<int>(cin))
#define em emplace
using namespace std;
const int N = 1e5 + 10;
set<int> g[N];
int deg[N];
int dfs(int u, int p, int s, int t) {
if (u == s && u != p)
return -1;
if (u == t)
return 1;
for (auto i = g[u].begin(); i != g[u].end();) {
in... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 905,015 | 905,016 | u080609335 | cpp |
p03091 | #include <bits/stdc++.h>
using namespace std;
int N, M, ap[100009];
bool dp[20];
vector<int> h, v[100009];
int cnt2 = 0, ever6 = 0;
void dfs(int nod) {
ap[nod] = 1;
ever6 |= (v[nod].size() > 4);
if (v[nod].size() > 2)
cnt2++;
for (auto it : v[nod])
if (ap[it] == 0)
dfs(it);
}
void delEdge(int ... | #include <bits/stdc++.h>
using namespace std;
int N, M, ap[100009];
bool dp[20];
vector<int> h, v[100009];
int cnt2 = 0, ever6 = 0;
void dfs(int nod) {
ap[nod] = 1;
ever6 |= (v[nod].size() > 4);
if (v[nod].size() > 2)
cnt2++;
for (auto it : v[nod])
if (ap[it] == 0)
dfs(it);
}
void delEdge(int ... | [
"call.function.change",
"control_flow.branch.if.condition.change"
] | 905,021 | 905,022 | u098930106 | cpp |
p03091 | #include <bits/stdc++.h>
using namespace std;
int N, M, ap[100009];
bool dp[20];
vector<int> h, v[100009];
int cnt2 = 0, ever6 = 0;
void dfs(int nod) {
ap[nod] = 1;
ever6 |= (v[nod].size() > 6);
if (v[nod].size() > 2)
cnt2++;
for (auto it : v[nod])
if (ap[it] == 0)
dfs(it);
}
void delEdge(int ... | #include <bits/stdc++.h>
using namespace std;
int N, M, ap[100009];
bool dp[20];
vector<int> h, v[100009];
int cnt2 = 0, ever6 = 0;
void dfs(int nod) {
ap[nod] = 1;
ever6 |= (v[nod].size() > 4);
if (v[nod].size() > 2)
cnt2++;
for (auto it : v[nod])
if (ap[it] == 0)
dfs(it);
}
void delEdge(int ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 905,023 | 905,022 | u098930106 | cpp |
p03091 | #include <bits/stdc++.h>
using namespace std;
#define inf 2000000000 // 1e17
// 0-indexed
template <class T> struct Dinic {
struct edge {
int to;
T cap;
int rev;
};
vector<vector<edge>> lst;
vector<int> completed;
vector<int> dist;
Dinic(int n = 1) {
// if 1-indexed
//++n;
lst.resize... | #include <bits/stdc++.h>
using namespace std;
#define inf 2000000000 // 1e17
// 0-indexed
template <class T> struct Dinic {
struct edge {
int to;
T cap;
int rev;
};
vector<vector<edge>> lst;
vector<int> completed;
vector<int> dist;
Dinic(int n = 1) {
// if 1-indexed
//++n;
lst.resize... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 905,027 | 905,028 | u269963329 | cpp |
p03091 | #include <bits/stdc++.h>
using namespace std;
#define inf 2000000000 // 1e17
// 0-indexed
template <class T> struct Dinic {
struct edge {
int to;
T cap;
int rev;
};
vector<vector<edge>> lst;
vector<int> completed;
vector<int> dist;
Dinic(int n = 1) {
// if 1-indexed
//++n;
lst.resize... | #include <bits/stdc++.h>
using namespace std;
#define inf 2000000000 // 1e17
// 0-indexed
template <class T> struct Dinic {
struct edge {
int to;
T cap;
int rev;
};
vector<vector<edge>> lst;
vector<int> completed;
vector<int> dist;
Dinic(int n = 1) {
// if 1-indexed
//++n;
lst.resize... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 905,029 | 905,028 | u269963329 | cpp |
p03091 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 905,037 | 905,038 | u354336886 | cpp |
p03091 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 905,039 | 905,038 | u354336886 | cpp |
p03091 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | [] | 905,047 | 905,048 | u895971408 | cpp |
p03091 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD (ll)(1e9 + 7)
ll N, M;
ll i, j, a;
vector<ll> rv[101010];
vecto... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD (ll)(1e9 + 7)
ll N, M;
ll i, j, a;
vector<ll> rv[101010];
vecto... | [] | 905,064 | 905,065 | u259396003 | cpp |
p03091 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9 + 7;
signed main() {
int n, m, a, b;
cin >> n >> m;
vector<int> hen[n];
for (int i = 0; i < m; i++) {
cin >> a >> b;
hen[a - 1].push_back(b - 1);
hen[b - 1].push_back(a - 1);
}
vector<int> hen4;
int t = 0;
int ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9 + 7;
signed main() {
int n, m, a, b;
cin >> n >> m;
vector<int> hen[n];
for (int i = 0; i < m; i++) {
cin >> a >> b;
hen[a - 1].push_back(b - 1);
hen[b - 1].push_back(a - 1);
}
vector<int> hen4;
int t = 0;
int ... | [] | 905,075 | 905,076 | u651317892 | cpp |
p03091 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
const ll INF = 99999999999999999;
ll a, b, c, d, e, f, ans = 0, xx, yy;
vl s;
vl g[200000];
void dfs(int x, int y) {
if (x == yy) {
s.pus... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
const ll INF = 99999999999999999;
ll a, b, c, d, e, f, ans = 0, xx, yy;
vl s;
vl g[200000];
void dfs(int x, int y) {
if (x == yy) {
s.pus... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 905,079 | 905,080 | u268571052 | cpp |
p03091 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#de... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#de... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.return.remove",
"control_flow.break.add"
] | 905,083 | 905,082 | u152129372 | cpp |
p03093 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, mod, a[N];
int calcmin(int l, int r) {
int Min = mod << 1;
for (int _l = l, _r = r; _l <= _r; _l++, _r--) {
// printf("__ %d %d %d [%d\n",_l,_r,a[_l]+a[_r],Min);
Min = min(Min, a[_l] + a[_r]);
}
return Min;
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, mod, a[N];
int calcmin(int l, int r) {
int Min = mod << 1;
for (int _l = l, _r = r; _l <= _r; _l++, _r--) {
// printf("__ %d %d %d [%d\n",_l,_r,a[_l]+a[_r],Min);
Min = min(Min, a[_l] + a[_r]);
}
return Min;
}
int main() {
... | [
"expression.operation.binary.remove"
] | 905,107 | 905,108 | u076784075 | cpp |
p03093 | #include <bits/stdc++.h>
#define ll long long
#define uint unsigned
#define ull unsigned ll
#define db double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pli pair<ll, int>
#define vi vector<int>
#define vpi vector<pii>
#define IT iterator
#define PB push_back
#define MK make_pair
#define LB lower_bound... | #include <bits/stdc++.h>
#define ll long long
#define uint unsigned
#define ull unsigned ll
#define db double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pli pair<ll, int>
#define vi vector<int>
#define vpi vector<pii>
#define IT iterator
#define PB push_back
#define MK make_pair
#define LB lower_bound... | [
"expression.operation.binary.add"
] | 905,109 | 905,110 | u579191570 | cpp |
p03093 | #include <bits/stdc++.h>
using namespace std;
int N, M;
int a[500005];
bool check1(int Now) {
int L = 1, R = Now;
while (a[L] + a[R] < M && L < R)
L++, R--;
if (a[L] + a[R] >= M)
return false;
return true;
}
bool check2(int Now) {
int L = Now + 1, R = N;
while (a[L] + a[R] >= M && L < R)
L++, R-... | #include <bits/stdc++.h>
using namespace std;
int N, M;
int a[500005];
bool check1(int Now) {
int L = 1, R = Now;
while (a[L] + a[R] < M && L < R)
L++, R--;
if (a[L] + a[R] >= M)
return false;
return true;
}
bool check2(int Now) {
int L = Now + 1, R = N;
while (a[L] + a[R] >= M && L < R)
L++, R-... | [
"assignment.value.change",
"identifier.change"
] | 905,111 | 905,112 | u490732536 | cpp |
p03093 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s s... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s s... | [
"assignment.add"
] | 905,115 | 905,116 | u396284099 | cpp |
p03093 | #include <bits/stdc++.h>
using namespace std;
int num[200005];
bool check(int n, int m, int s) {
int r = 0, d1 = 2 * n;
for (int i = 2 * n; i > 0; i--) {
while (r < 2 * n && num[r + 1] + num[i] <= s)
r++;
if (!r)
d1 = min(d1, i - 1);
else
d1 = min(d1, r + i - 1);
}
r = 0;
int ... | #include <bits/stdc++.h>
using namespace std;
int num[200005];
bool check(int n, int m, int s) {
int r = 0, d1 = 2 * n;
for (int i = 2 * n; i > 0; i--) {
while (r < 2 * n && num[r + 1] + num[i] <= s)
r++;
if (!r)
d1 = min(d1, i - 1);
else
d1 = min(d1, r + i - 1);
}
r = 0;
int ... | [
"assignment.change"
] | 905,117 | 905,118 | u966630585 | cpp |
p03093 | #include <bits/stdc++.h>
using namespace std;
const int N = 200050;
int a[N];
int main() {
int n, m, i;
scanf("%i %i", &n, &m);
for (i = 1; i <= 2 * n; i++)
scanf("%i", &a[i]);
sort(a + 1, a + 1 + n);
int top = n, bot = 0, mid, ans;
while (top >= bot) {
mid = top + bot >> 1;
bool ok = 1;
for... | #include <bits/stdc++.h>
using namespace std;
const int N = 200050;
int a[N];
int main() {
int n, m, i;
scanf("%i %i", &n, &m);
for (i = 1; i <= 2 * n; i++)
scanf("%i", &a[i]);
sort(a + 1, a + 1 + 2 * n);
int top = n, bot = 0, mid, ans;
while (top >= bot) {
mid = top + bot >> 1;
bool ok = 1;
... | [
"expression.operation.binary.add"
] | 905,125 | 905,126 | u939096624 | cpp |
p03094 | #include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
inline int add(int a, int b) {
a += b;
return a >= MOD ? a - MOD : a;
}
inline int mul(int a, int b) { return 1LL * a * b % MOD; }
int inv[1 << 20];
int main() {
int n, als = 0;
scanf("%d", &n);
inv[1] = 1;
for (int i = 2; i <= n; i++)
... | #include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
inline int add(int a, int b) {
a += b;
return a >= MOD ? a - MOD : a;
}
inline int mul(int a, int b) { return 1LL * a * b % MOD; }
int inv[1 << 20];
int main() {
int n, als = 0;
scanf("%d", &n);
inv[1] = 1;
for (int i = 2; i <= max(n, 3); ... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 905,136 | 905,137 | u140310696 | cpp |
p03094 | #include <bits/stdc++.h>
typedef long long int int64;
static const int64 mod = 1000000007LL;
int64 dp[1000003][3];
int64 fac[1000003], inv[1000003], invfac[1000003];
int n;
int64 choice(int a, int b) {
return fac[a] * invfac[b] % mod * invfac[a - b] % mod;
}
int main() {
scanf("%d", &n);
fac[0] = fac[1] = invfac... | #include <bits/stdc++.h>
typedef long long int int64;
static const int64 mod = 1000000007LL;
int64 dp[1000003][3];
int64 fac[1000003], inv[1000003], invfac[1000003];
int n;
int64 choice(int a, int b) {
return fac[a] * invfac[b] % mod * invfac[a - b] % mod;
}
int main() {
scanf("%d", &n);
fac[0] = fac[1] = invfac... | [
"assignment.add"
] | 905,138 | 905,139 | u339802099 | cpp |
p03094 | #include <bits/stdc++.h>
#define ll long long
template <class T> inline void read(T &x) {
x = 0;
register char c = getchar();
register bool f = 0;
while (!isdigit(c))
f ^= c == '-', c = getchar();
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
if (f)
x = -x;
}
const int N = 1e5 + 10, mo... | #include <bits/stdc++.h>
#define ll long long
template <class T> inline void read(T &x) {
x = 0;
register char c = getchar();
register bool f = 0;
while (!isdigit(c))
f ^= c == '-', c = getchar();
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
if (f)
x = -x;
}
const int N = 1e6 + 10, mo... | [
"literal.number.change",
"expression.operation.binary.change"
] | 905,140 | 905,141 | u806711698 | cpp |
p03094 | #include "bits/stdc++.h"
using namespace std;
#define MOD 100000007
#define MAX 1000002
int n;
long long int k[MAX];
long long int ppow(long long int i, long long int j) {
long long int res = 1;
while (j) {
if (j & 1LL) {
res *= i;
if (res >= MOD)
res %= MOD;
}
i *= i;
i %= MOD... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define MAX 1000002
int n;
long long int k[MAX];
long long int ppow(long long int i, long long int j) {
long long int res = 1;
while (j) {
if (j & 1LL) {
res *= i;
if (res >= MOD)
res %= MOD;
}
i *= i;
i %= MO... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 905,144 | 905,145 | u466917094 | cpp |
p03094 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
const int P = 1e9 + 7;
const int inv3 = (P + 1) / 3;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = mi... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
const int P = 1e9 + 7;
const int inv3 = (P + 1) / 3;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = mi... | [
"assignment.change",
"expression.operation.binary.remove"
] | 905,147 | 905,148 | u744755176 | cpp |
p03094 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.array_dimensions.change"
] | 905,149 | 905,150 | u452725238 | cpp |
p03095 | #include <bits/stdc++.h>
#define D 1000000007
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
string s;
cin >> s;
ll ans = 1;
ll alpha[26];
for (int i = 0; i < n; i++) {
alpha[s[i] - 'a']++;
alpha[s[i] - 'a'] %= D;
}
for (int i = 0; i < 26; i++) {
ans *= (alpha[... | #include <bits/stdc++.h>
#define D 1000000007
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
string s;
cin >> s;
ll ans = 1;
ll alpha[26] = {0};
for (int i = 0; i < n; i++) {
alpha[s[i] - 'a']++;
alpha[s[i] - 'a'] %= D;
}
for (int i = 0; i < 26; i++) {
ans *= (... | [
"variable_declaration.value.change"
] | 905,157 | 905,158 | u277318398 | cpp |
p03095 | #include <bits/stdc++.h>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (n - 1); i > (a - 1); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define rirep(i, x) f... | #include <bits/stdc++.h>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (n - 1); i > (a - 1); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define rirep(i, x) f... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 905,164 | 905,165 | u600244905 | cpp |
p03095 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
const int MOD = 129 + 7;
int main() {
string s;
int n;
cin >> n >> s;
map<char, int> d;
rep(i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
int main() {
string s;
int n;
cin >> n >> s;
map<char, int> d;
rep(i... | [
"literal.number.change",
"expression.operation.binary.change"
] | 905,192 | 905,193 | u309168663 | cpp |
p03095 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> vec(26, 0);
for (int i = 0; i < n; ++i) {
char c;
cin >> c;
++vec[c - 'a'];
}
ll ans = 1;
for (int i = 0; i < n; ++i)
ans = (ans * (vec[i] + 1)) % ... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> vec(26, 0);
for (int i = 0; i < n; ++i) {
char c;
cin >> c;
++vec[c - 'a'];
}
ll ans = 1;
for (int i = 0; i < 26; ++i)
ans = (ans * (vec[i] + 1)) % 1000000007;
cou... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,194 | 905,195 | u549438788 | cpp |
p03095 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
// here!!!
// define int long long !!!!!
#define int long long
// define int long long ... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
// here!!!
// define int long long !!!!!
#define int long long
// define int long long ... | [] | 905,219 | 905,220 | u943070796 | cpp |
p03095 | #define _GLIBCXX_DEBUG
#include <algorithm> //next_permutation
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace... | #define _GLIBCXX_DEBUG
#include <algorithm> //next_permutation
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace... | [
"literal.number.change",
"call.arguments.change"
] | 905,227 | 905,228 | u434398296 | cpp |
p03095 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | [
"variable_declaration.value.change"
] | 905,229 | 905,230 | u656771711 | cpp |
p03095 | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF (((ll)1 << 31) - 1)
#define eps LDBL_EPSILON
#define moder (1000000007)
#define pie 3.141592653589793238462643383279
#define P std::pair<int, int>
#define prique priority_queue
#define ggr ... | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF (((ll)1 << 31) - 1)
#define eps LDBL_EPSILON
#define moder (1000000007)
#define pie 3.141592653589793238462643383279
#define P std::pair<int, int>
#define prique priority_queue
#define ggr ... | [] | 905,240 | 905,241 | u379822620 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
string S;
cin >> N >> S;
int cnt[26] = {};
for (int i = 0; i < S.size(); i++) {
cnt[S[i] - 'a']++;
}
int ans = 1... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
string S;
cin >> N >> S;
int cnt[26] = {};
for (int i = 0; i < S.size(); i++) {
cnt[S[i] - 'a']++;
}
int ans = 1... | [] | 905,242 | 905,243 | u237390401 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.