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 |
|---|---|---|---|---|---|---|---|
p03141 | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <util... | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <util... | [
"expression.operation.unary.add",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 940,953 | 940,954 | u426683236 | cpp |
p03141 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
struct Info {
long long int a;
long long int b;
long long int c;
Info(long long int ax, long long int bx, long long int cx) {
a = ax;
... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
struct Info {
long long int a;
long long int b;
long long int c;
Info(long long int ax, long long int bx, long long int cx) {
a = ax;
... | [
"expression.operation.unary.arithmetic.remove"
] | 940,955 | 940,956 | u018872912 | cpp |
p03141 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
struct Info {
long long int a;
long long int b;
long long int c;
Info(long long int ax, long long int bx, long long int cx) {
a = ax;
... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
struct Info {
long long int a;
long long int b;
long long int c;
Info(long long int ax, long long int bx, long long int cx) {
a = ax;
... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operation.unary.arithmetic.remove"
] | 940,957 | 940,956 | u018872912 | cpp |
p03141 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
struct Info {
long long int a;
long long int b;
long long int c;
Info(long long int ax, long long int bx, long long int cx) {
a = ax;
... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
struct Info {
long long int a;
long long int b;
long long int c;
Info(long long int ax, long long int bx, long long int cx) {
a = ax;
... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operator.arithmetic.change",
"assignment.value.change"
] | 940,958 | 940,956 | u018872912 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp,... | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp,... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 940,959 | 940,960 | u878615689 | cpp |
p03140 | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int N;
string A, B, C;
cin >> N;
cin >> A;
cin >> B;
cin >> C;
int answer = 0;
for (int i = 0; i < N; i++) {
if (A[i] == B[i] && B[i] == C[i]) {
break;
} else if (A[i] == B[i] || B[i] == C[i] || C[i] == A[i]) {
... | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int N;
string A, B, C;
cin >> N;
cin >> A;
cin >> B;
cin >> C;
int answer = 0;
for (int i = 0; i < N; i++) {
if (A[i] == B[i] && B[i] == C[i]) {
continue;
} else if (A[i] == B[i] || B[i] == C[i] || C[i] == A[i]) ... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 940,976 | 940,977 | u417683939 | cpp |
p03140 | #include <bits/stdc++.h>
using namespace std;
int n, i, res;
char a[1000], b[1000], c[1000];
int main() {
cin >> n;
scanf("%s", &a);
scanf("%s", &b);
scanf("%s", &c);
for (i = 0; i < n; i++) {
if (a[i] == b[i])
if (a[i] != c[i])
res++;
if (a[i] != b[i])
;
{
if (b[i] ==... | #include <bits/stdc++.h>
using namespace std;
int n, i, res;
char a[1000], b[1000], c[1000];
int main() {
cin >> n;
scanf("%s", &a);
scanf("%s", &b);
scanf("%s", &c);
for (i = 0; i < n; i++) {
if (a[i] == b[i])
if (a[i] != c[i])
res++;
if (a[i] != b[i]) {
if (b[i] == c[i])
... | [] | 940,992 | 940,993 | u542075673 | cpp |
p03140 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, ans; //過半数を占める文字をしらべる
string a, b, c;
ans = 0;
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++) {
if (a[i] == b[i] || b[i] == c[i] || c[i] == a[i]) {
if (a[i] = b[i] && b[i] == c[i]) {
} else {
ans++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, ans; //過半数を占める文字をしらべる
string a, b, c;
ans = 0;
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++) {
if (a[i] == b[i] || b[i] == c[i] || c[i] == a[i]) {
if (a[i] == b[i] && b[i] == c[i]) {
} else {
ans++;
}... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 941,003 | 941,004 | u840013257 | cpp |
p03141 | #include <algorithm>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
//#define INF 100000000
//#define MOD (int) (1e9+7)
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace... | #include <algorithm>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
//#define INF 100000000
//#define MOD (int) (1e9+7)
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace... | [
"assignment.change"
] | 941,009 | 941,010 | u536712674 | cpp |
p03141 | // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cer... | // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cer... | [] | 941,027 | 941,028 | u379382721 | cpp |
p03141 | #include <bits/stdc++.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr << ... | #include <bits/stdc++.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr << ... | [] | 941,029 | 941,030 | u924011226 | cpp |
p03141 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
// typedef vector<unsigned int>vec;
// typedef vector<ll>vec;
// typedef vector<vec> mat;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 100000... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
// typedef vector<unsigned int>vec;
// typedef vector<ll>vec;
// typedef vector<vec> mat;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 100000... | [] | 941,031 | 941,032 | u493750228 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
const long long MAX_N = 1e5 + 5;
long long n, q, w;
long long A[MAX_N], B[MAX_N];
long long Arr[MAX_N];
bool cmp(long long a, long long b) { return A[a] + B[a] < A[b] + B[b]; }
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n;
for (long long i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
const long long MAX_N = 1e5 + 5;
long long n, q, w;
long long A[MAX_N], B[MAX_N];
long long Arr[MAX_N];
bool cmp(long long a, long long b) { return A[a] + B[a] > A[b] + B[b]; }
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n;
for (long long i = 0; i ... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,035 | 941,036 | u386747769 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | [
"identifier.change",
"call.function.change"
] | 941,039 | 941,040 | u303039933 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 941,041 | 941,040 | u303039933 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll sum = 0;
vector<ll> num(n);
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
num[i] = a + b;
sum += b;
}
sort(num.begin(), num.end());
ll ans = 0;
for (int i = 0; i < n; i += 2) {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll sum = 0;
vector<ll> num(n);
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
num[i] = a + b;
sum += b;
}
sort(num.rbegin(), num.rend());
ll ans = 0;
for (int i = 0; i < n; i += 2)... | [
"call.function.change",
"call.arguments.change"
] | 941,046 | 941,047 | u351265848 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
void solve(long long N, std::vector<long long> A, std::vector<long long> B) {
vector<pair<ll... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
void solve(long long N, std::vector<long long> A, std::vector<long long> B) {
vector<pair<ll... | [
"call.function.change",
"call.arguments.change"
] | 941,054 | 941,055 | u131340563 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
typedef pair<ll, P> PP;
vector<PP> r;
ll a[100005];
ll b[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
r.push_back(PP(b[i] - a[i], P(a... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
typedef pair<ll, P> PP;
vector<PP> r;
ll a[100005];
ll b[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
r.push_back(PP(b[i] + a[i], P(a... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,059 | 941,060 | u126361752 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
typedef pair<ll, ll> p_ll;
int main() {
ll N;
cin >> N;
ll A[N], B[N];
rep(i, N) cin >> A[i] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
typedef pair<ll, ll> p_ll;
int main() {
ll N;
cin >> N;
ll A[N], B[N];
rep(i, N) cin >> A[i] ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operator.compare.change"
] | 941,067 | 941,068 | u680707192 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define ALL(r) r.begin(), r.end()
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")... | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define ALL(r) r.begin(), r.end()
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operator.compare.change"
] | 941,076 | 941,077 | u664394831 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define ALL(r) r.begin(), r.end()
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")... | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define ALL(r) r.begin(), r.end()
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,078 | 941,077 | u664394831 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tup... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tup... | [
"call.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,079 | 941,080 | u693386219 | cpp |
p03141 | #include <algorithm>
#include <cstring>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) ... | #include <algorithm>
#include <cstring>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 941,081 | 941,082 | u209713918 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <boost/multiprecision/cpp_int.hpp>... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <boost/multiprecision/cpp_int.hpp>... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,085 | 941,086 | u457790148 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<P> vpl;
#... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<P> vpl;
#... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 941,091 | 941,092 | u242679311 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
int B, C, ans = 0, sum = 0;
for (int i = 0; i < N; i++) {
cin >> B >> C;
A.at(i) = B + C;
ans += C;
}
sort(A.begin(), A.end... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
long long B, C, ans = 0, sum = 0;
for (int i = 0; i < N; i++) {
cin >> B >> C;
A.at(i) = B + C;
ans += C;
}
sort(A.begin(),... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 941,095 | 941,096 | u815026012 | cpp |
p03141 | /*
URL https://
SCORE 0
AC false
WA false
TLE false
MLE false
TASK_TYPE
FAILURE_TYPE
NOTES
*/
#include <algorithm>
#include <cstdint>
#include <experimental/optional>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | /*
URL https://
SCORE 0
AC false
WA false
TLE false
MLE false
TASK_TYPE
FAILURE_TYPE
NOTES
*/
#include <algorithm>
#include <cstdint>
#include <experimental/optional>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,107 | 941,108 | u071730284 | cpp |
p03141 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &op... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &op... | [
"call.function.change",
"call.arguments.change"
] | 941,114 | 941,115 | u728732647 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, int> pdi;
typedef pair<ll, ll> pll;
#define S second
#define F first
#define kill(x) return (cout << x << endl, 0)
#define debug(x) cerr << #x << " : " << x << endl
#define ddebug(x, y) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, int> pdi;
typedef pair<ll, ll> pll;
#define S second
#define F first
#define kill(x) return (cout << x << endl, 0)
#define debug(x) cerr << #x << " : " << x << endl
#define ddebug(x, y) ... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,116 | 941,117 | u209742093 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 21;
int a[MAXN], b[MAXN];
int n;
long long ans;
pair<int, int> c[MAXN];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i].first = a[i] + b[i];
c[i].second = i;
}
sort(c, c + n);
for (int i = n -... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 21;
int a[MAXN], b[MAXN];
int n;
long long ans;
pair<int, int> c[MAXN];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i].first = a[i] + b[i];
c[i].second = i;
}
sort(c, c + n);
for (int i = n -... | [
"assignment.value.change",
"identifier.change"
] | 941,118 | 941,119 | u699904147 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
long long n;
const long long N = 100 * 1000 + 5;
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
long long n;
const long long N = 100 * 1000 + 5;
... | [
"call.arguments.add"
] | 941,121 | 941,122 | u900305088 | cpp |
p03141 | // +-- -- --++-- +-In the name of ALLAH-+ --++-- -- --+ \\
#include <bits/stdc++.h>
#define F first
#define S second
#define _sz(x) (int)x.size()
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
const int N = 1e5 + 20;
int n, a[N], b[N], ord[N]... | // +-- -- --++-- +-In the name of ALLAH-+ --++-- -- --+ \\
#include <bits/stdc++.h>
#define F first
#define S second
#define _sz(x) (int)x.size()
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
const int N = 1e5 + 20;
int n, a[N], b[N], ord[N]... | [] | 941,123 | 941,124 | u731138875 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
bool comp(P a, P b) { return a.second < b.second; }
void solve() {
int N;
cin >> N;
vector<ll> A(N), B(N);
vector<P> AB(N);
for (in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
bool comp(P a, P b) { return a.second > b.second; }
void solve() {
int N;
cin >> N;
vector<ll> A(N), B(N);
vector<P> AB(N);
for (in... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,131 | 941,132 | u335667012 | cpp |
p03141 | // https://atcoder.jp/contests/nikkei2019-qual/tasks/nikkei2019_qual_c
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define ALL(obj) (obj).begin(), (obj).end(... | // https://atcoder.jp/contests/nikkei2019-qual/tasks/nikkei2019_qual_c
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define ALL(obj) (obj).begin(), (obj).end(... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 941,139 | 941,140 | u858107870 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
vector<pair<ll, ll>> Sum(N);
for (ll i = 0; i < N; i++) {
cin >> A[i] >> B[i];
Sum[i].first = A[i] + B[i];
Sum[i].second = i;
}
sort(Sum.rbegin(), Sum.rend());... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
vector<pair<ll, ll>> Sum(N);
for (ll i = 0; i < N; i++) {
cin >> A[i] >> B[i];
Sum[i].first = A[i] + B[i];
Sum[i].second = i;
}
sort(Sum.rbegin(), Sum.rend())... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 941,149 | 941,150 | u904123392 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
vector<pair<ll, ll>> Sum(N);
for (ll i = 0; i < N; i++) {
cin >> A[i] >> B[i];
Sum[i].first = A[i] + B[i];
Sum[i].second = i;
}
sort(Sum.rbegin(), Sum.rend());... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
vector<pair<ll, ll>> Sum(N);
for (ll i = 0; i < N; i++) {
cin >> A[i] >> B[i];
Sum[i].first = A[i] + B[i];
Sum[i].second = i;
}
sort(Sum.rbegin(), Sum.rend())... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 941,151 | 941,150 | u904123392 | cpp |
p03132 | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const ll INF_ll = 4611686018427387903;
const int N = 2e5 + 10;
int n, a[N];
ll dp[N][5], ans;
int main() {
scanf("%d", &n);
for (register int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (register int i = 1; i <= n; i++) {
dp[... | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const ll INF_ll = 4611686018427387903;
const int N = 2e5 + 10;
int n, a[N];
ll dp[N][5], ans;
int main() {
scanf("%d", &n);
for (register int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (register int i = 1; i <= n; i++) {
dp[... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 941,154 | 941,155 | u917335077 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
long long n, v, a, b, c, d, e;
int main() {
cin >> n;
while (n--)
cin >> v, a += v, b = min(b + (v ? v % 2 : 2), a), c = min(c + !(v % 2), b),
d = min(d + (v ? v % 2 : 2), c), e = min(e, d);
cout << e;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, v, a, b, c, d, e;
int main() {
cin >> n;
while (n--)
cin >> v, a += v, b = min(b + (v ? v % 2 : 2), a), c = min(c + !(v % 2), b),
d = min(d + (v ? v % 2 : 2), c), e = min(e + v, d);
cout << e;
}
| [
"assignment.change"
] | 941,156 | 941,157 | u963610246 | cpp |
p03132 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (int i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define fi first
#define se second
#define int long long
using namespace... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (int i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define fi first
#define se second
#define int long long
using namespace... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 941,160 | 941,161 | u852113235 | cpp |
p03132 | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define ios() cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
ll const MOD = 1e9 + 7;
ll const INF = ... | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define ios() cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
ll const MOD = 1e9 + 7;
ll const INF = ... | [
"expression.operation.binary.remove"
] | 941,162 | 941,163 | u994831328 | cpp |
p03132 | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define mp make_pair
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1LL << 30;
const ll LINF = 1LL << 62;
const double eps = 1e-5;
const ll MOD = 1000000007LL;
template <typename T> void chmin(T &a, T b) { a = min(a, b);... | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define mp make_pair
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1LL << 30;
const ll LINF = 1LL << 62;
const double eps = 1e-5;
const ll MOD = 1000000007LL;
template <typename T> void chmin(T &a, T b) { a = min(a, b);... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 941,166 | 941,167 | u924339359 | cpp |
p03132 | #include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, k, l, ans = 1e18;
scanf("%lld", &l);
ll dp[l][5], a[l];
for (i = 0; i < l; ++i)
scanf("%lld", &a[i]);
for (i = 0; i < l; ++i)
for (j = 0; j < 5; ++j)
dp[i][j] = 1e18;
dp[0][0] = dp[0][4] = a[0], dp[0][1] = dp[0][3] = a[0] ? a[... | #include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, k, l, ans = 1e18;
scanf("%lld", &l);
ll dp[l][5], a[l];
for (i = 0; i < l; ++i)
scanf("%lld", &a[i]);
for (i = 0; i < l; ++i)
for (j = 0; j < 5; ++j)
dp[i][j] = 1e18;
dp[0][0] = dp[0][4] = a[0], dp[0][1] = dp[0][3] = a[0] ? a[... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 941,172 | 941,173 | u440920318 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef gp_hash_table<long long, long long> umap;
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define ... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef gp_hash_table<long long, long long> umap;
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define ... | [
"assignment.change"
] | 941,182 | 941,183 | u795058347 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(n, vector<ll>(5));
dp[0][0] = dp[0][4] = a[0];
dp[0][1] = dp[0][3] = (a[0] == 0 ? 2 : a[0] % 2 == 0 ? 0 : 1);
dp[0][2] = (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(n, vector<ll>(5));
dp[0][0] = dp[0][4] = a[0];
dp[0][1] = dp[0][3] = (a[0] == 0 ? 2 : a[0] % 2 == 0 ? 0 : 1);
dp[0][2] = (... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 941,187 | 941,188 | u987476436 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000000000000000
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(n, vector<ll>(5));
dp[0][0] = dp[0][4] = a[0];
dp[0][1] = dp[0][3] = (a[0] == 0 ? 2 : a[0] % 2... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(n, vector<ll>(5));
dp[0][0] = dp[0][4] = a[0];
dp[0][1] = dp[0][3] = (a[0] == 0 ? 2 : a[0] % 2 == 0 ? 0 : 1);
dp[0][2] = (... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 941,189 | 941,188 | u987476436 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(n, vector<ll>(5));
dp[0][0] = dp[0][4] = a[0];
dp[0][1] = dp[0][3] = (a[0] == 0 ? 2 : a[0] % 2 == 0 ? 0 : 1);
dp[0][2] = (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000000000000000
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(n, vector<ll>(5));
dp[0][0] = dp[0][4] = a[0];
dp[0][1] = dp[0][3] = (a[0] == 0 ? 2 : a[0] % 2... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 941,187 | 941,190 | u987476436 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000000000000000
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(n, vector<ll>(5));
dp[0][0] = dp[0][4] = a[0];
dp[0][1] = dp[0][3] = (a[0] == 0 ? 2 : a[0] % 2... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000000000000000
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<ll>> dp(n, vector<ll>(5));
dp[0][0] = dp[0][4] = a[0];
dp[0][1] = dp[0][3] = (a[0] == 0 ? 2 : a[0] % 2... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 941,189 | 941,190 | u987476436 | cpp |
p03132 | /**********************************************************************/
/******** ********/
/******** Writer:孙~~ ********/
/******** Lang:C++ ********/
/******** ... | /**********************************************************************/
/******** ********/
/******** Writer:孙~~ ********/
/******** Lang:C++ ********/
/******** ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 941,196 | 941,197 | u190596522 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,202 | 941,203 | u219873012 | cpp |
p03132 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL << (n))
#define BITCNT(n) (__builtin_popcountll(n))
#define SUBS(s, f, t) ... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL << (n))
#define BITCNT(n) (__builtin_popcountll(n))
#define SUBS(s, f, t) ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change",
"call.arguments.add"
] | 941,218 | 941,217 | u905715926 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(x) (x).begin(), (x).end()
#define foreach(u, v) for (auto(u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(x) (x).begin(), (x).end()
#define foreach(u, v) for (auto(u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define int... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 941,219 | 941,220 | u057866967 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | [
"call.add",
"call.arguments.change"
] | 941,225 | 941,226 | u833393891 | cpp |
p03132 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"expression.operation.unary.add",
"call.arguments.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"literal.number.change",
"variable_access.subscript.index.change"
] | 941,231 | 941,232 | u352642493 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
usi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
usi... | [
"literal.number.change",
"call.arguments.change"
] | 941,237 | 941,238 | u591883167 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
ll L;
ll A[200050];
ll sum[200050];
ll even[200050];
ll odd[200050];
ll even_after[200050];
ll even_before[200050];
ll odd_after[200050];
ll odd_before[200050];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
ll L;
ll A[200050];
ll sum[200050];
ll even[200050];
ll odd[200050];
ll even_after[200050];
ll even_before[200050];
ll odd_after[200050];
ll odd_before[200050];
... | [
"expression.operation.binary.remove"
] | 941,242 | 941,243 | u709243470 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
ll dp[200010][10];
int main() {
ll l;
cin >> l;
vector<ll> a(l);
for (auto &e : a)
cin >> e;
for (int i = 0; i <= l; ++i) {
for (int j = 0; j < 5; ++j)
dp[i][j] = 1 << 60;
}
dp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
ll dp[200010][10];
int main() {
ll l;
cin >> l;
vector<ll> a(l);
for (auto &e : a)
cin >> e;
for (int i = 0; i <= l; ++i) {
for (int j = 0; j < 5; ++j)
dp[i][j] = 1LL << 60;
}
... | [
"literal.number.type.widen.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 941,248 | 941,249 | u054652697 | cpp |
p03132 | #include <algorithm>
#include <iostream>
using namespace std;
int n;
long dp[2 << 17][5];
main() {
cin >> n;
for (int i = 0; i++ < n + 1;) {
long a = 0;
cin >> a;
long now = 9e18;
for (int j = 0; j < 5; j++) {
now = min(now, dp[i - 1][j]);
dp[i][j] = now + (j - 2 ? j % 2 ? a ? a % 2 : 1 ... | #include <algorithm>
#include <iostream>
using namespace std;
int n;
long dp[2 << 17][5];
main() {
cin >> n;
for (int i = 0; i++ < n + 1;) {
long a = 0;
cin >> a;
long now = 9e18;
for (int j = 0; j < 5; j++) {
now = min(now, dp[i - 1][j]);
dp[i][j] = now + (j - 2 ? j % 2 ? a ? a % 2 : 2 ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 941,250 | 941,251 | u657913472 | cpp |
p03132 | #include <bits/stdc++.h>
#define Pct puts("------ Yes ------");
#define rep(a, b, c) for (int a = (b); a <= (c); ++a)
#define per(a, b, c) for (int a = (b); a >= (c); --a)
#define fir first
#define sec second
#define ls son[u][0]
#define rs son[u][1]
#define eps 1e-8
#define PI acos(-1.0)
using namespace std;
template ... | #include <bits/stdc++.h>
#define Pct puts("------ Yes ------");
#define rep(a, b, c) for (int a = (b); a <= (c); ++a)
#define per(a, b, c) for (int a = (b); a >= (c); --a)
#define fir first
#define sec second
#define ls son[u][0]
#define rs son[u][1]
#define eps 1e-8
#define PI acos(-1.0)
using namespace std;
template ... | [
"expression.operation.binary.remove"
] | 941,252 | 941,253 | u383898108 | cpp |
p03132 | #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",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,256 | 941,257 | u452725238 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int l, a[200005];
ll f[200005][5];
void upd(ll &x, ll y) {
if (x > y)
x = y;
}
int cost(int x, int y) {
if (x == -1)
return y;
if (x == 0)
return y == 0 || y % 2;
return 1 - y % 2;
}
int main() {
scanf("%d", &l);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int l, a[200005];
ll f[200005][5];
void upd(ll &x, ll y) {
if (x > y)
x = y;
}
int cost(int x, int y) {
if (x == -1)
return y;
if (x == 0)
return y == 0 ? 2 : y % 2;
return 1 - y % 2;
}
int main() {
scanf("%d", &l);
for (int... | [
"function.return_value.change",
"expression.operation.binary.change"
] | 941,269 | 941,270 | u760178976 | cpp |
p03141 | #include <algorithm>
#include <iostream>
using namespace std;
#define MAXN 100006
typedef long long ll;
ll A[MAXN], B[MAXN], idx[MAXN];
ll n, resa, resb;
bool cmp(ll x, ll y) { return abs(A[x] - B[x]) > abs(A[y] - B[y]); }
int main() {
// freopen("input","r",stdin);
cin >> n;
for (ll i = 1; i <= n; ++i)
scanf... | #include <algorithm>
#include <iostream>
using namespace std;
#define MAXN 100006
typedef long long ll;
ll A[MAXN], B[MAXN], idx[MAXN];
ll n, resa, resb;
bool cmp(ll x, ll y) { return (A[x] + B[x]) > (A[y] + B[y]); }
int main() {
// freopen("input","r",stdin);
cin >> n;
for (ll i = 1; i <= n; ++i)
scanf("%lld... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 941,271 | 941,272 | u390140944 | cpp |
p03141 | #include <algorithm>
#include <iostream>
using namespace std;
#define MAXN 100006
typedef long long ll;
ll A[MAXN], B[MAXN], idx[MAXN];
ll n, resa, resb;
bool cmp(ll x, ll y) { return (A[x] - B[x]) > (A[y] - B[y]); }
int main() {
// freopen("input","r",stdin);
cin >> n;
for (ll i = 1; i <= n; ++i)
scanf("%lld... | #include <algorithm>
#include <iostream>
using namespace std;
#define MAXN 100006
typedef long long ll;
ll A[MAXN], B[MAXN], idx[MAXN];
ll n, resa, resb;
bool cmp(ll x, ll y) { return (A[x] + B[x]) > (A[y] + B[y]); }
int main() {
// freopen("input","r",stdin);
cin >> n;
for (ll i = 1; i <= n; ++i)
scanf("%lld... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,273 | 941,272 | u390140944 | cpp |
p03141 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define _USE_MATH_DEFINES
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define _USE_MATH_DEFINES
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,274 | 941,275 | u655723240 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, A[200000], B[200000], C[200000];
long long ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i] >> B[i];
for (int i = 0; i < n; i++)
C[i] = A[i] + B[i];
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, A[200000], B[200000], C[200000];
long long ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i] >> B[i];
for (int i = 0; i < n; i++)
C[i] = A[i] + B[i];
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 941,276 | 941,277 | u441296840 | cpp |
p03141 | #include <algorithm>
#include <cstdio>
using namespace std;
int x[200000], y[200000], z[200000];
int i, n;
long long s;
inline bool cmp(int z1, int z2) { return x[z1] + y[z1] > x[z2] + y[z2]; }
int main() {
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d%d", &x[i], &y[i]), z[i] = i;
sort(z + 1, z + n ... | #include <algorithm>
#include <cstdio>
using namespace std;
int x[200000], y[200000], z[200000];
int i, n;
long long s;
inline bool cmp(int z1, int z2) { return x[z1] + y[z1] > x[z2] + y[z2]; }
int main() {
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d%d", &x[i], &y[i]), z[i] = i;
sort(z + 1, z + n ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 941,283 | 941,284 | u405611259 | cpp |
p03141 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vec... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vec... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,285 | 941,286 | u652683896 | cpp |
p03141 | #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... | [
"call.remove",
"assignment.value.change",
"call.arguments.change"
] | 941,290 | 941,291 | u406225550 | cpp |
p03141 | #include <bits/stdc++.h>
#define INF 1000000007
#define LINF 1000000000000000007
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int n, a[101010], b[101010];
P p[101010];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
p[i] = P(b[i] - a[i], a[i]);
}
sor... | #include <bits/stdc++.h>
#define INF 1000000007
#define LINF 1000000000000000007
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int n, a[101010], b[101010];
P p[101010];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
p[i] = P(b[i] + a[i], a[i]);
}
sor... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,292 | 941,293 | u414947284 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VI;
typedef vector<VI> VVI;
typedef pair<LL, LL> PII;
typedef vector<string> VS;
inline LL toInt(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream s... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VI;
typedef vector<VI> VVI;
typedef pair<LL, LL> PII;
typedef vector<string> VS;
inline LL toInt(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream s... | [] | 941,296 | 941,297 | u816800341 | cpp |
p03141 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#incl... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#incl... | [] | 941,298 | 941,299 | u792273212 | cpp |
p03141 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mt make_tuple
typedef long long int ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int ll;
ll n, a[114514], b[114514];
int main(void) {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> ... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mt make_tuple
typedef long long int ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int ll;
ll n, a[114514], b[114514];
int main(void) {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 941,300 | 941,301 | u628262476 | cpp |
p03141 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mt make_tuple
typedef long long int ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int ll;
ll n, a[114514], b[114514];
int main(void) {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> ... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mt make_tuple
typedef long long int ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int ll;
ll n, a[114514], b[114514];
int main(void) {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 941,302 | 941,301 | u628262476 | cpp |
p03141 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mt make_tuple
typedef long long int ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int ll;
ll n, a[114514], b[114514];
int main(void) {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> ... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mt make_tuple
typedef long long int ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int ll;
ll n, a[114514], b[114514];
int main(void) {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 941,303 | 941,301 | u628262476 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
struct N {
ll a, b, c;
};
bool operator<(const N &l, const N &r) { return l.c > r.c; }
int main() {
cin.tie(0);
ios::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
struct N {
ll a, b, c;
};
bool operator<(const N &l, const N &r) { return l.c > r.c; }
int main() {
cin.tie(0);
ios::sync_with_st... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 941,304 | 941,305 | u656572785 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
struct N {
ll a, b, c;
};
bool operator<(const N &l, const N &r) { return l.c > r.c; }
int main() {
cin.tie(0);
ios::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
struct N {
ll a, b, c;
};
bool operator<(const N &l, const N &r) { return l.c > r.c; }
int main() {
cin.tie(0);
ios::sync_with_st... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 941,306 | 941,305 | u656572785 | cpp |
p03141 | #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... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,313 | 941,314 | u966921248 | cpp |
p03141 | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define rep(i, n) for (auto i = 0; i < (n); i++)
#define rep1(i, n) for (auto i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
struct init {
init() {
cin.tie(0);
ios::sync_with_stdio(0);
... | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define rep(i, n) for (auto i = 0; i < (n); i++)
#define rep1(i, n) for (auto i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
struct init {
init() {
cin.tie(0);
ios::sync_with_stdio(0);
... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,317 | 941,318 | u779159595 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("O3")
//#pragma GCC target("sse4")
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define ITER(it, a) \
for (__typeof(a.begin... | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("O3")
//#pragma GCC target("sse4")
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); --i)
#define ITER(it, a) \
for (__typeof(a.begin... | [
"call.arguments.add"
] | 941,321 | 941,322 | u109908451 | cpp |
p03141 | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ALL(c) (c).... | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ALL(c) (c).... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 941,325 | 941,326 | u378945900 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define DEBUG(a) cerr << #a << "=" << a << endl
#define DEBUG_ARRAY(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define DEBUG(a)
#define DEBUG_ARRAY(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, ... | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define DEBUG(a) cerr << #a << "=" << a << endl
#define DEBUG_ARRAY(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define DEBUG(a)
#define DEBUG_ARRAY(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, ... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,329 | 941,330 | u634743753 | cpp |
p03141 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<long long> A(N), B(N);
vector<pair<long long, int>> C(N);
for (int i = 0; i < N; i++) ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<long long> A(N), B(N);
vector<pair<long long, int>> C(N);
for (int i = 0; i < N; i++) ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 941,331 | 941,332 | u898331860 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <s... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <s... | [
"call.function.change",
"call.arguments.change"
] | 941,335 | 941,336 | u922299738 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
ll A[100100];
ll B[100100];
pair<ll, int> D[100100];
int main() {
int N;
cin >> N;
REP(i, N) {
ll a, b;
cin >> a >> b;
A[i] = a;
B[i] = b;
D[i] =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
ll A[100100];
ll B[100100];
pair<ll, int> D[100100];
int main() {
int N;
cin >> N;
REP(i, N) {
ll a, b;
cin >> a >> b;
A[i] = a;
B[i] = b;
D[i] =... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 941,337 | 941,338 | u666394517 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define For(i, n) for (int i = 0; i < n; i++)
#define Fre(i, a, b) for (int i = a; i < b; i++)
#define sf(n) scanf("%d", &n)
#define sff(a, b) scanf("%d %d", &a, &b)
#define sfff(a, b, c) scanf("%d %d %d", &a,... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define For(i, n) for (int i = 0; i < n; i++)
#define Fre(i, a, b) for (int i = a; i < b; i++)
#define sf(n) scanf("%d", &n)
#define sff(a, b) scanf("%d %d", &a, &b)
#define sfff(a, b, c) scanf("%d %d %d", &a,... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 941,339 | 941,340 | u318324429 | cpp |
p03141 | #include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define repeat(n) for (int _ = 1; _ <= n; _++)
struct Node {
int x1;
int x2;
};
bool operator<(Node a, Node b) { return a.x1 + a.x2 > b.x1 + b.x2; }
int main() {
ios::sync_with_stdio(false);
#ifdef CAI_WEI_HAN... | #include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define repeat(n) for (int _ = 1; _ <= n; _++)
struct Node {
int x1;
int x2;
};
bool operator<(Node a, Node b) { return a.x1 + a.x2 < b.x1 + b.x2; }
int main() {
ios::sync_with_stdio(false);
#ifdef CAI_WEI_HAN... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,341 | 941,342 | u506713609 | cpp |
p03141 | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
const ld PI = 3.14159265359;
const ll MO... | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
const ld PI = 3.14159265359;
const ll MO... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,347 | 941,348 | u787690200 | cpp |
p03141 | #include <bits/stdc++.h>
#define typeof(x) __typeof__(x)
#define int long long int
#define double long double
#define mod(x) ((x % MOD) + MOD) % MOD
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define RREP(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbe... | #include <bits/stdc++.h>
#define typeof(x) __typeof__(x)
#define int long long int
#define double long double
#define mod(x) ((x % MOD) + MOD) % MOD
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define RREP(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbe... | [
"identifier.change",
"call.function.change"
] | 941,349 | 941,350 | u960524878 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (int i = (l); i < (r); i++)
#define incII(i, l, r) for (int i = (l); i <= (r); i++)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define decII(i, l, r) for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (int i = (l); i < (r); i++)
#define incII(i, l, r) for (int i = (l); i <= (r); i++)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define decII(i, l, r) for (int i =... | [
"call.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,351 | 941,352 | u568652083 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (int i = (l); i < (r); i++)
#define incII(i, l, r) for (int i = (l); i <= (r); i++)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define decII(i, l, r) for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (int i = (l); i < (r); i++)
#define incII(i, l, r) for (int i = (l); i <= (r); i++)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define decII(i, l, r) for (int i =... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 941,353 | 941,352 | u568652083 | cpp |
p03141 | #include <bits/stdc++.h>
#define PB push_back
#define X first
#define Y second
#define INF 1000 * 1000 * 1000
#define LL long long
using namespace std;
const int mod = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL)INF;
const int MAX = 1 << 17;
int a[100005], b[100005], c[100005];
bool cmp(pair<int, int> p1, pair<i... | #include <bits/stdc++.h>
#define PB push_back
#define X first
#define Y second
#define INF 1000 * 1000 * 1000
#define LL long long
using namespace std;
const int mod = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL)INF;
const int MAX = 1 << 17;
int a[100005], b[100005], c[100005];
bool cmp(pair<int, int> p1, pair<i... | [
"call.arguments.add"
] | 941,354 | 941,355 | u804093140 | cpp |
p03141 | #include <algorithm>
#include <iostream>
using namespace std;
struct ts {
long long s, a, b;
bool operator<(const ts &r) const { return s < r.s; }
};
ts p[100009];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i].a >> p[... | #include <algorithm>
#include <iostream>
using namespace std;
struct ts {
long long s, a, b;
bool operator<(const ts &r) const { return s > r.s; }
};
ts p[100009];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i].a >> p[... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,356 | 941,357 | u105725117 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 941,358 | 941,359 | u843522325 | cpp |
p03141 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_b... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_b... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,360 | 941,361 | u015768390 | cpp |
p03141 | //**************************
//*** author : Alex Hu **
//************************
#include <bits/stdc++.h>
using namespace std;
#define CLEAN(a, b) memset(a, b, sizeof(a))
#define mkp make_pair
#define pb push_back
#define rept(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
typedef long long ll;
typedef pair<... | //**************************
//*** author : Alex Hu **
//************************
#include <bits/stdc++.h>
using namespace std;
#define CLEAN(a, b) memset(a, b, sizeof(a))
#define mkp make_pair
#define pb push_back
#define rept(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
typedef long long ll;
typedef pair<... | [] | 941,364 | 941,365 | u548920851 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
struct P {
bool operator<(const P &p) const { return a + b < p.a + p.b; }
int a, b;
};
int main() {
ios::sync_with_stdio(false);
cin.tie... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
struct P {
bool operator<(const P &p) const { return a + b > p.a + p.b; }
int a, b;
};
int main() {
ios::sync_with_stdio(false);
cin.tie... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,372 | 941,373 | u215860196 | cpp |
p03141 | // ConsoleApplication9.cpp : アプリケーションのエントリ ポイントを定義します。
//
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for... | // ConsoleApplication9.cpp : アプリケーションのエントリ ポイントを定義します。
//
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for... | [
"call.add"
] | 941,374 | 941,375 | u859396346 | cpp |
p03141 | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<int64_t, int64_t, int64_t>> vs(n);
for (auto &v : vs) {
int64_t a, b;
cin >> a >> b;
int64_t d = a + b;
v = make_tuple(d, a, b);
}
... | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<int64_t, int64_t, int64_t>> vs(n);
for (auto &v : vs) {
int64_t a, b;
cin >> a >> b;
int64_t d = a + b;
v = make_tuple(d, a, b);
}
... | [
"call.arguments.add"
] | 941,376 | 941,377 | u537234062 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
typedef int _int;
#define int long long
struct ele {
int a, b, p;
inline bool operator<(const ele &x) const { return p < x.p; }
} o[N];
int n, ans;
_int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> o[i].a >> o[i].b, o[i].p = o[i]... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
typedef int _int;
#define int long long
struct ele {
int a, b, p;
inline bool operator<(const ele &x) const { return p > x.p; }
} o[N];
int n, ans;
_int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> o[i].a >> o[i].b, o[i].p = o[i]... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 941,378 | 941,379 | u454097714 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll a[200000], b[200000];
ll c[200000];
int main() {
// ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
c[i] = a[i] + b[i];
ans -= b[i];... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll a[200000], b[200000];
ll c[200000];
int main() {
// ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
c[i] = a[i] + b[i];
ans -= b[i];... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 941,380 | 941,381 | u279130306 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <locale>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <locale>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace ... | [] | 941,384 | 941,385 | u008017892 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.