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 <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
int n, m;
cin >... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
int n, m;
cin >... | [
"call.add",
"call.arguments.add"
] | 850,185 | 850,186 | u678961336 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int L = 0, 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 << "\n"s;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int L = 0, 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) << "\n"s;
}
| [
"call.add",
"call.arguments.change"
] | 850,193 | 850,194 | u104613587 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int L = 0, R = 1e9;
for (int i = 0; i < m; ++i) {
int l, r;
cin >> l >> r;
L = max(L, l), R = min(R, r);
}
cout << (R - L > 0 ? R - L + 1 : 0) << "\n"s;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int L = 0, R = 1e9;
for (int i = 0; i < m; ++i) {
int l, r;
cin >> l >> r;
L = max(L, l), R = min(R, r);
}
cout << (R - L >= 0 ? R - L + 1 : 0) << "\n"s;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 850,195 | 850,196 | u104613587 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> L(m);
vector<int> R(m);
for (int i = 0; i < m; i++) {
cin >> L.at(i) >> R.at(i);
}
int l = 0, r = 9999999;
for (int i = 0; i < m; i++) {
l = max(l, L.at(i));
r = min(r, R.at(i));
}
int ans = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> L(m);
vector<int> R(m);
for (int i = 0; i < m; i++) {
cin >> L.at(i) >> R.at(i);
}
int l = 0, r = 999999;
for (int i = 0; i < m; i++) {
l = max(l, L.at(i));
r = min(r, R.at(i));
}
int ans = 0;... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 850,207 | 850,208 | u856957535 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> L(m);
vector<int> R(m);
for (int i = 0; i < m; i++) {
cin >> L.at(i) >> R.at(i);
}
int l = 0, r = 999999;
for (int i = 0; i < m; i++) {
l = max(l, L.at(i));
r = min(r, R.at(i));
}
int ans = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> L(m);
vector<int> R(m);
for (int i = 0; i < m; i++) {
cin >> L.at(i) >> R.at(i);
}
int l = 0, r = 999999;
for (int i = 0; i < m; i++) {
l = max(l, L.at(i));
r = min(r, R.at(i));
}
int ans = 0;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 850,209 | 850,208 | u856957535 | cpp |
p03037 | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
void scan() {
#ifdef NURS
freopen("main.in", "r", stdin);
freopen("main.out", "w", stdout);
#endif
}
const int N = 1e6 + 500;
const int mod = 1e9 + 7;
int pref[N];
int main() {
scan();
int n, m;
cin >> n >> m;
for (in... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
void scan() {
#ifdef NURS
freopen("main.in", "r", stdin);
freopen("main.out", "w", stdout);
#endif
}
const int N = 1e6 + 500;
const int mod = 1e9 + 7;
int pref[N];
int main() {
scan();
int n, m;
cin >> n >> m;
for (in... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 850,210 | 850,211 | u165212329 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; i++)
cin >> l[i] >> r[i];
sort(l, l + m, greater<int>());
sort(r, r + m);
if (r[0] - l[0] > 0)
cout << r[0] - l[0] + 1 << endl;
else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; i++)
cin >> l[i] >> r[i];
sort(l, l + m, greater<int>());
sort(r, r + m);
if (r[0] - l[0] >= 0)
cout << r[0] - l[0] + 1 << endl;
else
cout << 0 << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,218 | 850,219 | u351148423 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define EACH(i, a, b) for (int i = (a); i <= (b); i++)
#define ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define EACH(i, a, b) for (int i = (a); i <= (b); i++)
#define ... | [
"call.add",
"call.arguments.add"
] | 850,226 | 850,227 | u616360029 | cpp |
p03037 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
#define all(i) i.begin(), i.end()
using namespace std;
const long long INF = 1e9 + 7;
const string alp = "abcdefghijklmnopqrstuvwxyz"; // 26
const string ALP ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
#define all(i) i.begin(), i.end()
using namespace std;
const long long INF = 1e9 + 7;
const string alp = "abcdefghijklmnopqrstuvwxyz"; // 26
const string ALP ... | [
"variable_declaration.value.change",
"identifier.change"
] | 850,239 | 850,240 | u251242696 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mxn = 5e5 + 5;
#define mod 1000000007
#define endl '\n'
void rishabh() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
rishabh();
int n, m;
cin >> n >> m;
int x, y;
x = -1e6, y = 1e6;
for (int i = 0; i < m; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mxn = 5e5 + 5;
#define mod 1000000007
#define endl '\n'
void rishabh() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
rishabh();
int n, m;
cin >> n >> m;
int x, y;
x = -1e6, y = 1e6;
for (int i = 0; i < m; i... | [
"control_flow.branch.if.condition.change"
] | 850,246 | 850,247 | u577654787 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
vector<int> L(100010), R(100010);
cin >> N >> M;
for (int i = 0; i < M; i++)
cin >> L[i] >> R[i];
int left = 1;
int right = N;
for (int i = 0; i < M; i++) {
left = max(left, L[i]);
right = min(right, R[i]);
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
vector<int> L(100010), R(100010);
cin >> N >> M;
for (int i = 0; i < M; i++)
cin >> L[i] >> R[i];
int left = 1;
int right = N;
for (int i = 0; i < M; i++) {
left = max(left, L[i]);
right = min(right, R[i]);
}
cout << ... | [
"call.add",
"call.arguments.change"
] | 850,258 | 850,259 | u285358283 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, l, r, ans;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
cin >> L[0] >> R[0];
l = L[0];
r = R[0];
for (int i = 1; i < M; i++) {
cin >> L[i] >> R[i];
l = max(l, L[i]);
r = min(r, R[i]);
}
ans = r - l + 1;
if (... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M, l, r, ans;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
cin >> L[0] >> R[0];
l = L[0];
r = R[0];
for (int i = 1; i < M; i++) {
cin >> L[i] >> R[i];
l = max(l, L[i]);
r = min(r, R[i]);
}
ans = r - l + 1;
if (... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"identifier.change",
"assignment.value.change"
] | 850,276 | 850,277 | u066538689 | cpp |
p03037 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<... | [
"call.add",
"call.arguments.change"
] | 850,278 | 850,279 | u242679311 | cpp |
p03037 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
#define LL_MAX (1 << 30)
using namespace std;
int main() {
ll n, m;
vector<ll> r;
vector<ll> l;
cin >> n >> m;
ll tmp;
for (ll i = 0; i < m; i++) {
... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
#define LL_MAX (1 << 30)
using namespace std;
int main() {
ll n, m;
vector<ll> r;
vector<ll> l;
cin >> n >> m;
ll tmp;
for (ll i = 0; i < m; i++) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,280 | 850,281 | u778668639 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
//#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
//#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) ... | [
"call.add",
"call.arguments.add"
] | 850,296 | 850,297 | u697090185 | cpp |
p03037 | #define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (ll i##_len = (n), i = i##_len - 1; i >= 0; --i)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define printd(val) std::cout << #val " = " << val << "\n";
#define lim 1000000007ll
#include <bits/stdc++.h>
using ll = long... | #define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (ll i##_len = (n), i = i##_len - 1; i >= 0; --i)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define printd(val) std::cout << #val " = " << val << "\n";
#define lim 1000000007ll
#include <bits/stdc++.h>
using ll = long... | [
"call.add",
"call.arguments.change",
"call.arguments.add"
] | 850,298 | 850,299 | u954176652 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m, L, R, MIN = 1e9, MAX = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> L >> R;
MAX = max(MAX, L);
MIN = min(MIN, R);
}
cout << MIN - MAX + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m, L, R, MIN = 1e9, MAX = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> L >> R;
MAX = max(MAX, L);
MIN = min(MIN, R);
}
cout << max(0, MIN - MAX + 1) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 850,300 | 850,301 | u675509234 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> left(M);
vector<int> right(M);
for (int i = 0; i < M; i++) {
cin >> left[i];
cin >> right[i];
}
sort(left.begin(), left.end());
reverse(left.begin(), left.end());
sort(right.begin(), right.end())... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> left(M);
vector<int> right(M);
for (int i = 0; i < M; i++) {
cin >> left[i];
cin >> right[i];
}
sort(left.begin(), left.end());
reverse(left.begin(), left.end());
sort(right.begin(), right.end())... | [
"literal.number.change",
"io.output.change"
] | 850,313 | 850,314 | u762502257 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
static int n, m;
static int l[100010], r[100010];
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &l[i], &r[i]);
}
int MIN = 1, MAX = n;
for (int i = 1; i <= m; i++) {
MIN = max(MIN, l[i]);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
static int n, m;
static int l[100010], r[100010];
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &l[i], &r[i]);
}
int MIN = 1, MAX = n;
for (int i = 1; i <= m; i++) {
MIN = max(MIN, l[i]);
... | [
"call.add",
"call.arguments.change"
] | 850,319 | 850,320 | u957457849 | cpp |
p03037 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int l, r, n, m;
int main() {
scanf("%d%d", &n, &m);
scanf("%d%d", &l, &r);
for (int i = 1; i < m; i++) {
int x, y;
scanf("%d%d", &x, &y);
l = max(x, l);
r = max(y, r);
}
printf("%d\n", r >= l ? r ... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int l, r, n, m;
int main() {
scanf("%d%d", &n, &m);
scanf("%d%d", &l, &r);
for (int i = 1; i < m; i++) {
int x, y;
scanf("%d%d", &x, &y);
l = max(x, l);
r = min(y, r);
}
printf("%d\n", r >= l ? r ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 850,325 | 850,326 | u427571081 | cpp |
p03037 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX(x, y) (x > y ? x : y)
#define MIN(x, y) (x < y ? x : y)
#define ABS(x) (x > 0 ? x : -(x))
int main() {
int N, M;
int L[100000];
int R[100000];
int max, min;
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++)
scanf("%d%d", &L[i], ... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX(x, y) (x > y ? x : y)
#define MIN(x, y) (x < y ? x : y)
#define ABS(x) (x > 0 ? x : -(x))
int main() {
int N, M;
int L[100000];
int R[100000];
int max, min;
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++)
scanf("%d%d", &L[i], ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 850,333 | 850,334 | u314920173 | 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];
}
sort(l.begin(), l.end());
sort(r.begin(), r.end());
cout << r[0] - l[m - 1] + 1 << endl;
return 0;
} | #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];
}
sort(l.begin(), l.end());
sort(r.begin(), r.end());
cout << max(0, r[0] - l[m - 1] + 1) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 850,343 | 850,344 | u180716041 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a, b;
cin >> a >> b;
for (int i = 0; i < m - 1; i++) {
int c;
cin >> c;
a = max(a, c);
int d;
cin >> d;
b = min(b, d);
}
cout << max(0, b - a) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a, b;
cin >> a >> b;
for (int i = 0; i < m - 1; i++) {
int c;
cin >> c;
a = max(a, c);
int d;
cin >> d;
b = min(b, d);
}
cout << max(0, b - a + 1) << endl;
} | [
"expression.operation.binary.add"
] | 850,345 | 850,346 | u356701928 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
int ans1 = 0;
int ans2 = 10000;
for (int i = 0; i < m; i++) {
cin >> l.at(i) >> r.at(i);
ans1 = max(ans1, l.at(i));
ans2 = min(ans2, r.at(i));
}
if (ans2 - ans1 < 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
int ans1 = 0;
int ans2 = 1000000;
for (int i = 0; i < m; i++) {
cin >> l.at(i) >> r.at(i);
ans1 = max(ans1, l.at(i));
ans2 = min(ans2, r.at(i));
}
if (ans2 - ans1 < 0) {... | [
"literal.number.change",
"variable_declaration.value.change"
] | 850,363 | 850,364 | u955282280 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
int ans1 = 0;
int ans2 = 10000;
for (int i = 0; i < m; i++) {
cin >> l.at(i) >> r.at(i);
ans1 = max(ans1, l.at(i));
ans2 = min(ans2, r.at(i));
}
if (ans2 - ans1 < 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
int ans1 = 0;
int ans2 = 1000000;
for (int i = 0; i < m; i++) {
cin >> l.at(i) >> r.at(i);
ans1 = max(ans1, l.at(i));
ans2 = min(ans2, r.at(i));
}
if (ans2 - ans1 < 0) {... | [
"literal.number.change",
"variable_declaration.value.change"
] | 850,365 | 850,364 | u955282280 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
vector<int> A(N);
for (int i = 0; i < N; ++i) {
A[i] = i + 1;
}
int num = 1e7;
int num2 = -1;
int num3 = 0;
for (int i = 0; i < M; ++i) {
cin >> L[i];
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
vector<int> A(N);
for (int i = 0; i < N; ++i) {
A[i] = i + 1;
}
int num = 1e7;
int num2 = -1;
int num3 = 0;
for (int i = 0; i < M; ++i) {
cin >> L[i];
c... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 850,369 | 850,370 | u091026689 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
vector<int> A(N);
for (int i = 0; i < N; ++i) {
A[i] = i + 1;
}
int num = 1e7;
int num2 = -1;
int num3 = 0;
for (int i = 0; i < M; ++i) {
cin >> L[i];
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
vector<int> A(N);
for (int i = 0; i < N; ++i) {
A[i] = i + 1;
}
int num = 1e7;
int num2 = -1;
int num3 = 0;
for (int i = 0; i < M; ++i) {
cin >> L[i];
c... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 850,371 | 850,370 | u091026689 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define what_is_v(x) \
cerr << #x << " is "; \
for (auto &e : (x)) ... | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define what_is_v(x) \
cerr << #x << " is "; \
for (auto &e : (x)) ... | [
"call.add",
"call.arguments.change"
] | 850,374 | 850,375 | u411771230 | 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.at(i) >> R.at(i);
}
sort(L.begin(), L.end(), greater<int>());
sort(R.begin(), R.end());
cout << min(N, R.at(0)) - L.at(0) + 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.at(i) >> R.at(i);
}
sort(L.begin(), L.end(), greater<int>());
sort(R.begin(), R.end());
cout << max(0, min(N, R.at(0)) - L.at(0) + 1) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 850,376 | 850,377 | u304862095 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
struct node {
int l, r;
};
int m, n;
node a[maxn];
int kq;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++)
cin >> a[i].l >> a[i].r;
int L = 0;
for (int i = 1; i <= m; i++)
L = max(L, a[i].l);
int R = n + 1;
for... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
struct node {
int l, r;
};
int m, n;
node a[maxn];
int kq;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++)
cin >> a[i].l >> a[i].r;
int L = 0;
for (int i = 1; i <= m; i++)
L = max(L, a[i].l);
int R = n + 1;
for... | [
"call.add",
"call.arguments.change"
] | 850,378 | 850,379 | u013476277 | cpp |
p03037 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define sqr(x) ((x) * (x))
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
typedef long long ll;
int main() {
int N, M, max_L = 0, min_R = 1000000;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int L, R;
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define sqr(x) ((x) * (x))
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
typedef long long ll;
int main() {
int N, M, max_L = 0, min_R = 1000000;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int L, R;
... | [
"call.add",
"call.arguments.add"
] | 850,380 | 850,381 | u346180161 | cpp |
p03037 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define print(x) cout << (x) << endl
#define FOR(i, a, ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define print(x) cout << (x) << endl
#define FOR(i, a, ... | [
"call.add",
"call.arguments.change"
] | 850,382 | 850,383 | u301893320 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(n);
vector<int> r(n);
int mal = 0;
int mar = 0;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
mal = max(mal, l[i]);
mar = max(mar, r[i]);
}
if (mal <= mar) {
cout << mar - mal + 1 <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
int mal = 0;
int mar = 10000000;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
mal = max(mal, l[i]);
mar = min(mar, r[i]);
}
if (mal <= mar) {
cout << mar - mal... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 850,388 | 850,387 | u103850114 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt;
int n, m;
cin >> n >> m;
int L[m], R[m];
for (i = 0; i < m; i++)
cin >> L[i] >> R[i];
int maL = 0, miR = 1000000;
for (i = 0; i < m; i++) {
maL = max(maL, L[i]);
miR = min(miR, R[i]);
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt;
int n, m;
cin >> n >> m;
int L[m], R[m];
for (i = 0; i < m; i++)
cin >> L[i] >> R[i];
int maL = 0, miR = 1000000;
for (i = 0; i < m; i++) {
maL = max(maL, L[i]);
miR = min(miR, R[i]);
}
cout <<... | [
"call.add",
"call.arguments.change"
] | 850,389 | 850,390 | u952130512 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt;
int n, m;
cin >> n >> m;
int L[m], R[m];
for (i = 0; i < m; i++)
cin >> L[i] >> R[i];
int maL = 0, miR = 1000000;
for (i = 0; i < m; i++) {
maL = max(maL, L[i]);
miR = min(miR, R[i]);
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt;
int n, m;
cin >> n >> m;
int L[m], R[m];
for (i = 0; i < m; i++)
cin >> L[i] >> R[i];
int maL = 0, miR = 1000000;
for (i = 0; i < m; i++) {
maL = max(maL, L[i]);
miR = min(miR, R[i]);
}
cout <<... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"call.arguments.add",
"call.arguments.change"
] | 850,391 | 850,390 | u952130512 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
for (int i = 0; i < M; i++) {
cin >> L.at(i) >> R.at(i);
}
int ans = min(*min_element(R.begin(), R.end()) -
*max_element(L... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
for (int i = 0; i < M; i++) {
cin >> L.at(i) >> R.at(i);
}
int ans = max(*min_element(R.begin(), R.end()) -
*max_element(L... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 850,394 | 850,395 | u976833038 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
for (int i = 0; i < M; i++) {
cin >> L.at(i) >> R.at(i);
}
int ans =
*min_element(R.begin(), R.end()) - *max_element(L.begin(), L.end())... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
for (int i = 0; i < M; i++) {
cin >> L.at(i) >> R.at(i);
}
int ans = max(*min_element(R.begin(), R.end()) -
*max_element(L... | [
"call.add",
"call.arguments.change",
"call.arguments.add"
] | 850,396 | 850,395 | u976833038 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int a, b, c, d;
a = 1;
b = N;
for (int i = 0; i < M; i++) {
cin >> c >> d;
if (a < c)
a = c;
if (d < b)
b = d;
}
cout << b - a + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int a, b, c, d;
a = 1;
b = N;
for (int i = 0; i < M; i++) {
cin >> c >> d;
if (a < c)
a = c;
if (d < b)
b = d;
}
cout << max(0, b - a + 1) << endl;
} | [
"call.add",
"call.arguments.change"
] | 850,397 | 850,398 | u136342563 | cpp |
p03037 | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int mins = 1;
int maxs = N;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
mins = max(mins, L);
maxs = min(maxs, R);
}
cout << maxs -... | #include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int mins = 1;
int maxs = N;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
mins = max(mins, L);
maxs = min(maxs, R);
}
cout << max(0,... | [
"call.add",
"call.arguments.change"
] | 850,409 | 850,410 | u064359585 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> p(m);
for (int i = 0; i < m; i++) {
cin >> p[i].first >> p[i].second;
}
int s = 0;
int t = 0;
for (int i = 0; i < m; i++) {
s = max(s, p[i].first);
t = min(t, p[i].second);
}
int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> p(m);
for (int i = 0; i < m; i++) {
cin >> p[i].first >> p[i].second;
}
int s = 0;
int t = n;
for (int i = 0; i < m; i++) {
s = max(s, p[i].first);
t = min(t, p[i].second);
}
int ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 850,422 | 850,423 | u882039496 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> p(m);
for (int i = 0; i < m; i++) {
cin >> p[i].first >> p[i].second;
}
int s = 0;
int t = 0;
for (int i = 0; i < m; i++) {
s = max(s, p[i].first);
t = min(t, p[i].second);
}
int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> p(m);
for (int i = 0; i < m; i++) {
cin >> p[i].first >> p[i].second;
}
int s = 0;
int t = n;
for (int i = 0; i < m; i++) {
s = max(s, p[i].first);
t = min(t, p[i].second);
}
int ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 850,424 | 850,423 | u882039496 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll BIG = 1000000007;
int main() {
int N, M;
cin ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll BIG = 1000000007;
int main() {
int N, M;
cin ... | [
"call.add",
"call.arguments.change"
] | 850,425 | 850,426 | u004411048 | cpp |
p03037 | #include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define rep(i, initial_value, max_value) \
for (uint64_t i{initial_value}; i < max_value; ++i)
#define fore(i, a) for (auto &i : a)
#define each(i, c) ... | #include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define rep(i, initial_value, max_value) \
for (uint64_t i{initial_value}; i < max_value; ++i)
#define fore(i, a) for (auto &i : a)
#define each(i, c) ... | [
"assignment.change"
] | 850,427 | 850,428 | u955529484 | cpp |
p03037 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) <... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) <... | [
"call.add",
"call.arguments.add"
] | 850,434 | 850,435 | u516525290 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
int main() {
ll N,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
int main() {
ll N,... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 850,445 | 850,446 | u730271001 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
int main() {
ll N,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
int main() {
ll N,... | [
"control_flow.branch.if.condition.change"
] | 850,447 | 850,446 | u730271001 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [
"call.add",
"call.arguments.add"
] | 850,450 | 850,451 | u987913144 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [
"call.add",
"call.arguments.add"
] | 850,452 | 850,453 | u987913144 | cpp |
p03037 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L = 0, R = N + 1;
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;
}
| #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L = 0, R = N + 1;
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;
}
| [
"call.add",
"call.arguments.change"
] | 850,456 | 850,457 | u119098168 | cpp |
p03037 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vv = vector<vector<int>>;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> ans(n, 1);
int mn, mx;
rep(i, m) {
int l, r;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vv = vector<vector<int>>;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> ans(n, 1);
int mn, mx;
rep(i, m) {
int l, r;... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 850,462 | 850,463 | u548778623 | cpp |
p03037 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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);
}... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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);
}... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 850,464 | 850,465 | u455266724 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
rep(i, m) cin >> l[i] >> r[i];
int L = *max_element(l.begin(), l.end());
int R = *min_element(r.begin(), r.end());
int ans = L - R + 1;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
rep(i, m) cin >> l[i] >> r[i];
int L = *max_element(l.begin(), l.end());
int R = *min_element(r.begin(), r.end());
int ans = R - L + 1;... | [
"expression.operation.binary.remove"
] | 850,477 | 850,478 | u928712536 | cpp |
p03037 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define ALL(v) v.begin(), v.end()
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
template <class T> inline T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template <class T> inline T LCM(... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define ALL(v) v.begin(), v.end()
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
template <class T> inline T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template <class T> inline T LCM(... | [
"call.add",
"call.arguments.change"
] | 850,479 | 850,480 | u445457059 | cpp |
p03037 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
using str = string;
typedef pair<int, int> P;
typedef vector<int> vi;
ll gcd(ll a, ll b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
using str = string;
typedef pair<int, int> P;
typedef vector<int> vi;
ll gcd(ll a, ll b... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 850,481 | 850,482 | u420130252 | cpp |
p03037 | #include <algorithm>
#include <array>
#include <cstddef>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int right = n;
int left = 1;
for (int i = 0; i < m; i++) {
int l, r;
cin >> ... | #include <algorithm>
#include <array>
#include <cstddef>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int right = n;
int left = 1;
for (int i = 0; i < m; i++) {
int l, r;
cin >> ... | [
"call.add",
"call.arguments.change"
] | 850,487 | 850,488 | u537234062 | cpp |
p03037 | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
#define re return
#define mp map<int, int>
#define N 200005
using namespace std;
int l[N], r[N];
int main() {
int n, m;
cin >> n >> m;
rep(i, 1, m) cin >> l[... | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
#define re return
#define mp map<int, int>
#define N 200005
using namespace std;
int l[N], r[N];
int main() {
int n, m;
cin >> n >> m;
rep(i, 1, m) cin >> l[... | [
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 850,499 | 850,500 | u796123030 | cpp |
p03037 | #include <algorithm> //辞書順=next_permutation
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <locale>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string> //char 小文字のほうが32大きい
#include <time.h>
#... | #include <algorithm> //辞書順=next_permutation
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <locale>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string> //char 小文字のほうが32大きい
#include <time.h>
#... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 850,508 | 850,509 | u742306624 | cpp |
p03037 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
int most_left = -1;
int most_right = n + 1;
rep(i, m) {
int lef, rig;
cin >> lef >> rig;
most_left = max(lef, most_left... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
int most_left = -1;
int most_right = n + 1;
rep(i, m) {
int lef, rig;
cin >> lef >> rig;
most_left = max(lef, most_left... | [
"call.add",
"call.arguments.add"
] | 850,515 | 850,516 | u868237899 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int maxID = n;
int minID = 1;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
maxID = min(maxID, r);
minID = max(minID, l);
}
cout << maxID - minID + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int maxID = n;
int minID = 1;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
maxID = min(maxID, r);
minID = max(minID, l);
}
cout << max(maxID - minID + 1, 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 850,526 | 850,527 | u503841284 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m, l, r, ls, rs;
cin >> n >> m;
ls = 0, rs = n;
rep(i, m) {
cin >> l >> r;
ls = max(ls, l);
rs = min(rs, r);
}
cout << rs - ls + 1;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m, l, r, ls, rs;
cin >> n >> m;
ls = 0, rs = n;
rep(i, m) {
cin >> l >> r;
ls = max(ls, l);
rs = min(rs, r);
}
cout << max(0, rs - ls + 1);
} | [
"call.add",
"call.arguments.change"
] | 850,528 | 850,529 | u983711104 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int L[100000];
int R[100000];
int mM = 1;
int Mm = n;
rep(i, m) {
cin >> L[i] >> R[i];
m... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int L[100000];
int R[100000];
int mM = 1;
int Mm = n;
rep(i, m) {
cin >> L[i] >> R[i];
m... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,530 | 850,531 | u745267317 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
for (int i = 0; i < M; i++) {
cin >> L.at(i) >> R.at(i);
}
int min = L.at(0);
int max = R.at(0);
for (int i = 0; i < M; i++) {
min = (min >= L.at(i)) ? min : L.at(i);
ma... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
for (int i = 0; i < M; i++) {
cin >> L.at(i) >> R.at(i);
}
int min = L.at(0);
int max = R.at(0);
for (int i = 0; i < M; i++) {
min = (min >= L.at(i)) ? min : L.at(i);
ma... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,543 | 850,544 | u568010843 | cpp |
p03037 | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ans, mx, mn = 1e8, sum;
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
ll a, b;
cin >> a >> b;
mx = max(mx, a);
mn =... | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ans, mx, mn = 1e8, sum;
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
ll a, b;
cin >> a >> b;
mx = max(mx, a);
mn =... | [
"call.add",
"call.arguments.change"
] | 850,545 | 850,546 | u620390714 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[N], R[N];
int LT, RT;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
LT = 1;
RT = N;
for (int i = 0; i < M; i++) {
if (LT <= L[i]) {
LT = L[i];
}
if (RT >= R[i]) {
RT = R[i];
}
... | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[N], R[N];
int LT, RT;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
LT = 1;
RT = N;
for (int i = 0; i < M; i++) {
if (LT <= L[i]) {
LT = L[i];
}
if (RT >= R[i]) {
RT = R[i];
}
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 850,553 | 850,554 | u961135803 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[N], R[N];
int LT, RT;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
LT = 1;
RT = N;
for (int i = 0; i < M; i++) {
if (LT <= L[i]) {
LT = L[i];
}
if (RT >= R[i]) {
RT = R[i];
}
... | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[N], R[N];
int LT, RT;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
LT = 1;
RT = N;
for (int i = 0; i < M; i++) {
if (LT <= L[i]) {
LT = L[i];
}
if (RT >= R[i]) {
RT = R[i];
}
... | [
"call.add",
"call.arguments.add"
] | 850,555 | 850,554 | u961135803 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Vec = vector<ll>;
using VecP = vector<P>;
#define FOR(i, m, n) for (ll(i) = (m); (i) < (n); ++(i))
#define FORN(i, m, n) for (ll(i) = (m); (i) <= (n); ++(i))
#define FORR(i, m, n) for (ll(i) = (m); (i) >= (n); --(i))
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Vec = vector<ll>;
using VecP = vector<P>;
#define FOR(i, m, n) for (ll(i) = (m); (i) < (n); ++(i))
#define FORN(i, m, n) for (ll(i) = (m); (i) <= (n); ++(i))
#define FORR(i, m, n) for (ll(i) = (m); (i) >= (n); --(i))
#defi... | [
"call.add"
] | 850,562 | 850,563 | u997368585 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int n, m;
int main() {
cin >> n >> m;
int left = 0, right = n;
rep(i, m) {
int l, r;
cin >> l >> r;
l--;
left = max(l, left);
right = min(r, right);
}
cout << righ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int n, m;
int main() {
cin >> n >> m;
int left = 0, right = n;
rep(i, m) {
int l, r;
cin >> l >> r;
l--;
left = max(l, left);
right = min(r, right);
}
cout << max(... | [
"call.add",
"call.arguments.add"
] | 850,568 | 850,569 | u389007679 | cpp |
p03037 |
// C - Prison
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const int MOD = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
int max_L = 1;
int min_R = N;
int L, R;
for (int i = 0; i < M; i++) {
cin >> L >> ... |
// C - Prison
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const int MOD = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
int max_L = 1;
int min_R = N;
int L, R;
for (int i = 0; i < M; i++) {
cin >> L >> ... | [
"call.add",
"call.arguments.add"
] | 850,588 | 850,589 | u790272146 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m] = {};
int r[m] = {};
int lmax = 0, rmin = 1000000;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
lmax = max(l[i], lmax);
rmin = min(r[i], rmin);
}
cout << rmin - lmax + 1;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m] = {};
int r[m] = {};
int lmax = 0, rmin = 1000000;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
lmax = max(l[i], lmax);
rmin = min(r[i], rmin);
}
cout << max(0, rmin - lmax + 1);
}
| [
"call.add",
"call.arguments.change"
] | 850,601 | 850,602 | u924373338 | cpp |
p03037 | #include <bits/stdc++.h>
#define sz(arr) (int)(arr).size()
#define rng(arr) arr.begin(), arr.end()
#define show(x) cout << #x << " = " << x << endl;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head,... | #include <bits/stdc++.h>
#define sz(arr) (int)(arr).size()
#define rng(arr) arr.begin(), arr.end()
#define show(x) cout << #x << " = " << x << endl;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head,... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 850,611 | 850,612 | u994307795 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
int main() {
int n, m;
cin >> n >> m;
VI l(m), r(m);
rep(i, m) { cin >> l[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
int main() {
int n, m;
cin >> n >> m;
VI l(m), r(m);
rep(i, m) { cin >> l[... | [
"call.add",
"call.arguments.change"
] | 850,622 | 850,623 | u491314298 | cpp |
p03037 | /*
27 January 2020
islingr
*/
#pragma region Boilerplate
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<l... | /*
27 January 2020
islingr
*/
#pragma region Boilerplate
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<l... | [
"call.add",
"call.arguments.change"
] | 850,636 | 850,637 | u883745615 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, l, r, ma = 1, mi;
cin >> n >> m;
mi = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
ma = max(ma, l);
mi = min(mi, r);
}
if (mi <= ma) {
cout << mi - ma + 1 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, l, r, ma = 1, mi;
cin >> n >> m;
mi = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
ma = max(ma, l);
mi = min(mi, r);
}
if (mi >= ma) {
cout << mi - ma + 1 << endl;
} else {
cout << 0 << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,643 | 850,644 | u442754977 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, l, r, ma = 1, mi;
cin >> n >> m;
mi = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
ma = max(ma, l);
mi = min(mi, r);
}
if (mi < ma) {
cout << mi - ma + 1 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, l, r, ma = 1, mi;
cin >> n >> m;
mi = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
ma = max(ma, l);
mi = min(mi, r);
}
if (mi >= ma) {
cout << mi - ma + 1 << endl;
} else {
cout << 0 << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,645 | 850,644 | u442754977 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, l, r, ma = 1, mi;
cin >> n >> m;
mi = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
ma = max(ma, l);
mi = min(mi, r);
}
if (mi - ma + 1 < 0) {
cout << mi - ma + 1 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, l, r, ma = 1, mi;
cin >> n >> m;
mi = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
ma = max(ma, l);
mi = min(mi, r);
}
if (mi >= ma) {
cout << mi - ma + 1 << endl;
} else {
cout << 0 << endl;
}
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 850,646 | 850,644 | u442754977 | cpp |
p03037 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,660 | 850,661 | u637983859 | cpp |
p03037 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <ciso646>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <ciso646>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#in... | [
"call.add",
"call.arguments.add"
] | 850,662 | 850,663 | u579875569 | cpp |
p03037 | #include <stdio.h>
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define REP(i, n) FOR(i, 0, n)
int main(void) {
int n, m;
scanf("%d%d", &n, &m);
int l = 1, r = n;
REP(i, m) {
int a, b;
scanf("%d%d", &a, &b);
if (l < a)
l = a;
if (r > b)
r = b;
}
if (r < l)
puts... | #include <stdio.h>
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define REP(i, n) FOR(i, 0, n)
int main(void) {
int n, m;
scanf("%d%d", &n, &m);
int l = 1, r = n;
REP(i, m) {
int a, b;
scanf("%d%d", &a, &b);
if (l < a)
l = a;
if (r > b)
r = b;
}
if (r < l)
puts... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 850,668 | 850,669 | u394853232 | 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.at(i) >> R.at(i);
}
int L_max = 0, R_min = N;
for (int i = 0; i < M; ++i) {
L_max = max(L_max, L.at(i));
R_min = min(R_min, R.at(i));
}
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.at(i) >> R.at(i);
}
int L_max = 0, R_min = N;
for (int i = 0; i < M; ++i) {
L_max = max(L_max, L.at(i));
R_min = min(R_min, R.at(i));
}
cout ... | [
"call.add",
"call.arguments.add"
] | 850,672 | 850,673 | u564185267 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define repl(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const l... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define repl(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const l... | [
"call.add",
"call.arguments.add"
] | 850,674 | 850,675 | u764013649 | cpp |
p03037 | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
//
// using boost::multiprecision::cpp_int;
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
//
// using boost::multiprecision::cpp_int;
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (... | [
"call.add",
"call.arguments.change"
] | 850,680 | 850,681 | u916743460 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> p;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
i... | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> p;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
i... | [
"call.add",
"call.arguments.add"
] | 850,682 | 850,683 | u916743460 | cpp |
p03037 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
#define dump(c) ... |
#include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <utility>
using namespace std;
typedef long long LL;
#define dump(c) ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 850,684 | 850,685 | u851470173 | cpp |
p03037 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[M], R[M];
for (int i = 0; i < M; i++)
cin >> L[i] >> R[i];
int st = L[0];
int en = R[0];
for (int i = 0; i < M; i++) {
st = max(st, L[i]);
en = min(en, R[i]);
}
if (en - st >= 0)
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[M], R[M];
for (int i = 0; i < M; i++)
cin >> L[i] >> R[i];
int st = L[0];
int en = R[0];
for (int i = 0; i < M; i++) {
st = max(st, L[i]);
en = min(en, R[i]);
}
if (en - st >= 0)
... | [
"expression.operation.binary.remove"
] | 850,696 | 850,697 | u937275419 | cpp |
p03037 | #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll l... | #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll l... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,700 | 850,701 | u540741303 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#de... | [
"call.add",
"call.arguments.change",
"function.return_value.change"
] | 850,723 | 850,724 | u957084285 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M, L, R;
cin >> N >> M;
int L_max = 0;
int R_min = N;
for (int i = 0; i < M; i++) {
cin >> L >> R;
L_max = max(L_max, L);
R_min = min(R_min, R);
}
cout << R_min - L_max + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M, L, R;
cin >> N >> M;
int L_max = 0;
int R_min = N;
for (int i = 0; i < M; i++) {
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"
] | 850,734 | 850,735 | u351586819 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
vector<int> vec(b);
vector<int> vecb(b);
for (int i = 0; i < b; i++) {
cin >> vec.at(i);
cin >> vecb.at(i);
}
sort(vec.begin(), vec.end());
sort(vecb.begin(), vecb.end());
int l = vecb.at(0) - vec.at(b - 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
vector<int> vec(b);
vector<int> vecb(b);
for (int i = 0; i < b; i++) {
cin >> vec.at(i);
cin >> vecb.at(i);
}
sort(vec.begin(), vec.end());
sort(vecb.begin(), vecb.end());
int l = vecb.at(0) - vec.at(b - 1... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"identifier.replace.remove",
"literal.replace.add"
] | 850,736 | 850,737 | u363369454 | cpp |
p03037 | // abc127_c
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | // abc127_c
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); +... | [
"call.arguments.add"
] | 850,738 | 850,739 | u614550445 | cpp |
p03037 | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int max_l = INT_MIN, min_r = INT_MAX;
int l, r;
for (int i = 0; i < m; ++i) {
cin >> l >> r;
max_l = max(max_l, l);
min_r = min(min_r, r);
}
cout << min_r - max_l + 1 << '\... | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int max_l = INT_MIN, min_r = INT_MAX;
int l, r;
for (int i = 0; i < m; ++i) {
cin >> l >> r;
max_l = max(max_l, l);
min_r = min(min_r, r);
}
cout << max(min_r - max_l + 1, ... | [
"call.add",
"call.arguments.add"
] | 850,740 | 850,741 | u964185015 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
int main(void) {
int N, M,... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
int main(void) {
int N, M,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,742 | 850,743 | u075689098 | cpp |
p03037 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a = 1, b = n;
rep(i, m) {
int l, r;
cin >> l >> r;
a = max(a, l);
b = min(b, r);
}
cout << max(b - a, 0) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a = 1, b = n;
rep(i, m) {
int l, r;
cin >> l >> r;
a = max(a, l);
b = min(b, r);
}
cout << max(b - a + 1, 0) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 850,746 | 850,747 | u781095600 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L, R;
int mini = 0;
int maxi = N;
for (int i = 0; i < M; i++) {
cin >> L >> R;
mini = max(mini, L);
maxi = min(maxi, R);
}
cout << maxi - mini + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L, R;
int mini = 0;
int maxi = N;
for (int i = 0; i < M; i++) {
cin >> L >> R;
mini = max(mini, L);
maxi = min(maxi, R);
}
cout << max(0, maxi - mini + 1) << endl;
} | [
"call.add",
"call.arguments.change"
] | 850,748 | 850,749 | u476833465 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int left = 1, right = n, t_left, t_right;
for (int i = 0; i < m; i++) {
cin >> t_left >> t_right;
left = m... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int left = 1, right = n, t_left, t_right;
for (int i = 0; i < m; i++) {
cin >> t_left >> t_right;
left = m... | [
"call.add",
"call.arguments.add"
] | 850,752 | 850,753 | u448407332 | cpp |
p03037 | #include <bits/stdc++.h>
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;
}
| #include <bits/stdc++.h>
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;
}
| [
"call.add",
"call.arguments.change"
] | 850,766 | 850,767 | u223172354 | cpp |
p03037 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
ty... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
ty... | [
"call.add",
"call.arguments.change"
] | 850,770 | 850,771 | u983505021 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | [
"call.arguments.add",
"call.arguments.change"
] | 850,775 | 850,776 | u317177661 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, ans = 0, min = 0, max;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
max = r[0];
for (int j = 0; j < m; j++) {
if (min < l[j])
min = l[j];
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, ans = 0, min = 0, max;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
max = r[0];
for (int j = 0; j < m; j++) {
if (min < l[j])
min = l[j];
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,779 | 850,780 | u117606227 | cpp |
p03037 | #include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
sort(l.begin(), l.end());
sort(r.begin(), r.end());
cout << min(n, r[0] - l[... | #include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
sort(l.begin(), l.end());
sort(r.begin(), r.end());
cout << max(0, r[0] - l[... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"identifier.replace.remove",
"literal.replace.add"
] | 850,791 | 850,792 | u374190629 | cpp |
p03037 | #include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
sort(l.begin(), l.end());
sort(r.begin(), r.end());
cout << r[0] - l[m - 1] ... | #include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
sort(l.begin(), l.end());
sort(r.begin(), r.end());
cout << max(0, r[0] - l[... | [
"call.add",
"call.arguments.change"
] | 850,793 | 850,792 | u374190629 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.