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>
#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;
vector<int> L(M), R(M);
rep(i, M) cin >> L.at(i) >> R.at(i);
sort(L.begin(), L.end(), greater<int>());
sort(R.begin(), R.end())... | #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;
vector<int> L(M), R(M);
rep(i, M) cin >> L.at(i) >> R.at(i);
sort(L.begin(), L.end(), greater<int>());
sort(R.begin(), R.end())... | [
"call.add",
"call.arguments.change"
] | 849,595 | 849,594 | u097161601 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define An setprecision(16)
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 AL = L[0], AR = R[0];
for (int i = 1; i < M; i++) {
if (L[i] >= AL) {
AL = L[i];
}
if (R[i] < AL) {
... | #include <bits/stdc++.h>
using namespace std;
#define An setprecision(16)
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 AL = L[0], AR = R[0];
for (int i = 1; i < M; i++) {
if (L[i] >= AL) {
AL = L[i];
}
if (R[i] < AR) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 849,602 | 849,603 | u634131849 | cpp |
p03037 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,604 | 849,605 | u298620933 | cpp |
p03037 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | [
"call.add",
"call.arguments.change"
] | 849,608 | 849,609 | u116523315 | cpp |
p03037 | #include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
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);
r = min(r, R);
}
cout ... | #include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
int main(int argc, char *argv[]) {
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);
r = min(r, R);
}
cout ... | [
"call.add",
"call.arguments.change"
] | 849,618 | 849,619 | u365077014 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ii = pair<ll, ll>;
using vi = vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(), (x).end()
#define print(a) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ii = pair<ll, ll>;
using vi = vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(), (x).end()
#define print(a) ... | [
"call.add",
"call.arguments.change"
] | 849,624 | 849,625 | u596724731 | cpp |
p03037 | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pi pair<int, int>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#define ln(x) ((int)x.length())
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define end... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pi pair<int, int>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#define ln(x) ((int)x.length())
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define end... | [
"call.add",
"call.arguments.change"
] | 849,632 | 849,633 | u503629869 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
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 = min(minR, r);
}
cout << minR - maxL + 1;
return 0;
} | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
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 = min(minR, r);
}
cout << max(minR - maxL + 1, 0);
ret... | [
"call.add",
"call.arguments.add"
] | 849,634 | 849,635 | u257632310 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; ... | [
"expression.operation.binary.add"
] | 849,636 | 849,637 | u264265458 | cpp |
p03037 | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | [
"call.add",
"call.arguments.change"
] | 849,648 | 849,649 | u229582356 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int l[100005], r[100005];
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
sort(l, l + m);
sort(r, r + m);
if (r[0] >= l[n - 1]) {
cout << r[0] - l[n - 1] + 1 << "\n";
} else {
cout << 0 << "\n";
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int l[100005], r[100005];
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
sort(l, l + m);
sort(r, r + m);
if (r[0] >= l[m - 1]) {
cout << r[0] - l[m - 1] + 1 << "\n";
} else {
cout << 0 << "\n";
}
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 849,665 | 849,666 | u430766779 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
u... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
u... | [
"call.add",
"call.arguments.change"
] | 849,667 | 849,668 | u236658355 | cpp |
p03037 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | [
"call.add",
"call.arguments.add"
] | 849,675 | 849,676 | u850516963 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
long long int n, m, v1, v2;
cin >> n >> m;
long long int l[m], r[m];
for (long long int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
v1 = l[0];
v2 = r[0];
for (long long int i = 1; i < m; i++) {
v1 = max(v1, l[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
long long int n, m, v1, v2;
cin >> n >> m;
long long int l[m], r[m];
for (long long int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
v1 = l[0];
v2 = r[0];
for (long long int i = 1; i < m; i++) {
v1 = max(v1, l[i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,679 | 849,680 | u094861294 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, l, r, ml, mr;
cin >> n >> m;
ml = 0;
mr = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
ml = max(ml, l);
mr = min(mr, r);
}
if (ml < mr) {
cout << mr - (ml - 1) << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, l, r, ml, mr;
cin >> n >> m;
ml = 0;
mr = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
ml = max(ml, l);
mr = min(mr, r);
}
if (ml <= mr) {
cout << mr - (ml - 1) << endl;
} else {
cout << 0 << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,681 | 849,682 | u569361260 | cpp |
p03037 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int m, n;
cin >> n >> m;
int left = -1;
int right = n + 2;
rep(i, m) {
int t_left, t_right;
cin >> t_left >> t_right;
left = max(left, t_left);
right = min(right, t... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int m, n;
cin >> n >> m;
int left = -1;
int right = n + 2;
rep(i, m) {
int t_left, t_right;
cin >> t_left >> t_right;
left = max(left, t_left);
right = min(right, t... | [
"call.add",
"call.arguments.add"
] | 849,685 | 849,686 | u965095643 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<ll>>;
using P = pair<int, int>;
#define MOD 1000000007
#define INF 1000000
#define PI 3.14159265358979323846264338327950L
#define MAX_N 200010
#define lb lower_bound //[2,4)=lb(4)-lb(2);
int main() ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<ll>>;
using P = pair<int, int>;
#define MOD 1000000007
#define INF 1000000
#define PI 3.14159265358979323846264338327950L
#define MAX_N 200010
#define lb lower_bound //[2,4)=lb(4)-lb(2);
int main() ... | [
"control_flow.branch.if.condition.change"
] | 849,715 | 849,716 | u711676593 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | [
"call.add",
"call.arguments.add"
] | 849,721 | 849,722 | u007099475 | cpp |
p03037 | #include "iostream"
#include "vector"
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int max_l = 1, min_r = n + 1;
for (int i = 0; i < m; ++i) {
int l, r;
cin >> l >> r;
max_l = max(max_l, l);
min_r = min(min_r, r);
}
if (min_r >= max_l) {
cout << min_r - max_l + 1 << endl;
... | #include "iostream"
#include "vector"
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int max_l = 1, min_r = n + 1;
for (int i = 0; i < m; ++i) {
int l, r;
cin >> l >> r;
max_l = max(max_l, l);
min_r = min(min_r, r);
}
if (min_r >= max_l) {
cout << min_r - max_l + 1 << endl;
... | [
"literal.string.change",
"io.output.change"
] | 849,723 | 849,724 | u934630944 | cpp |
p03037 | #include "iostream"
#include "vector"
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int max_l = 1, min_r = n + 1;
for (int i = 0; i < m; ++i) {
int l, r;
cin >> l >> r;
max_l = max(max_l, l);
min_r = min(min_r, r);
}
if (min_r <= max_l) {
cout << min_r - max_l + 1 << endl;
... | #include "iostream"
#include "vector"
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int max_l = 1, min_r = n + 1;
for (int i = 0; i < m; ++i) {
int l, r;
cin >> l >> r;
max_l = max(max_l, l);
min_r = min(min_r, r);
}
if (min_r >= max_l) {
cout << min_r - max_l + 1 << endl;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 849,725 | 849,724 | u934630944 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define _FastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define _FastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"call.add",
"call.arguments.change"
] | 849,745 | 849,746 | u958323734 | cpp |
p03037 | #include <iostream>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, m;
cin >> n >> m;
ll maxl = 1, minr = n;
for (ll i = 0; i < m; ++i) {
ll l, r;
cin >> l >> r;
if (maxl < l)
maxl = l;
if (minr > r)
minr = r;
}
ll res;... | #include <iostream>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, m;
cin >> n >> m;
ll maxl = 1, minr = n;
for (ll i = 0; i < m; ++i) {
ll l, r;
cin >> l >> r;
if (maxl < l)
maxl = l;
if (minr > r)
minr = r;
}
ll res;... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,747 | 849,748 | u294683729 | cpp |
p03037 | #include <iostream>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
ll maxl = 1, minr = n;
for (ll i = 0; i < m; ++i) {
ll l, r;
cin >> l >> r;
if (maxl < l)
maxl = l;
if (minr > r)
minr = r;
}
ll res;
if (minr > maxl)
res = 0;
else
r... | #include <iostream>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
ll maxl = 1, minr = n;
for (ll i = 0; i < m; ++i) {
ll l, r;
cin >> l >> r;
if (maxl < l)
maxl = l;
if (minr > r)
minr = r;
}
ll res;
if (minr < maxl)
res = 0;
else
r... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,749 | 849,750 | u294683729 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int m;
int r;
int l;
int lmax = 0;
int rmin = 1000000;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> l >> r;
if (l > lmax) {
lmax = l;
}
if (r < rmin) {
rmin = r;
}
}
if ((rmin - lmax) > 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int m;
int r;
int l;
int lmax = 0;
int rmin = 1000000;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> l >> r;
if (l > lmax) {
lmax = l;
}
if (r < rmin) {
rmin = r;
}
}
if ((rmin - lmax + 1) > 0) ... | [
"control_flow.branch.if.condition.change"
] | 849,760 | 849,761 | u667099095 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int m;
int r;
int l;
int lmax = 0;
int rmin = 1000000;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> l >> r;
if (l > lmax) {
lmax = l;
}
if (r < rmin) {
rmin = r;
}
}
if ((rmin - lmax) > 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int m;
int r;
int l;
int lmax = 0;
int rmin = 1000000;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> l >> r;
if (l > lmax) {
lmax = l;
}
if (r < rmin) {
rmin = r;
}
}
if ((rmin - lmax + 1) > 0) ... | [
"control_flow.branch.if.condition.change"
] | 849,762 | 849,761 | u667099095 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> L;
priority_queue<int, vector<int>, greater<int>> R;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
L.push(l);
R.push(r);
}
if (L.top() < R.top())
cout << R.top() - L.top() ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> L;
priority_queue<int, vector<int>, greater<int>> R;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
L.push(l);
R.push(r);
}
if (L.top() <= R.top())
cout << R.top() - L.top()... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,777 | 849,778 | u306482197 | cpp |
p03037 | #include <algorithm>
#include <assert.h>
#include <iostream>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int maxElement(const int *array, size_t size) {
assert(array != NULL);
assert(size >= 1);
int max = array[0];
for (size_t i = 1; i... | #include <algorithm>
#include <assert.h>
#include <iostream>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int maxElement(const int *array, size_t size) {
assert(array != NULL);
assert(size >= 1);
int max = array[0];
for (size_t i = 1; i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,781 | 849,782 | u675314298 | 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;
return 0;
}
| #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(r - l + 1, 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 849,783 | 849,784 | u124187388 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a = 1;
int b = n;
for (int i = 0; i < m; i++) {
int L, R;
cin >> L >> R;
a = max(a, L);
b = min(b, R);
}
if (a >= b) {
cout << b - a + 1 << endl;
} else {
cout << "0" << endl;
}
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a = 1;
int b = n;
for (int i = 0; i < m; i++) {
int L, R;
cin >> L >> R;
a = max(a, L);
b = min(b, R);
}
if (a <= b) {
cout << b - a + 1 << endl;
} else {
cout << "0" << endl;
}
return 0;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,789 | 849,790 | u182774725 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int left = -1, right = 1001001, L, R;
for (int i = 0; i < M; i++) {
cin >> L >> R;
left = max(left, L);
right = min(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, right = 1001001, L, R;
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;
} | [
"call.add",
"call.arguments.change"
] | 849,791 | 849,792 | u658901072 | cpp |
p03037 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INCANT ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INCANT ... | [
"call.add",
"call.arguments.change"
] | 849,816 | 849,817 | u288087195 | cpp |
p03037 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int INF = 100100101;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> L(m);
vector<int> R(m);
rep(i, m) { cin >> L[i] >> R[i]; }
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int INF = 100100101;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> L(m);
vector<int> R(m);
rep(i, m) { cin >> L[i] >> R[i]; }
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,832 | 849,833 | u415671616 | cpp |
p03037 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; // or pb_ds;
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#ifndef DEBUG
#define... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; // or pb_ds;
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#ifndef DEBUG
#define... | [
"call.add",
"call.arguments.add"
] | 849,836 | 849,837 | u323269203 | cpp |
p03037 | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 849,840 | 849,841 | u526639495 | cpp |
p03037 | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | [
"call.add",
"call.arguments.change"
] | 849,842 | 849,841 | u526639495 | 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;
int L = 0, R = n, l, r;
rep(i, m) {
cin >> l >> r;
L = max(L, l);
R = min(R, r);
}
cout << R - L + 1 << endl;
return 0;
}
| #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;
int L = 0, R = n, l, r;
rep(i, m) {
cin >> l >> r;
L = max(L, l);
R = min(R, r);
}
cout << max(R - L + 1, 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 849,843 | 849,844 | u237022500 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l, r, l_max = -1, r_min = 10000000;
for (int i = 0; i < m; i++) {
cin >> l >> r;
l_max = max(l_max, l);
r_min = min(r, r_min);
}
cout << min(0, r_min - l_max + 1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l, r, l_max = -1, r_min = 10000000;
for (int i = 0; i < m; i++) {
cin >> l >> r;
l_max = max(l_max, l);
r_min = min(r, r_min);
}
cout << max(0, r_min - l_max + 1) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 849,850 | 849,851 | u729703601 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l, r, l_max = -1, r_min = 10000000;
for (int i = 0; i < m; i++) {
cin >> l >> r;
l_max = max(l_max, l);
r_min = min(r, r_min);
}
cout << r_min - l_max + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l, r, l_max = -1, r_min = 10000000;
for (int i = 0; i < m; i++) {
cin >> l >> r;
l_max = max(l_max, l);
r_min = min(r, r_min);
}
cout << max(0, r_min - l_max + 1) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 849,852 | 849,851 | u729703601 | cpp |
p03037 | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define per(i, n) fo... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define per(i, n) fo... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,855 | 849,856 | u548791035 | 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;
vector<int> l(m);
vector<int> r(m);
rep(i, m) cin >> l[i] >> r[i];
int maxl = l[0];
int minr = r[0];
rep(i, m) {
if (l[... | #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;
vector<int> l(m);
vector<int> r(m);
rep(i, m) cin >> l[i] >> r[i];
int maxl = l[0];
int minr = r[0];
rep(i, m) {
if (l[... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,865 | 849,866 | u448922807 | 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;
vector<int> l(m);
vector<int> r(m);
rep(i, m) cin >> l[i] >> r[i];
int maxl = l[0];
int minr = r[0];
rep(i, m) {
if (l[... | #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;
vector<int> l(m);
vector<int> r(m);
rep(i, m) cin >> l[i] >> r[i];
int maxl = l[0];
int minr = r[0];
rep(i, m) {
if (l[... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,865 | 849,867 | u448922807 | 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;
Lmax = max(Lmax, L);
Rmin = min(Rmin, R);
}
if (Lmax < Rmin) {
cout << 0 << endl;
} else {
cout << Rm... | #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;
Lmax = max(Lmax, L);
Rmin = min(Rmin, R);
}
if (Lmax > Rmin) {
cout << 0 << endl;
} else {
cout << Rm... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,875 | 849,876 | u739095155 | cpp |
p03037 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
const int INT_INF = 1e9;
const long long LONG_INF = 1e18;
const long long MOD = 1e9 + 7;
const double PI = 3.14159265358979323846;
using namespace std;
int ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
const int INT_INF = 1e9;
const long long LONG_INF = 1e18;
const long long MOD = 1e9 + 7;
const double PI = 3.14159265358979323846;
using namespace std;
int ... | [
"call.add",
"call.arguments.add"
] | 849,879 | 849,880 | u512857550 | 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 chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long ... | #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 chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"identifier.replace.remove",
"literal.replace.add"
] | 849,881 | 849,882 | u944545272 | 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 chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long ... | #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 chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long ... | [
"call.add",
"call.arguments.change"
] | 849,883 | 849,882 | u944545272 | cpp |
p03037 | #include <iostream>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int p, q, l = 0, r = N;
rep(i, 0, M - 1) {
cin >> p >> q;
l = max(l, p);
r = min(r, q);
}
cout << r - l + 1 << endl;
return 0;
}
| #include <iostream>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int p, q, l = 0, r = N;
rep(i, 0, M - 1) {
cin >> p >> q;
l = max(l, p);
r = min(r, q);
}
cout << max(r - l + 1, 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 849,884 | 849,885 | u752006685 | cpp |
p03037 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <map>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int mai... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <map>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int mai... | [
"call.add",
"call.arguments.change"
] | 849,888 | 849,889 | u557934154 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define imx INT_MAX
#define imn INT_MIN
#define llmx LLONG_MAX
#define llmn LLONG_MIN
#define fi first
#define se second
#define pb push_back
#define f_s(a) sort(a.begin(), a.end())
#define b_s(a) sort(a.rbegin(), a.rend())
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define imx INT_MAX
#define imn INT_MIN
#define llmx LLONG_MAX
#define llmn LLONG_MIN
#define fi first
#define se second
#define pb push_back
#define f_s(a) sort(a.begin(), a.end())
#define b_s(a) sort(a.rbegin(), a.rend())
#... | [
"call.add",
"call.arguments.add"
] | 849,890 | 849,891 | u644164234 | cpp |
p03037 | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ... | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ... | [
"call.add",
"call.arguments.add"
] | 849,892 | 849,893 | u803173123 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, ini, n) for (int i = ini; i < n; i++)
#define _rep(i, ini, n) for (int i = ini; i >= n; i--)
#define ToEnd(a) a.begin(), a.end()
uint64_t MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
rep(m, 0, M) cin >> L.at(m) >> R... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, ini, n) for (int i = ini; i < n; i++)
#define _rep(i, ini, n) for (int i = ini; i >= n; i--)
#define ToEnd(a) a.begin(), a.end()
uint64_t MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
rep(m, 0, M) cin >> L.at(m) >> R... | [
"call.add",
"call.arguments.change"
] | 849,896 | 849,897 | u190679129 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> l(m), r(m);
for (ll i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
sort(l.begin(), l.end());
sort(r.begin(), r.end());
cout << min((ll)0,... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> l(m), r(m);
for (ll i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
sort(l.begin(), l.end());
sort(r.begin(), r.end());
cout << max((ll)0,... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 849,900 | 849,901 | u476027087 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typ... | [
"identifier.change",
"expression.operation.binary.change"
] | 849,902 | 849,903 | u981759938 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typ... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 849,904 | 849,903 | u981759938 | 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;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
rep(i, M) {
cin >> L[i];
cin >> R[i];
}
cout << *min_element(R.begin(), R.end()) - *max_element(L.begin(), L.end()) +
... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
rep(i, M) {
cin >> L[i];
cin >> R[i];
}
cout << max(*min_element(R.begin(), R.end()) -
*max_element(L.begi... | [
"call.add",
"call.arguments.change",
"call.arguments.add"
] | 849,914 | 849,915 | u906839513 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
using ll = long long... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 849,918 | 849,919 | u489823438 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
int i;
for (i = 0; i < m; i++) {
cin >> l.at(i) >> r.at(i);
}
int mini = 1000000, maxi = 0;
for (i = 0; i < m; i++) {
maxi = max(maxi, l.at(i));
mini = min(mini, 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);
int i;
for (i = 0; i < m; i++) {
cin >> l.at(i) >> r.at(i);
}
int mini = 1000000, maxi = 0;
for (i = 0; i < m; i++) {
maxi = max(maxi, l.at(i));
mini = min(mini, r.at(i));
}
cout ... | [
"call.add",
"call.arguments.change"
] | 849,933 | 849,934 | u130651752 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int left = -1, right = n + 1;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
left = max(left, l);
right = min(right, r);
}
int ans = (right - left) < 0 ? 0 : right - left + 1;
cout << right - ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int left = -1, right = n + 1;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
left = max(left, l);
right = min(right, r);
}
int ans = (right - left) < 0 ? 0 : right - left + 1;
cout << ans << e... | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 849,963 | 849,964 | u957377447 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
ll N, M;
ll maxL = 0, minR = LONG_LONG_MAX;
cin >> N >> M;
for (ll i = 0; i < M; i++) {
ll L, R;
cin >> L >> R;
maxL = max(maxL, L);
minR = min(minR, R);... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
ll N, M;
ll maxL = 0, minR = LONG_LONG_MAX;
cin >> N >> M;
for (ll i = 0; i < M; i++) {
ll L, R;
cin >> L >> R;
maxL = max(maxL, L);
minR = min(minR, R);... | [
"call.add",
"call.arguments.change"
] | 849,967 | 849,968 | u196953553 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ul = unsigned long;
using ull = unsigned long long;
#define vec vector
#define rep(_i, _n) for (ull _i = 0; _i < _n; _i++)
#define rep2(_i, _s, _n) for (ull _i = _s; _i < _n; _i++)
#define elif else if
#define push(_a) push_back(_a)
#define fullSort(_a) sort(_a.begin(... | #include <bits/stdc++.h>
using namespace std;
using ul = unsigned long;
using ull = unsigned long long;
#define vec vector
#define rep(_i, _n) for (ull _i = 0; _i < _n; _i++)
#define rep2(_i, _s, _n) for (ull _i = _s; _i < _n; _i++)
#define elif else if
#define push(_a) push_back(_a)
#define fullSort(_a) sort(_a.begin(... | [
"identifier.change",
"expression.operation.binary.change"
] | 849,971 | 849,972 | u961423750 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ul = unsigned long;
using ull = unsigned long long;
#define vec vector
#define rep(_i, _n) for (ull _i = 0; _i < _n; _i++)
#define rep2(_i, _s, _n) for (ull _i = _s; _i < _n; _i++)
#define elif else if
#define push(_a) push_back(_a)
#define fullSort(_a) sort(_a.begin(... | #include <bits/stdc++.h>
using namespace std;
using ul = unsigned long;
using ull = unsigned long long;
#define vec vector
#define rep(_i, _n) for (ull _i = 0; _i < _n; _i++)
#define rep2(_i, _s, _n) for (ull _i = _s; _i < _n; _i++)
#define elif else if
#define push(_a) push_back(_a)
#define fullSort(_a) sort(_a.begin(... | [] | 849,973 | 849,972 | u961423750 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ul = unsigned long;
using ull = unsigned long long;
#define vec vector
#define rep(_i, _n) for (ull _i = 0; _i < _n; _i++)
#define rep2(_i, _s, _n) for (ull _i = _s; _i < _n; _i++)
#define elif else if
#define push(_a) push_back(_a)
#define fullSort(_a) sort(_a.begin(... | #include <bits/stdc++.h>
using namespace std;
using ul = unsigned long;
using ull = unsigned long long;
#define vec vector
#define rep(_i, _n) for (ull _i = 0; _i < _n; _i++)
#define rep2(_i, _s, _n) for (ull _i = _s; _i < _n; _i++)
#define elif else if
#define push(_a) push_back(_a)
#define fullSort(_a) sort(_a.begin(... | [
"identifier.change",
"expression.operation.binary.change"
] | 849,974 | 849,972 | u961423750 | cpp |
p03037 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int l = 0;
int r = 1e8;
rep(i, M) {
int L, R, t = 0;
cin >> L >> R;
l = max(l, L);
r = min(r, R);
}
if (l < r) {
cout << r - l + 1 <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int l = 0;
int r = 1e8;
rep(i, M) {
int L, R, t = 0;
cin >> L >> R;
l = max(l, L);
r = min(r, R);
}
if (l <= r) {
cout << r - l + 1 ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 849,992 | 849,993 | u636018568 | 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[i] >> r[i];
}
int a = l[0], b = r[0];
for (int i = 1; i < m; i++) {
a = max(a, l[i]);
b = min(b, r[i]);
}
int ans = min(b - a + ... | #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[i] >> r[i];
}
int a = l[0], b = r[0];
for (int i = 1; i < m; i++) {
a = max(a, l[i]);
b = min(b, r[i]);
}
int ans = min(b - a + ... | [
"call.add",
"call.arguments.add"
] | 849,994 | 849,995 | u576472702 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
int maxl = 0, minr = n - 1;
rep(i, m) {
int l, r;
cin >> l >> r;
if (maxl < l)
maxl = l;
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
int maxl = 1, minr = n;
rep(i, m) {
int l, r;
cin >> l >> r;
if (maxl < l)
maxl = l;
i... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 850,001 | 850,002 | u060936992 | 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);
sort(R, R + M);
cout << (R[0] - L[M - 1] > 0 ? R[0] - L[M - 1] + 1 : 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);
sort(R, R + M);
cout << (R[0] - L[M - 1] >= 0 ? R[0] - L[M - 1] + 1 : 0) << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 850,003 | 850,004 | u222625974 | cpp |
p03037 | #include <algorithm>
#include <climits>
#include <iostream>
#include <utility>
int main(int argc, char *argv[]) {
int n, m;
std::cin >> n >> m;
int max = 0, min = INT_MAX;
for (int i = 0; i < m; ++i) {
int r, l;
std::cin >> l >> r;
max = std::max(max, l);
min = std::min(min, r);
}
if (min ... | #include <algorithm>
#include <climits>
#include <iostream>
#include <utility>
int main(int argc, char *argv[]) {
int n, m;
std::cin >> n >> m;
int max = 0, min = INT_MAX;
for (int i = 0; i < m; ++i) {
int r, l;
std::cin >> l >> r;
max = std::max(max, l);
min = std::min(min, r);
}
if (min ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,011 | 850,012 | u089888152 | cpp |
p03037 | #include <bits/stdc++.h>
//#include <boost/range/algorithm/find_if.hpp>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
const int INF = 999999999;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
int ... | #include <bits/stdc++.h>
//#include <boost/range/algorithm/find_if.hpp>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
const int INF = 999999999;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
int ... | [
"literal.number.change",
"io.output.change"
] | 850,015 | 850,016 | u767481489 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1}... | [
"call.add",
"call.arguments.add"
] | 850,020 | 850,021 | u474760662 | cpp |
p03037 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
int n, m, L = -1, R = 1e6;
cin >> n >> m;
rep(i, m) {
int l, r;
cin >> l >> r;
... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
int n, m, L = -1, R = 1e6;
cin >> n >> m;
rep(i, m) {
int l, r;
cin >> l >> r;
... | [
"call.add",
"call.arguments.add"
] | 850,024 | 850,025 | u168684371 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> gateL;
priority_queue<int, vector<int>, greater<int>> gateR;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
gateL.push(L);
gateR.push(R);
}
int min = gateL.top(); // Lで最大
int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> gateL;
priority_queue<int, vector<int>, greater<int>> gateR;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
gateL.push(L);
gateR.push(R);
}
int min = gateL.top(); // Lで最大
int ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,026 | 850,027 | u094654185 | cpp |
p03037 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
int Low = 0, High = 1e8;
rep(i, m) {
int l, r;
cin >> l >> m;
Low = max(Low, l);
High = min(High, m);
}
int ans = High - Low + 1;
if (a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
int Low = 0, High = 1e8;
rep(i, m) {
int l, r;
cin >> l >> r;
Low = max(Low, l);
High = min(High, r);
}
int ans = High - Low + 1;
if (a... | [
"identifier.change",
"expression.operation.binary.change",
"assignment.value.change",
"call.arguments.change"
] | 850,028 | 850,029 | u321168841 | cpp |
p03037 | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using... | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using... | [
"call.add",
"call.arguments.add"
] | 850,030 | 850,031 | u955627293 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> pi;
typedef pair<int, int> vi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
bool sort_by(vi c, vi d) { return c.S < d.S; }
int main() {
int N, M, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> pi;
typedef pair<int, int> vi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
bool sort_by(vi c, vi d) { return c.S < d.S; }
int main() {
int N, M, ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 850,032 | 850,033 | u712837698 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> pi;
typedef pair<int, int> vi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
bool sort_by(vi c, vi d) { return c.S < d.S; }
int main() {
int N, M, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> pi;
typedef pair<int, int> vi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
bool sort_by(vi c, vi d) { return c.S < d.S; }
int main() {
int N, M, ... | [] | 850,034 | 850,033 | u712837698 | 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 L[M], R[M];
rep(i, M) {
int r, l;
cin >> l >> r;
L[i] = l;
R[i] = r;
}
int maxL = 1;
int minR = N;
rep(i, M) {
maxL = max(maxL, L[i]);
mi... | #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 L[M], R[M];
rep(i, M) {
int r, l;
cin >> l >> r;
L[i] = l;
R[i] = r;
}
int maxL = 1;
int minR = N;
rep(i, M) {
maxL = max(maxL, L[i]);
mi... | [
"assignment.change"
] | 850,035 | 850,036 | u264405855 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
ll left = 0, right = 1e+10;
for (int i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
left = max(a, left);
right = min(b, right);
}
cout << right - left + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
ll left = 0, right = 1e+10;
for (int i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
left = max(a, left);
right = min(b, right);
}
cout << max(0LL, right - left + 1) << endl;
} | [
"call.add",
"call.arguments.change"
] | 850,038 | 850,039 | u050087249 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
... | #include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
... | [
"call.add",
"call.arguments.add"
] | 850,048 | 850,049 | u488878376 | cpp |
p03037 | #include <algorithm>
#include <iomanip>
#include <iostream>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int n, m;
cin >> n >> m;
int l = 0, r = INF;
repi(i, m, 0) {
int L, R;
cin >> L >> R;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int n, m;
cin >> n >> m;
int l = 0, r = INF;
repi(i, m, 0) {
int L, R;
cin >> L >> R;
... | [
"call.add",
"call.arguments.add"
] | 850,050 | 850,051 | u187013893 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a = 0, b;
cin >> n >> m;
b = n;
vector<int> vec(2 * m);
for (int i = 0; i < 2 * m; i++) {
cin >> vec[i];
}
for (int i = 0; i < m; i++) {
if (vec[2 * i] > a)
a = vec[2 * i];
}
for (int i = 0; i < m; i++) {
if (vec[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a = 0, b;
cin >> n >> m;
b = n;
vector<int> vec(2 * m);
for (int i = 0; i < 2 * m; i++) {
cin >> vec[i];
}
for (int i = 0; i < m; i++) {
if (vec[2 * i] > a)
a = vec[2 * i];
}
for (int i = 0; i < m; i++) {
if (vec[... | [
"call.add",
"call.arguments.add"
] | 850,052 | 850,053 | u070779615 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
#define drep(i, cc, n) for (int i = cc; i >= n; --i)
typedef long long ll;
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> l(m), r(... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
#define drep(i, cc, n) for (int i = cc; i >= n; --i)
typedef long long ll;
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> l(m), r(... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,064 | 850,065 | u374678351 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define P pair<int, int>
signed main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<int> b(m);
rep(i, m) cin >> a[i] >> b[i];
sort(all(a));
sort(all(b))... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define P pair<int, int>
signed main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<int> b(m);
rep(i, m) cin >> a[i] >> b[i];
sort(all(a));
sort(all(b))... | [] | 850,066 | 850,067 | u310101703 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define RREP(i, N) for (int i = (int)N - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define RREP(i, N) for (int i = (int)N - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,068 | 850,069 | u458311335 | cpp |
p03037 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int maxL = 0, minR = n;
for (int i = 0; i < m; ++i) {
int l, r;
cin >> l >> r;
if (maxL < l)
maxL = l;
if (minR > r)
minR = r;
}
int ans = max(minR - maxL + 1, 0);
cout << minR... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int maxL = 0, minR = n;
for (int i = 0; i < m; ++i) {
int l, r;
cin >> l >> r;
if (maxL < l)
maxL = l;
if (minR > r)
minR = r;
}
int ans = max(minR - maxL + 1, 0);
cout << ans ... | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 850,078 | 850,079 | u117944057 | cpp |
p03037 | #include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define f first
#define s second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define forn(i, n) for (int i = 1; i <= n; ++i)
#define pqueue priority_queue
usin... | #include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define f first
#define s second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define forn(i, n) for (int i = 1; i <= n; ++i)
#define pqueue priority_queue
usin... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 850,080 | 850,081 | u002627851 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
int cnt[100010];
int min = 1e6;
int max = 0;
for (int i = 0; i < m; ++i) {
int l, r;
std::cin >> l >> r;
min = std::min(min, r);
max = std::max(max, l);
}
std::cout << std::max(0, ma... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
int cnt[100010];
int min = 1e6;
int max = 0;
for (int i = 0; i < m; ++i) {
int l, r;
std::cin >> l >> r;
min = std::min(min, r);
max = std::max(max, l);
}
std::cout << std::max(0, mi... | [
"expression.operation.binary.remove"
] | 850,092 | 850,093 | u353919145 | 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;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
sort(l.begin(), l.end());
sort(r.begin(), r.end());
int L = l[m - 1], ... | #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;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
sort(l.begin(), l.end());
sort(r.begin(), r.end());
int L = l[m - 1], ... | [
"call.add",
"call.arguments.add"
] | 850,096 | 850,097 | u337734014 | cpp |
p03037 | // ConsoleApplication73.cpp : 此文件包含 "main"
// 函数。程序执行将在此处开始并结束。
//
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int a[100500];
int main() {
int n, m, l, r, lala = 0;
cin >> n >> m;
int min = 0, max = 200000;
... | // ConsoleApplication73.cpp : 此文件包含 "main"
// 函数。程序执行将在此处开始并结束。
//
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int a[100500];
int main() {
int n, m, l, r, lala = 0;
cin >> n >> m;
int min = 0, max = 200000;
... | [
"assignment.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 850,098 | 850,099 | u089230684 | cpp |
p03037 | #include <iostream>
int main() {
long long n, m, l = 0, r = 0;
std::cin >> n >> m;
std::cin >> l >> r;
for (int i = 1; i < m; i++) {
long long li, ri;
std::cin >> li >> ri;
if (li > l)
l = li;
if (ri < r)
r = ri;
}
if (r > l)
std::cout << 0;
else
std::cout << r + 1 - l... | #include <iostream>
int main() {
long long n, m, l = 0, r = 0;
std::cin >> n >> m;
std::cin >> l >> r;
for (int i = 1; i < m; i++) {
long long li, ri;
std::cin >> li >> ri;
if (li > l)
l = li;
if (ri < r)
r = ri;
}
if (l > r)
std::cout << 0;
else
std::cout << r + 1 - l... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 850,100 | 850,101 | u863370423 | 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>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,104 | 850,105 | u278557766 | cpp |
p03037 | #pragma region template 3.0
#define G3(_1, _2, _3, F, ...) F
#define G4(_1, _2, _3, _4, F, ...) F
#define G5(_1, _2, _3, _4, _5, F, ...) F
#define G6(_1, _2, _3, _4, _5, _6, F, ...) F
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> using vec = vector<T>;
template <typename T> u... | #pragma region template 3.0
#define G3(_1, _2, _3, F, ...) F
#define G4(_1, _2, _3, _4, F, ...) F
#define G5(_1, _2, _3, _4, _5, F, ...) F
#define G6(_1, _2, _3, _4, _5, _6, F, ...) F
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> using vec = vector<T>;
template <typename T> u... | [
"call.add",
"call.arguments.change"
] | 850,131 | 850,132 | u564902833 | cpp |
p03037 | #include <cstdlib>
#include <deque>
#include <iostream>
#include <string>
using namespace std;
using ulli = unsigned long long int;
int main() {
int n, m;
cin >> n >> m;
int ll = 1;
int rr = n;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
ll = max(ll, l);
rr = min(rr, r);
}
cout... | #include <cstdlib>
#include <deque>
#include <iostream>
#include <string>
using namespace std;
using ulli = unsigned long long int;
int main() {
int n, m;
cin >> n >> m;
int ll = 1;
int rr = n;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
ll = max(ll, l);
rr = min(rr, r);
}
cout... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.number.change"
] | 850,137 | 850,138 | u665581783 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
vector<int> num(n + 1, 0);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
num[l[i]]++;
num[r[i] + 1]--;
}
int ans = 0;
for (int i = 1; i < n + 1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
vector<int> num(n + 5, 0);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
num[l[i]]++;
num[r[i] + 1]--;
}
int ans = 0;
for (int i = 1; i < n + 5; i++) {
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 850,139 | 850,140 | u221391729 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
#define pi 3.14159265358979
int main() {
int n, m;
cin >> n >> m;
int first = 0, last = n + 1;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
#define pi 3.14159265358979
int main() {
int n, m;
cin >> n >> m;
int first = 0, last = n + 1;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,144 | 850,145 | u966522561 | cpp |
p03037 | // Author: Fuadul Hasan(fuadul202@gmail.com)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main() {
int n, m;
cin >> n >> m;
int x, y;
int L = 0, R = N;
while (m--) {
cin >> x >> y;
L = max(L, x);
R = min(R, y);
}
cout << (R - L + 1) << endl;... | // Author: Fuadul Hasan(fuadul202@gmail.com)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main() {
int n, m;
cin >> n >> m;
int x, y;
int L = 0, R = N;
while (m--) {
cin >> x >> y;
L = max(L, x);
R = min(R, y);
}
cout << max(0, (R - L + 1)) ... | [
"call.add",
"call.arguments.change"
] | 850,146 | 850,147 | u526278960 | 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;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
int left = 1, right... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
int left = 1, right... | [] | 850,156 | 850,157 | u420483676 | cpp |
p03037 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m, 0);
vector<int> r(m, 0);
vector<bool> can(n, true);
REP(i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m, 0);
vector<int> r(m, 0);
vector<bool> can(n, true);
REP(i... | [
"control_flow.branch.if.condition.change"
] | 850,160 | 850,161 | u514896542 | 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;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void) {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
rep(i, M) cin >> L[i] >> R[i];
... | #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;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void) {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
rep(i, M) cin >> L[i] >> R[i];
... | [
"call.add",
"call.arguments.change"
] | 850,166 | 850,167 | u437633151 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,168 | 850,169 | u272628953 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,170 | 850,169 | u272628953 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, mx = 0, mn = 999999;
cin >> n >> m;
vector<pair<int, int>> v(m);
for (int i = 0; i < m; i++) {
cin >> v[i].first >> v[i].second;
mx = max(v[i].first, mx);
mn = min(v[i].second, mn);
}
cout << mn - mx + 1;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, mx = 0, mn = 999999;
cin >> n >> m;
vector<pair<int, int>> v(m);
for (int i = 0; i < m; i++) {
cin >> v[i].first >> v[i].second;
mx = max(v[i].first, mx);
mn = min(v[i].second, mn);
}
cout << max(mn - mx + 1, 0);
return 0;
}... | [
"call.add",
"call.arguments.add"
] | 850,181 | 850,182 | u354648318 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.