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 9 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());
cout << R.at(0) - L.at(0) + 1 << endl;
}
| #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());
cout << max(0, R.at(0) - L.at(0) + 1) << endl;
}
| [
"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) {
AR = R[i];
}
}
if (AR - AL >= 0) {
cout << AR - AL + 1 << endl;
} else {
cout << 0 << endl;
}
} | #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) {
AR = R[i];
}
}
if (AR - AL >= 0) {
cout << AR - AL + 1 << endl;
} else {
cout << 0 << endl;
}
} | [
"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++)
#define SORT(a) sort((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
using namespace std;
using ll = long long;
#define INF 2000000000
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) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
/*覚えてないことメaモ
数値型から文字列に変換 to_string(number);これは簡単
文字列から数値型に変換 stoi(number)
文字列からllに変換 stoll(number)*/
//ここから書き始める
const long long mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
ll max_l = -1, min_r = 10000000;
ll L, R;
rep(i, m) {
cin >> L >> R;
chmax(max_l, L);
chmin(min_r, R);
}
if (min_r > max_l) {
cout << min_r - max_l + 1 << endl;
} else
cout << 0 << endl;
}
| #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++)
#define SORT(a) sort((a).begin(), (a).end())
#define REV(a) reverse((a).begin(), (a).end())
using namespace std;
using ll = long long;
#define INF 2000000000
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) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
/*覚えてないことメaモ
数値型から文字列に変換 to_string(number);これは簡単
文字列から数値型に変換 stoi(number)
文字列からllに変換 stoll(number)*/
//ここから書き始める
const long long mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
ll max_l = -1, min_r = 10000000;
ll L, R;
rep(i, m) {
cin >> L >> R;
chmax(max_l, L);
chmin(min_r, R);
}
if (min_r >= max_l) {
cout << min_r - max_l + 1 << endl;
} else
cout << 0 << endl;
}
| [
"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 long LL;
int main() {
int N, M;
cin >> N >> M;
int vmin = 0, vmax = N + 1;
for (int i = 0; i < M; ++i) {
int L, R;
cin >> L >> R;
vmin = max(vmin, L);
vmax = min(vmax, R);
}
cout << vmax - vmin + 1 << endl;
}
| #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 long LL;
int main() {
int N, M;
cin >> N >> M;
int vmin = 0, vmax = N + 1;
for (int i = 0; i < M; ++i) {
int L, R;
cin >> L >> R;
vmin = max(vmin, L);
vmax = min(vmax, R);
}
cout << max(0, vmax - vmin + 1) << endl;
}
| [
"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 << r - l + 1 << endl;
return 0;
}
| #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 << max(0, r - l + 1) << endl;
return 0;
}
| [
"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) \
; \
for (auto x : a) \
cout << x << " "; \
cout << "\n";
#define mset(a) \
; \
memset(a, 0, sizeof(a));
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, m;
cin >> n >> m;
ll l = 1, r = n;
for (int i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << r - l + 1 << "\n";
}
| #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) \
; \
for (auto x : a) \
cout << x << " "; \
cout << "\n";
#define mset(a) \
; \
memset(a, 0, sizeof(a));
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, m;
cin >> n >> m;
ll l = 1, r = n;
for (int i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << max(0ll, r - l + 1) << "\n";
}
| [
"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 endl '\n'
#define dbg(x) cout << #x << " " << x << endl
#define clr(x, v) memset(x, v, sizeof(x))
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
const double eps = 1e-9;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;
const int MAXN = 1e6 + 5;
void cp() {
int n, m;
cin >> n >> m;
int l = 1, r = n;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << r - l + 1;
}
int main() {
FASTIO;
int t;
t = 1;
// cin >> t;
while (t--) {
cp();
}
return 0;
} | #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 endl '\n'
#define dbg(x) cout << #x << " " << x << endl
#define clr(x, v) memset(x, v, sizeof(x))
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
const double eps = 1e-9;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;
const int MAXN = 1e6 + 5;
void cp() {
int n, m;
cin >> n >> m;
int l = 1, r = n;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << max(0, r - l + 1);
}
int main() {
FASTIO;
int t;
t = 1;
// cin >> t;
while (t--) {
cp();
}
return 0;
} | [
"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);
return 0;
} | [
"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; i--)
m += n / ((int)pow(10, i)) - (n / ((int)pow(10, i + 1))) * 10;
return m;
}
int ggcd(int a, int b) {
int r, tmp;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int fac(int n) {
int m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
int vec_sum(vector<int> v) {
int n = 0;
for (int i = 0; i < v.size(); i++)
n += v[i];
return n;
}
///////////////////////////
int main() {
int n, m, a, b;
cin >> n >> m;
vector<int> v(m), w(m);
rep(i, m) cin >> v[i] >> w[i];
a = v[0];
b = w[0];
rep(i, m) {
a = max(a, v[i]);
b = min(b, w[i]);
}
if (b - a >= 0) {
cout << b - a << endl;
} else {
cout << 0 << endl;
}
}
/////////////////////////// | #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; i--)
m += n / ((int)pow(10, i)) - (n / ((int)pow(10, i + 1))) * 10;
return m;
}
int ggcd(int a, int b) {
int r, tmp;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int fac(int n) {
int m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
int vec_sum(vector<int> v) {
int n = 0;
for (int i = 0; i < v.size(); i++)
n += v[i];
return n;
}
///////////////////////////
int main() {
int n, m, a, b;
cin >> n >> m;
vector<int> v(m), w(m);
rep(i, m) cin >> v[i] >> w[i];
a = v[0];
b = w[0];
rep(i, m) {
a = max(a, v[i]);
b = min(b, w[i]);
}
if (b - a >= 0) {
cout << b - a + 1 << endl;
} else {
cout << 0 << endl;
}
}
/////////////////////////// | [
"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).begin(), (a).end()
#define fi first
#define se second
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> LR(M);
for (int i = 0; i < M; i++)
cin >> LR[i].fi >> LR[i].se;
int right = INT_INF;
for (auto p : LR)
right = min(right, p.se);
int left = 0;
for (auto p : LR)
left = max(left, p.fi);
cout << right - left + 1 << endl;
} | #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).begin(), (a).end()
#define fi first
#define se second
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> LR(M);
for (int i = 0; i < M; i++)
cin >> LR[i].fi >> LR[i].se;
int right = INT_INF;
for (auto p : LR)
right = min(right, p.se);
int left = 0;
for (auto p : LR)
left = max(left, p.fi);
cout << max(0, right - left + 1) << endl;
} | [
"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";
}
return 0;
} | #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";
}
return 0;
} | [
"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>;
using vpli = vector<pli>;
using vpll = vector<pll>;
#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++)
int INF = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vi L(M), R(M);
int mi = N, ma = 1;
rep(i, M) {
cin >> L[i] >> R[i];
ma = max(ma, L[i]);
mi = min(mi, R[i]);
}
cout << mi - ma + 1 << endl;
} | #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>;
using vpli = vector<pli>;
using vpll = vector<pll>;
#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++)
int INF = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vi L(M), R(M);
int mi = N, ma = 1;
rep(i, M) {
cin >> L[i] >> R[i];
ma = max(ma, L[i]);
mi = min(mi, R[i]);
}
cout << max(0, mi - ma + 1) << endl;
} | [
"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()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(all(x));
#define RSORT(x) sort(rall(x));
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
using tiii = tuple<int, int, int>;
const ll inf = 1ll << 29;
const ll mod = 1000000007;
const double eps = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N, M;
cin >> N >> M;
vi L(M), R(M);
rep(i, M) {
cin >> L.at(i) >> R.at(i);
L.at(i)--, R.at(i)--;
}
cout << *min_element(all(R)) - *max_element(all(L)) + 1 << endl;
} | #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()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(all(x));
#define RSORT(x) sort(rall(x));
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
using tiii = tuple<int, int, int>;
const ll inf = 1ll << 29;
const ll mod = 1000000007;
const double eps = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N, M;
cin >> N >> M;
vi L(M), R(M);
rep(i, M) {
cin >> L.at(i) >> R.at(i);
L.at(i)--, R.at(i)--;
}
cout << max(*min_element(all(R)) - *max_element(all(L)) + 1, 0) << endl;
} | [
"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]);
v2 = min(v2, r[i]);
}
if (v2 - v1 > 0) {
cout << v2 - v1 + 1;
} else {
cout << 0;
}
return 0;
}
| #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]);
v2 = min(v2, r[i]);
}
if (v2 - v1 >= 0) {
cout << v2 - v1 + 1;
} else {
cout << 0;
}
return 0;
}
| [
"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_right);
}
cout << right - left + 1 << endl;
} | #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_right);
}
cout << max(right - left + 1, 0) << endl;
} | [
"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() {
int N, M;
cin >> N >> M;
vector<int> L(M + 1);
vector<int> R(M + 1);
int l, r;
for (int i = 1; i <= M; i++) {
cin >> L[i] >> R[i];
if (i == 1) {
l = L[i];
r = R[i];
} else {
if (l <= L[i])
l = L[i];
if (R[i] <= r)
r = R[i];
}
}
if (r - l - +1 < 0)
cout << 0 << endl;
else {
cout << r - l + 1 << endl;
}
} | #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() {
int N, M;
cin >> N >> M;
vector<int> L(M + 1);
vector<int> R(M + 1);
int l, r;
for (int i = 1; i <= M; i++) {
cin >> L[i] >> R[i];
if (i == 1) {
l = L[i];
r = R[i];
} else {
if (l <= L[i])
l = L[i];
if (R[i] <= r)
r = R[i];
}
}
if (r - l + 1 < 0)
cout << 0 << endl;
else {
cout << r - l + 1 << endl;
}
} | [
"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++)
#define all(a) (a).begin(), (a).end()
#define allg(a) (a).begin(), (a).end(), greator<>()
#define d20 std::setprecision(20)
#define veci vector<int>
#define vecll vector<long long int>
#define vecb vector<bool>
#define vecd vector<double>
template <typename T> T lcm(T a, T b) { return a / __gcd(a, b) * b; }
void comb(vector<vector<long long int>> &v) {
for (size_t i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (size_t k = 1; k < v.size(); k++) {
for (size_t j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
ll repeat_squaring(ll n, ll p, ll m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
ll t = repeat_squaring(n, p / 2, m);
return t * t % m;
}
return n * repeat_squaring(n, p - 1, m);
}
int main() {
int n, m;
cin >> n >> m;
int l = -1, r = INT_MAX;
rep(i, m) {
int tmp_l, tmp_r;
cin >> tmp_l >> tmp_r;
l = max(l, tmp_l);
r = min(r, tmp_r);
}
cout << min(r, n) - l + 1 << endl;
return 0;
} | #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++)
#define all(a) (a).begin(), (a).end()
#define allg(a) (a).begin(), (a).end(), greator<>()
#define d20 std::setprecision(20)
#define veci vector<int>
#define vecll vector<long long int>
#define vecb vector<bool>
#define vecd vector<double>
template <typename T> T lcm(T a, T b) { return a / __gcd(a, b) * b; }
void comb(vector<vector<long long int>> &v) {
for (size_t i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (size_t k = 1; k < v.size(); k++) {
for (size_t j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
ll repeat_squaring(ll n, ll p, ll m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
ll t = repeat_squaring(n, p / 2, m);
return t * t % m;
}
return n * repeat_squaring(n, p - 1, m);
}
int main() {
int n, m;
cin >> n >> m;
int l = -1, r = INT_MAX;
rep(i, m) {
int tmp_l, tmp_r;
cin >> tmp_l >> tmp_r;
l = max(l, tmp_l);
r = min(r, tmp_r);
}
cout << max(min(r, n) - l + 1, 0) << endl;
return 0;
} | [
"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;
} else
cout << "O" << endl;
return 0;
}
| #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;
} else
cout << "0" << endl;
return 0;
}
| [
"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;
} else
cout << "O" << endl;
return 0;
}
| #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;
} else
cout << "0" << endl;
return 0;
}
| [
"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); \
cout.tie(0)
#define MAXX 100005
int n, m;
int l[MAXX];
int r[MAXX];
int main() {
_FastIO;
cin >> n >> m;
int x = 1;
int y = n;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
x = max(x, l[i]);
y = min(y, r[i]);
}
int ans = y - x + 1;
cout << ans << endl;
return 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); \
cout.tie(0)
#define MAXX 100005
int n, m;
int l[MAXX];
int r[MAXX];
int main() {
_FastIO;
cin >> n >> m;
int x = 1;
int y = n;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
x = max(x, l[i]);
y = min(y, r[i]);
}
int ans = y - x + 1;
cout << max(0, ans) << endl;
return 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;
if (minr > maxl)
res = 0;
else
res = minr - maxl + 1;
cout << res << endl;
return 0;
}
| #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;
if (minr < maxl)
res = 0;
else
res = minr - maxl + 1;
cout << res << endl;
return 0;
}
| [
"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
res = minr - maxl + 1;
cout << res << endl;
return 0;
} | #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
res = minr - maxl + 1;
cout << res << endl;
return 0;
}
| [
"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) {
cout << rmin - lmax + 1 << endl;
} else {
cout << 0 << endl;
}
} | #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) {
cout << rmin - lmax + 1 << endl;
} else {
cout << 0 << endl;
}
} | [
"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) {
cout << rmin - lmax << endl;
} else {
cout << 0 << endl;
}
} | #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) {
cout << rmin - lmax + 1 << endl;
} else {
cout << 0 << endl;
}
} | [
"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() + 1 << endl;
else
cout << 0 << endl;
} | #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() + 1 << endl;
else
cout << 0 << endl;
} | [
"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 < size; ++i) {
if (max < array[i]) {
max = array[i];
}
}
return max;
}
int minElement(const int *array, size_t size) {
assert(array != NULL);
assert(size >= 1);
int min = array[0];
for (size_t i = 1; i < size; ++i) {
if (min > array[i]) {
min = array[i];
}
}
return min;
}
int main() {
int n, m;
cin >> n >> m;
int l[m] = {0};
int r[m] = {0};
rep(i, m) cin >> l[i] >> r[i];
/*
int id[n+1]={0};
for( int i = 0; i < n; i++ ){
id[l[i]:r[i]]++;
}
int ans = 0;
for( int i = 1; i < n+1; i++ ){
if( id[i] == n ) ans++;
}
*/
if (minElement(r, m) < maxElement(l, m)) {
cout << minElement(r, m) - maxElement(l, m) + 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #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 < size; ++i) {
if (max < array[i]) {
max = array[i];
}
}
return max;
}
int minElement(const int *array, size_t size) {
assert(array != NULL);
assert(size >= 1);
int min = array[0];
for (size_t i = 1; i < size; ++i) {
if (min > array[i]) {
min = array[i];
}
}
return min;
}
int main() {
int n, m;
cin >> n >> m;
int l[m] = {0};
int r[m] = {0};
rep(i, m) cin >> l[i] >> r[i];
/*
int id[n+1]={0};
for( int i = 0; i < n; i++ ){
id[l[i]:r[i]]++;
}
int ans = 0;
for( int i = 1; i < n+1; i++ ){
if( id[i] == n ) ans++;
}
*/
if (minElement(r, m) >= maxElement(l, m)) {
cout << minElement(r, m) - maxElement(l, m) + 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"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 \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), \
cout << fixed << setprecision(20);
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
#define PI 3.14159265358979
typedef long long ll;
using namespace std;
const ll MOD = 1e9 + 7LL;
const int INF = 2e9;
int N, M;
int main() {
INCANT;
cin >> N >> M;
int left = 0, right = INF;
int l, r;
rep(i, M) {
cin >> l >> r;
left = max(left, l);
right = min(right, r);
}
cout << right - left + 1 << endl;
return 0;
} | #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 \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), \
cout << fixed << setprecision(20);
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
#define PI 3.14159265358979
typedef long long ll;
using namespace std;
const ll MOD = 1e9 + 7LL;
const int INF = 2e9;
int N, M;
int main() {
INCANT;
cin >> N >> M;
int left = 0, right = INF;
int l, r;
rep(i, M) {
cin >> l >> r;
left = max(left, l);
right = min(right, r);
}
cout << max(0, right - left + 1) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 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]; }
int Lmax = 0, Rmin = INF;
rep(i, m) {
Lmax = max(L[i], Lmax);
Rmin = min(R[i], Rmin);
}
if (Rmin > Lmax)
cout << (Rmin - Lmax) + 1 << endl;
else
cout << 0 << endl;
} | #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]; }
int Lmax = 0, Rmin = INF;
rep(i, m) {
Lmax = max(L[i], Lmax);
Rmin = min(R[i], Rmin);
}
if (Rmin >= Lmax)
cout << (Rmin - Lmax) + 1 << endl;
else
cout << 0 << endl;
} | [
"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 endl "\n"
#endif
#define fff ff
#define sss ss.ff
#define ttt ss.ss
#define INF (1 << 30)
#define LLF (1ll << 60)
#define PRIME (1000000007)
#define FASTIO std::ios::sync_with_stdio(false)
#ifdef DEBUG
#define debug(x) cerr << #x << " = " << x << endl
#else
#define debug(x)
#endif
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define FILE_INPUT \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout)
#define all(x) x.begin(), x.end()
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<string> vs;
template <typename T, typename B = null_type>
using oset =
tree<T, B, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order / order_of_key
const ld eps = 1e-12;
ll fexp(ll b, ll e, ll p = PRIME) {
ll res = 1;
while (e) {
if (e & 1)
res = (res * b) % p;
b = (b * b) % p;
e >>= 1;
}
return res;
}
const int RANDOM =
chrono::high_resolution_clock::now().time_since_epoch().count();
struct no_hack_hash {
int operator()(int x) const { return x ^ RANDOM; }
};
struct iihash {
int operator()(ii x) const { return x.first * 31 + x.second; }
};
// To use most bits rather than just the lowest ones:
struct ghash { // large odd number for C
const uint64_t C = ll(4e18 * acos(0)) | 71;
ll operator()(ll x) const { return __builtin_bswap64(x * C); }
};
/*-----------------END TEMPLATE-----------------*/
int(((((((((((((((main)))))))))))))))() {
FASTIO;
ll n, m;
cin >> n >> m;
ll left = 1, right = n;
while (m--) {
ll a, b;
cin >> a >> b;
left = max(left, a);
right = min(right, b);
}
cout << right - left + 1 << endl;
}
| #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 endl "\n"
#endif
#define fff ff
#define sss ss.ff
#define ttt ss.ss
#define INF (1 << 30)
#define LLF (1ll << 60)
#define PRIME (1000000007)
#define FASTIO std::ios::sync_with_stdio(false)
#ifdef DEBUG
#define debug(x) cerr << #x << " = " << x << endl
#else
#define debug(x)
#endif
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define FILE_INPUT \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout)
#define all(x) x.begin(), x.end()
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<string> vs;
template <typename T, typename B = null_type>
using oset =
tree<T, B, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order / order_of_key
const ld eps = 1e-12;
ll fexp(ll b, ll e, ll p = PRIME) {
ll res = 1;
while (e) {
if (e & 1)
res = (res * b) % p;
b = (b * b) % p;
e >>= 1;
}
return res;
}
const int RANDOM =
chrono::high_resolution_clock::now().time_since_epoch().count();
struct no_hack_hash {
int operator()(int x) const { return x ^ RANDOM; }
};
struct iihash {
int operator()(ii x) const { return x.first * 31 + x.second; }
};
// To use most bits rather than just the lowest ones:
struct ghash { // large odd number for C
const uint64_t C = ll(4e18 * acos(0)) | 71;
ll operator()(ll x) const { return __builtin_bswap64(x * C); }
};
/*-----------------END TEMPLATE-----------------*/
int(((((((((((((((main)))))))))))))))() {
FASTIO;
ll n, m;
cin >> n >> m;
ll left = 1, right = n;
while (m--) {
ll a, b;
cin >> a >> b;
left = max(left, a);
right = min(right, b);
}
cout << max(right - left + 1, 0ll) << endl;
}
| [
"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(NULL); \
return 0; \
}();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll, ll>
#define debug(x) cout << x << "\n";
#define debug cout << "debugged\n";
#define minval -2e9
#define maxval 2e9
long double PI = 3.14159265358979323846;
const ll M = 1e9 + 7;
const ll inf = 1e18;
const ll ms = 1e7 + 2;
fast;
ll ans;
ll n, m, l, r;
void solve() {
cin >> n >> m;
r = INT_MAX;
for (int i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << min(n, r - l + 1) << endl;
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// int t;cin>>t;while(t--)
{ solve(); }
return 0;
}
| // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
return 0; \
}();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll, ll>
#define debug(x) cout << x << "\n";
#define debug cout << "debugged\n";
#define minval -2e9
#define maxval 2e9
long double PI = 3.14159265358979323846;
const ll M = 1e9 + 7;
const ll inf = 1e18;
const ll ms = 1e7 + 2;
fast;
ll ans;
ll n, m, l, r;
void solve() {
cin >> n >> m;
r = INT_MAX;
for (int i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << max(0ll, r - l + 1) << endl;
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// int t;cin>>t;while(t--)
{ solve(); }
return 0;
}
| [
"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(NULL); \
return 0; \
}();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll, ll>
#define debug(x) cout << x << "\n";
#define debug cout << "debugged\n";
#define minval -2e9
#define maxval 2e9
long double PI = 3.14159265358979323846;
const ll M = 1e9 + 7;
const ll inf = 1e18;
const ll ms = 1e7 + 2;
fast;
ll ans;
ll n, m, l, r;
void solve() {
cin >> n >> m;
r = INT_MAX;
for (int i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << r - l + 1 << endl;
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// int t;cin>>t;while(t--)
{ solve(); }
return 0;
}
| // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
return 0; \
}();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll, ll>
#define debug(x) cout << x << "\n";
#define debug cout << "debugged\n";
#define minval -2e9
#define maxval 2e9
long double PI = 3.14159265358979323846;
const ll M = 1e9 + 7;
const ll inf = 1e18;
const ll ms = 1e7 + 2;
fast;
ll ans;
ll n, m, l, r;
void solve() {
cin >> n >> m;
r = INT_MAX;
for (int i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << max(0ll, r - l + 1) << endl;
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// int t;cin>>t;while(t--)
{ solve(); }
return 0;
}
| [
"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) for (ll i = ((ll)(n)) - 1; i >= 0; i--)
#define perf(i, n) for (ll i = ((ll)(n)); i > 0; i--)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
ll n, m;
cin >> n >> m;
ll left = 0, right = INF;
rep(i, m) {
ll l, r;
cin >> l >> r;
chmax(left, l);
chmin(right, r);
}
if (right > left)
cout << right - left + 1 << endl;
else
cout << 0 << endl;
} | #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) for (ll i = ((ll)(n)) - 1; i >= 0; i--)
#define perf(i, n) for (ll i = ((ll)(n)); i > 0; i--)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
ll n, m;
cin >> n >> m;
ll left = 1, right = n;
rep(i, m) {
ll l, r;
cin >> l >> r;
chmax(left, l);
chmin(right, r);
}
if (right >= left)
cout << right - left + 1 << endl;
else
cout << 0 << endl;
} | [
"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[i] > maxl)
maxl = l[i];
if (r[i] < minr)
minr = r[i];
}
if (maxl < minr)
cout << minr - maxl + 1 << endl;
else
cout << 0 << endl;
return 0;
}
| #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[i] > maxl)
maxl = l[i];
if (r[i] < minr)
minr = r[i];
}
if (maxl <= minr)
cout << minr - maxl + 1 << endl;
else
cout << 0 << endl;
return 0;
} | [
"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[i] > maxl)
maxl = l[i];
if (r[i] < minr)
minr = r[i];
}
if (maxl < minr)
cout << minr - maxl + 1 << endl;
else
cout << 0 << endl;
return 0;
}
| #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[i] > maxl)
maxl = l[i];
if (r[i] < minr)
minr = r[i];
}
if (maxl <= minr)
cout << minr - maxl + 1 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"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 << Rmin - Lmax + 1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int Lmax, Rmin;
Lmax = 0;
Rmin = n;
for (int i = 0; i < m; i++) {
int L, R;
cin >> L >> R;
Lmax = max(Lmax, L);
Rmin = min(Rmin, R);
}
if (Lmax > Rmin) {
cout << 0 << endl;
} else {
cout << Rmin - Lmax + 1 << endl;
}
return 0;
} | [
"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 main() {
int n, m;
cin >> n >> m;
vector<int> v(n + 1, 0);
int l = 1, r = n;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
int count = r - l + 1;
cout << count << endl;
return 0;
} | #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 main() {
int n, m;
cin >> n >> m;
vector<int> v(n + 1, 0);
int l = 1, r = n;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
int count = max(r - l + 1, 0);
cout << count << endl;
return 0;
} | [
"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 long;
using pii = pair<int, int>;
// const ll INF = 1e18L + 5;
// const int INF = 1e9 + 5;
// const double pi = 3.14159265358979323846;
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
unordered_map<int, int> mp;
int L = 0, R = n + 1;
rep(_, m) {
int l, r;
cin >> l >> r;
l--;
r--;
chmax(L, l);
chmin(R, r);
}
cout << min(n, R - L + 1) << endl;
}
| #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 long;
using pii = pair<int, int>;
// const ll INF = 1e18L + 5;
// const int INF = 1e9 + 5;
// const double pi = 3.14159265358979323846;
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
unordered_map<int, int> mp;
int L = 0, R = n + 1;
rep(_, m) {
int l, r;
cin >> l >> r;
l--;
r--;
chmax(L, l);
chmin(R, r);
}
cout << max(0, R - L + 1) << endl;
}
| [
"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 long;
using pii = pair<int, int>;
// const ll INF = 1e18L + 5;
// const int INF = 1e9 + 5;
// const double pi = 3.14159265358979323846;
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
unordered_map<int, int> mp;
int L = 0, R = n + 1;
rep(_, m) {
int l, r;
cin >> l >> r;
l--;
r--;
chmax(L, l);
chmin(R, r);
}
cout << R - L + 1 << endl;
}
| #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 long;
using pii = pair<int, int>;
// const ll INF = 1e18L + 5;
// const int INF = 1e9 + 5;
// const double pi = 3.14159265358979323846;
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
unordered_map<int, int> mp;
int L = 0, R = n + 1;
rep(_, m) {
int l, r;
cin >> l >> r;
l--;
r--;
chmax(L, l);
chmin(R, r);
}
cout << max(0, R - L + 1) << endl;
}
| [
"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 main() {
int n, m;
cin >> n >> m;
int l = 0, r = n;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << r - l + 1 << endl;
} | #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 main() {
int n, m;
cin >> n >> m;
int l = 0, r = n;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << max(0, r - l + 1) << endl;
} | [
"call.add",
"call.arguments.change"
] | 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())
#define p(a) cout << a << "\n"
// ll mod = 1000000007;
// #define l(i, )
// #define rl(i, a, b) for(int i = a; i < b; i++)
/////////////////////GCD//////////////////////
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll extended_gcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll x1, y1;
ll d = extended_gcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
return d;
}
////////////////////SIEVE OF ERATOSTHENES//////////////////////
vector<int> sieveoferatosthenes(int n) {
vector<bool> prime(n + 1, true);
for (int i = 2; i <= sqrt(n); i++) {
if (prime[i]) {
for (int j = i * i; j <= n; j += i) {
prime[j] = false;
}
}
}
vector<int> all_primes;
for (int i = 2; i <= n; i++) {
if (prime[i])
all_primes.pb(i);
}
return all_primes;
}
////////////////////BINARY EXPONENTIATION///////////////////////
ll bin_exp(ll a, ll b, ll mod) {
ll ans = 1;
while (b) {
if (b % 2) {
b--;
ans = (ans % mod * a % mod) % mod;
}
b /= 2;
a = (a % mod * a % mod) % mod;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<pair<ll, ll>> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i].fi >> a[i].se;
}
sort(a.begin(), a.end());
ll x = a[0].fi, y = a[0].se;
// cout<<x<<" "<<y<<endl;
for (int i = 1; i < m; i++) {
x = max(x, a[i].fi);
y = min(y, a[i].se);
// if(xa[i].fi)
// {
// }
// else
}
// cout<<y<<" "<<x<<endl;
cout << y - x + 1 << endl;
} | #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())
#define p(a) cout << a << "\n"
// ll mod = 1000000007;
// #define l(i, )
// #define rl(i, a, b) for(int i = a; i < b; i++)
/////////////////////GCD//////////////////////
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll extended_gcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll x1, y1;
ll d = extended_gcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
return d;
}
////////////////////SIEVE OF ERATOSTHENES//////////////////////
vector<int> sieveoferatosthenes(int n) {
vector<bool> prime(n + 1, true);
for (int i = 2; i <= sqrt(n); i++) {
if (prime[i]) {
for (int j = i * i; j <= n; j += i) {
prime[j] = false;
}
}
}
vector<int> all_primes;
for (int i = 2; i <= n; i++) {
if (prime[i])
all_primes.pb(i);
}
return all_primes;
}
////////////////////BINARY EXPONENTIATION///////////////////////
ll bin_exp(ll a, ll b, ll mod) {
ll ans = 1;
while (b) {
if (b % 2) {
b--;
ans = (ans % mod * a % mod) % mod;
}
b /= 2;
a = (a % mod * a % mod) % mod;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<pair<ll, ll>> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i].fi >> a[i].se;
}
sort(a.begin(), a.end());
ll x = a[0].fi, y = a[0].se;
// cout<<x<<" "<<y<<endl;
for (int i = 1; i < m; i++) {
x = max(x, a[i].fi);
y = min(y, a[i].se);
// if(xa[i].fi)
// {
// }
// else
}
// cout<<y<<" "<<x<<endl;
cout << max(y - x + 1, 0ll) << endl;
} | [
"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 ? a : gcd(b, a % b); }
ll fceil(ll a, ll b) { return (a % b == 0 ? a / b : a / b + 1); }
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m + 1, 0), r(m + 1, 0);
for (int i = 1; i <= m; i++)
cin >> l[i] >> r[i];
l[0] = *max_element(++l.begin(), l.end());
r[0] = *min_element(++r.begin(), r.end());
cout << r[0] - l[0] + 1 << endl;
return 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 ? a : gcd(b, a % b); }
ll fceil(ll a, ll b) { return (a % b == 0 ? a / b : a / b + 1); }
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m + 1, 0), r(m + 1, 0);
for (int i = 1; i <= m; i++)
cin >> l[i] >> r[i];
l[0] = *max_element(++l.begin(), l.end());
r[0] = *min_element(++r.begin(), r.end());
cout << max(r[0] - l[0] + 1, 0) << endl;
return 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.at(m);
sort(ToEnd(L));
sort(ToEnd(R));
cout << R.at(0) - L.at(M - 1) + 1 << endl;
} | #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.at(m);
sort(ToEnd(L));
sort(ToEnd(R));
cout << max(0, R.at(0) - L.at(M - 1) + 1) << endl;
} | [
"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, r[0] - l.back() + 1);
return 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, r[0] - l.back() + 1);
return 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;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
sort(rall(l));
sort(all(r));
int ans = l[0] - r[0] + 1;
if (ans < 0)
cout << 0 << endl;
else
cout << ans << endl;
} | #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;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
sort(rall(l));
sort(all(r));
int ans = r[0] - l[0] + 1;
if (ans < 0)
cout << 0 << endl;
else
cout << ans << endl;
} | [
"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;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
sort(rall(l));
sort(rall(r));
int ans = r[0] - l[0] + 1;
if (ans < 0)
cout << 0 << endl;
else
cout << ans << endl;
} | #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;
typedef tuple<ll, ll, ll> LT;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
sort(rall(l));
sort(all(r));
int ans = r[0] - l[0] + 1;
if (ans < 0)
cout << 0 << endl;
else
cout << ans << endl;
} | [
"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()) +
1
<< endl;
return 0;
} | #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.begin(), L.end()) + 1,
0)
<< endl;
return 0;
} | [
"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;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) { cin >> l[i] >> r[i]; }
int maxl = 1;
int minr = 1000000;
rep(i, m) {
maxl = max(maxl, l[i]);
minr = min(minr, l[i]);
}
int ans = minr - maxl;
cout << max(ans, 0) << endl;
} | #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;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) { cin >> l[i] >> r[i]; }
int maxl = 1;
int minr = 1000000;
rep(i, m) {
maxl = max(maxl, l[i]);
minr = min(minr, r[i]);
}
int ans = minr - maxl + 1;
cout << max(ans, 0) << endl;
} | [
"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 << mini - maxi + 1;
}
| #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 << max(0, mini - maxi + 1);
}
| [
"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 - left + 1 << endl;
return 0;
} | #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 << endl;
return 0;
} | [
"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);
}
cout << minR - maxL + 1 << endl;
return 0;
}
| #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);
}
cout << max(0LL, minR - maxL + 1) << endl;
return 0;
}
| [
"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(), _a.end())
#define inputVecI(_name, _n) \
vec<int> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecUL(_name, _n) \
vec<ul> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecULL(_name, _n) \
vec<ull> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecS(_name, _n) \
vec<string> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define printVec(_vec) \
cout << "{"; \
rep(i, _vec.size() - 1) cout << _vec[i] << ","; \
cout << _vec[_vec.size() - 1]; \
cout << "}\n";
#define append(_x) push_back(_x)
#define mapLoop(_i, _name) for (auto i = _name.begin(); i != _name.end(); i++)
int main() {
long N, M;
cin >> N >> M;
long l, r;
long R = M + 1, L = 0;
rep(i, M) {
cin >> l >> r;
R = min(R, r);
L = max(L, l);
}
if (R - L + 1 < 0)
cout << 0 << endl;
else
cout << R - L + 1 << endl;
return 0;
} | #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(), _a.end())
#define inputVecI(_name, _n) \
vec<int> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecUL(_name, _n) \
vec<ul> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecULL(_name, _n) \
vec<ull> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecS(_name, _n) \
vec<string> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define printVec(_vec) \
cout << "{"; \
rep(i, _vec.size() - 1) cout << _vec[i] << ","; \
cout << _vec[_vec.size() - 1]; \
cout << "}\n";
#define append(_x) push_back(_x)
#define mapLoop(_i, _name) for (auto i = _name.begin(); i != _name.end(); i++)
int main() {
long N, M;
cin >> N >> M;
long l, r;
long R = N + 1, L = 0;
rep(i, M) {
cin >> l >> r;
R = min(R, r);
L = max(L, l);
}
if (R - L + 1 < 0)
cout << 0 << endl;
else
cout << R - L + 1 << endl;
return 0;
} | [
"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(), _a.end())
#define inputVecI(_name, _n) \
vec<int> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecUL(_name, _n) \
vec<ul> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecULL(_name, _n) \
vec<ull> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecS(_name, _n) \
vec<string> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define printVec(_vec) \
cout << "{"; \
rep(i, _vec.size() - 1) cout << _vec[i] << ","; \
cout << _vec[_vec.size() - 1]; \
cout << "}\n";
#define append(_x) push_back(_x)
#define mapLoop(_i, _name) for (auto i = _name.begin(); i != _name.end(); i++)
int main() {
ul N, M;
cin >> N >> M;
ul l, r;
ul R = N + 1, L = 0;
rep(i, M) {
cin >> l >> r;
R = min(R, r);
L = max(L, l);
}
if (R - L + 1 < 0)
cout << 0 << endl;
else
cout << R - L + 1 << endl;
return 0;
} | #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(), _a.end())
#define inputVecI(_name, _n) \
vec<int> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecUL(_name, _n) \
vec<ul> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecULL(_name, _n) \
vec<ull> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecS(_name, _n) \
vec<string> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define printVec(_vec) \
cout << "{"; \
rep(i, _vec.size() - 1) cout << _vec[i] << ","; \
cout << _vec[_vec.size() - 1]; \
cout << "}\n";
#define append(_x) push_back(_x)
#define mapLoop(_i, _name) for (auto i = _name.begin(); i != _name.end(); i++)
int main() {
long N, M;
cin >> N >> M;
long l, r;
long R = N + 1, L = 0;
rep(i, M) {
cin >> l >> r;
R = min(R, r);
L = max(L, l);
}
if (R - L + 1 < 0)
cout << 0 << endl;
else
cout << R - L + 1 << endl;
return 0;
} | [] | 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(), _a.end())
#define inputVecI(_name, _n) \
vec<int> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecUL(_name, _n) \
vec<ul> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecULL(_name, _n) \
vec<ull> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecS(_name, _n) \
vec<string> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define printVec(_vec) \
cout << "{"; \
rep(i, _vec.size() - 1) cout << _vec[i] << ","; \
cout << _vec[_vec.size() - 1]; \
cout << "}\n";
#define append(_x) push_back(_x)
#define mapLoop(_i, _name) for (auto i = _name.begin(); i != _name.end(); i++)
int main() {
ul N, M;
cin >> N >> M;
ul l, r;
ul R = M + 1, L = 0;
rep(i, M) {
cin >> l >> r;
R = min(R, r);
L = max(L, l);
}
if (R - L + 1 < 0)
cout << 0 << endl;
else
cout << R - L + 1 << endl;
return 0;
} | #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(), _a.end())
#define inputVecI(_name, _n) \
vec<int> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecUL(_name, _n) \
vec<ul> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecULL(_name, _n) \
vec<ull> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define inputVecS(_name, _n) \
vec<string> _name(_n); \
rep(_i, _n) cin >> _name[_i];
#define printVec(_vec) \
cout << "{"; \
rep(i, _vec.size() - 1) cout << _vec[i] << ","; \
cout << _vec[_vec.size() - 1]; \
cout << "}\n";
#define append(_x) push_back(_x)
#define mapLoop(_i, _name) for (auto i = _name.begin(); i != _name.end(); i++)
int main() {
long N, M;
cin >> N >> M;
long l, r;
long R = N + 1, L = 0;
rep(i, M) {
cin >> l >> r;
R = min(R, r);
L = max(L, l);
}
if (R - L + 1 < 0)
cout << 0 << endl;
else
cout << R - L + 1 << endl;
return 0;
} | [
"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 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #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 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"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 + 1, n);
cout << ans << endl;
}
| #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 + 1, n);
cout << max(ans, 0) << endl;
}
| [
"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;
if (minr > r)
minr = r;
}
int ans = max(0, minr - maxl + 1);
cout << ans << endl;
}
| #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;
if (minr > r)
minr = r;
}
int ans = max(0, minr - maxl + 1);
cout << ans << endl;
}
| [
"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 > max)
std::cout << min - max + 1 << std::endl;
else
std::cout << 0 << std::endl;
}
| #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 >= max)
std::cout << min - max + 1 << std::endl;
else
std::cout << 0 << std::endl;
}
| [
"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 Lmax = 0, Rmin = INF;
rep(i, M) {
cin >> L[i] >> R[i];
if (Lmax < L[i]) {
Lmax = L[i];
}
if (R[i] < Rmin) {
Rmin = R[i];
}
}
if (Lmax <= Rmin) {
cout << Rmin - Lmax + 1;
} else {
cout << -1;
}
return 0;
}
/**
* g++ code.cpp
* ./a.out
* shift + ctrl + i
**/ | #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 Lmax = 0, Rmin = INF;
rep(i, M) {
cin >> L[i] >> R[i];
if (Lmax < L[i]) {
Lmax = L[i];
}
if (R[i] < Rmin) {
Rmin = R[i];
}
}
if (Lmax <= Rmin) {
cout << Rmin - Lmax + 1;
} else {
cout << 0;
}
return 0;
}
/**
* g++ code.cpp
* ./a.out
* shift + ctrl + i
**/
| [
"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};
// isPrime
// modpow modinv
// getDigit
int main() {
cout << fixed << setprecision(10);
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) {
cin >> l.at(i);
cin >> r.at(i);
}
int lans = 0;
int rans = INF;
rep(i, m) {
lans = max(lans, l.at(i));
rans = min(rans, r.at(i));
}
cout << rans - lans + 1 << endl;
}
| #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};
// isPrime
// modpow modinv
// getDigit
int main() {
cout << fixed << setprecision(10);
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
rep(i, m) {
cin >> l.at(i);
cin >> r.at(i);
}
int lans = 0;
int rans = INF;
rep(i, m) {
lans = max(lans, l.at(i));
rans = min(rans, r.at(i));
}
cout << max(rans - lans + 1, 0) << endl;
}
| [
"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;
L = max(L, l);
R = min(R, r);
}
cout << R - L + 1 << endl;
return 0;
} | //#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;
L = max(L, l);
R = min(R, r);
}
cout << max(R - L + 1, 0) << endl;
return 0;
} | [
"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 max = gateR.top(); // Rで最少
if (min >= max)
cout << 0 << endl;
else
cout << max - min + 1 << endl;
}
| #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 max = gateR.top(); // Rで最少
if (min > max)
cout << 0 << endl;
else
cout << max - min + 1 << endl;
}
| [
"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 (ans < 0)
cout << 0 << endl;
else
cout << ans << endl;
return 0;
} | #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 (ans < 0)
cout << 0 << endl;
else
cout << ans << endl;
return 0;
} | [
"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 vd = vector<double>;
using vvi = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int L = 0, R = n - 1;
rep(i, 0, m) {
int l, r;
cin >> l >> r;
L = max(L, l - 1);
R = min(R, r - 1);
}
cout << R - L + 1 << endl;
return 0;
} | #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 vd = vector<double>;
using vvi = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int L = 0, R = n - 1;
rep(i, 0, m) {
int l, r;
cin >> l >> r;
L = max(L, l - 1);
R = min(R, r - 1);
}
cout << max(R - L + 1, 0) << endl;
return 0;
} | [
"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, mx = 0, my = INT_MAX, l, r;
cin >> N >> M;
REP(i, 0, M) {
cin >> l >> r;
mx = max(l, mx);
my = min(r, my);
}
cout << (my - mx > 0 ? my - mx + 1 : 0);
}
| #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, mx = 0, my = INT_MAX, l, r;
cin >> N >> M;
REP(i, 0, M) {
cin >> l >> r;
mx = max(l, mx);
my = min(r, my);
}
cout << (my - mx >= 0 ? my - mx + 1 : 0);
}
| [
"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, mx = 0, my = INT_MAX, l, r;
cin >> N >> M;
REP(i, 0, M) {
cin >> l >> r;
mx = max(l, mx);
my = min(r, my);
}
cout << (my - my > 0 ? my - mx + 1 : 0);
}
| #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, mx = 0, my = INT_MAX, l, r;
cin >> N >> M;
REP(i, 0, M) {
cin >> l >> r;
mx = max(l, mx);
my = min(r, my);
}
cout << (my - mx >= 0 ? my - mx + 1 : 0);
}
| [] | 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]);
minR = min(minR, R[i]);
}
int ans = minR - maxL;
ans = max(ans, 0);
cout << ans << 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 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]);
minR = min(minR, R[i]);
}
int ans = minR - maxL + 1;
ans = max(ans, 0);
cout << ans << endl;
return 0;
} | [
"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;
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
struct edge {
ll to, cost;
};
using Graph = vector<vector<int>>;
using _Graph = vector<vector<edge>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// 深さ優先探索
vector<bool> seen;
vector<int> colors;
int H, W, N;
int sx, sy, gx, gy;
vector<vector<char>> field;
vector<vector<int>> dist;
// vector<pair<int, int>> gx, gy;
deque<pair<int, int>> que;
typedef vector<vector<int>> Matrix;
const int INF = 100000000;
int main() {
int N, M;
cin >> N >> M;
// vector<pair<int, int>> gate(M);
vector<int> L(M), R(M);
REP(i, M) {
cin >> L[i] >> R[i];
// cin >> gate[i].second >> gate[i].first;
}
sort(L.begin(), L.end(), greater<int>());
sort(R.begin(), R.end());
cout << R[0] - L[0] + 1 << endl;
// sort(gate.begin(), gate.end());
// REP(i, N)swap(gate[i].first, gate[i].second);
}
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
pass System Test!
*/
| #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;
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
struct edge {
ll to, cost;
};
using Graph = vector<vector<int>>;
using _Graph = vector<vector<edge>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// 深さ優先探索
vector<bool> seen;
vector<int> colors;
int H, W, N;
int sx, sy, gx, gy;
vector<vector<char>> field;
vector<vector<int>> dist;
// vector<pair<int, int>> gx, gy;
deque<pair<int, int>> que;
typedef vector<vector<int>> Matrix;
const int INF = 100000000;
int main() {
int N, M;
cin >> N >> M;
// vector<pair<int, int>> gate(M);
vector<int> L(M), R(M);
REP(i, M) {
cin >> L[i] >> R[i];
// cin >> gate[i].second >> gate[i].first;
}
sort(L.begin(), L.end(), greater<int>());
sort(R.begin(), R.end());
cout << max(R[0] - L[0] + 1, 0) << endl;
// sort(gate.begin(), gate.end());
// REP(i, N)swap(gate[i].first, gate[i].second);
}
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
pass System Test!
*/
| [
"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;
l = max(l, L);
r = min(r, R);
}
cout << r - l + 1 << endl;
return 0;
} | #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;
l = max(l, L);
r = min(r, R);
}
cout << max(r - l + 1, 0) << endl;
return 0;
} | [
"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[2 * i + 1] < b)
b = vec[2 * i + 1];
}
cout << b - a + 1 << endl;
} | #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[2 * i + 1] < b)
b = vec[2 * i + 1];
}
cout << max(b - a + 1, 0) << endl;
} | [
"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(m);
rep(i, 0, m - 1) cin >> l[i] >> r[i];
ll min = 10000000;
ll max = 0;
rep(i, 0, m - 1) {
if (l[i] > max)
max = l[i];
if (r[i] < min)
min = r[i];
}
if (max >= min)
cout << min - max + 1 << endl;
else
cout << "0" << endl;
return 0;
} | #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(m);
rep(i, 0, m - 1) cin >> l[i] >> r[i];
ll min = 10000000;
ll max = 0;
rep(i, 0, m - 1) {
if (l[i] > max)
max = l[i];
if (r[i] < min)
min = r[i];
}
if (max <= min)
cout << min - max + 1 << endl;
else
cout << "0" << endl;
return 0;
} | [
"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));
cout << (((b[0] - a[a.size() - 1]) < 0) ? '0' : (b[0] - a[a.size() - 1] + 1));
return 0;
} | #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));
cout << (((b[0] - a[a.size() - 1]) < 0) ? 0 : (b[0] - a[a.size() - 1] + 1));
return 0;
} | [] | 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(__LINE__, ":" __VA_ARGS__)
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
typedef pair<string, int> Psi;
int main() {
int n, m;
cin >> n >> m;
int l, r;
int max = INF;
int min = -INF;
REP(i, m) {
cin >> l >> r;
if (r <= max) {
max = r;
}
if (min <= r) {
min = l;
}
}
// cout<<min<< " "<<max<<endl;
if (max < min) {
cout << 0 << endl;
} else {
cout << max - min + 1 << endl;
}
}
| #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(__LINE__, ":" __VA_ARGS__)
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
typedef pair<string, int> Psi;
int main() {
int n, m;
cin >> n >> m;
int l, r;
int max = INF;
int min = -INF;
REP(i, m) {
cin >> l >> r;
if (r < max) {
max = r;
}
if (min < l) {
min = l;
}
}
// cout<<min<< " "<<max<<endl;
if (max < min) {
cout << 0 << endl;
} else {
cout << max - min + 1 << endl;
}
} | [
"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 - maxL + 1 << endl;
} | #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 << endl;
} | [
"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
using namespace std;
template <class T> void umin(T &a, T b) { a = min(a, b); }
template <class T> void umax(T &a, T b) { a = max(a, b); }
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1e9 + 7, N = 1e6 + 3;
int pref[N], ans;
void solve() {
int n, m;
cin >> n >> m;
rep(i, m) {
int l, r;
cin >> l >> r;
pref[l]++;
pref[r + 1]--;
}
for (int i = 1; i <= n; ++i) {
pref[i] += pref[i - 1];
ans += pref[i] == n;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
// cin>>T;
while (T--)
solve();
} | #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
using namespace std;
template <class T> void umin(T &a, T b) { a = min(a, b); }
template <class T> void umax(T &a, T b) { a = max(a, b); }
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1e9 + 7, N = 1e6 + 3;
int pref[N], ans;
void solve() {
int n, m;
cin >> n >> m;
rep(i, m) {
int l, r;
cin >> l >> r;
pref[l]++;
pref[r + 1]--;
}
for (int i = 1; i <= n; ++i) {
pref[i] += pref[i - 1];
ans += pref[i] == m;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
// cin>>T;
while (T--)
solve();
} | [
"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, max - min + 1);
} | #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, min - max + 1);
} | [
"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], R = r[0];
int ans = R - L + 1;
cout << ans << endl;
return 0;
} | #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], R = r[0];
int ans = R - L + 1;
cout << max(ans, 0) << endl;
return 0;
} | [
"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;
for (int i = 0; i < m; i++) {
cin >> l >> r;
if (l > min)
min = l;
if (r < max) {
max = r;
}
}
if (max < min) {
lala = 0;
} else if (max < n) {
lala = max - min;
} else if (r >= n && min <= n) {
lala = n - min + 1;
} else if (max >= n && min > n) {
lala = 0;
}
cout << lala << "\n";
}
| // 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;
for (int i = 0; i < m; i++) {
cin >> l >> r;
if (l > min)
min = l;
if (r < max) {
max = r;
}
}
if (max < min) {
lala = 0;
} else {
if (max < n) {
lala = max - min + 1;
} else if (max >= n && min <= n) {
lala = n - min + 1;
} else if (max >= n && min > n) {
lala = 0;
}
}
cout << lala << "\n";
}
| [
"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;
return 0;
}
| #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;
return 0;
}
| [
"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) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
int main() {
ll N, M;
cin >> N >> M;
ll L[M], R[M];
rep(i, M) { cin >> L[i] >> R[i]; }
ll maxL = 0;
ll minR = N;
rep(i, M) {
if (maxL < L[i]) {
maxL = L[i];
}
if (minR < R[i]) {
minR = R[i];
}
}
ll ans = minR - maxL + 1;
if (ans >= 0) {
cout << ans << endl;
return 0;
}
cout << 0 << endl;
} | #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) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
int main() {
ll N, M;
cin >> N >> M;
ll L[M], R[M];
rep(i, M) { cin >> L[i] >> R[i]; }
ll maxL = 0;
ll minR = N;
rep(i, M) {
if (maxL < L[i]) {
maxL = L[i];
}
if (minR > R[i]) {
minR = R[i];
}
}
ll ans = minR - maxL + 1;
if (ans >= 0) {
cout << ans << endl;
return 0;
}
cout << 0 << endl;
} | [
"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> using vec2 = vec<vec<T>>;
template <typename T> using vec3 = vec<vec2<T>>;
template <typename T> using vec4 = vec<vec3<T>>;
using vi = vec<ll>;
using vvi = vec2<ll>;
using ii = pair<ll, ll>;
using iii = tuple<ll, ll, ll>;
using vii = vec<ii>;
using vs = vec<string>;
using vb = vec<bool>;
template <typename T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define VEC1(T, n1) vec<T>(n1)
#define VEC2(T, n1, n2) vec2<T>(n1, VEC1(T, n2))
#define VEC3(T, n1, n2, n3) vec3<T>(n1, VEC2(T, n2, n3))
#define VEC4(T, n1, n2, n3, n4) vec4<T>(n1, VEC3(T, n2, n3, n4))
#define vec(...) G5(__VA_ARGS__, VEC4, VEC3, VEC2, VEC1)(__VA_ARGS__)
#define VEC1V(T, n1, v) vec<T>(n1, v)
#define VEC2V(T, n1, n2, v) vec2<T>(n1, VEC1V(T, n2, v))
#define VEC3V(T, n1, n2, n3, v) vec3<T>(n1, VEC2V(T, n2, n3, v))
#define VEC4V(T, n1, n2, n3, n4, v) vec4<T>(n1, VEC3V(T, n2, n3, n4, v))
#define vecv(...) G6(__VA_ARGS__, VEC4V, VEC3V, VEC2V, VEC1V)(__VA_ARGS__)
#define REP0(i, n) for (ll i = 0; i < (n); ++i)
#define REP(i, j, n) for (ll i = (j); i < (n); ++i)
#define rep(...) G3(__VA_ARGS__, REP, REP0)(__VA_ARGS__)
#define REP1(i, n) for (ll i = 1; i <= (n); ++i)
#define REPI(i, j, n) for (ll i = (j); i <= (n); ++i)
#define repi(...) G3(__VA_ARGS__, REPI, REP1)(__VA_ARGS__)
#define RREP0(i, n) for (ll i = (n)-1; i >= 0; --i)
#define RREP(i, j, n) for (ll i = (n)-1; i >= (j); --i)
#define rrep(...) G3(__VA_ARGS__, RREP, RREP0)(__VA_ARGS__)
#define RREP1(i, n) for (ll i = (n); i >= 1; --i)
#define RREPI(i, j, n) for (ll i = (n); i >= (j); --i)
#define rrepi(...) G3(__VA_ARGS__, RREPI, RREP1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define ch(f, x, y) x = f((x), (y))
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
SORT(a); \
reverse(ALL(a))
#define IN1(T, a) \
T a; \
cin >> a;
#define IN2(T, a, b) \
T a, b; \
cin >> a >> b;
#define IN3(T, a, b, c) \
T a, b, c; \
cin >> a >> b >> c;
#define IN4(T, a, b, c, d) \
T a, b, c, d; \
cin >> a >> b >> c >> d;
#define in(...) G5(__VA_ARGS__, IN4, IN3, IN2, IN1)(__VA_ARGS__)
#define ll(...) in(ll, __VA_ARGS__)
#define STR(...) in(string, __VA_ARGS__)
#define VIN1(T, a, n) \
vec<T> a(n); \
each(i, a) cin >> i;
#define VIN2(T, a, b, n) \
vec<T> a(n), b(n); \
rep(i, n) cin >> a[i] >> b[i];
#define VIN3(T, a, b, c, n) \
vec<T> a(n), b(n), c(n); \
rep(i, n) cin >> a[i] >> b[i] >> c[i];
#define VIN4(T, a, b, c, d, n) \
vec<T> a(n), b(n), c(n), d(n); \
rep(i, n) cin >> a[i] >> b[i] >> c[i] >> d[i];
#define vin(...) G6(__VA_ARGS__, VIN4, VIN3, VIN2, VIN1)(__VA_ARGS__)
#define vll(...) vin(ll, __VA_ARGS__)
#define vvll(a, n) \
vvi a = vec(ll, n, n); \
rep(i, n) rep(j, n) cin >> a[i][j];
#define out(x) cout << (x) << endl;
#define fout(x) cout << fixed << setprecision(15) << (x) << endl;
#define DUMP1(a) cout << #a << " = " << (a) << endl;
#define DUMP2(a, b) \
cout << #a << " = " << (a) << ' ' << #b << " = " << (b) << endl;
#define DUMP3(a, b, c) \
cout << #a << " = " << (a) << ' ' << #b << " = " << (b) << ' ' << #c \
<< " = " << (c) << endl;
#define DUMP4(a, b, c, d) \
cout << #a << " = " << (a) << ' ' << #b << " = " << (b) << ' ' << #c \
<< " = " << (c) << ' ' << #d << " = " << (d) << endl;
#define DUMP5(a, b, c, d, e) \
cout << #a << " = " << (a) << ' ' << #b << " = " << (b) << ' ' << #c \
<< " = " << (c) << ' ' << #d << " = " << (d) << ' ' << #e << " = " \
<< (e) << endl;
#define dump(...) \
G5(__VA_ARGS__, DUMP5, DUMP4, DUMP3, DUMP2, DUMP1)(__VA_ARGS__)
template <typename T>
ostream &jout(T s, T e, string sep = " ", ostream &os = cout) {
if (s != e) {
os << *s;
++s;
}
while (s != e) {
os << sep << *s;
++s;
}
return os;
}
ostream &yes(bool cond, string y = "Yes", string n = "No", ostream &os = cout) {
os << (cond ? y : n) << endl;
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &t) {
return os << '(' << get<0>(t) << ", " << get<1>(t) << ", " << get<2>(t)
<< ')';
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
return jout(ALL(v), ", ", os << '[') << ']';
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &s) {
return jout(ALL(s), ", ", os << '{') << '}';
}
template <typename K, typename V>
ostream &operator<<(ostream &os, const map<K, V> &m) {
return jout(ALL(m), ", ", os << '{') << '}';
}
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#pragma endregion template
int main() {
ll(N, M);
vll(L, R, M);
ll l = 1;
ll r = N;
rep(i, M) {
ch(max, l, L[i]);
ch(min, r, R[i]);
}
out(r - l + 1);
} | #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> using vec2 = vec<vec<T>>;
template <typename T> using vec3 = vec<vec2<T>>;
template <typename T> using vec4 = vec<vec3<T>>;
using vi = vec<ll>;
using vvi = vec2<ll>;
using ii = pair<ll, ll>;
using iii = tuple<ll, ll, ll>;
using vii = vec<ii>;
using vs = vec<string>;
using vb = vec<bool>;
template <typename T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define VEC1(T, n1) vec<T>(n1)
#define VEC2(T, n1, n2) vec2<T>(n1, VEC1(T, n2))
#define VEC3(T, n1, n2, n3) vec3<T>(n1, VEC2(T, n2, n3))
#define VEC4(T, n1, n2, n3, n4) vec4<T>(n1, VEC3(T, n2, n3, n4))
#define vec(...) G5(__VA_ARGS__, VEC4, VEC3, VEC2, VEC1)(__VA_ARGS__)
#define VEC1V(T, n1, v) vec<T>(n1, v)
#define VEC2V(T, n1, n2, v) vec2<T>(n1, VEC1V(T, n2, v))
#define VEC3V(T, n1, n2, n3, v) vec3<T>(n1, VEC2V(T, n2, n3, v))
#define VEC4V(T, n1, n2, n3, n4, v) vec4<T>(n1, VEC3V(T, n2, n3, n4, v))
#define vecv(...) G6(__VA_ARGS__, VEC4V, VEC3V, VEC2V, VEC1V)(__VA_ARGS__)
#define REP0(i, n) for (ll i = 0; i < (n); ++i)
#define REP(i, j, n) for (ll i = (j); i < (n); ++i)
#define rep(...) G3(__VA_ARGS__, REP, REP0)(__VA_ARGS__)
#define REP1(i, n) for (ll i = 1; i <= (n); ++i)
#define REPI(i, j, n) for (ll i = (j); i <= (n); ++i)
#define repi(...) G3(__VA_ARGS__, REPI, REP1)(__VA_ARGS__)
#define RREP0(i, n) for (ll i = (n)-1; i >= 0; --i)
#define RREP(i, j, n) for (ll i = (n)-1; i >= (j); --i)
#define rrep(...) G3(__VA_ARGS__, RREP, RREP0)(__VA_ARGS__)
#define RREP1(i, n) for (ll i = (n); i >= 1; --i)
#define RREPI(i, j, n) for (ll i = (n); i >= (j); --i)
#define rrepi(...) G3(__VA_ARGS__, RREPI, RREP1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define ch(f, x, y) x = f((x), (y))
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
SORT(a); \
reverse(ALL(a))
#define IN1(T, a) \
T a; \
cin >> a;
#define IN2(T, a, b) \
T a, b; \
cin >> a >> b;
#define IN3(T, a, b, c) \
T a, b, c; \
cin >> a >> b >> c;
#define IN4(T, a, b, c, d) \
T a, b, c, d; \
cin >> a >> b >> c >> d;
#define in(...) G5(__VA_ARGS__, IN4, IN3, IN2, IN1)(__VA_ARGS__)
#define ll(...) in(ll, __VA_ARGS__)
#define STR(...) in(string, __VA_ARGS__)
#define VIN1(T, a, n) \
vec<T> a(n); \
each(i, a) cin >> i;
#define VIN2(T, a, b, n) \
vec<T> a(n), b(n); \
rep(i, n) cin >> a[i] >> b[i];
#define VIN3(T, a, b, c, n) \
vec<T> a(n), b(n), c(n); \
rep(i, n) cin >> a[i] >> b[i] >> c[i];
#define VIN4(T, a, b, c, d, n) \
vec<T> a(n), b(n), c(n), d(n); \
rep(i, n) cin >> a[i] >> b[i] >> c[i] >> d[i];
#define vin(...) G6(__VA_ARGS__, VIN4, VIN3, VIN2, VIN1)(__VA_ARGS__)
#define vll(...) vin(ll, __VA_ARGS__)
#define vvll(a, n) \
vvi a = vec(ll, n, n); \
rep(i, n) rep(j, n) cin >> a[i][j];
#define out(x) cout << (x) << endl;
#define fout(x) cout << fixed << setprecision(15) << (x) << endl;
#define DUMP1(a) cout << #a << " = " << (a) << endl;
#define DUMP2(a, b) \
cout << #a << " = " << (a) << ' ' << #b << " = " << (b) << endl;
#define DUMP3(a, b, c) \
cout << #a << " = " << (a) << ' ' << #b << " = " << (b) << ' ' << #c \
<< " = " << (c) << endl;
#define DUMP4(a, b, c, d) \
cout << #a << " = " << (a) << ' ' << #b << " = " << (b) << ' ' << #c \
<< " = " << (c) << ' ' << #d << " = " << (d) << endl;
#define DUMP5(a, b, c, d, e) \
cout << #a << " = " << (a) << ' ' << #b << " = " << (b) << ' ' << #c \
<< " = " << (c) << ' ' << #d << " = " << (d) << ' ' << #e << " = " \
<< (e) << endl;
#define dump(...) \
G5(__VA_ARGS__, DUMP5, DUMP4, DUMP3, DUMP2, DUMP1)(__VA_ARGS__)
template <typename T>
ostream &jout(T s, T e, string sep = " ", ostream &os = cout) {
if (s != e) {
os << *s;
++s;
}
while (s != e) {
os << sep << *s;
++s;
}
return os;
}
ostream &yes(bool cond, string y = "Yes", string n = "No", ostream &os = cout) {
os << (cond ? y : n) << endl;
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &t) {
return os << '(' << get<0>(t) << ", " << get<1>(t) << ", " << get<2>(t)
<< ')';
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
return jout(ALL(v), ", ", os << '[') << ']';
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &s) {
return jout(ALL(s), ", ", os << '{') << '}';
}
template <typename K, typename V>
ostream &operator<<(ostream &os, const map<K, V> &m) {
return jout(ALL(m), ", ", os << '{') << '}';
}
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#pragma endregion template
int main() {
ll(N, M);
vll(L, R, M);
ll l = 1;
ll r = N;
rep(i, M) {
ch(max, l, L[i]);
ch(min, r, R[i]);
}
out(max(0LL, r - l + 1));
} | [
"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 << ((rr - ll > 0) ? rr - ll : 0) + 1 << endl;
return 0;
} | #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 << ((rr - ll >= 0) ? rr - ll : -1) + 1 << endl;
return 0;
} | [
"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++) {
num[i] += num[i - 1];
if (num[i] == m)
ans++;
}
cout << ans << endl;
return 0;
} | #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++) {
num[i] += num[i - 1];
if (num[i] == m)
ans++;
}
cout << ans << endl;
return 0;
} | [
"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;
rep(i, m) {
int l, r;
cin >> l >> r;
first = max(l, first);
last = min(r, last);
}
if (first < last)
cout << last - first + 1 << endl;
else
cout << 0 << endl;
return 0;
} | #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;
rep(i, m) {
int l, r;
cin >> l >> r;
first = max(l, first);
last = min(r, last);
}
if (first <= last)
cout << last - first + 1 << endl;
else
cout << 0 << endl;
return 0;
} | [
"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;
return 0;
} | // 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)) << endl;
return 0;
} | [
"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 = n;
rep(i, m) {
left = max(left, l[i]);
right = min(right, r[i]);
}
int ans = right - left + 1;
cout << ans << endl;
return 0;
}
| #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 = n;
rep(i, m) {
left = max(left, l[i]);
right = min(right, r[i]);
}
int ans = left > right ? 0 : right - left + 1;
cout << ans << endl;
return 0;
}
| [] | 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, m) cin >> l[i] >> r[i];
sort(l.begin(), l.end());
sort(r.begin(), r.end());
REP(i, n) {
if (i < (l[m - 1]) || (r[0]) < i) {
can[i] = false;
}
}
int ans = 0;
REP(i, n) {
if (can[i] == true) {
ans++;
}
}
cout << ans << endl;
} | #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, m) cin >> l[i] >> r[i];
sort(l.begin(), l.end());
sort(r.begin(), r.end());
REP(i, n) {
if (i < (l[m - 1] - 1) || (r[0] - 1) < i) {
can[i] = false;
}
}
int ans = 0;
REP(i, n) {
if (can[i] == true) {
ans++;
}
}
cout << ans << endl;
} | [
"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];
int ans = *min_element(all(R)) - *max_element(all(L)) + 1;
cout << ans << endl;
return 0;
}
| #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];
int ans = max(0, *min_element(all(R)) - *max_element(all(L)) + 1);
cout << ans << endl;
return 0;
}
| [
"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++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); };
// fixed << setprecision(2)
bool Array_check(ll y, ll x, ll d, ll w) {
if (x < 0 || x >= w || y < 0 || y >= d) {
return false;
} else {
return true;
}
}
//小文字=大文字+32
int main() {
ll n, m;
cin >> n >> m;
vector<ll> L(m), R(m);
ll l = 1, r = n;
rep(i, m) { cin >> L[i] >> R[i]; }
rep(i, m) {
l = max(l, L[i]);
r = min(R[i], r);
}
if (r - l > 0) {
cout << r - l + 1;
} else {
cout << 0;
}
}
| #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++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); };
// fixed << setprecision(2)
bool Array_check(ll y, ll x, ll d, ll w) {
if (x < 0 || x >= w || y < 0 || y >= d) {
return false;
} else {
return true;
}
}
//小文字=大文字+32
int main() {
ll n, m;
cin >> n >> m;
vector<ll> L(m), R(m);
ll l = 1, r = n;
rep(i, m) { cin >> L[i] >> R[i]; }
rep(i, m) {
l = max(l, L[i]);
r = min(R[i], r);
}
if (r - l >= 0) {
cout << r - l + 1;
} else {
cout << 0;
}
}
| [
"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++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); };
// fixed << setprecision(2)
bool Array_check(ll y, ll x, ll d, ll w) {
if (x < 0 || x >= w || y < 0 || y >= d) {
return false;
} else {
return true;
}
}
//小文字=大文字+32
int main() {
ll n, m;
cin >> n >> m;
vector<ll> L(m), R(m);
ll l = 1, r = n;
rep(i, m) { cin >> L[i] >> R[i]; }
rep(i, m) {
l = max(l, L[i]);
r = min(R[i], r);
}
if (r - l > 0) {
cout << r - l;
} else {
cout << 0;
}
}
| #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++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); };
// fixed << setprecision(2)
bool Array_check(ll y, ll x, ll d, ll w) {
if (x < 0 || x >= w || y < 0 || y >= d) {
return false;
} else {
return true;
}
}
//小文字=大文字+32
int main() {
ll n, m;
cin >> n >> m;
vector<ll> L(m), R(m);
ll l = 1, r = n;
rep(i, m) { cin >> L[i] >> R[i]; }
rep(i, m) {
l = max(l, L[i]);
r = min(R[i], r);
}
if (r - l >= 0) {
cout << r - l + 1;
} else {
cout << 0;
}
}
| [
"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.