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 |
|---|---|---|---|---|---|---|---|
p03037 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int left, right;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int left = 0, right = N;
for (int i = 0; i < M; i++) {
int l, r;
... | [
"variable_declaration.value.change"
] | 852,039 | 852,040 | u412039195 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define ll long long
#define pq priority_queue
#define mp make_pair
#define vl vector<long long>
long long INF = 1e10;
#define pii pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#define rep(x) for (int i = 0; i < (x); i++)
#define re... | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define ll long long
#define pq priority_queue
#define mp make_pair
#define vl vector<long long>
long long INF = 1e10;
#define pii pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#define rep(x) for (int i = 0; i < (x); i++)
#define re... | [
"identifier.change",
"call.arguments.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 852,043 | 852,042 | u426397594 | cpp |
p03037 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.replace.add",
"literal.replace.remove"
] | 852,056 | 852,057 | u930898631 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define MAX 50005
int tree[4 * MAX], arr[MAX], print[MAX];
map<int, int> cnt;
void bld(int n, int b, int e) {
if (b == e) {
// cout << arr[b] << " = " << tree[n] << endl;
cnt[arr[b]] += tree[n];
return;
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define MAX 100005
int tree[4 * MAX], arr[MAX], print[MAX];
map<int, int> cnt;
void bld(int n, int b, int e) {
if (b == e) {
// cout << arr[b] << " = " << tree[n] << endl;
cnt[arr[b]] += tree[n];
return;
}
... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 852,058 | 852,059 | u620961063 | cpp |
p03037 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, l, r;
cin >> n >> m >> l >> r;
int lmax = l, rmin = r;
for (int i = 1; i < m; i++) {
cin >> l >> r;
lmax = max(l, lmax);
rmin = min(r, rmin);
}
cout << rmin - lmax + 1 << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, l, r;
cin >> n >> m >> l >> r;
int lmax = l, rmin = r;
for (int i = 1; i < m; i++) {
cin >> l >> r;
lmax = max(l, lmax);
rmin = min(r, rmin);
}
cout << max(0, rmin - lmax + 1) << endl;
} | [
"call.add",
"call.arguments.change"
] | 852,079 | 852,080 | u240685518 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, L, R;
cin >> N >> M;
L = 1;
R = N;
while (M--) {
int l, r;
cin >> l >> r;
L = max(L, l);
R = min(R, r);
}
cout << R - L + 1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, L, R;
cin >> N >> M;
L = 1;
R = N;
while (M--) {
int l, r;
cin >> l >> r;
L = max(L, l);
R = min(R, r);
}
cout << max(R - L + 1, 0);
return 0;
} | [
"call.add",
"call.arguments.add"
] | 852,083 | 852,084 | u538921909 | cpp |
p03037 | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int N, M, i, j, Ans, sub, judg, r, L[100000], R[100000];
int main() {
cin >> N >> M;
for (i = 0; i < M; i++) {
cin >> L[i] >> R[i];
if (L[0] < L[i])
L[0] = L[i];
if (R[0] > R[i])
R[0] > R[i];
}
if (R[0] - L[0] ... | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int N, M, i, j, Ans, sub, judg, r, L[100000], R[100000];
int main() {
cin >> N >> M;
for (i = 0; i < M; i++) {
cin >> L[i] >> R[i];
if (L[0] < L[i])
L[0] = L[i];
if (R[0] > R[i])
R[0] = R[i];
}
if (R[0] >= L[0]... | [
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 852,099 | 852,100 | u839537391 | cpp |
p03037 | #include <iostream>
using namespace std;
typedef long long ll;
const ll MAX_N = 100000;
int N, M;
ll L[MAX_N], R[MAX_N];
void solve() {
ll max_L = L[0];
ll min_R = R[0];
for (int k = 1; k < M; k++) {
if (min_R < L[k] || R[k] < max_L) {
min_R = 1;
max_L = 0;
break;
} else {
max_... | #include <iostream>
using namespace std;
typedef long long ll;
const ll MAX_N = 100000;
int N, M;
ll L[MAX_N], R[MAX_N];
void solve() {
ll max_L = L[0];
ll min_R = R[0];
for (int k = 1; k < M; k++) {
if (min_R < L[k] || R[k] < max_L) {
min_R = -1;
max_L = 0;
break;
} else {
max... | [
"expression.operation.unary.arithmetic.add"
] | 852,103 | 852,102 | u345981182 | cpp |
p03037 | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, (n))
typedef long long ll;
using namespace std;
int n, m, l, r, ansL, ansR = 1e9;
int main() {
cin >> n >> m;
rep(i, m) {
cin >> l >> r;
ansL = max(ansL, l);
ansR = min(ansR, r);
}
cout << ans... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, (n))
typedef long long ll;
using namespace std;
int n, m, l, r, ansL, ansR = 1e9;
int main() {
cin >> n >> m;
rep(i, m) {
cin >> l >> r;
ansL = max(ansL, l);
ansR = min(ansR, r);
}
cout << max... | [
"call.add",
"call.arguments.add"
] | 852,117 | 852,118 | u658655325 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ans, low, hi;
cin >> n >> m;
vector<int> L(m), R(m);
for (int i = 0; i < m; i++) {
cin >> L.at(i) >> R.at(i);
}
low = L.at(0);
hi = R.at(0);
for (int i = 1; i < m; i++) {
if (L.at(i) > low) {
low = L.at(i);
}
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ans, low, hi;
cin >> n >> m;
vector<int> L(m), R(m);
for (int i = 0; i < m; i++) {
cin >> L.at(i) >> R.at(i);
}
low = L.at(0);
hi = R.at(0);
for (int i = 1; i < m; i++) {
if (L.at(i) > low) {
low = L.at(i);
}
if ... | [
"identifier.change",
"io.output.change",
"identifier.replace.remove",
"literal.replace.add"
] | 852,133 | 852,134 | u536015544 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int min = 0, max = n;
for (int i = 0; i < m; i++) {
int L, R;
cin >> L >> R;
if (min < L)
min = L;
if (max > R)
max = R;
}
cout << (max - min > 0 ? max - min + 1 : 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int min = 0, max = n;
for (int i = 0; i < m; i++) {
int L, R;
cin >> L >> R;
if (min < L)
min = L;
if (max > R)
max = R;
}
cout << (max - min >= 0 ? max - min + 1 : 0) << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 852,140 | 852,141 | u405230134 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define FORE(i, m, n) FOR(i, m, n + 1)
#define REP(i, n) FOR(i, 0, n)
#define REPE(i, n) FOR(i, 0, n + 1)
#define FORR(i, m) for (int(i) = (m); (i) >= 0; (i)--)
#define REPONE(i, n) FOR(i, 1, n... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define FORE(i, m, n) FOR(i, m, n + 1)
#define REP(i, n) FOR(i, 0, n)
#define REPE(i, n) FOR(i, 0, n + 1)
#define FORR(i, m) for (int(i) = (m); (i) >= 0; (i)--)
#define REPONE(i, n) FOR(i, 1, n... | [
"expression.operation.binary.change"
] | 852,155 | 852,156 | u481767096 | cpp |
p03037 | #include <bits/stdc++.h>
#define RANGE(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
signed main() {
int N, M;
cin >> N >> M;
int L_max = 0;
int R_min = INT_MAX;
RANGE(i, M) {
int l, r;
cin >> l >> r;
L_max = max(L_max, l);
R_min = min(R_min, r);
}
cout << ... | #include <bits/stdc++.h>
#define RANGE(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
signed main() {
int N, M;
cin >> N >> M;
int L_max = 0;
int R_min = INT_MAX;
RANGE(i, M) {
int l, r;
cin >> l >> r;
L_max = max(L_max, l);
R_min = min(R_min, r);
}
cout << ... | [
"call.add",
"call.arguments.add"
] | 852,157 | 852,158 | u310710814 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long... | [
"assignment.variable.change",
"identifier.change"
] | 852,163 | 852,164 | u335839000 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0, M = 0;
cin >> N >> M;
int lb = 0, rb = N;
vector<int> L(M, 0), R(M, 0);
for (int i = 0; i < M; ++i) {
cin >> L[i] >> R[i];
if (L[i] > lb) {
lb = L[i];
}
if (R[i] < rb) {
rb = R[i];
}
}
cout << rb - lb ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0, M = 0;
cin >> N >> M;
int lb = 0, rb = N;
vector<int> L(M, 0), R(M, 0);
for (int i = 0; i < M; ++i) {
cin >> L[i] >> R[i];
if (L[i] > lb) {
lb = L[i];
}
if (R[i] < rb) {
rb = R[i];
}
}
cout << max(rb -... | [
"call.add",
"call.arguments.add"
] | 852,176 | 852,177 | u384217508 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N, M, Lx, Rx;
cin >> N >> M;
vector<int> L(M), R(M);
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
vector<int>::iterator iterL = max_element(L.begin(), L.end());
size_t indexL = ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N, M, Lx, Rx;
cin >> N >> M;
vector<int> L(M), R(M);
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
vector<int>::iterator iterL = max_element(L.begin(), L.end());
size_t indexL = ... | [
"control_flow.branch.if.condition.change"
] | 852,190 | 852,191 | u226530091 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int min_n, max_n;
int l, r;
int ans;
min_n = (1 << 25);
max_n = -1;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> l >> r;
max_n = max(max_n, l);
min_n = min(min_n, r);
}
ans = min_n - max_n;
if (ans < 0)
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int min_n, max_n;
int l, r;
int ans;
min_n = (1 << 25);
max_n = -1;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> l >> r;
max_n = max(max_n, l);
min_n = min(min_n, r);
}
ans = min_n - max_n;
if (ans < 0)
co... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 852,200 | 852,201 | u863841238 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int M, N;
cin >> N >> M;
vector<vector<int>> data(M, vector<int>(2, 0));
for (int i = 0; i < M; i++) {
cin >> data.at(i).at(0) >> data.at(i).at(1);
}
int L = 0;
int R = N;
for (int i = 0; i < M; i++) {
L = max(data.at(i).at(0), L);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int M, N;
cin >> N >> M;
vector<vector<int>> data(M, vector<int>(2, 0));
for (int i = 0; i < M; i++) {
cin >> data.at(i).at(0) >> data.at(i).at(1);
}
int L = 0;
int R = N;
for (int i = 0; i < M; i++) {
L = max(data.at(i).at(0), L);
... | [
"expression.operation.binary.add"
] | 852,210 | 852,211 | u830811818 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> li(m);
vector<int> ri(m);
int l, r;
for (int i = 0; i < m; i++) {
cin >> l >> r;
li[i] = l;
ri[i] = r;
}
sort(li.rbegin(), li.rend());
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> li(m);
vector<int> ri(m);
int l, r;
for (int i = 0; i < m; i++) {
cin >> l >> r;
li[i] = l;
ri[i] = r;
}
sort(li.rbegin(), li.rend());
... | [
"call.add",
"call.arguments.add"
] | 852,217 | 852,218 | u199433843 | cpp |
p03037 | #define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define SORTD(a) sort(a.rbegin(), a.rend());
#define UNIQUE(a) unique(a.begin(), a.end())
#define ll long long
#define INF 1000000000000000000
#define INT_MAX 2147483647
#include <al... | #define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define SORTD(a) sort(a.rbegin(), a.rend());
#define UNIQUE(a) unique(a.begin(), a.end())
#define ll long long
#define INF 1000000000000000000
#define INT_MAX 2147483647
#include <al... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 852,228 | 852,229 | u489197691 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, R, L, mR, mL;
cin >> N >> M;
mR = 0;
mL = N;
for (int i = 0; i < M; i++) {
cin >> R >> L;
if (mR < R) {
mR = R;
}
if (mL > L) {
mL = L;
}
}
if (mL - mR > 0) {
cout << mL - mR + 1 << endl;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, R, L, mR, mL;
cin >> N >> M;
mR = 0;
mL = N;
for (int i = 0; i < M; i++) {
cin >> R >> L;
if (mR <= R) {
mR = R;
}
if (mL >= L) {
mL = L;
}
}
if (mL - mR > -1) {
cout << mL - mR + 1 << endl;
} else... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 852,240 | 852,241 | u041855176 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
// templates -------------------------------------
#define ULL unsigned long long
#define LL long long
#define LLD long long double
#define REP(i, n) for (LL i = 0; i < n; i++)
#define INV_REP(i, n) for (LL i = n; 0 <= i; i--)
LL combination(LL n, LL m) {
LL nume = 1;
... | #include <bits/stdc++.h>
using namespace std;
// templates -------------------------------------
#define ULL unsigned long long
#define LL long long
#define LLD long long double
#define REP(i, n) for (LL i = 0; i < n; i++)
#define INV_REP(i, n) for (LL i = n; 0 <= i; i--)
LL combination(LL n, LL m) {
LL nume = 1;
... | [
"call.add",
"call.arguments.add"
] | 852,244 | 852,245 | u042817784 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int l[100005];
int r[100005];
int main() {
int n, m, k;
cin >> n >> m;
int t = k;
int ll, rr;
cin >> ll >> rr;
for (int i = 1; i < m; i++) {
int x, y;
cin >> x >> y;
ll = max(x, ll);
rr = max(x, rr);
}
if (ll <= rr)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int l[100005];
int r[100005];
int main() {
int n, m, k;
cin >> n >> m;
int t = k;
int ll, rr;
cin >> ll >> rr;
for (int i = 1; i < m; i++) {
int x, y;
cin >> x >> y;
ll = max(x, ll);
rr = min(y, rr);
}
if (ll <= rr)
... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 852,258 | 852,259 | u269278772 | cpp |
p03037 | #include <bits/stdc++.h>
#define LL long long
#define Max 100005
const LL mod = 1e9 + 7;
const LL LL_MAX = 9223372036854775807;
using namespace std;
int l, r;
struct node {
int x, y;
} a[Max];
bool cmp(node a, node b) { return a.x < b.x; }
int ans = 0;
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = ... | #include <bits/stdc++.h>
#define LL long long
#define Max 100005
const LL mod = 1e9 + 7;
const LL LL_MAX = 9223372036854775807;
using namespace std;
int l, r;
struct node {
int x, y;
} a[Max];
bool cmp(node a, node b) { return a.x < b.x; }
int ans = 0;
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = ... | [
"call.arguments.add",
"call.arguments.change"
] | 852,260 | 852,261 | u790399429 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using Gate = std::pair<int, int>;
int solve(int n, const std::vector<Gate> &gates) {
int first = 1;
int last = n;
for (const auto &g : gates) {
first = std::max(first, g.first);
last = std::min(last, g.second);
if (last <=... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using Gate = std::pair<int, int>;
int solve(int n, const std::vector<Gate> &gates) {
int first = 1;
int last = n;
for (const auto &g : gates) {
first = std::max(first, g.first);
last = std::min(last, g.second);
if (last < ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 852,262 | 852,263 | u405612058 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
int L = -1, R = 1000000;
int Li, Ri;
for (int i = 0; i < M; i++) {
cin >> Li >> Ri;
if (Li > L)
L = Li;
if (Ri < R)
R = Ri;
}
cout << R - L ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
int L = -1, R = 1000000;
int Li, Ri;
for (int i = 0; i < M; i++) {
cin >> Li >> Ri;
if (Li > L)
L = Li;
if (Ri < R)
R = Ri;
}
cout << max(R ... | [
"call.add",
"call.arguments.add"
] | 852,266 | 852,267 | u904131021 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
auto L = vector<int>(M);
auto R = vector<int>(M);
for (int i = 0; i < M; i++)
cin >> L[i] >> R[i];
int minimum = *max_element(L.begin(), L.end());
int maxium = *min_element(R.begin()... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
auto L = vector<int>(M);
auto R = vector<int>(M);
for (int i = 0; i < M; i++)
cin >> L[i] >> R[i];
int minimum = *max_element(L.begin(), L.end());
int maxium = *min_element(R.begin()... | [
"call.add",
"call.arguments.change"
] | 852,270 | 852,271 | u726173718 | cpp |
p03037 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 852,272 | 852,273 | u775507068 | cpp |
p03037 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 852,274 | 852,273 | u775507068 | cpp |
p03037 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 852,275 | 852,273 | u775507068 | cpp |
p03037 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int maxl = -1, minr = 1000000;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
maxl = max(maxl, l);
minr... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int maxl = -1, minr = 10000000;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
maxl = max(maxl, l);
min... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 852,279 | 852,280 | u630664279 | cpp |
p03037 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m, l, r, al, ar;
cin >> n >> m;
al = 1, ar = n;
while (m--) {
cin >> l >> r;
al = max(al, l);
ar = min(ar, r);
}
cout << ar - al + 1 << '\n';
return... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m, l, r, al, ar;
cin >> n >> m;
al = 1, ar = n;
while (m--) {
cin >> l >> r;
al = max(al, l);
ar = min(ar, r);
}
cout << max(0LL, ar - al + 1) << '\n';... | [
"call.add",
"call.arguments.change"
] | 852,281 | 852,282 | u769237842 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long int llint;
typedef long int lint;
typedef vector<char> vchar;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<vector<char>> vvchar;
#define vsort(v) sort((v).begin(), (v).end())
#define vreverse(v) reverse((v).begin(), (v).end()... | #include <bits/stdc++.h>
using namespace std;
typedef long long int llint;
typedef long int lint;
typedef vector<char> vchar;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<vector<char>> vvchar;
#define vsort(v) sort((v).begin(), (v).end())
#define vreverse(v) reverse((v).begin(), (v).end()... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 852,283 | 852,284 | u557138271 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int lmax, rmin;
lmax = 0, rmin = N;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
if (l > lmax) {
lmax = l;
}
if (r < rmin) {
rmin = r;
}
}
int ans;
if (rmin - lmax > 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int lmax, rmin;
lmax = 0, rmin = N;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
if (l > lmax) {
lmax = l;
}
if (r < rmin) {
rmin = r;
}
}
int ans;
if (rmin - lmax + 1 > 0) ... | [
"control_flow.branch.if.condition.change"
] | 852,295 | 852,296 | u593555034 | cpp |
p03037 | #include <iostream>
using namespace std;
int n, m;
int r[100005];
int l[100005];
int main() {
cin >> n >> m;
int maxl = 0, minr = 99999999;
for (int i = 1; i <= m; i++) {
cin >> l[i] >> r[i];
maxl = max(maxl, l[i]);
minr = min(minr, r[i]);
}
cout << minr - maxl + 1;
return 0;
} | #include <iostream>
using namespace std;
int n, m;
int r[100005];
int l[100005];
int main() {
cin >> n >> m;
int maxl = 0, minr = 99999999;
for (int i = 1; i <= m; i++) {
cin >> l[i] >> r[i];
maxl = max(maxl, l[i]);
minr = min(minr, r[i]);
}
cout << max(minr - maxl + 1, 0);
return 0;
} | [
"call.add",
"call.arguments.add"
] | 852,297 | 852,298 | u261868146 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int left = 1;
int right = N;
for (int i = 0; i < M; ++i) {
int L,... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int left = 1;
int right = N;
for (int i = 0; i < M; ++i) {
int L,... | [
"call.add",
"call.arguments.change"
] | 852,299 | 852,300 | u045679746 | cpp |
p03037 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, M, L, R;
cin >> N >> M;
int min = 0, max = N + 1;
for (int i = 0; i < M; i++) {
cin >> L >> R;
if (min < L)
min = L;
if (max > R)
max = R;
}
int ans = 0;
if (max > min)
ans = max - min + 1;
cout <... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, M, L, R;
cin >> N >> M;
int min = 0, max = N + 1;
for (int i = 0; i < M; i++) {
cin >> L >> R;
if (min < L)
min = L;
if (max > R)
max = R;
}
int ans = 0;
if (max >= min)
ans = max - min + 1;
cout ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 852,301 | 852,302 | u079918228 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
int l[m], r[m], ma = -2, mi = INT_MAX;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
mi = min(mi, r[i]);
ma = max(ma, l[i]);
}
cout << mi - ma + 1 << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
int l[m], r[m], ma = -2, mi = INT_MAX;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
mi = min(mi, r[i]);
ma = max(ma, l[i]);
}
cout << max(mi - ma + 1, 0... | [
"call.add",
"call.arguments.add"
] | 852,315 | 852,316 | u121799456 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#define EPS (1e-7)
#define INF ... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#define EPS (1e-7)
#define INF ... | [
"call.add",
"call.arguments.add"
] | 852,324 | 852,325 | u551351897 | cpp |
p03037 | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
int min_ = 0;
int max_ ... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
int min_ = 0;
int max_ ... | [
"call.add",
"call.arguments.change"
] | 852,328 | 852,329 | u658993896 | cpp |
p03037 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1'000'000'007;
template <class T> bool chmax(T &a, const T &b) ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1'000'000'007;
template <class T> bool chmax(T &a, const T &b) ... | [
"call.add",
"call.arguments.change"
] | 852,332 | 852,333 | u756088996 | cpp |
p03037 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
v... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
v... | [
"call.add",
"call.arguments.add"
] | 852,334 | 852,335 | u299843956 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int g = INT_MAX, l = 1;
int L, R;
for (int i = 0; i < m; i++) {
cin >> L >> R;
l = max(L, l);
g = min(R, g);
}
cout << g - l + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int g = INT_MAX, l = 1;
int L, R;
for (int i = 0; i < m; i++) {
cin >> L >> R;
l = max(L, l);
g = min(R, g);
}
cout << max(g - l + 1, 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 852,341 | 852,342 | u331948661 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <locale>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
int l = 1;
int r = N;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
l = max(l, L);
... | #include <algorithm>
#include <iostream>
#include <locale>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
int l = 1;
int r = N;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
l = max(l, L);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 852,343 | 852,344 | u502685724 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int l[100005];
int r[100005];
int cl, cr;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
cl = 1;
cr = n;
for (int i = 1; i <= m; i++) {
cin >> l[i] >> r[i];
cl = max(cl, l[i]);
cr = min(cr, r[i]);
... | #include <bits/stdc++.h>
using namespace std;
int n, m;
int l[100005];
int r[100005];
int cl, cr;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
cl = 1;
cr = n;
for (int i = 1; i <= m; i++) {
cin >> l[i] >> r[i];
cl = max(cl, l[i]);
cr = min(cr, r[i]);
... | [
"call.add",
"call.arguments.add"
] | 852,349 | 852,350 | u659725815 | cpp |
p03037 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
void IOS() { ios::sync_with_stdio(false), cin.tie(0); }
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
const ld EP... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
void IOS() { ios::sync_with_stdio(false), cin.tie(0); }
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
const ld EP... | [
"call.arguments.add"
] | 852,365 | 852,366 | u872959410 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | [
"call.add",
"call.arguments.change",
"call.arguments.add"
] | 852,373 | 852,374 | u532573979 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long lo... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long lo... | [
"call.add",
"call.arguments.add"
] | 852,377 | 852,378 | u174404613 | cpp |
p03037 | // failed to generate code
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[M], R[M];
int l = 1, r = N;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
l = max(l, L[i]);
r = min(r, R[i]);
}
cout << r - l + 1 << endl;
}
| // failed to generate code
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[M], R[M];
int l = 1, r = N;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
l = max(l, L[i]);
r = min(r, R[i]);
}
cout << max(r - l + 1, 0) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 852,379 | 852,380 | u709604332 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, ... | [
"call.add",
"call.arguments.change"
] | 852,381 | 852,382 | u243196226 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int left = 1;
int right = n;
int l, r;
for (int i = 0; i < m; i++) {
cin >> l >> r;
if (left < l)
left = l;
if (right > r)
right = r;
}
cout << right - left + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int left = 1;
int right = n;
int l, r;
for (int i = 0; i < m; i++) {
cin >> l >> r;
if (left < l)
left = l;
if (right > r)
right = r;
}
cout << max(0, right - left + 1) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 852,383 | 852,384 | u013408661 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll n, m, lx = 0, rn = 1e9;
cin >> n >> m;
for (int i = 0; i < m; i++) {
ll l, r;
cin >> l >> r;
lx = max(lx, l);
rn = min(rn, r);
}
cout << rn - lx + 1 << ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll n, m, lx = 0, rn = 1e9;
cin >> n >> m;
for (int i = 0; i < m; i++) {
ll l, r;
cin >> l >> r;
lx = max(lx, l);
rn = min(rn, r);
}
cout << max(0ll, rn - l... | [
"call.add",
"call.arguments.change"
] | 852,387 | 852,388 | u921168761 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int l_max = 0;
int r_min = N;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
l_max = max(l_max, L);
r_min = min(r_min, R);
}
cout << r_min - l_max + 1 << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int l_max = 0;
int r_min = N;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
l_max = max(l_max, L);
r_min = min(r_min, R);
}
cout << max(0, r_min - l_max + 1) << endl;
} | [
"call.add",
"call.arguments.change"
] | 852,389 | 852,390 | u693133807 | cpp |
p03037 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
ret... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
ret... | [
"call.add",
"call.arguments.change"
] | 852,391 | 852,392 | u916974091 | cpp |
p03037 | #include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include ... | [] | 852,400 | 852,401 | u419874471 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define REP(i, j) FOR(i, 0, j)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long in... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define REP(i, j) FOR(i, 0, j)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long in... | [
"call.add",
"call.arguments.add"
] | 852,402 | 852,403 | u463697306 | cpp |
p03037 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
int L = 0, R = n + 1;
rep(i, m) {
int l, r;
s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
int L = 0, R = n + 1;
rep(i, m) {
int l, r;
s... | [
"call.add",
"call.arguments.change"
] | 852,406 | 852,407 | u781091740 | cpp |
p03037 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <random>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, M, mi = 0, ma = 100000000;
cin >> N >> M;
vector<ll> L(M), R(M);
f... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <random>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, M, mi = 0, ma = 100000000;
cin >> N >> M;
vector<ll> L(M), R(M);
f... | [
"call.add",
"call.arguments.change"
] | 852,408 | 852,409 | u394033362 | cpp |
p03037 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sta... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sta... | [
"call.add",
"call.arguments.add"
] | 852,410 | 852,411 | u587248350 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int R, m, L = 1;
cin >> R >> m;
for (int i = 0; i < m; i++) {
int l, r;
scanf("%d%d", &l, &r);
L = max(L, l);
R = min(R, r);
}
cout << R - L + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int R, m, L = 1;
cin >> R >> m;
for (int i = 0; i < m; i++) {
int l, r;
scanf("%d%d", &l, &r);
L = max(L, l);
R = min(R, r);
}
cout << max(0, R - L + 1) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 852,412 | 852,413 | u337381518 | cpp |
p03037 | // srinivas
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
// using namespace boost::multiprecision;
// using namespace __gnu_pbds;
#define all(c)... | // srinivas
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
// using namespace boost::multiprecision;
// using namespace __gnu_pbds;
#define all(c)... | [
"call.add",
"call.arguments.change"
] | 852,416 | 852,417 | u906227026 | cpp |
p03037 | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
// #define DEBUG 1
#define DFILE "t1.1"
int main() {
int n, m;
#ifdef DEBUG
#define cin fin
fstream fin(DFILE);
#endif
int min_n, max_n;
cin >> n >> m;
min_n = 1;
max_n = n;
for (int i... | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
// #define DEBUG 1
#define DFILE "t1.1"
int main() {
int n, m;
#ifdef DEBUG
#define cin fin
fstream fin(DFILE);
#endif
int min_n, max_n;
cin >> n >> m;
min_n = 1;
max_n = n;
for (int i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 852,428 | 852,429 | u147305315 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2... | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 852,436 | 852,437 | u933068010 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <c... | [
"call.add",
"call.arguments.add"
] | 852,447 | 852,448 | u959236700 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> void cmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, cl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> void cmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, cl... | [
"call.add",
"call.arguments.change"
] | 852,454 | 852,455 | u366644013 | cpp |
p03037 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
int lb, ub;
cin >> n >> m;
lb = 1;
ub = n;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
lb = max(l, lb);
ub = min(r, ub);
}
cout << ub - lb + 1 << endl;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
int lb, ub;
cin >> n >> m;
lb = 1;
ub = n;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
lb = max(l, lb);
ub = min(r, ub);
}
cout << max(0, ub - lb + 1) <<... | [
"call.add",
"call.arguments.change"
] | 852,460 | 852,461 | u426837411 | cpp |
p03037 | #include <iostream>
int main() {
unsigned long long N, M;
std::cin >> N >> M;
unsigned long long l = 0;
unsigned long long r = N;
for (unsigned long long m = 0; m < M; m++) {
unsigned long long L, R;
std::cin >> L >> R;
l = std::max(l, L);
r = std::min(r, R);
}
if (l >= r)
std::cout <... | #include <iostream>
int main() {
unsigned long long N, M;
std::cin >> N >> M;
unsigned long long l = 0;
unsigned long long r = N;
for (unsigned long long m = 0; m < M; m++) {
unsigned long long L, R;
std::cin >> L >> R;
l = std::max(l, L);
r = std::min(r, R);
}
if (l <= r)
std::cout <... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 852,464 | 852,465 | u896932701 | cpp |
p03037 | #include <iostream>
#include <queue>
#include <utility>
#include <vector>
int main(int argc, char const *argv[]) {
int n, m;
std::cin >> n >> m;
int left_max = 1;
int right_min = n;
for (int i = 0; i < m; ++i) {
int l, r;
std::cin >> l >> r;
;
left_max = std::max(left_max, l);
right_mi... | #include <iostream>
#include <queue>
#include <utility>
#include <vector>
int main(int argc, char const *argv[]) {
int n, m;
std::cin >> n >> m;
int left_max = 1;
int right_min = n;
for (int i = 0; i < m; ++i) {
int l, r;
std::cin >> l >> r;
;
left_max = std::max(left_max, l);
right_mi... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 852,466 | 852,467 | u197999770 | cpp |
p03037 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace... | [
"call.add",
"call.arguments.add"
] | 852,468 | 852,469 | u504098542 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L, R;
int L_res = 1, R_res = N;
for (int i = 0; i < M; i++) {
cin >> L >> R;
L_res = max(L, L_res);
R_res = min(R, R_res);
}
cout << R_res - L_res + 1... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L, R;
int L_res = 1, R_res = N;
for (int i = 0; i < M; i++) {
cin >> L >> R;
L_res = max(L, L_res);
R_res = min(R, R_res);
}
cout << max(R_res - L_res... | [
"call.add",
"call.arguments.add"
] | 852,470 | 852,471 | u238353279 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1e9 + 7
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int l[m], r[m];
rep(i, m) cin >> l[i] >> r[i];
int left ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1e9 + 7
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int l[m], r[m];
rep(i, m) cin >> l[i] >> r[i];
int left ... | [
"call.add",
"call.arguments.add"
] | 852,474 | 852,475 | u241908712 | cpp |
p03037 | #include <iostream>
#include <utility>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int minN = 1;
int maxN = N;
for (int m = 1; m <= M; ++m) {
int L, R;
cin >> L >> R;
minN = max(minN, L);
maxN = min(maxN, R);
}
cout << maxN - minN + 1 << endl;
return 0;
} | #include <iostream>
#include <utility>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int minN = 1;
int maxN = N;
for (int m = 1; m <= M; ++m) {
int L, R;
cin >> L >> R;
minN = max(minN, L);
maxN = min(maxN, R);
}
cout << max(maxN - minN + 1, 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 852,480 | 852,481 | u843070415 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int x = *max_element(begin(l), end(l));
int y = *min_element(begin(r), end(r));
cout << y - x + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int x = *max_element(begin(l), end(l));
int y = *min_element(begin(r), end(r));
cout << max(y - x + 1, 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 852,484 | 852,485 | u731175398 | cpp |
p03037 | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int Mmax = 1e5;
int N, M;
int L[Mmax], R[Mmax];
int main() {
cin >> N >> M;
for (int i = 0; i < M; i+... | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int Mmax = 1e5;
int N, M;
int L[Mmax], R[Mmax];
int main() {
cin >> N >> M;
for (int i = 0; i < M; i+... | [
"call.add",
"call.arguments.change"
] | 852,490 | 852,491 | u534998883 | cpp |
p03037 | // C - Prison
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, m, l, r;
cin >> n >> m;
int ll = 1, rr = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
ll = max(ll, l);
rr = min(rr, r);
}
cout << (rr - ll + 1) << endl;
return 0;
}
| // C - Prison
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, m, l, r;
cin >> n >> m;
int ll = 1, rr = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
ll = max(ll, l);
rr = min(rr, r);
}
cout << max(0, rr - ll + 1) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 852,502 | 852,503 | u839953699 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(N), R(N);
for (int i = 0; i < M; i++)
cin >> L.at(i) >> R.at(i);
int l = 1, r = 100000;
for (int i = 0; i < M; i++) {
l = max(l, L.at(i));
r = min(r, R.at(i));
}
... | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
for (int i = 0; i < M; i++)
cin >> L.at(i) >> R.at(i);
int l = 1, r = N;
for (int i = 0; i < M; i++) {
l = max(l, L.at(i));
r = min(r, R.at(i));
}
if (... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 852,508 | 852,509 | u618649215 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < n; i++)
using namespace std;
int main(void) {
cout.precisi... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < n; i++)
using namespace std;
int main(void) {
cout.precisi... | [
"call.add",
"call.arguments.change"
] | 852,510 | 852,511 | u995792346 | cpp |
p03037 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
REP(i, M) cin >> L[i] >> R[i];
int l = 1, r = N;
for (int i = 0; i < M; ++i) {
l = max(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
REP(i, M) cin >> L[i] >> R[i];
int l = 1, r = N;
for (int i = 0; i < M; ++i) {
l = max(... | [
"call.add",
"call.arguments.change"
] | 852,512 | 852,513 | u318727472 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
#define rep(i, n) for (int i = 0; i < (n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
#define rep(i, n) for (int i = 0; i < (n... | [
"call.add",
"call.arguments.add"
] | 852,522 | 852,523 | u823451365 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int lm = 0, rm = 1000000;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
lm = max(lm, l);
rm = min(rm, r);
}
cout << rm - lm + 1 << endl;
return ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int lm = 0, rm = 1000000;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
lm = max(lm, l);
rm = min(rm, r);
}
cout << max(rm - lm + 1, 0) << endl;
... | [
"call.add",
"call.arguments.add"
] | 852,526 | 852,527 | u662614053 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | [
"call.add",
"call.arguments.add"
] | 852,528 | 852,529 | u381714561 | cpp |
p03037 | #include <bits/stdc++.h>
/**/
#include <random>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
long long int ansmin = -1, ansmax = 100000000LL;
for (size_t i = 0; i < M; i++) {
long long int L, R;
cin >> L >> R;
ansmin = max(L, ansmin);
ansmax = min(R, ansmax);
}
cout ... | #include <bits/stdc++.h>
/**/
#include <random>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
long long int ansmin = -1, ansmax = 100000000LL;
for (size_t i = 0; i < M; i++) {
long long int L, R;
cin >> L >> R;
ansmin = max(L, ansmin);
ansmax = min(R, ansmax);
}
cout ... | [
"call.add",
"call.arguments.change"
] | 852,530 | 852,531 | u779353743 | cpp |
p03037 | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define PB push_back
#define MP make_pair
int N, M;
int main() {
cin >> N >> M;
int l, r;
cin >> l >> r;
for (int i = 1; i < M; i++) {
int a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << r - l + 1 << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define PB push_back
#define MP make_pair
int N, M;
int main() {
cin >> N >> M;
int l, r;
cin >> l >> r;
for (int i = 1; i < M; i++) {
int a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << max(0, r - l + 1) << endl... | [
"call.add",
"call.arguments.change"
] | 852,532 | 852,533 | u422592877 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define INF 1000000000000000
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define pb push_back
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
struct edge {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define INF 1000000000000000
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define pb push_back
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
struct edge {
... | [
"call.add",
"call.arguments.change"
] | 852,534 | 852,535 | u006686215 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
... | [
"call.add",
"call.arguments.change"
] | 852,542 | 852,543 | u287015418 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 852,546 | 852,547 | u550398291 | cpp |
p03038 | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(n, x) ... | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(n, x) ... | [
"expression.operation.binary.remove",
"control_flow.loop.condition.change"
] | 852,548 | 852,549 | u936877713 | cpp |
p03038 | #include <algorithm>
#include <cstdio>
const int maxn = 1e5 + 5;
int n, m, a[maxn];
struct Op {
int b, c;
bool operator<(Op b) const { return c > b.c; }
} p[maxn];
long long ans;
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]), ans += a[i];
for (int i = 1; i <= m; ++i)... | #include <algorithm>
#include <cstdio>
const int maxn = 1e5 + 5;
int n, m, a[maxn];
struct Op {
int b, c;
bool operator<(Op b) const { return c > b.c; }
} p[maxn];
long long ans;
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]), ans += a[i];
for (int i = 1; i <= m; ++i)... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 852,550 | 852,551 | u571935386 | cpp |
p03038 | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for (ll i = (k); i < (n); i++)
#define FORe(i, k, n) for (ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for (ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre... | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for (ll i = (k); i < (n); i++)
#define FORe(i, k, n) for (ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for (ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre... | [
"control_flow.loop.condition.change"
] | 852,554 | 852,555 | u961136005 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <vector>
int main(void) {
int n, m;
std::cin >> n >> m;
std::vector<int> a(n);
std::vector<std::pair<int, int>> bc(m);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < m; i++) {
int b, c;
std::cin >> b >> c;
bc[i] = std... | #include <algorithm>
#include <iostream>
#include <vector>
int main(void) {
int n, m;
std::cin >> n >> m;
std::vector<long long> a(n);
std::vector<std::pair<long long, long long>> bc(m);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < m; i++) {
int b, c;
std::cin >> b >> ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 852,558 | 852,559 | u275256557 | cpp |
p03038 | #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... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 852,566 | 852,567 | u434398296 | cpp |
p03037 | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << ' '; ... | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << ' '; ... | [
"call.add",
"call.arguments.add"
] | 852,572 | 852,573 | u135248164 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef int ll;
typedef long double ld;
const ll N = 100005;
char en = '\n';
ll inf = 1e16;
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
re... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef int ll;
typedef long double ld;
const ll N = 100005;
char en = '\n';
ll inf = 1e16;
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
re... | [
"call.add",
"call.arguments.change"
] | 852,574 | 852,575 | u401416019 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int left, right, l, r, n, m;
cin >> n >> m;
left = 1;
right = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
left = max(left, l);
right = min(right, r);
}
cout << right - left + 1 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int left, right, l, r, n, m;
cin >> n >> m;
left = 1;
right = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
left = max(left, l);
right = min(right, r);
}
cout << max(0, right - left + 1) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 852,582 | 852,583 | u749475370 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N, M;
cin >> N >> M;
int L[M], R[M];
rep(i, M) { cin >> L[i] >> R[i]; }
int L_max = 1, R_min = N;
rep(i, M) {
L_max = max(L_max, L[i]);
R_min = min(R_min, R[i]);
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N, M;
cin >> N >> M;
int L[M], R[M];
rep(i, M) { cin >> L[i] >> R[i]; }
int L_max = 1, R_min = N;
rep(i, M) {
L_max = max(L_max, L[i]);
R_min = min(R_min, R[i]);
}
... | [
"call.add",
"call.arguments.add"
] | 852,584 | 852,585 | u263654061 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L = 1, R = N;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
L = max(L, l);
R = min(R, r);
}
cout << R - L + 1 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L = 1, R = N;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
L = max(L, l);
R = min(R, r);
}
cout << max(0, R - L + 1) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 852,598 | 852,599 | u587172770 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
// rep
//------------------------------------------
#define FOR(i, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
// rep
//------------------------------------------
#define FOR(i, ... | [
"call.add",
"call.arguments.add"
] | 852,602 | 852,603 | u187153832 | cpp |
p03037 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
int main(int argc, co... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
int main(int argc, co... | [
"call.add",
"call.arguments.change"
] | 852,604 | 852,605 | u320491590 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++)
cin >> l[i] >> r[i];
int L = 0, M = n - 1;
for (int i = 0; i < m; i++) {
if (L < l[i] - 1)
L = l[i] - 1;
if (M > r[i] - 1)
M = r[i] - 1;
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++)
cin >> l[i] >> r[i];
int L = 0, M = n - 1;
for (int i = 0; i < m; i++) {
if (L < l[i] - 1)
L = l[i] - 1;
if (M > r[i] - 1)
M = r[i] - 1;
}
cout ... | [
"call.add",
"call.arguments.add"
] | 852,606 | 852,607 | u057079894 | cpp |
p03037 | #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);
... | [
"call.add",
"call.arguments.change"
] | 852,618 | 852,619 | u779159595 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.