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>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> L(m), R(m);
for (int i = 0; i < m; i++) {
cin >> L.at(i) >> R.at(i);
}
int andl, andr;
andl = *min_element(L.begin(), L.end());
andr = *max_element(R.begin(), R.end());
if (andr - andl >= 0)
cout << andr - andl + 1 << endl;
else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> L(m), R(m);
for (int i = 0; i < m; i++) {
cin >> L.at(i) >> R.at(i);
}
int andl, andr;
andl = *max_element(L.begin(), L.end());
andr = *min_element(R.begin(), R.end());
if (andr - andl >= 0)
cout << andr - andl + 1 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 850,802 | 850,803 | u720447689 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> L(m), R(m);
for (int i = 0; i < m; i++) {
cin >> L.at(i) >> R.at(i);
}
int andl, andr;
andl = *min_element(L.begin(), L.end());
andr = *max_element(L.begin(), L.end());
if (andr - andl >= 0)
cout << andr - andl + 1 << endl;
else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> L(m), R(m);
for (int i = 0; i < m; i++) {
cin >> L.at(i) >> R.at(i);
}
int andl, andr;
andl = *max_element(L.begin(), L.end());
andr = *min_element(R.begin(), R.end());
if (andr - andl >= 0)
cout << andr - andl + 1 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"assignment.add"
] | 850,804 | 850,803 | u720447689 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int l, r;
cin >> l >> r;
for (int i = 1; i <= m; i++) {
int L, R;
cin >> L >> R;
l = max(l, L);
r = min(r, R);
}
if (l > r)
cout << 0 << endl;
else
cout << r - l + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int l, r;
cin >> l >> r;
for (int i = 1; i < m; i++) {
int L, R;
cin >> L >> R;
l = max(l, L);
r = min(r, R);
}
if (l > r)
cout << 0 << endl;
else
cout << r - l + 1 << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 850,811 | 850,812 | u945761460 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C, D, H, K, L, M, N, T, W, X;
string S;
cin >> N >> M;
vector<long long> vec(N, 0);
C = 1;
D = N;
for (int i = 0; i < M; i++) {
cin >> A >> B;
if (A > C && A < D) {
C = A;
}
if (B < D && B > C) {
D = B;
}
if (A > D || B < C) {
C = 1;
D = 0;
}
}
cout << D - C + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C, D, H, K, L, M, N, T, W, X;
string S;
cin >> N >> M;
vector<long long> vec(N, 0);
C = 1;
D = N;
for (int i = 0; i < M; i++) {
cin >> A >> B;
if (A >= C && A <= D) {
C = A;
}
if (B <= D && B >= C) {
D = B;
}
if (A > D || B < C) {
C = 1;
D = 0;
}
}
cout << D - C + 1 << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,819 | 850,820 | u261947526 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
int N, M;
cin >> N >> M;
int L = 0, R = N;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
L = max(L, l);
R = min(R, r);
}
cout << R - L + 1 << endl;
}
| #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
int N, M;
cin >> N >> M;
int L = 0, R = N;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
L = max(L, l);
R = min(R, r);
}
cout << max(0, R - L + 1) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 850,826 | 850,827 | u475843109 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll INF = 1'010'000'000'000'000'017LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
ll n, m;
cin >> n >> m;
vector<ll> l(m);
vector<ll> r(m);
rep(i, m) cin >> l.at(i) >> r.at(i);
ll lmax, rmin;
lmax = -1;
rmin = INF;
rep(i, m) lmax = max(lmax, l.at(i));
rep(i, m) rmin = min(rmin, r.at(i));
if (l <= r)
cout << rmin - lmax + 1;
else
cout << 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll INF = 1'010'000'000'000'000'017LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
ll n, m;
cin >> n >> m;
vector<ll> l(m);
vector<ll> r(m);
rep(i, m) cin >> l.at(i) >> r.at(i);
ll lmax, rmin;
lmax = -1;
rmin = INF;
rep(i, m) lmax = max(lmax, l.at(i));
rep(i, m) rmin = min(rmin, r.at(i));
if (lmax <= rmin)
cout << rmin - lmax + 1;
else
cout << 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 850,836 | 850,837 | u656731444 | cpp |
p03037 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int, int> P;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
const int MOD = 1000000007;
// const int MOD = 998244353;
const ll INF = 1e16;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
const string abc = "abcdefghijklmnopqrstuvwxyz";
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1),
make_pair(0, -1)};
////////////////////////////////////////////////////////////////////
///////////////////////___modpow___////////////////////
ll modpow(ll a, ll n, const ll &MOD = MOD) {
ll ret = n == 0 ? 1 : modpow(a, n / 2, MOD);
(ret *= ret) %= MOD;
if (n % 2)
((ret *= a) %= MOD);
return ret;
}
///////////////////////___modinv___////////////////////
ll modinv(ll d, const ll &MOD = MOD) { return modpow(d, MOD - 2, MOD); }
///////////////////////___combination___////////////////////
vector<ll> fac, finv, inv;
void COMinit(const int MAX = 5000000, const ll &MOD = MOD) {
fac.resize(MAX);
finv.resize(MAX);
inv.resize(MAX);
fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
repd(i, 2, MAX) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
///////////////////////////////////////////////////////////
signed main() {
int n, m;
cin >> n >> m;
int l = 1, r = n;
rep(i, m) {
int a, b;
cin >> a >> b;
chmin(r, b);
chmax(l, a);
}
cout << r - l + 1 << endl;
}
| //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int, int> P;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
const int MOD = 1000000007;
// const int MOD = 998244353;
const ll INF = 1e16;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
const string abc = "abcdefghijklmnopqrstuvwxyz";
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1),
make_pair(0, -1)};
////////////////////////////////////////////////////////////////////
///////////////////////___modpow___////////////////////
ll modpow(ll a, ll n, const ll &MOD = MOD) {
ll ret = n == 0 ? 1 : modpow(a, n / 2, MOD);
(ret *= ret) %= MOD;
if (n % 2)
((ret *= a) %= MOD);
return ret;
}
///////////////////////___modinv___////////////////////
ll modinv(ll d, const ll &MOD = MOD) { return modpow(d, MOD - 2, MOD); }
///////////////////////___combination___////////////////////
vector<ll> fac, finv, inv;
void COMinit(const int MAX = 5000000, const ll &MOD = MOD) {
fac.resize(MAX);
finv.resize(MAX);
inv.resize(MAX);
fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
repd(i, 2, MAX) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
///////////////////////////////////////////////////////////
signed main() {
int n, m;
cin >> n >> m;
int l = 1, r = n;
rep(i, m) {
int a, b;
cin >> a >> b;
chmin(r, b);
chmax(l, a);
}
cout << max(r - l + 1, 0LL) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 850,840 | 850,841 | u317754719 | cpp |
p03037 | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
/*int H,W;
vector<vector<int>> field;
void dfs(int h, int w){
field[h][w] = 0;
for(int dh = -1; dh <= 1; dh++){
for(int dw = -1; dw <= 1; dw++){
int nh = h + dh;
int nw = w + dw;
if(nh < 0 || nh >= H || nw < 0 || nw >= W)continue;
if(field[nh][nw] == 0)continue;
dfs(nh, nw);
}
}
}*/
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 left = 0;
int right = INFINITY;
rep(i, m) {
if (i == 0) {
left = l[i];
right = r[i];
} else {
if (l[i] > left)
left = l[i];
if (r[i] < right)
right = r[i];
}
}
print(right - left + 1);
} | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
/*int H,W;
vector<vector<int>> field;
void dfs(int h, int w){
field[h][w] = 0;
for(int dh = -1; dh <= 1; dh++){
for(int dw = -1; dw <= 1; dw++){
int nh = h + dh;
int nw = w + dw;
if(nh < 0 || nh >= H || nw < 0 || nw >= W)continue;
if(field[nh][nw] == 0)continue;
dfs(nh, nw);
}
}
}*/
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 left = 0;
int right = INFINITY;
rep(i, m) {
if (i == 0) {
left = l[i];
right = r[i];
} else {
if (l[i] > left)
left = l[i];
if (r[i] < right)
right = r[i];
}
}
print(max(right - left + 1, 0));
} | [
"call.arguments.add"
] | 850,851 | 850,852 | u999788719 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (n); i++)
#define ll long long
#define ull unsigned long long
int main() {
int n, m;
cin >> n >> m;
vector<int> Ls(m), Rs(m);
// int Ls[m], Rs[m];
rep(i, 0, m) { cin >> Ls[i] >> Rs[i]; }
int maxL = *max_element(Ls.begin(), Ls.end());
int minR = *min_element(Rs.begin(), Rs.end());
int ans = max(0, minR - maxL) + 1;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (n); i++)
#define ll long long
#define ull unsigned long long
int main() {
int n, m;
cin >> n >> m;
vector<int> Ls(m), Rs(m);
// int Ls[m], Rs[m];
rep(i, 0, m) { cin >> Ls[i] >> Rs[i]; }
int maxL = *max_element(Ls.begin(), Ls.end());
int minR = *min_element(Rs.begin(), Rs.end());
int ans = max(0, minR - maxL + 1);
cout << ans << endl;
return 0;
} | [
"call.arguments.change"
] | 850,861 | 850,862 | u024383312 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vb = vector<bool>;
using pii = 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;
}
// pow(llpow,modpow)
template <class T> ll llpow(ll x, T n) {
ll ans = 1;
if (x == 0)
ans = 0;
while (n) {
if (n & 1)
ans *= x;
x *= x;
n >>= 1;
}
return ans;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//ๆๅคงๅ
ฌ็ดๆฐ
template <class T> inline T gcd(T x, T y) {
if (y == 0)
return x;
else {
return gcd(y, x % y);
}
}
//ๆๅฐๅ
ฌๅๆฐ
template <class T> inline T lcm(T x, T y) { return x / gcd(x, y) * y; }
//้ๅ
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
#define rep(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
long long INF = 1LL << 60;
int main() {
int l = 0, r = 1 << 30;
int n, m;
cin >> n >> m;
rep(i, 0, m) {
int lv, rv;
cin >> lv >> rv;
chmax(l, lv);
chmin(r, rv);
}
cout << r - l + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vb = vector<bool>;
using pii = 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;
}
// pow(llpow,modpow)
template <class T> ll llpow(ll x, T n) {
ll ans = 1;
if (x == 0)
ans = 0;
while (n) {
if (n & 1)
ans *= x;
x *= x;
n >>= 1;
}
return ans;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//ๆๅคงๅ
ฌ็ดๆฐ
template <class T> inline T gcd(T x, T y) {
if (y == 0)
return x;
else {
return gcd(y, x % y);
}
}
//ๆๅฐๅ
ฌๅๆฐ
template <class T> inline T lcm(T x, T y) { return x / gcd(x, y) * y; }
//้ๅ
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
#define rep(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
long long INF = 1LL << 60;
int main() {
int l = 0, r = 1 << 30;
int n, m;
cin >> n >> m;
rep(i, 0, m) {
int lv, rv;
cin >> lv >> rv;
chmax(l, lv);
chmin(r, rv);
}
cout << max(r - l + 1, 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 850,863 | 850,864 | u410506856 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep2(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
long long INF = 1LL << 60;
ll n, m;
int main() {
cin >> n >> m;
vector<int> l(m + 10), r(m + 10);
for (int i = 1; i <= m; i++) {
cin >> l.at(i) >> r.at(i);
}
int start = 1;
int end = n;
for (int i = 1; i <= m; i++) {
if (l.at(i) > start)
start = l.at(i);
if (r.at(i) < end)
end = r.at(i);
}
int ans = end - start + 1;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep2(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
long long INF = 1LL << 60;
ll n, m;
int main() {
cin >> n >> m;
vector<int> l(m + 10), r(m + 10);
for (int i = 1; i <= m; i++) {
cin >> l.at(i) >> r.at(i);
}
int start = 1;
int end = n;
for (int i = 1; i <= m; i++) {
if (l.at(i) > start)
start = l.at(i);
if (r.at(i) < end)
end = r.at(i);
}
int ans = end - start + 1;
cout << max(ans, 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 850,865 | 850,866 | u410506856 | cpp |
p03037 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
#define enl "\n";
using namespace std;
using ll = long long;
using ld = long double;
ll mod = ll(1e9) + 7;
ll inf = ll(1e18);
template <typename T1, typename T2> ll ceill(T1 a, T2 b) {
return (a + b - 1) / b;
}
void ans(bool b, ostream &out = cout) { out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream &out = cout) { out << (b ? "YES" : "NO") << endl; }
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP
#include <iostream>
#include <map>
#include <vector>
using namespace std;
namespace dbg {
using ll = long long;
class Debug {
public:
Debug() {}
template <typename T> void vd(vector<T> vec);
template <typename T> void vd2(vector<vector<T>> vec);
template <typename T> void ad(T *arr, ll n);
template <typename T, size_t N> void ad2(T (&arr)[N], ll n);
template <typename T> void md(T mp);
};
template <typename T> void Debug::vd(vector<T> vec) {
for (auto vv : vec)
cout << vv << " ";
cout << endl;
}
template <typename T> void Debug::vd2(vector<vector<T>> vec) {
for (auto vv : vec)
for (auto vvv : vv)
cout << vvv << " ";
cout << endl;
}
template <typename T> void Debug::ad(T *arr, ll n) {
for (int i = 0; i <= n; i++)
cout << arr[i] << " ";
cout << endl;
}
template <typename T, size_t N> void Debug::ad2(T (&arr)[N], ll n) {
for (int i = 0; i <= N; i++)
for (int j = 0; j <= n; j++)
cout << arr[i][j] << " ";
cout << endl;
}
template <typename T> void Debug::md(T mp) {
cout << "key : value" << endl;
for (auto const &m : mp)
cout << m.first << " : " << m.second << endl;
cout << endl;
}
} // namespace dbg
#endif // INCLUDE_DEBUG_HPP
using dbg::Debug;
Debug debug;
class CPrison {
public:
void solve(std::istream &in, std::ostream &out) {
int n, m;
in >> n >> m;
int l, r;
int resl = 1, resr = n;
for (int i = 0; i < m; i++) {
in >> l >> r;
chmax(resl, l);
chmin(resr, r);
}
out << resr - resl + 1 << endl;
}
};
int main() {
CPrison solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
#define enl "\n";
using namespace std;
using ll = long long;
using ld = long double;
ll mod = ll(1e9) + 7;
ll inf = ll(1e18);
template <typename T1, typename T2> ll ceill(T1 a, T2 b) {
return (a + b - 1) / b;
}
void ans(bool b, ostream &out = cout) { out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream &out = cout) { out << (b ? "YES" : "NO") << endl; }
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP
#include <iostream>
#include <map>
#include <vector>
using namespace std;
namespace dbg {
using ll = long long;
class Debug {
public:
Debug() {}
template <typename T> void vd(vector<T> vec);
template <typename T> void vd2(vector<vector<T>> vec);
template <typename T> void ad(T *arr, ll n);
template <typename T, size_t N> void ad2(T (&arr)[N], ll n);
template <typename T> void md(T mp);
};
template <typename T> void Debug::vd(vector<T> vec) {
for (auto vv : vec)
cout << vv << " ";
cout << endl;
}
template <typename T> void Debug::vd2(vector<vector<T>> vec) {
for (auto vv : vec)
for (auto vvv : vv)
cout << vvv << " ";
cout << endl;
}
template <typename T> void Debug::ad(T *arr, ll n) {
for (int i = 0; i <= n; i++)
cout << arr[i] << " ";
cout << endl;
}
template <typename T, size_t N> void Debug::ad2(T (&arr)[N], ll n) {
for (int i = 0; i <= N; i++)
for (int j = 0; j <= n; j++)
cout << arr[i][j] << " ";
cout << endl;
}
template <typename T> void Debug::md(T mp) {
cout << "key : value" << endl;
for (auto const &m : mp)
cout << m.first << " : " << m.second << endl;
cout << endl;
}
} // namespace dbg
#endif // INCLUDE_DEBUG_HPP
using dbg::Debug;
Debug debug;
class CPrison {
public:
void solve(std::istream &in, std::ostream &out) {
int n, m;
in >> n >> m;
int l, r;
int resl = 1, resr = n;
for (int i = 0; i < m; i++) {
in >> l >> r;
chmax(resl, l);
chmin(resr, r);
}
out << max(resr - resl + 1, 0) << endl;
}
};
int main() {
CPrison solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 850,878 | 850,879 | u026620445 | cpp |
p03037 | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
int n, h[100005];
ll dp[100005];
#define ALL(v) (v).begin(), (v).end()
std::set<int> st;
//#define MAX(a,b) if(a>b)
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
/* ใใข้ข้ฃ
//vector<pair<long long, long long> > pairs(N);
for(long long i=0; i<N; i++){
long long a, b;
cin >> a >> b;
pairs[i] = make_pair(a, b);
}
//sort(pairs.begin(), pairs.end(),greater<pair<int,int> >());
sort(pairs.begin(), pairs.end());
*/
// stack<int> sta;
// queue<int> que;
int main() {
long long N, M, K;
string s;
// std::cin >> N;
std::cin >> N >> M;
// std::cin >> N >> M >> K;
// std::vector<long long> v(N);
// std::vector<long long> w(N);
// std::cin >> s;
// ้
ๅๅ
ฅๅ
/*
for(long long i=0; i<N; i++){
std::cin >> v[i];
}
*/
//ใฝใผใ
// std::sort(v.begin(),v.end());//ๆ้ ใฝใผใ
// std::sort(v.begin(),v.end(),std::greater<long long>());//้้ ใฝใผใ
// std::sort(w.begin(),w.end());//ๆ้ ใฝใผใ
// std::sort(w.begin(),w.end(),std::greater<long long>());//้้ ใฝใผใ
/*
//S.substr(i, 5);
//S.size();
for(long long i=0; i<N; i++){
std::cin >> v[i];
if(st.find(v[i])==st.end()){
st.insert(v[i]);
}
else{
st.erase(v[i]);
}
}
*/
long long sum, sum1;
sum = 0;
sum1 = 0;
int flg, flg1, cnt, cnt1;
flg = 0;
flg1 = 0;
cnt = 0;
cnt1 = 0;
long long max;
int max1;
max = 0;
max1 = 0;
long long min;
int min1;
min = INF;
min1 = INF;
int work1, work2, work3, work4;
work1 = 0;
work2 = 0;
work3 = 0;
work4 = 0;
// int a[4];
int value;
value = 0;
/*
a[0] = (value % 10);
value /= 10;// 1ๆก็ฎใๅใๅบใ
a[1] = (value % 10);
value /= 10;// 2ๆก็ฎใๅใๅบใ
a[2] = (value % 10);
value /= 10;// 3ๆก็ฎใๅใๅบใ
a[3] = (value % 10);
value /= 10;// 4ๆก็ฎใๅใๅบใ
work1=a[0]+10*a[1];
work2=a[2]+10*a[3];
*/
long long a;
long long b;
a = 0;
b = 0;
max = N;
min = 0;
for (long long i = 0; i < M; i++) {
std::cin >> a >> b;
if (min <= a) {
min = a;
}
if (b <= max) {
max = b;
}
}
//ๆๅญๅๅ
ฅๅ
/*
for(long long i=0; i<s.length(); i++){
if(s[i]!='1'){
}
*/
if (min <= max) {
printf("%llu", max - min + 1);
// puts("Yes");
// printf("%d",st.size());
//ๆๅญๅใฎๅบๅ
// std::cout << s << std::endl;
// printf("%.12f\n",ret);
// cout << sum << endl;
} else {
printf("%llu", max - min + 1);
// puts("No");
}
return 0;
}
| #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
int n, h[100005];
ll dp[100005];
#define ALL(v) (v).begin(), (v).end()
std::set<int> st;
//#define MAX(a,b) if(a>b)
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
/* ใใข้ข้ฃ
//vector<pair<long long, long long> > pairs(N);
for(long long i=0; i<N; i++){
long long a, b;
cin >> a >> b;
pairs[i] = make_pair(a, b);
}
//sort(pairs.begin(), pairs.end(),greater<pair<int,int> >());
sort(pairs.begin(), pairs.end());
*/
// stack<int> sta;
// queue<int> que;
int main() {
long long N, M, K;
string s;
// std::cin >> N;
std::cin >> N >> M;
// std::cin >> N >> M >> K;
// std::vector<long long> v(N);
// std::vector<long long> w(N);
// std::cin >> s;
// ้
ๅๅ
ฅๅ
/*
for(long long i=0; i<N; i++){
std::cin >> v[i];
}
*/
//ใฝใผใ
// std::sort(v.begin(),v.end());//ๆ้ ใฝใผใ
// std::sort(v.begin(),v.end(),std::greater<long long>());//้้ ใฝใผใ
// std::sort(w.begin(),w.end());//ๆ้ ใฝใผใ
// std::sort(w.begin(),w.end(),std::greater<long long>());//้้ ใฝใผใ
/*
//S.substr(i, 5);
//S.size();
for(long long i=0; i<N; i++){
std::cin >> v[i];
if(st.find(v[i])==st.end()){
st.insert(v[i]);
}
else{
st.erase(v[i]);
}
}
*/
long long sum, sum1;
sum = 0;
sum1 = 0;
int flg, flg1, cnt, cnt1;
flg = 0;
flg1 = 0;
cnt = 0;
cnt1 = 0;
long long max;
int max1;
max = 0;
max1 = 0;
long long min;
int min1;
min = INF;
min1 = INF;
int work1, work2, work3, work4;
work1 = 0;
work2 = 0;
work3 = 0;
work4 = 0;
// int a[4];
int value;
value = 0;
/*
a[0] = (value % 10);
value /= 10;// 1ๆก็ฎใๅใๅบใ
a[1] = (value % 10);
value /= 10;// 2ๆก็ฎใๅใๅบใ
a[2] = (value % 10);
value /= 10;// 3ๆก็ฎใๅใๅบใ
a[3] = (value % 10);
value /= 10;// 4ๆก็ฎใๅใๅบใ
work1=a[0]+10*a[1];
work2=a[2]+10*a[3];
*/
long long a;
long long b;
a = 0;
b = 0;
max = N;
min = 0;
for (long long i = 0; i < M; i++) {
std::cin >> a >> b;
if (min <= a) {
min = a;
}
if (b <= max) {
max = b;
}
}
//ๆๅญๅๅ
ฅๅ
/*
for(long long i=0; i<s.length(); i++){
if(s[i]!='1'){
}
*/
if (min <= max) {
printf("%llu", max - min + 1);
// puts("Yes");
// printf("%d",st.size());
//ๆๅญๅใฎๅบๅ
// std::cout << s << std::endl;
// printf("%.12f\n",ret);
// cout << sum << endl;
} else {
printf("%llu", 0);
// puts("No");
}
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"expression.operation.binary.remove"
] | 850,883 | 850,884 | u069521477 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> cards(M, vector<int>(2));
for (int i = 0; i < M; i++) {
for (int j = 0; j < 2; j++) {
cin >> cards[i][j];
}
}
int p = cards[0][1], q = cards[0][0];
for (int i = 1; i < M; i++) {
if (cards[i][0] > q)
q = cards[i][0];
if (cards[i][1] < p)
p = cards[i][1];
}
if (p - q - 1 <= 0)
cout << 0 << endl;
if (p - q + 1 > 0)
cout << p - q + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> cards(M, vector<int>(2));
for (int i = 0; i < M; i++) {
for (int j = 0; j < 2; j++) {
cin >> cards[i][j];
}
}
int p = cards[0][1], q = cards[0][0];
for (int i = 1; i < M; i++) {
if (cards[i][0] > q)
q = cards[i][0];
if (cards[i][1] < p)
p = cards[i][1];
}
if (p - q + 1 <= 0)
cout << 0 << endl;
if (p - q + 1 > 0)
cout << p - q + 1 << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 850,889 | 850,890 | u962609087 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0, temp = (int)(n); i < temp; ++i)
#define repi(i, start, end) for (int i = start, temp = (int)(end); i < end; ++i)
#define rfor(v, x) for (const auto &x : v) // xใฏๅคใ่กจใ
#define all(x) (x).begin(), (x).end()
#define SORT(v, n) sort(v, v + n)
#define vsort(v) sort(v.begin(), v.end())
#define vfsort(v, lambda) sort(v.begin(), v.end(), lambda)
#define vint vector<int>
#define vvint vector<vector<int>>
#define vin(v) \
rep(i, v.size()) { cin >> v[i]; }
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;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int ctoi(char c) { return c - '0'; }
//(lambda (x y) (< x y)) => [](int x, int y) -> int { return x<y; }
#define int ll
signed main(void) {
int n, m, ans = 0, l, r;
cin >> n >> m;
l = 0;
r = 10e5;
int a, b;
rep(i, m) {
cin >> a >> b;
chmax(l, a);
chmin(r, b);
}
if (r - l <= 0)
ans = 0;
else
ans = r - l + 1;
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0, temp = (int)(n); i < temp; ++i)
#define repi(i, start, end) for (int i = start, temp = (int)(end); i < end; ++i)
#define rfor(v, x) for (const auto &x : v) // xใฏๅคใ่กจใ
#define all(x) (x).begin(), (x).end()
#define SORT(v, n) sort(v, v + n)
#define vsort(v) sort(v.begin(), v.end())
#define vfsort(v, lambda) sort(v.begin(), v.end(), lambda)
#define vint vector<int>
#define vvint vector<vector<int>>
#define vin(v) \
rep(i, v.size()) { cin >> v[i]; }
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;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int ctoi(char c) { return c - '0'; }
//(lambda (x y) (< x y)) => [](int x, int y) -> int { return x<y; }
#define int ll
signed main(void) {
int n, m, ans = 0, l, r;
cin >> n >> m;
l = 0;
r = 10e5;
int a, b;
rep(i, m) {
cin >> a >> b;
chmax(l, a);
chmin(r, b);
}
if (r - l < 0)
ans = 0;
else
ans = r - l + 1;
printf("%lld\n", ans);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,893 | 850,894 | u432998668 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
int main() {
int n, m;
cin >> n >> m;
int left = 1;
int right = INT_MAX;
REP(i, 0, m) {
int l, r;
cin >> l >> r;
if (left < l)
left = l;
if (right > r)
right = r;
}
int ans = 0;
if (right - left > 0)
ans = right - left + 1;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
int main() {
int n, m;
cin >> n >> m;
int left = 1;
int right = INT_MAX;
REP(i, 0, m) {
int l, r;
cin >> l >> r;
if (left < l)
left = l;
if (right > r)
right = r;
}
int ans = 0;
if (right - left >= 0)
ans = right - left + 1;
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,895 | 850,896 | u530107518 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
bool chmin(ll &a, ll b) {
if (a > b) {
a = b;
return true;
}
return false;
}
bool chmax(ll &a, ll b) {
if (a < b) {
a = b;
return true;
}
return false;
}
signed main() {
ll n, m;
cin >> n >> m;
vector<ll> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
ll lmx = l[0], rmn = r[0];
rep(i, m) {
chmax(lmx, l[i]);
chmin(rmn, r[i]);
}
if (lmx > rmn)
cout << -1 << endl;
else
cout << rmn - lmx + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
bool chmin(ll &a, ll b) {
if (a > b) {
a = b;
return true;
}
return false;
}
bool chmax(ll &a, ll b) {
if (a < b) {
a = b;
return true;
}
return false;
}
signed main() {
ll n, m;
cin >> n >> m;
vector<ll> l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
ll lmx = l[0], rmn = r[0];
rep(i, m) {
chmax(lmx, l[i]);
chmin(rmn, r[i]);
}
if (lmx > rmn)
cout << 0 << endl;
else
cout << rmn - lmx + 1 << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 850,897 | 850,898 | u423624748 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
const int INF = INT_MAX / 2;
int main() {
int N, M;
cin >> N >> M;
int l = -INF, r = INF;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
l = max(l, L);
r = min(r, R);
}
if (r >= 0)
cout << r - l + 1 << endl;
else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
const int INF = INT_MAX / 2;
int main() {
int N, M;
cin >> N >> M;
int l = -INF, r = INF;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
l = max(l, L);
r = min(r, R);
}
if (r - l >= 0)
cout << r - l + 1 << endl;
else
cout << 0 << endl;
} | [
"control_flow.branch.if.condition.change"
] | 850,905 | 850,906 | u777258731 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> p(M);
for (int i = 0; i < M; i++) {
int a;
int b;
cin >> a >> b;
p.at(i) = make_pair(a, b);
}
int maxv = -1;
int minv = 1001001;
for (int i = 0; i < M; i++) {
int a;
int b;
tie(a, b) = p.at(i);
maxv = max(a, maxv);
minv = min(b, minv);
}
cout << min(minv - maxv + 1, 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> p(M);
for (int i = 0; i < M; i++) {
int a;
int b;
cin >> a >> b;
p.at(i) = make_pair(a, b);
}
int maxv = -1;
int minv = 1001001;
for (int i = 0; i < M; i++) {
int a;
int b;
tie(a, b) = p.at(i);
maxv = max(a, maxv);
minv = min(b, minv);
}
cout << max(minv - maxv + 1, 0) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 850,907 | 850,908 | u533566373 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9 + 5;
int main() {
int n, m;
cin >> n >> m;
int maxl = 0;
int minr = INT_MAX;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
l--;
maxl = max(maxl, l);
minr = min(minr, r);
}
cout << minr - maxl << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9 + 5;
int main() {
int n, m;
cin >> n >> m;
int maxl = 0;
int minr = INT_MAX;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
l--;
maxl = max(maxl, l);
minr = min(minr, r);
}
cout << max(0, minr - maxl) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 850,909 | 850,910 | u146594935 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 1000000000
int func(int x, int r, int D) { return r * x - D; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int Lmax = 0, Rmin = INF;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
if (l > Lmax)
Lmax = l;
if (r < Rmin)
Rmin = r;
}
int ans = (Rmin - Lmax >= 0) ? Rmin - Lmax : 0;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 1000000000
int func(int x, int r, int D) { return r * x - D; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int Lmax = 0, Rmin = INF;
for (int i = 0; i < M; i++) {
int l, r;
cin >> l >> r;
if (l > Lmax)
Lmax = l;
if (r < Rmin)
Rmin = r;
}
int ans = (Rmin - Lmax >= 0) ? Rmin - Lmax + 1 : 0;
cout << ans << endl;
} | [
"assignment.change"
] | 850,917 | 850,918 | u303163217 | 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 u = 1;
int l = n;
rep(i, m) {
int U, L;
cin >> U >> L;
u = (u < U) ? U : u;
l = (l > L) ? L : l;
}
int ans = l - u + 1;
if (ans < 1)
ans = 0;
cout << l - u + 1 << 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 u = 1;
int l = n;
rep(i, m) {
int U, L;
cin >> U >> L;
u = (u < U) ? U : u;
l = (l > L) ? L : l;
}
int ans = l - u + 1;
if (ans < 1)
ans = 0;
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 850,922 | 850,923 | u437779154 | 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];
sort(L.begin(), L.end());
sort(R.begin(), R.end());
cout << R[0] - L[M - 1] + 1 << 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];
sort(L.begin(), L.end());
sort(R.begin(), R.end());
cout << max(0, R[0] - L[M - 1] + 1) << endl;
} | [
"call.add",
"call.arguments.change"
] | 850,930 | 850,931 | u147808483 | cpp |
p03037 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pp;
const int INF = 1e9;
const int MOD = 1000000007;
const double pi = 3.141592653589793238;
ll gcd(ll a, ll b) { return __gcd(a, b); } //ๆๅคงๅ
ฌ็ดๆฐ
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //ๆๅคงๅ
ฌๅๆฐ
void printV(vector<int> &v);
void printVV(vector<vector<int>> &vv);
int main() {
int N, M;
cin >> N >> M;
int l, r, bl, br;
cin >> bl >> br;
for (int i = 1; i < M; i++) {
cin >> l >> r;
bl = max(bl, l);
br = min(br, r);
if (br - bl <= 0) {
cout << br - bl << endl;
return 0;
};
}
cout << br - bl << endl;
return 0;
}
// ใใฏใฟใผใฎไธญ่บซใๅ
จ้จๅบๅ
void printV(vector<int> &v) {
cout << " [ ";
for (int i = 0; i < (int)v.size(); i++) {
cout << v.at(i) << " ";
}
cout << "]" << endl;
}
void printVV(vector<vector<int>> &vv) {
cout << "{" << endl;
for (int i = 0; i < (int)vv.size(); i++) {
cout << " [ ";
for (int j = 0; j < (int)vv.at(i).size(); j++) {
cout << vv.at(i).at(j) << " ";
}
cout << "]," << endl;
}
cout << "}" << endl;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pp;
const int INF = 1e9;
const int MOD = 1000000007;
const double pi = 3.141592653589793238;
ll gcd(ll a, ll b) { return __gcd(a, b); } //ๆๅคงๅ
ฌ็ดๆฐ
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //ๆๅคงๅ
ฌๅๆฐ
void printV(vector<int> &v);
void printVV(vector<vector<int>> &vv);
int main() {
int N, M;
cin >> N >> M;
int l, r, bl, br;
cin >> bl >> br;
for (int i = 1; i < M; i++) {
cin >> l >> r;
bl = max(bl, l);
br = min(br, r);
if (br - bl < 0) {
cout << 0 << endl;
return 0;
};
}
cout << br - bl + 1 << endl;
return 0;
}
// ใใฏใฟใผใฎไธญ่บซใๅ
จ้จๅบๅ
void printV(vector<int> &v) {
cout << " [ ";
for (int i = 0; i < (int)v.size(); i++) {
cout << v.at(i) << " ";
}
cout << "]" << endl;
}
void printVV(vector<vector<int>> &vv) {
cout << "{" << endl;
for (int i = 0; i < (int)vv.size(); i++) {
cout << " [ ";
for (int j = 0; j < (int)vv.at(i).size(); j++) {
cout << vv.at(i).at(j) << " ";
}
cout << "]," << endl;
}
cout << "}" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"expression.operation.binary.remove"
] | 850,936 | 850,937 | u251236092 | cpp |
p03037 | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define pb push_back
#define f first
#define s second
#define double long double
const int MAX = 2e5 + 5;
const int MAX2 = 2e5 + 4;
const int MAAX = 2e18;
const int MOD = 1e9 + 7;
in main() {
int l, r;
int n, m;
cin >> n >> m;
int x, y;
r = n;
l = 0;
for (int i = 0; i < m; i++) {
cin >> x >> y;
l = max(l, x);
r = min(r, y);
}
cout << r - l + 1 << endl;
return 0;
}
| #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define pb push_back
#define f first
#define s second
#define double long double
const int MAX = 2e5 + 5;
const int MAX2 = 2e5 + 4;
const int MAAX = 2e18;
const int MOD = 1e9 + 7;
in main() {
int l, r;
int n, m;
cin >> n >> m;
int x, y;
r = n;
l = 0;
for (int i = 0; i < m; i++) {
cin >> x >> y;
l = max(l, x);
r = min(r, y);
}
cout << max(0ll, r - l + 1) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 850,940 | 850,941 | u839354257 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
in main() {
int n, m, mn = INT_MAX, mx = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
mx = max(x, mx);
mn = min(mn, y);
}
cout << max((int)0, mx - mn + 1) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
in main() {
int n, m, mn = INT_MAX, mx = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
mx = max(x, mx);
mn = min(mn, y);
}
cout << max((int)0, mn - mx + 1) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 850,942 | 850,943 | u488922517 | cpp |
p03037 | #include <bits/stdc++.h>
#include <unordered_map>
#define int long long int
#define double long double
#define endl "\n"
#define PI 3.141592653589793238462643383279502884
#define sum_up(x) (x * (x + 1)) / 2
#define sp(x) setprecision(x)
#define ceil(a, b) (a + (b - 1)) / b
#define mp(a, b) make_pair(a, b)
#define LCM(a, b) (a * b) / __gcd(a, b)
#define all(v) v.begin(), v.end()
#define alls(s, v) s.begin(), s.end(), v
#define gena(arr, n, nxt) generate(arr, arr + n, nxt)
#define genv(v, nxt) generate(v.begin(), v.end(), nxt)
#define BSv(v, a) binary_search(v.begin(), v.end(), a)
#define BSa(v, n, a) binary_search(v, v + n, a)
using namespace std;
void base() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
bool prime[100001];
void sieve(int n) {
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
}
/*int power(int x, int y)
{
int res = 1;
while (y > 0)
{
if (y & 1)
res = res * x;
y = y >> 1;
x = x*x;
}
return res;
}*/
double float_sq(double n) {
double x = n;
double y = 1;
double e = 0.000001;
while (x - y > e) {
x = (x + y) / 2;
y = n / x;
}
return x;
}
int int_sq(int x) {
if (x == 0 || x == 1)
return x;
int start = 1, end = x, ans;
while (start <= end) {
int mid = (start + end) / 2;
if (mid * mid == x)
return mid;
if (mid * mid < x) {
start = mid + 1;
ans = mid;
} else
end = mid - 1;
}
return ans;
}
int nxt() {
int x;
cin >> x;
return x;
}
bool ispalindrome(string str) {
vector<char> List;
for (int i = 0; i < str.length(); i++) {
auto pos = find(List.begin(), List.end(), str[i]);
if (pos != List.end()) {
auto posi = find(List.begin(), List.end(), str[i]);
List.erase(posi);
} else
List.push_back(str[i]);
}
if (str.length() % 2 == 0 && List.empty() ||
(str.length() % 2 == 1 && List.size() == 1))
return true;
else
return false;
}
void printArray(vector<int> arr, int n, vector<string> v) {
string s;
for (int i = 0; i < arr.size(); i++)
s += v[arr[i]];
}
void printSubsequences(vector<int> arr, int index, vector<int> subarr,
vector<string> v) {
if (index == arr.size()) {
int l = subarr.size();
if (l != 0)
printArray(subarr, l, v);
} else {
printSubsequences(arr, index + 1, subarr, v);
subarr.push_back(arr[index]);
printSubsequences(arr, index + 1, subarr, v);
}
return;
}
bool palindrome(string s) {
string test = s;
reverse(all(test));
return s == test;
}
int fast_power(int x, int y, int m) {
if (y == 0)
return 1;
int temp = fast_power(x, y / 2, m);
temp = (temp * temp) % m;
if (y % 2 != 0)
temp = (temp * x) % m;
return temp;
}
int inv(int x, int m) { return fast_power(x, m - 2, m); }
bool comp(const pair<int, pair<int, int>> &a,
const pair<int, pair<int, int>> &b) {
if (a.first == b.first) {
if (a.second.first == b.second.first)
return a.second.second < b.second.second;
return a.second.first < a.second.first;
}
return a.first > b.first;
}
int32_t main() {
base();
int n = nxt(), k = nxt();
int l = 0, r = 0;
for (int i = 0; i < k; i++) {
if (i == 0) {
int a = nxt(), b = nxt();
l = a;
r = b;
} else {
int a = nxt(), b = nxt();
if (b < r)
r = b;
if (a > l)
l = a;
}
}
cout << r - l + 1;
return 0;
}
| #include <bits/stdc++.h>
#include <unordered_map>
#define int long long int
#define double long double
#define endl "\n"
#define PI 3.141592653589793238462643383279502884
#define sum_up(x) (x * (x + 1)) / 2
#define sp(x) setprecision(x)
#define ceil(a, b) (a + (b - 1)) / b
#define mp(a, b) make_pair(a, b)
#define LCM(a, b) (a * b) / __gcd(a, b)
#define all(v) v.begin(), v.end()
#define alls(s, v) s.begin(), s.end(), v
#define gena(arr, n, nxt) generate(arr, arr + n, nxt)
#define genv(v, nxt) generate(v.begin(), v.end(), nxt)
#define BSv(v, a) binary_search(v.begin(), v.end(), a)
#define BSa(v, n, a) binary_search(v, v + n, a)
using namespace std;
void base() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
bool prime[100001];
void sieve(int n) {
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
}
/*int power(int x, int y)
{
int res = 1;
while (y > 0)
{
if (y & 1)
res = res * x;
y = y >> 1;
x = x*x;
}
return res;
}*/
double float_sq(double n) {
double x = n;
double y = 1;
double e = 0.000001;
while (x - y > e) {
x = (x + y) / 2;
y = n / x;
}
return x;
}
int int_sq(int x) {
if (x == 0 || x == 1)
return x;
int start = 1, end = x, ans;
while (start <= end) {
int mid = (start + end) / 2;
if (mid * mid == x)
return mid;
if (mid * mid < x) {
start = mid + 1;
ans = mid;
} else
end = mid - 1;
}
return ans;
}
int nxt() {
int x;
cin >> x;
return x;
}
bool ispalindrome(string str) {
vector<char> List;
for (int i = 0; i < str.length(); i++) {
auto pos = find(List.begin(), List.end(), str[i]);
if (pos != List.end()) {
auto posi = find(List.begin(), List.end(), str[i]);
List.erase(posi);
} else
List.push_back(str[i]);
}
if (str.length() % 2 == 0 && List.empty() ||
(str.length() % 2 == 1 && List.size() == 1))
return true;
else
return false;
}
void printArray(vector<int> arr, int n, vector<string> v) {
string s;
for (int i = 0; i < arr.size(); i++)
s += v[arr[i]];
}
void printSubsequences(vector<int> arr, int index, vector<int> subarr,
vector<string> v) {
if (index == arr.size()) {
int l = subarr.size();
if (l != 0)
printArray(subarr, l, v);
} else {
printSubsequences(arr, index + 1, subarr, v);
subarr.push_back(arr[index]);
printSubsequences(arr, index + 1, subarr, v);
}
return;
}
bool palindrome(string s) {
string test = s;
reverse(all(test));
return s == test;
}
int fast_power(int x, int y, int m) {
if (y == 0)
return 1;
int temp = fast_power(x, y / 2, m);
temp = (temp * temp) % m;
if (y % 2 != 0)
temp = (temp * x) % m;
return temp;
}
int inv(int x, int m) { return fast_power(x, m - 2, m); }
bool comp(const pair<int, pair<int, int>> &a,
const pair<int, pair<int, int>> &b) {
if (a.first == b.first) {
if (a.second.first == b.second.first)
return a.second.second < b.second.second;
return a.second.first < a.second.first;
}
return a.first > b.first;
}
int32_t main() {
base();
int n = nxt(), k = nxt();
int l = 0, r = 0;
for (int i = 0; i < k; i++) {
if (i == 0) {
int a = nxt(), b = nxt();
l = a;
r = b;
} else {
int a = nxt(), b = nxt();
if (b < r)
r = b;
if (a > l)
l = a;
}
}
cout << max(0ll, r - l + 1);
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 850,944 | 850,945 | u497215320 | cpp |
p03037 | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define f first
#define s second
#define pb push_back
#define pp push
#define RETURN exit(0)
#define pow(x, y) (int)(pow(x, y))
#define ceil(x) (int)(ceil(x))
#ifndef ONLINE_JUDGE
#define debug(x) cout << x << endl;
#else
#define debug(x) 42
#endif
const int MAX = 1e7;
const int MOD = 1e9 + 7;
const int MAAX = 1e15;
const long double EPS = 1e-6;
const int N = 1e6;
int power(int x, int y) {
if (y == 0)
return 1;
int a = power(x, y / 2) % MOD;
if (y % 2 == 0)
return a * a % MOD;
else
return x * a % MOD * a % MOD;
}
long double sq(int x) {
long double s = 0, e = x, mid;
while (e - s >= EPS) {
mid = (s + e) / 2;
if (mid * mid <= x) {
s = mid;
} else {
e = mid - EPS;
}
}
return s;
}
vector<int> primes;
bool visted[N + 5];
void sieve() {
visted[0] = visted[1] = 1;
for (int i = 2; i * i <= N; i++) {
if (visted[i] == 0) {
primes.pb(i);
for (int j = i * i; j <= N; j += i) {
visted[j] = 1;
}
}
}
for (int i = sqrt(N) + 1; i <= N; i++) {
if (visted[i] == 0)
primes.pb(i);
}
return;
}
in main() {
// freopen("in.in","r",stdin);
// freopen("out.out","w",stdout);
int tc = 1;
// sieve();
// scanf("%lld",&tc);
while (tc--) {
int n, m;
cin >> n >> m;
int l = 1, r = n;
while (m--) {
int x, y;
cin >> x >> y;
if (x > l)
l = x;
if (y < r)
r = y;
}
cout << max(0ll, r - l) << endl;
}
RETURN;
}
| #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define f first
#define s second
#define pb push_back
#define pp push
#define RETURN exit(0)
#define pow(x, y) (int)(pow(x, y))
#define ceil(x) (int)(ceil(x))
#ifndef ONLINE_JUDGE
#define debug(x) cout << x << endl;
#else
#define debug(x) 42
#endif
const int MAX = 1e7;
const int MOD = 1e9 + 7;
const int MAAX = 1e15;
const long double EPS = 1e-6;
const int N = 1e6;
int power(int x, int y) {
if (y == 0)
return 1;
int a = power(x, y / 2) % MOD;
if (y % 2 == 0)
return a * a % MOD;
else
return x * a % MOD * a % MOD;
}
long double sq(int x) {
long double s = 0, e = x, mid;
while (e - s >= EPS) {
mid = (s + e) / 2;
if (mid * mid <= x) {
s = mid;
} else {
e = mid - EPS;
}
}
return s;
}
vector<int> primes;
bool visted[N + 5];
void sieve() {
visted[0] = visted[1] = 1;
for (int i = 2; i * i <= N; i++) {
if (visted[i] == 0) {
primes.pb(i);
for (int j = i * i; j <= N; j += i) {
visted[j] = 1;
}
}
}
for (int i = sqrt(N) + 1; i <= N; i++) {
if (visted[i] == 0)
primes.pb(i);
}
return;
}
in main() {
// freopen("in.in","r",stdin);
// freopen("out.out","w",stdout);
int tc = 1;
// sieve();
// scanf("%lld",&tc);
while (tc--) {
int n, m;
cin >> n >> m;
int l = 1, r = n;
while (m--) {
int x, y;
cin >> x >> y;
if (x > l)
l = x;
if (y < r)
r = y;
}
cout << max(0ll, r - l + 1) << endl;
}
RETURN;
}
| [
"expression.operation.binary.add"
] | 850,946 | 850,947 | u956319190 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, ans;
cin >> N >> M;
int l = 1;
int r = N;
for (int i = 0; i < M; i++) {
int ifl, ifr;
cin >> ifl >> ifr;
l = max(l, ifl);
r = min(r, ifr);
}
if (r - l + 1 >= 0) {
ans = r - l + 1;
} else {
ans = 0;
}
cout << r - l + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, ans;
cin >> N >> M;
int l = 1;
int r = N;
for (int i = 0; i < M; i++) {
int ifl, ifr;
cin >> ifl >> ifr;
l = max(l, ifl);
r = min(r, ifr);
}
if (r - l + 1 >= 0) {
ans = r - l + 1;
} else {
ans = 0;
}
cout << ans << endl;
}
| [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 850,957 | 850,958 | u342075214 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
for (int i = 0; i < M; i++)
cin >> L.at(i) >> R.at(i);
sort(L.begin(), L.end());
sort(R.begin(), R.end());
if (R[0] - L[M - 1] <= 0) {
cout << 0 << endl;
} else {
cout << R[0] - L[M - 1] + 1 << 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.at(i) >> R.at(i);
}
sort(L.begin(), L.end());
sort(R.begin(), R.end());
if (R[0] - L[M - 1] < 0) {
cout << 0 << endl;
} else {
cout << R[0] - L[M - 1] + 1 << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 850,959 | 850,960 | u016183710 | 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];
sort(l.begin(), l.end());
reverse(l.begin(), l.end());
sort(r.begin(), r.end());
cout << r[0] - l[0] + 1 << 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];
sort(l.begin(), l.end());
reverse(l.begin(), l.end());
sort(r.begin(), r.end());
cout << max(r[0] - l[0] + 1, 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 850,963 | 850,964 | u297195722 | 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>;
void Main() {
int N, M;
int cnt = 0;
int gateMin = 0;
cin >> N >> M;
int gateMax = N;
vector<int> L(M), R(M);
for (int i = 1; i <= M; i++) {
cin >> L[i - 1] >> R[i - 1];
}
for (int i = 1; i <= M; i++) {
gateMin = max(gateMin, L[i - 1]);
// cout << gateMax << ", " << R[i-1] << endl;
gateMax = min(gateMax, R[i - 1]);
}
// for (int j = 1; j <= N; j++) {
// if (gateMin <= j && j <= gateMax) cnt++;
//}
// cout << gateMax << endl;
// cout << gateMin << endl;
cout << gateMax - gateMin + 1 << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
Main();
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>;
void Main() {
int N, M;
int cnt = 0;
int gateMin = 0;
cin >> N >> M;
int gateMax = N;
vector<int> L(M), R(M);
for (int i = 1; i <= M; i++) {
cin >> L[i - 1] >> R[i - 1];
}
for (int i = 1; i <= M; i++) {
gateMin = max(gateMin, L[i - 1]);
// cout << gateMax << ", " << R[i-1] << endl;
gateMax = min(gateMax, R[i - 1]);
}
// for (int j = 1; j <= N; j++) {
// if (gateMin <= j && j <= gateMax) cnt++;
//}
// cout << gateMax << endl;
// cout << gateMin << endl;
cout << max(gateMax - gateMin + 1, 0) << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
Main();
return 0;
} | [
"call.add",
"call.arguments.add"
] | 850,965 | 850,966 | u900523387 | cpp |
p03037 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n)-1; i > 0; --i)
#define rrepeq(i, n) for (int i = (int)(n); i >= 0; --i)
#define rrep1eq(i, n) for (int i = (int)(n); i > 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define fi first
#define se second
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template <typename T> using Graph = vector<vector<T>>;
template <typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T> struct is_pair : false_type {};
template <typename T1, typename T2> struct is_pair<pair<T1, T2>> : true_type {};
template <typename T> struct is_vector : false_type {};
template <typename T> struct is_vector<vector<T>> : true_type {};
template <typename T1, typename T2>
istream &operator>>(istream &istr, pair<T1, T2> &p) {
istr >> p.first >> p.second;
return istr;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &ostr, const pair<T1, T2> &p) {
ostr << p.first << " " << p.second;
return ostr;
}
template <typename T> istream &operator>>(istream &istr, vector<T> &vec) {
for (auto itr = vec.begin(); itr != vec.end(); ++itr) {
istr >> *itr;
}
return istr;
}
template <typename T> ostream &operator<<(ostream &ostr, const vector<T> &vec) {
if (vec.empty())
return ostr;
bool vp = is_vector<T>() || is_pair<T>();
ostr << vec.front();
for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) {
ostr << (vp ? "\n" : " ") << *itr;
}
return ostr;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
int modpow(int a, long long n, int mod = MOD) {
int ret = 1;
do {
if (n & 1)
ret = 1LL * ret * a % mod;
a = 1LL * a * a % mod;
} while (n >>= 1);
return ret;
}
template <typename T> T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template <typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }
template <typename T1, typename T2>
bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) {
return a.second != b.second ? a.second < b.second : a.first < b.first;
}
template <typename T> bool CompareBySlope(pair<T, T> a, pair<T, T> b) {
// counterclockwise from 12 o'clock direction
if (a.first * b.first < 0)
return a.first < b.first;
if (a.first == 0)
return a.second >= 0 || b.first > 0;
if (b.first == 0)
return b.second < 0 && a.first < 0;
return a.second * b.first < a.first * b.second;
}
/* -------- <templates end> -------- */
void solve() {
int n, m;
cin >> n >> m;
vector<pii> g(n);
cin >> g;
int l = 1, r = n;
rep(i, n) {
chmax(l, g[i].fi);
chmin(r, g[i].se);
}
if (r < l)
cout << 0 << endl;
else
cout << r - l + 1 << endl;
}
/* -------- <programs end> -------- */
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
solve();
return 0;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n)-1; i > 0; --i)
#define rrepeq(i, n) for (int i = (int)(n); i >= 0; --i)
#define rrep1eq(i, n) for (int i = (int)(n); i > 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define fi first
#define se second
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template <typename T> using Graph = vector<vector<T>>;
template <typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T> struct is_pair : false_type {};
template <typename T1, typename T2> struct is_pair<pair<T1, T2>> : true_type {};
template <typename T> struct is_vector : false_type {};
template <typename T> struct is_vector<vector<T>> : true_type {};
template <typename T1, typename T2>
istream &operator>>(istream &istr, pair<T1, T2> &p) {
istr >> p.first >> p.second;
return istr;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &ostr, const pair<T1, T2> &p) {
ostr << p.first << " " << p.second;
return ostr;
}
template <typename T> istream &operator>>(istream &istr, vector<T> &vec) {
for (auto itr = vec.begin(); itr != vec.end(); ++itr) {
istr >> *itr;
}
return istr;
}
template <typename T> ostream &operator<<(ostream &ostr, const vector<T> &vec) {
if (vec.empty())
return ostr;
bool vp = is_vector<T>() || is_pair<T>();
ostr << vec.front();
for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) {
ostr << (vp ? "\n" : " ") << *itr;
}
return ostr;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
int modpow(int a, long long n, int mod = MOD) {
int ret = 1;
do {
if (n & 1)
ret = 1LL * ret * a % mod;
a = 1LL * a * a % mod;
} while (n >>= 1);
return ret;
}
template <typename T> T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template <typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }
template <typename T1, typename T2>
bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) {
return a.second != b.second ? a.second < b.second : a.first < b.first;
}
template <typename T> bool CompareBySlope(pair<T, T> a, pair<T, T> b) {
// counterclockwise from 12 o'clock direction
if (a.first * b.first < 0)
return a.first < b.first;
if (a.first == 0)
return a.second >= 0 || b.first > 0;
if (b.first == 0)
return b.second < 0 && a.first < 0;
return a.second * b.first < a.first * b.second;
}
/* -------- <templates end> -------- */
void solve() {
int n, m;
cin >> n >> m;
vector<pii> g(m);
cin >> g;
int l = 1, r = n;
rep(i, m) {
chmax(l, g[i].fi);
chmin(r, g[i].se);
}
if (r < l)
cout << 0 << endl;
else
cout << r - l + 1 << endl;
}
/* -------- <programs end> -------- */
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
solve();
return 0;
}
| [] | 850,989 | 850,990 | u104057163 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const int inf = 1e9 + 7;
const ll INF = 1e18;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> T pow(T a, int b) {
return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
ll modpow(ll a, ll b, ll _mod) {
return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (auto &vi : vec)
os << vi << " ";
return os;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.F << " " << p.S;
return os;
}
template <typename T> inline istream &operator>>(istream &is, vector<T> &v) {
rep(j, sz(v)) is >> v[j];
return is;
}
template <class T> inline void add(T &a, int b) {
a += b;
if (a >= mod)
a -= mod;
}
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(10);
int T;
// cin >> T;
T = 1;
while (T--) {
solve();
}
}
void solve() {
int n, m;
cin >> n >> m;
vector<int> acc(m + 1);
rep(i, m) {
int l, r;
cin >> l >> r;
acc[l]++;
acc[r + 1]--;
}
rep3(i, 1, m + 1) acc[i] += acc[i - 1];
// cout << acc << endl;
int ans = 0;
rep(i, n + 1) if (acc[i] == m) ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const int inf = 1e9 + 7;
const ll INF = 1e18;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> T pow(T a, int b) {
return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
ll modpow(ll a, ll b, ll _mod) {
return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (auto &vi : vec)
os << vi << " ";
return os;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.F << " " << p.S;
return os;
}
template <typename T> inline istream &operator>>(istream &is, vector<T> &v) {
rep(j, sz(v)) is >> v[j];
return is;
}
template <class T> inline void add(T &a, int b) {
a += b;
if (a >= mod)
a -= mod;
}
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(10);
int T;
// cin >> T;
T = 1;
while (T--) {
solve();
}
}
void solve() {
int n, m;
cin >> n >> m;
vector<int> acc(n + 2);
rep(i, m) {
int l, r;
cin >> l >> r;
acc[l]++;
acc[r + 1]--;
}
rep3(i, 1, n + 2) acc[i] += acc[i - 1];
// cout << acc << endl;
int ans = 0;
rep(i, n + 2) if (acc[i] == m) ans++;
cout << ans << endl;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"assignment.variable.change"
] | 850,991 | 850,992 | u277556971 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9 + 7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
ll pow(ll a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n, m;
cin >> n >> m;
int l = -inf, r = inf;
rep(i, m) {
int u, v;
cin >> u >> v;
chmax(l, u);
chmin(r, v);
}
cout << r - l + 1 << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9 + 7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
ll pow(ll a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n, m;
cin >> n >> m;
int l = -inf, r = inf;
rep(i, m) {
int u, v;
cin >> u >> v;
chmax(l, u);
chmin(r, v);
}
cout << max(0, r - l + 1) << '\n';
}
| [
"call.add",
"call.arguments.change"
] | 850,994 | 850,995 | u277556971 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(25) << S << endl
#define Vec(K, L, N, S) vector<L> K(N, S)
#define DV(K, L, N, M, S) vector<vector<L>> K(N, vector<L>(M, S))
#define TV(K, L, N, M, R, S) \
vector<vector<vector<L>>> K(N, vector<vector<L>>(M, vector<L>(R, S)))
#define pint pair<lli, lli>
#define paf(L, R) pair<L, R>
#define mod 1000000007
#define MAX 510000
#define ALL(a) a.begin(), a.end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
lli gcd(lli num1, lli num2) {
return num2 != 0 ? gcd(num2, num1 % num2) : num1;
}
lli lcm(lli num1, lli num2) { return num1 / gcd(num1, num2) * num2; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
lli A, B, C, D, E, F, N, M, K, L, X, Y, Z, H, W, sum = 0, num = 0, flag = 0;
string S, T;
cin >> N >> M;
Vec(P, lli, M, 0);
Vec(Q, lli, M, 0);
rep(i, 0, M) cin >> P[i] >> Q[i];
Sort(P);
Sort(Q);
Out(Q[0] - P[M - 1] + 1);
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(25) << S << endl
#define Vec(K, L, N, S) vector<L> K(N, S)
#define DV(K, L, N, M, S) vector<vector<L>> K(N, vector<L>(M, S))
#define TV(K, L, N, M, R, S) \
vector<vector<vector<L>>> K(N, vector<vector<L>>(M, vector<L>(R, S)))
#define pint pair<lli, lli>
#define paf(L, R) pair<L, R>
#define mod 1000000007
#define MAX 510000
#define ALL(a) a.begin(), a.end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
lli gcd(lli num1, lli num2) {
return num2 != 0 ? gcd(num2, num1 % num2) : num1;
}
lli lcm(lli num1, lli num2) { return num1 / gcd(num1, num2) * num2; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
lli A, B, C, D, E, F, N, M, K, L, X, Y, Z, H, W, sum = 0, num = 0, flag = 0;
string S, T;
cin >> N >> M;
Vec(P, lli, M, 0);
Vec(Q, lli, M, 0);
rep(i, 0, M) cin >> P[i] >> Q[i];
Sort(P);
Sort(Q);
Out(max(0LL, Q[0] - P[M - 1] + 1));
}
| [
"call.add",
"call.arguments.change"
] | 851,005 | 851,006 | u618604643 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
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;
}
int main() {
int n, m;
cin >> n >> m;
int l = 1, r = n;
int ans = n;
rep(i, m) {
int p, q;
cin >> p >> q;
if (l < p)
l = p;
if (q < r)
r = q;
if (l >= r) {
ans = 0;
break;
}
ans = min(ans, r - l + 1);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
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;
}
int main() {
int n, m;
cin >> n >> m;
int l = 1, r = n;
int ans = n;
rep(i, m) {
int p, q;
cin >> p >> q;
if (l < p)
l = p;
if (q < r)
r = q;
if (l > r) {
ans = 0;
break;
}
ans = min(ans, r - l + 1);
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,009 | 851,010 | u989306199 | cpp |
p03037 |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cVf ?Y! JM V$ `
+++++= OunkoI Xppppp dMN .MM+ .MM MM| MM] JMMMMMM+
|@tqkoh) ,y0 (V$ yyyyyyyV7 VV JMWyZWr TWVVVVW&,
++++++ dZZZZ0 Xppppp ^HMN, _.db WMm, .MMF MM| ..MM` JMF .
|yk .WV&. .XW' yy 4yn. jyn +. JM #S
`++++` ?ZZZX= ?WWWW= -THMMMMH9^ (TMMMMM9! MMMMMMM"" JMMMMMMMME
|UU. ?TUUUUY= UU. (UU- ^7TUUUV7! JUUUUUUUU 7TUNKO*/
// Ricty Diminished
#include "bits/stdc++.h"
using namespace std;
typedef long long lint;
typedef vector<lint> liv;
//#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define linf 1152921504606846976
#define MAXN 100100
#define md 1000000007 // 998244353
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1, _2, _3, _4, name, ...) name
#define _getname3(_1, _2, _3, name, ...) name
#define _trep2(tuple) _rep2 tuple
#define _trep3(tuple) _rep3 tuple
#define _trep4(tuple) _rep4 tuple
#define _rep1(n) for (lint i = 0; i < n; ++i)
#define _rep2(i, n) for (lint i = 0; i < n; ++i)
#define _rep3(i, a, b) for (lint i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (lint i = a; i < b; i += c)
#define _trrep2(tuple) _rrep2 tuple
#define _trrep3(tuple) _rrep3 tuple
#define _trrep4(tuple) _rrep4 tuple
#define _rrep1(n) for (lint i = n - 1; i >= 0; --i)
#define _rrep2(i, n) for (lint i = n - 1; i >= 0; --i)
#define _rrep3(i, a, b) for (lint i = b - 1; i >= a; --i)
#define _rrep4(i, a, b, c) \
for (lint i = a + (b - a - 1) / c * c; i >= a; i -= c)
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
// template<class T>
// ostream& operator<<(ostream& os,vector<T>& vec){
// os<<vec[0];rep(i,1,vec.size())os<<' '<<vec[i];return os; } template<class T>
// ostream& operator<<(ostream& os,deque<T>& deq){
// os<<deq[0];rep(i,1,deq.size())os<<' '<<deq[i];return os; }
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
} // http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
#define rep(...) \
_vcppunko4((__VA_ARGS__, _trep4, _trep3, _trep2, _rep1))((__VA_ARGS__))
#define rrep(...) \
_vcppunko4((__VA_ARGS__, _trrep4, _trrep3, _trrep2, _rrep1))((__VA_ARGS__))
#define each(v) for (auto &i : v)
#define lin(...) \
lint __VA_ARGS__; \
in(__VA_ARGS__)
#define stin(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define vin(type, name, size) \
vector<type> name(size); \
in(name)
#define fi i.first
#define se i.second
#define YES(c) cout << ((c) ? "YES\n" : "NO\n"), 0
#define Yes(c) cout << ((c) ? "Yes\n" : "No\n"), 0
#define o(p) cout << p << endl, 0
#define deb(p) cerr << p << endl, 0
#define dd(n) cout << fixed << setprecision(n)
#define inf linf
int main() {
lin(n, m);
liv l(m), r(m);
lint L = 0, R = n;
rep(m) {
cin >> l[i] >> r[i];
--l[i];
L = max(L, l[i]);
R = min(R, r[i]);
}
cout << R - L << endl;
}
// sub-EOF
|
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cVf ?Y! JM V$ `
+++++= OunkoI Xppppp dMN .MM+ .MM MM| MM] JMMMMMM+
|@tqkoh) ,y0 (V$ yyyyyyyV7 VV JMWyZWr TWVVVVW&,
++++++ dZZZZ0 Xppppp ^HMN, _.db WMm, .MMF MM| ..MM` JMF .
|yk .WV&. .XW' yy 4yn. jyn +. JM #S
`++++` ?ZZZX= ?WWWW= -THMMMMH9^ (TMMMMM9! MMMMMMM"" JMMMMMMMME
|UU. ?TUUUUY= UU. (UU- ^7TUUUV7! JUUUUUUUU 7TUNKO*/
// Ricty Diminished
#include "bits/stdc++.h"
using namespace std;
typedef long long lint;
typedef vector<lint> liv;
//#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define linf 1152921504606846976
#define MAXN 100100
#define md 1000000007 // 998244353
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1, _2, _3, _4, name, ...) name
#define _getname3(_1, _2, _3, name, ...) name
#define _trep2(tuple) _rep2 tuple
#define _trep3(tuple) _rep3 tuple
#define _trep4(tuple) _rep4 tuple
#define _rep1(n) for (lint i = 0; i < n; ++i)
#define _rep2(i, n) for (lint i = 0; i < n; ++i)
#define _rep3(i, a, b) for (lint i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (lint i = a; i < b; i += c)
#define _trrep2(tuple) _rrep2 tuple
#define _trrep3(tuple) _rrep3 tuple
#define _trrep4(tuple) _rrep4 tuple
#define _rrep1(n) for (lint i = n - 1; i >= 0; --i)
#define _rrep2(i, n) for (lint i = n - 1; i >= 0; --i)
#define _rrep3(i, a, b) for (lint i = b - 1; i >= a; --i)
#define _rrep4(i, a, b, c) \
for (lint i = a + (b - a - 1) / c * c; i >= a; i -= c)
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
// template<class T>
// ostream& operator<<(ostream& os,vector<T>& vec){
// os<<vec[0];rep(i,1,vec.size())os<<' '<<vec[i];return os; } template<class T>
// ostream& operator<<(ostream& os,deque<T>& deq){
// os<<deq[0];rep(i,1,deq.size())os<<' '<<deq[i];return os; }
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
} // http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
#define rep(...) \
_vcppunko4((__VA_ARGS__, _trep4, _trep3, _trep2, _rep1))((__VA_ARGS__))
#define rrep(...) \
_vcppunko4((__VA_ARGS__, _trrep4, _trrep3, _trrep2, _rrep1))((__VA_ARGS__))
#define each(v) for (auto &i : v)
#define lin(...) \
lint __VA_ARGS__; \
in(__VA_ARGS__)
#define stin(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define vin(type, name, size) \
vector<type> name(size); \
in(name)
#define fi i.first
#define se i.second
#define YES(c) cout << ((c) ? "YES\n" : "NO\n"), 0
#define Yes(c) cout << ((c) ? "Yes\n" : "No\n"), 0
#define o(p) cout << p << endl, 0
#define deb(p) cerr << p << endl, 0
#define dd(n) cout << fixed << setprecision(n)
#define inf linf
int main() {
lin(n, m);
liv l(m), r(m);
lint L = 0, R = n;
rep(m) {
cin >> l[i] >> r[i];
--l[i];
L = max(L, l[i]);
R = min(R, r[i]);
}
cout << max(0ll, R - L) << endl;
}
// sub-EOF
| [
"call.add",
"call.arguments.change"
] | 851,013 | 851,014 | u675296835 | cpp |
p03037 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constexpr long long int infll = 1001001001001001LL;
constexpr int INF = 1000000007;
constexpr int inf = 1000000007;
const int mod = 1000000007;
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;
}
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 / gcd(a, b) * b; }
inline double nCr(const int n, int r) {
if (n == 0) {
return 0;
}
if (r == 0) {
return 1;
}
if (r == 1) {
return n;
}
if (n == r) {
return 1;
}
if (r > n / 2) {
r = n / 2;
}
double result = 1;
for (double i = 1; i <= r; i++) {
result *= (n - i + 1) / i;
}
return (result);
}
template <typename T> T seinomi(T a) {
if (a > 0) {
return a;
} else {
return 0;
}
}
template <typename T>
map<T, T> soinsuubunkai(T n) //้ฃๆณ้
ๅ[็ด ๅ ๆฐf.first][ๅๆฐf.second]
{
map<T, T> ret;
for (T i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
template <typename T> T ketasuu(T num) { return std::to_string(num).length(); }
int kaizyou(int k) {
int sum = 1;
for (int i = 1; i <= k; ++i) {
sum *= i;
}
return sum;
}
template <class ForwardIt, class T>
void iota(ForwardIt first, ForwardIt last, T value) {
while (first != last) {
*first++ = value;
++value;
}
}
// nใฎ้ไนใ่จ็ฎ
int factorial(int n) {
int answer = 1;
while (n > 1) {
answer *= n;
n--;
}
return answer;
}
int comb(int n, int r) {
return factorial(n) / (factorial(r) * factorial(n - r));
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
template <typename T> T amarinasi(T a, T b) {
if (a % b == 0) {
return a / b;
} else if (a % b > 0) {
return a / b + 1;
} else {
return a / b - 1;
}
}
//ๅฐๆฐ็นไปฅไธ10ๆกใใณใใฌใผใ๏ผmain้ขๆฐๅ
ใฎๆๅใซ่ฒผไปใ๏ผ
// std::cout << std::fixed << std::setprecision(10);
//----------------------------------------------------------------
int main() {
ll n, m;
cin >> n >> m;
ll a, b;
ll l = -infll, r = infll;
for (ll i = 0; i < m; i++) {
cin >> a >> b;
chmax(l, a);
chmin(r, b);
}
cout << seinomi(r - l) + 1 << endl;
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constexpr long long int infll = 1001001001001001LL;
constexpr int INF = 1000000007;
constexpr int inf = 1000000007;
const int mod = 1000000007;
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;
}
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 / gcd(a, b) * b; }
inline double nCr(const int n, int r) {
if (n == 0) {
return 0;
}
if (r == 0) {
return 1;
}
if (r == 1) {
return n;
}
if (n == r) {
return 1;
}
if (r > n / 2) {
r = n / 2;
}
double result = 1;
for (double i = 1; i <= r; i++) {
result *= (n - i + 1) / i;
}
return (result);
}
template <typename T> T seinomi(T a) {
if (a > 0) {
return a;
} else {
return 0;
}
}
template <typename T>
map<T, T> soinsuubunkai(T n) //้ฃๆณ้
ๅ[็ด ๅ ๆฐf.first][ๅๆฐf.second]
{
map<T, T> ret;
for (T i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
template <typename T> T ketasuu(T num) { return std::to_string(num).length(); }
int kaizyou(int k) {
int sum = 1;
for (int i = 1; i <= k; ++i) {
sum *= i;
}
return sum;
}
template <class ForwardIt, class T>
void iota(ForwardIt first, ForwardIt last, T value) {
while (first != last) {
*first++ = value;
++value;
}
}
// nใฎ้ไนใ่จ็ฎ
int factorial(int n) {
int answer = 1;
while (n > 1) {
answer *= n;
n--;
}
return answer;
}
int comb(int n, int r) {
return factorial(n) / (factorial(r) * factorial(n - r));
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
template <typename T> T amarinasi(T a, T b) {
if (a % b == 0) {
return a / b;
} else if (a % b > 0) {
return a / b + 1;
} else {
return a / b - 1;
}
}
//ๅฐๆฐ็นไปฅไธ10ๆกใใณใใฌใผใ๏ผmain้ขๆฐๅ
ใฎๆๅใซ่ฒผไปใ๏ผ
// std::cout << std::fixed << std::setprecision(10);
//----------------------------------------------------------------
int main() {
ll n, m;
cin >> n >> m;
ll a, b;
ll l = -infll, r = infll;
for (ll i = 0; i < m; i++) {
cin >> a >> b;
chmax(l, a);
chmin(r, b);
}
cout << seinomi((r - l) + 1) << endl;
return 0;
}
| [
"call.arguments.change"
] | 851,015 | 851,016 | u863537799 | cpp |
p03037 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int a, b;
a = 0;
b = n;
for (int i = 0; i < m; i++) {
int tmpl, tmpr;
cin >> tmpl >> tmpr;
a = max(a, tmpl);
b = min(b, tmpr);
}
cout << b - a + 1 << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int a, b;
a = 0;
b = n;
for (int i = 0; i < m; i++) {
int tmpl, tmpr;
cin >> tmpl >> tmpr;
a = max(a, tmpl);
b = min(b, tmpr);
}
cout << max(b - a + 1, 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 851,022 | 851,023 | u255172538 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M;
scanf("%d %d", &N, &M);
int x = 1, y = N;
for (int i = 0; i < M; i++) {
int a, b;
scanf("%d %d", &a, &b);
x = max(x, a);
y = min(y, b);
}
printf("%d", y - x + 1);
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M;
scanf("%d %d", &N, &M);
int x = 1, y = N;
for (int i = 0; i < M; i++) {
int a, b;
scanf("%d %d", &a, &b);
x = max(x, a);
y = min(y, b);
}
printf("%d", max(y - x + 1, 0));
} | [
"call.add",
"call.arguments.add"
] | 851,030 | 851,031 | u635358463 | cpp |
p03037 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &V) {
for (int i = 0; i < V.size(); i++) {
out << V[i];
if (i != V.size() - 1)
out << " ";
}
return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<vector<T>> &Mat) {
for (int i = 0; i < Mat.size(); i++) {
if (i != 0)
out << endl;
out << Mat[i];
}
return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &mp) {
out << "{ ";
for (auto it = mp.begin(); it != mp.end(); it++) {
out << it->first << ":" << it->second;
if (mp.size() - 1 != distance(mp.begin(), it))
out << ", ";
}
out << " }";
return out;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
/*
<url:https://atcoder.jp/contests/abc127/tasks/abc127_c>
ๅ้กๆ============================================================
=================================================================
่งฃ่ชฌ=============================================================
================================================================
*/
template <class Type> Type solve(Type res = Type()) {
ll N, M;
cin >> N >> M;
ll l = 1, r = N;
for (int i = 0; i < M; i++) {
ll L, R;
cin >> L >> R;
l = max(l, L);
r = min(r, R);
}
res = r - l + 1;
return res;
}
int main(void) {
cin.tie(0);
ios_base::sync_with_stdio(false);
// solve(0);
cout << fixed << setprecision(15) << solve<ll>() << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &V) {
for (int i = 0; i < V.size(); i++) {
out << V[i];
if (i != V.size() - 1)
out << " ";
}
return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<vector<T>> &Mat) {
for (int i = 0; i < Mat.size(); i++) {
if (i != 0)
out << endl;
out << Mat[i];
}
return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &mp) {
out << "{ ";
for (auto it = mp.begin(); it != mp.end(); it++) {
out << it->first << ":" << it->second;
if (mp.size() - 1 != distance(mp.begin(), it))
out << ", ";
}
out << " }";
return out;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
/*
<url:https://atcoder.jp/contests/abc127/tasks/abc127_c>
ๅ้กๆ============================================================
=================================================================
่งฃ่ชฌ=============================================================
ๆๅใซๅบ้[1,N]ใๆใฃใฆ
ๅ
ฅๅใซๅฟใใฆๅบ้ใ็ญใใฆใใ
ๆๅพใซๅพใใใๅบ้ใ[l,r]ใจใใใจ max(r-l+1,0)ใ็ญใ
================================================================
*/
template <class Type> Type solve(Type res = Type()) {
ll N, M;
cin >> N >> M;
ll l = 1, r = N;
for (int i = 0; i < M; i++) {
ll L, R;
cin >> L >> R;
l = max(l, L);
r = min(r, R);
}
res = max(r - l + 1, 0LL);
return res;
}
int main(void) {
cin.tie(0);
ios_base::sync_with_stdio(false);
// solve(0);
cout << fixed << setprecision(15) << solve<ll>() << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 851,038 | 851,039 | u728732647 | cpp |
p03037 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &V) {
for (int i = 0; i < V.size(); i++) {
out << V[i];
if (i != V.size() - 1)
out << " ";
}
return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<vector<T>> &Mat) {
for (int i = 0; i < Mat.size(); i++) {
if (i != 0)
out << endl;
out << Mat[i];
}
return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &mp) {
out << "{ ";
for (auto it = mp.begin(); it != mp.end(); it++) {
out << it->first << ":" << it->second;
if (mp.size() - 1 != distance(mp.begin(), it))
out << ", ";
}
out << " }";
return out;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
/*
<url:https://atcoder.jp/contests/abc127/tasks/abc127_c>
ๅ้กๆ============================================================
=================================================================
่งฃ่ชฌ=============================================================
================================================================
*/
template <class Type> Type solve(Type res = Type()) {
ll N, M;
cin >> N >> M;
ll l = 1, r = N;
for (int i = 0; i < M; i++) {
ll L, R;
cin >> L >> R;
l = max(l, L);
r = min(r, R);
}
res = r - l + 1;
return res;
}
int main(void) {
cin.tie(0);
ios_base::sync_with_stdio(false);
// solve(0);
cout << fixed << setprecision(15) << solve<ll>() << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &V) {
for (int i = 0; i < V.size(); i++) {
out << V[i];
if (i != V.size() - 1)
out << " ";
}
return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<vector<T>> &Mat) {
for (int i = 0; i < Mat.size(); i++) {
if (i != 0)
out << endl;
out << Mat[i];
}
return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &mp) {
out << "{ ";
for (auto it = mp.begin(); it != mp.end(); it++) {
out << it->first << ":" << it->second;
if (mp.size() - 1 != distance(mp.begin(), it))
out << ", ";
}
out << " }";
return out;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
/*
<url:https://atcoder.jp/contests/abc127/tasks/abc127_c>
ๅ้กๆ============================================================
=================================================================
่งฃ่ชฌ=============================================================
================================================================
*/
template <class Type> Type solve(Type res = Type()) {
ll N, M;
cin >> N >> M;
ll l = 1, r = N;
for (int i = 0; i < M; i++) {
ll L, R;
cin >> L >> R;
l = max(l, L);
r = min(r, R);
}
res = max(r - l + 1, 0LL);
return res;
}
int main(void) {
cin.tie(0);
ios_base::sync_with_stdio(false);
// solve(0);
cout << fixed << setprecision(15) << solve<ll>() << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 851,038 | 851,040 | u728732647 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
// https://yamakasa.net/atcoder-abc-127-c/
// http://drken1215.hatenablog.com/entry/2019/06/11/103300
int main(void) {
int n, m;
cin >> n >> m;
int *l, *r;
l = new int[m];
r = new int[m];
for (int i = 0; i < m; ++i) {
cin >> l[i] >> r[i];
}
int lb = l[0];
int rb = r[0];
for (int i = 1; i < m; ++i) {
if (l[i] > lb) {
lb = l[i];
}
if (r[i] < rb) {
rb = r[i];
}
if (lb >= rb) {
cout << 0 << endl;
return 0;
}
}
cout << rb - lb + 1 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
// https://yamakasa.net/atcoder-abc-127-c/
// http://drken1215.hatenablog.com/entry/2019/06/11/103300
int main(void) {
int n, m;
cin >> n >> m;
int *l, *r;
l = new int[m];
r = new int[m];
for (int i = 0; i < m; ++i) {
cin >> l[i] >> r[i];
}
int lb = l[0];
int rb = r[0];
for (int i = 1; i < m; ++i) {
if (l[i] > lb) {
lb = l[i];
}
if (r[i] < rb) {
rb = r[i];
}
if (lb > rb) {
cout << 0 << endl;
return 0;
}
}
cout << rb - lb + 1 << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,043 | 851,044 | u871841829 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int *l, *r;
l = new int[m];
r = new int[m];
for (int i = 0; i < m; ++i) {
cin >> l[i] >> r[i];
}
int lb = l[0];
int rb = r[0];
for (int i = 1; i < m; ++i) {
if (l[i] > lb) {
lb = l[i];
}
if (r[i] < rb) {
rb = r[i];
}
if (l >= r) {
cout << 0 << endl;
return 0;
}
}
cout << rb - lb + 1 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = unsigned long long;
using namespace std;
// https://yamakasa.net/atcoder-abc-127-c/
// http://drken1215.hatenablog.com/entry/2019/06/11/103300
int main(void) {
int n, m;
cin >> n >> m;
int *l, *r;
l = new int[m];
r = new int[m];
for (int i = 0; i < m; ++i) {
cin >> l[i] >> r[i];
}
int lb = l[0];
int rb = r[0];
for (int i = 1; i < m; ++i) {
if (l[i] > lb) {
lb = l[i];
}
if (r[i] < rb) {
rb = r[i];
}
if (lb > rb) {
cout << 0 << endl;
return 0;
}
}
cout << rb - lb + 1 << endl;
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 851,045 | 851,044 | u871841829 | 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) {
int l, r;
cin >> l >> r;
L[i] = l;
R[i] = r;
}
int Lmax = 0;
int Rmin = R[0];
for (int i = 0; i < M; ++i) {
Lmax = max(Lmax, L[i]);
Rmin = min(Rmin, R[i]);
}
int count = 0;
for (int i = 0; i < N; ++i) {
if (Lmax <= i && i <= Rmin) {
++count;
}
}
cout << count << 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) {
int l, r;
cin >> l >> r;
L[i] = l;
R[i] = r;
}
int Lmax = 0;
int Rmin = R[0];
for (int i = 0; i < M; ++i) {
Lmax = max(Lmax, L[i]);
Rmin = min(Rmin, R[i]);
}
int count = 0;
for (int i = 0; i <= N; ++i) {
if (Lmax <= i && i <= Rmin) {
++count;
}
}
cout << count << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 851,051 | 851,052 | u492047031 | cpp |
p03037 | #include <cstdio>
#include <iostream>
using namespace std;
int n, m, a, b, x, y = 1e9;
int main() {
cin >> n >> m;
while (m--) {
scanf("%d%d", &a, &b);
x = max(x, a);
y = min(y, b);
}
cout << y - x + 1;
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int n, m, a, b, x, y = 1e9;
int main() {
cin >> n >> m;
while (m--) {
scanf("%d%d", &a, &b);
x = max(x, a);
y = min(y, b);
}
cout << max(y - x + 1, 0);
return 0;
} | [
"call.add",
"call.arguments.add"
] | 851,085 | 851,086 | u093170535 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
long int N, M, L, R;
cin >> N >> M;
long int small = 1, large = N, ans = 0;
for (int i = 0; i < M; i++) {
cin >> L >> R;
if (small < L) {
small = L;
}
if (M < large) {
large = M;
}
if (small <= large) {
ans = large - small + 1;
} else {
ans = 0;
break;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long int N, M, L, R;
cin >> N >> M;
long int small = 1, large = N, ans = 0;
for (int i = 0; i < M; i++) {
cin >> L >> R;
if (small < L) {
small = L;
}
if (R < large) {
large = R;
}
if (small <= large) {
ans = large - small + 1;
} else {
ans = 0;
break;
}
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 851,091 | 851,092 | u200849592 | cpp |
p03037 |
#include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int lf, rf;
cin >> lf >> rf;
for (int i = 0; i < m - 1; i++) {
int l, r;
cin >> l >> r;
if (lf < l) {
lf = l;
}
if (rf > r) {
rf = r;
}
}
if (rf - lf > 0) {
if (rf <= n) {
cout << rf - lf + 1 << endl;
} else {
cout << n - lf + 1 << endl;
}
} else {
cout << "0" << endl;
}
} |
#include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int lf, rf;
cin >> lf >> rf;
for (int i = 0; i < m - 1; i++) {
int l, r;
cin >> l >> r;
if (lf < l) {
lf = l;
}
if (rf > r) {
rf = r;
}
}
if (rf - lf >= 0) {
if (rf <= n) {
cout << rf - lf + 1 << endl;
} else {
cout << n - lf + 1 << endl;
}
} else {
cout << "0" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,093 | 851,094 | u286623856 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
const int INF = 0x3f3f3f3f;
const int MAXN = 512345;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
int l, r;
cin >> l >> r;
--m;
while (m--) {
int L, R;
cin >> L >> R;
l = max(L, l);
r = min(R, r);
}
cout << r - l + 1 << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define LL long long
const int INF = 0x3f3f3f3f;
const int MAXN = 512345;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
int l, r;
cin >> l >> r;
--m;
while (m--) {
int L, R;
cin >> L >> R;
l = max(L, l);
r = min(R, r);
}
cout << max(0, r - l + 1) << '\n';
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 851,097 | 851,098 | u578509549 | cpp |
p03037 | #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
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];
sort(L.begin(), L.end());
sort(R.begin(), R.end());
cout << R[0] - L[m - 1] + 1;
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
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];
sort(L.begin(), L.end());
sort(R.begin(), R.end());
cout << max(R[0] - L[m - 1] + 1, 0);
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 851,103 | 851,104 | u433162241 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> lr(n + 1, 0);
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
lr[l]++, lr[r + 1]--;
}
for (int i = 0; i < n; i++) {
lr[i + 1] += lr[i];
}
cout << count(lr.begin(), lr.end(), m) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int64_t> lr(n + 1, 0);
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
lr[l]++, lr[r + 1]--;
}
for (int i = 0; i < n; i++) {
lr[i + 1] += lr[i];
}
cout << count(lr.begin(), lr.end(), m) << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 851,105 | 851,106 | u820225607 | cpp |
p03037 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, ans = 0;
vector<int> l, r;
cin >> n >> m;
int upmin = n, lowmax = 0;
l.resize(m + 1);
r.resize(m + 1);
for (int i = 1; i <= m; ++i) {
cin >> l[i] >> r[i];
if (l[i] > lowmax)
lowmax = l[i];
if (r[i] < upmin)
upmin = r[i];
}
cout << upmin - lowmax + 1 << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, ans = 0;
vector<int> l, r;
cin >> n >> m;
int upmin = n, lowmax = 0;
l.resize(m + 1);
r.resize(m + 1);
for (int i = 1; i <= m; ++i) {
cin >> l[i] >> r[i];
if (l[i] > lowmax)
lowmax = l[i];
if (r[i] < upmin)
upmin = r[i];
}
cout << max(upmin - lowmax + 1, 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 851,111 | 851,112 | u911828387 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define mp make_pair
#define pb push_back
#define F first
#define S second
const int N = 1000005;
#define M 1000000007
#define double long double
#define BINF 1000000000000001
#define init(arr, val) memset(arr, val, sizeof(arr))
#define MAXN 15000001
const int LG = 22;
#undef int
int main() {
#define int long long int
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
int l = 0, r = BINF;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
l = max(l, x);
r = min(r, y);
}
int ans = r - l + 1;
if (ans < 0)
r = 0;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define mp make_pair
#define pb push_back
#define F first
#define S second
const int N = 1000005;
#define M 1000000007
#define double long double
#define BINF 1000000000000001
#define init(arr, val) memset(arr, val, sizeof(arr))
#define MAXN 15000001
const int LG = 22;
#undef int
int main() {
#define int long long int
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
int l = 0, r = BINF;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
l = max(l, x);
r = min(r, y);
}
int ans = r - l + 1;
if (ans < 0)
ans = 0;
cout << ans;
return 0;
} | [
"assignment.variable.change",
"identifier.change"
] | 851,113 | 851,114 | u246471788 | cpp |
p03037 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1e9 + 7
using namespace std;
typedef long long ll;
int main() {
int N, M, ma = 0, mi = 10000000;
cin >> N >> M;
vector<int> l(M), r(M);
rep(i, M) {
cin >> l[i] >> r[i];
ma = max(ma, l[i]);
mi = min(mi, r[i]);
}
if (ma <= mi) {
cout << ma - mi + 1 << endl;
} else {
cout << "0";
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1e9 + 7
using namespace std;
typedef long long ll;
int main() {
int N, M, ma = 0, mi = 10000000;
cin >> N >> M;
vector<int> l(M), r(M);
rep(i, M) {
cin >> l[i] >> r[i];
ma = max(ma, l[i]);
mi = min(mi, r[i]);
}
if (ma <= mi) {
cout << mi - ma + 1 << endl;
} else {
cout << "0";
}
} | [
"expression.operation.binary.remove"
] | 851,119 | 851,120 | u710135612 | cpp |
p03037 | //#include "pch.h"
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int card, gate, min[100010], max[100010];
cin >> card >> gate;
for (int i = 0; i < gate; i++) {
cin >> min[i] >> max[i];
}
sort(min, min + gate);
sort(max, max + gate);
if (max[gate - 1] - min[0] >= 0) {
cout << max[0] - min[gate - 1] + 1;
} else
cout << 0;
} | //#include "pch.h"
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int card, gate, min[100010], max[100010];
cin >> card >> gate;
for (int i = 0; i < gate; i++) {
cin >> min[i] >> max[i];
}
sort(min, min + gate);
sort(max, max + gate);
if (max[0] - min[gate - 1] >= 0) {
cout << max[0] - min[gate - 1] + 1;
} else
cout << 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove"
] | 851,121 | 851,122 | u919992484 | cpp |
p03037 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> vec(n + 10, 0);
for (int i = 0; i < n; ++i) {
int l, r;
cin >> l >> r;
vec[l] += 1;
vec[r + 1] -= 1;
}
int ans = 0;
int cnt = 0;
for (auto &&e : vec) {
cnt += e;
if (cnt >= m)
ans++;
if (ans & cnt < m)
break;
}
cout << ans << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> vec(n + 10, 0);
for (int i = 0; i < m; ++i) {
int l, r;
cin >> l >> r;
vec[l] += 1;
vec[r + 1] -= 1;
}
int ans = 0;
int cnt = 0;
for (auto &&e : vec) {
cnt += e;
if (cnt >= m)
ans++;
if (ans & cnt < m)
break;
}
cout << ans << endl;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 851,131 | 851,132 | u691380397 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (n); (i)++)
const int maxn = 100010;
int n, m;
int l[maxn], r[maxn];
typedef long long ll;
int read() {
char ch = getchar();
int f = 1, x = 0;
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int lowbit(int x) {
return x & (-x);
} /*
3 9
4 7
5 8
*/
int maxn1, maxn2 = 10000000;
int main() {
n = read(), m = read();
for (register int i(1); i <= m; ++i) {
l[i] = read(), r[i] = read();
maxn1 = max(maxn1, l[i]);
maxn2 = min(maxn2, r[i]);
}
cout << maxn2 - maxn1 + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (n); (i)++)
const int maxn = 100010;
int n, m;
int l[maxn], r[maxn];
typedef long long ll;
int read() {
char ch = getchar();
int f = 1, x = 0;
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int lowbit(int x) {
return x & (-x);
} /*
3 9
4 7
5 8
*/
int maxn1, maxn2 = 10000000;
int main() {
n = read(), m = read();
for (register int i(1); i <= m; ++i) {
l[i] = read(), r[i] = read();
maxn1 = max(maxn1, l[i]);
maxn2 = min(maxn2, r[i]);
}
cout << max(maxn2 - maxn1 + 1, 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 851,141 | 851,142 | u828050896 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define MAX 1000000007
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
int l, r;
cin >> l >> r;
rep(i, M - 1) {
int tl, tr;
cin >> tl >> tr;
if (tl > l)
l = tl;
if (tr < r)
r = tr;
if (tl > tr) {
cout << 0 << endl;
return 0;
}
}
cout << r - l + 1 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define MAX 1000000007
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
int l, r;
cin >> l >> r;
rep(i, M - 1) {
int tl, tr;
cin >> tl >> tr;
if (tl > l)
l = tl;
if (tr < r)
r = tr;
if (l > r) {
cout << 0 << endl;
return 0;
}
}
cout << r - l + 1 << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 851,147 | 851,148 | u582848517 | cpp |
p03037 | #include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int B, E;
B = 0;
E = INF;
int tb, te;
REP(i, M) {
cin >> tb >> te;
if (tb > B) {
B = tb;
}
if (te < E) {
E = te;
}
}
if (E - B > 0) {
cout << E - B << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int B, E;
B = 0;
E = INF;
int tb, te;
REP(i, M) {
cin >> tb >> te;
if (tb > B) {
B = tb;
}
if (te < E) {
E = te;
}
}
if (E - B >= 0) {
cout << E - B + 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,156 | 851,157 | u192273224 | cpp |
p03037 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = __int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
bool comp(const pair<int, ll> &p1, const pair<int, ll> &p2) {
return p1.second > p2.second;
}
void solve() {
int n, m;
int l[100005], r[100005];
int lmax = 0, rmin = INF;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
lmax = max(lmax, l[i]);
rmin = min(rmin, r[i]);
}
cout << (rmin - lmax + 1) << endl;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = __int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
bool comp(const pair<int, ll> &p1, const pair<int, ll> &p2) {
return p1.second > p2.second;
}
void solve() {
int n, m;
int l[100005], r[100005];
int lmax = 0, rmin = INF;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
lmax = max(lmax, l[i]);
rmin = min(rmin, r[i]);
}
cout << max((rmin - lmax + 1), 0) << endl;
}
int main() {
solve();
return 0;
} | [
"call.add",
"call.arguments.add"
] | 851,162 | 851,163 | u679071005 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <vector>
int main(int argc, char **argv) {
int n, m, l, r, ans;
std::cin >> n >> m;
std::vector<int> candidate;
std::cin >> l >> r;
for (int i = 1; i < m; i++) {
int tmp_l, tmp_r;
std::cin >> tmp_l >> tmp_r;
if (l < tmp_l) {
l = tmp_l;
}
if (r > tmp_r) {
r = tmp_r;
}
}
if (l >= r) {
ans = 0;
} else {
ans = r - l + 1;
}
std::cout << ans << std::endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
int main(int argc, char **argv) {
int n, m, l, r, ans;
std::cin >> n >> m;
std::vector<int> candidate;
std::cin >> l >> r;
for (int i = 1; i < m; i++) {
int tmp_l, tmp_r;
std::cin >> tmp_l >> tmp_r;
if (l < tmp_l) {
l = tmp_l;
}
if (r > tmp_r) {
r = tmp_r;
}
}
if (l > r) {
ans = 0;
} else {
ans = r - l + 1;
}
std::cout << ans << std::endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,166 | 851,167 | u096984483 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct card {
int size;
int noFrom;
int noTo;
};
vector<card> cardList;
bool cmp(const card &a, const card &b) { return a.size < b.size; }
int main() {
// N - cardๆฐใM - gateๆฐ
int N, M;
cin >> N >> M;
cardList.resize(M);
card c;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L;
cin >> R;
c.size = R - L;
c.noFrom = L;
c.noTo = R;
cardList[i] = c;
}
sort(cardList.begin(), cardList.end(), cmp);
int noFrom, noTo;
noFrom = cardList[0].noFrom;
noTo = cardList[0].noTo;
for (int i = 1; i < M; i++) {
if (cardList[i].noFrom > noFrom) {
noFrom = cardList[i].noFrom;
}
if (cardList[i].noTo < noTo) {
noTo = cardList[i].noTo;
}
}
if (noTo > noFrom) {
cout << 0 << endl;
}
cout << noTo - noFrom + 1 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct card {
int size;
int noFrom;
int noTo;
};
vector<card> cardList;
bool cmp(const card &a, const card &b) { return a.size < b.size; }
int main() {
// N - cardๆฐใM - gateๆฐ
int N, M;
cin >> N >> M;
cardList.resize(M);
card c;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L;
cin >> R;
c.size = R - L;
c.noFrom = L;
c.noTo = R;
cardList[i] = c;
}
sort(cardList.begin(), cardList.end(), cmp);
int noFrom, noTo;
noFrom = cardList[0].noFrom;
noTo = cardList[0].noTo;
for (int i = 1; i < M; i++) {
if (cardList[i].noFrom > noFrom) {
noFrom = cardList[i].noFrom;
}
if (cardList[i].noTo < noTo) {
noTo = cardList[i].noTo;
}
}
if (noTo < noFrom) {
cout << 0 << endl;
return 0;
}
cout << noTo - noFrom + 1 << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 851,170 | 851,169 | u134857688 | cpp |
p03037 | // https://atcoder.jp/contests/
#include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
int main() {
int N, M, l, r, maxL = INF, minR = 0;
cin >> N >> M;
REP(i, M) {
cin >> l >> r;
maxL = max(maxL, l);
minR = min(minR, r);
}
if (maxL < minR) {
cout << minR - maxL << '\n';
} else {
cout << 0 << '\n';
}
return 0;
}
| // https://atcoder.jp/contests/
#include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
int main() {
int N, M, l, r, maxL = 0, minR = INF;
cin >> N >> M;
REP(i, M) {
cin >> l >> r;
maxL = max(maxL, l);
minR = min(minR, r);
}
if (maxL <= minR) {
cout << minR - maxL + 1 << '\n';
} else {
cout << 0 << '\n';
}
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,175 | 851,176 | u414220724 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int n, p, k;
int maxv = 0, minv;
cin >> minv >> n;
++minv;
for (int i = 0; i < n; ++i) {
cin >> p >> k;
maxv = max(maxv, p);
minv = min(minv, k);
}
cout << minv - maxv + 1 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, p, k;
int maxv = 0, minv;
cin >> minv >> n;
++minv;
for (int i = 0; i < n; ++i) {
cin >> p >> k;
maxv = max(maxv, p);
minv = min(minv, k);
}
cout << max(0, minv - maxv + 1) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 851,179 | 851,180 | u146240825 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
int main() {
int n, m;
cin >> n >> m;
int ansl = 1, ansr = n;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
ansl = max(ansl, l);
ansr = min(ansr, r);
}
cout << ansr - ansl + 1 << endl;
;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
int main() {
int n, m;
cin >> n >> m;
int ansl = 1, ansr = n;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
ansl = max(ansl, l);
ansr = min(ansr, r);
}
cout << max(0, ansr - ansl + 1) << endl;
;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 851,181 | 851,182 | u773916255 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M;
cin >> N >> M;
ll min_id = 0;
ll max_id = 10000000;
for (int i = 0; i < M; i++) {
ll L, R;
cin >> L >> R;
if (min_id < L)
min_id = L;
if (R < max_id)
max_id = R;
}
if (max_id == min_id) {
cout << 0 << endl;
} else
cout << max_id - min_id + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M;
cin >> N >> M;
ll min_id = 0;
ll max_id = 10000000;
for (int i = 0; i < M; i++) {
ll L, R;
cin >> L >> R;
if (min_id < L)
min_id = L;
if (R < max_id)
max_id = R;
}
if (max_id < min_id) {
cout << 0 << endl;
} else
cout << max_id - min_id + 1 << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,183 | 851,184 | u185821641 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
ll mod = 1000000007;
void solve() {
int n, m;
cin >> n >> m;
int mi, ma;
mi = 0;
ma = n;
rep(i, m) {
int l, r;
cin >> l >> r;
mi = max(mi, l);
ma = min(ma, r);
}
cout << ma - mi + 1 << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
ll mod = 1000000007;
void solve() {
int n, m;
cin >> n >> m;
int mi, ma;
mi = 0;
ma = n;
rep(i, m) {
int l, r;
cin >> l >> r;
mi = max(mi, l);
ma = min(ma, r);
}
cout << max(0, ma - mi + 1) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | [
"call.add",
"call.arguments.change"
] | 851,187 | 851,188 | u272496669 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, g_ma = 0, g_mi = 1000000;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int r, l;
scanf("%d %d", &l, &r);
g_ma = max(g_ma, l);
g_mi = min(g_mi, r);
}
if (g_mi == g_ma) {
cout << 0 << endl;
} else {
g_mi -= g_ma;
cout << g_mi + 1 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, g_ma = 0, g_mi = 1000000;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int r, l;
scanf("%d %d", &l, &r);
g_ma = max(g_ma, l);
g_mi = min(g_mi, r);
}
if (g_mi < g_ma) {
cout << 0 << endl;
} else {
g_mi -= g_ma;
cout << g_mi + 1 << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,191 | 851,192 | u106635407 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i, n) for (int i = (int)(n); i > 0; --i)
#define all(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
#define rall(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(rbegin(whole), rend(whole), ##__VA_ARGS__); \
})(x)
#define sz(a) (int)(a).size()
#define mins(a, ...) a = min({a, ##__VA_ARGS__})
#define maxs(a, ...) a = max({a, ##__VA_ARGS__})
#define plusMod(a, b) a = (a % mod + b % mod) % mod
using ll = long long;
using ld = long double;
constexpr ll inf = static_cast<ll>(1e17);
constexpr int iinf = static_cast<int>(1e9);
constexpr double dinf = 1e10;
constexpr ld ldinf = 1e17;
ll mod = static_cast<ll>(1e9 + 7);
std::ostream &endn(std::ostream &os) { return os.put(os.widen('\n')); }
template <typename A, size_t N, typename T>
void fillArray(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
int n, m;
void solve() {
cin >> n >> m;
int l = 1, r = n;
rep(i, m) {
int lm, rm;
cin >> lm >> rm;
maxs(l, lm);
mins(r, rm);
}
cout << r - l + 1 << endn;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
cout << flush;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i, n) for (int i = (int)(n); i > 0; --i)
#define all(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
#define rall(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(rbegin(whole), rend(whole), ##__VA_ARGS__); \
})(x)
#define sz(a) (int)(a).size()
#define mins(a, ...) a = min({a, ##__VA_ARGS__})
#define maxs(a, ...) a = max({a, ##__VA_ARGS__})
#define plusMod(a, b) a = (a % mod + b % mod) % mod
using ll = long long;
using ld = long double;
constexpr ll inf = static_cast<ll>(1e17);
constexpr int iinf = static_cast<int>(1e9);
constexpr double dinf = 1e10;
constexpr ld ldinf = 1e17;
ll mod = static_cast<ll>(1e9 + 7);
std::ostream &endn(std::ostream &os) { return os.put(os.widen('\n')); }
template <typename A, size_t N, typename T>
void fillArray(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
int n, m;
void solve() {
cin >> n >> m;
int l = 1, r = n;
rep(i, m) {
int lm, rm;
cin >> lm >> rm;
maxs(l, lm);
mins(r, rm);
}
cout << max(0, r - l + 1) << endn;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
cout << flush;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 851,193 | 851,194 | u640248738 | cpp |
p03037 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int L = 0, R = n + 1;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
L = max(l, L);
R = min(r, R);
}
cout << R - L + 1 << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int L = 0, R = n + 1;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
L = max(l, L);
R = min(r, R);
}
cout << max(R - L + 1, 0) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 851,197 | 851,198 | u126361752 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intt int64_t
#define all(vec) vec.begin(), vec.end()
#define INF 2000000000
int main() {
int n, m;
scanf("%d %d", &n, &m);
pair<int, int> id = make_pair(1, INF);
rep(i, m) {
int l, r;
scanf("%d %d", &l, &r);
id.first = max(id.first, l);
id.second = min(id.second, r);
}
printf("%d\n", id.second - id.first + 1);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intt int64_t
#define all(vec) vec.begin(), vec.end()
#define INF 2000000000
int main() {
int n, m;
scanf("%d %d", &n, &m);
pair<int, int> id = make_pair(1, INF);
rep(i, m) {
int l, r;
scanf("%d %d", &l, &r);
id.first = max(id.first, l);
id.second = min(id.second, r);
}
printf("%d\n", max(id.second - id.first + 1, 0));
} | [
"call.add",
"call.arguments.add"
] | 851,209 | 851,210 | u716314620 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[M];
int R[M];
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
int a, b;
a = L[0];
b = R[0];
for (int i = 1; i < M; i++) {
if (a < L[i]) {
a = L[i];
}
if (b > R[i]) {
b = R[i];
}
}
if (b - a + 1 < 0)
a = b - 1;
/*
int card[N][M];
for(int i=0;i<N;i++){
for(int j=0;j<M;j++){
card[i][j]=0;
}
}
for(int i=0;i<M;i++){
for(int j=i;j<M;j++){
card[L[j]][i]=1;
}
for(int j=0;j<=i;j++){
card[R[j]][i]=1;
}
}
int ans=0;
for(int i=0;i<N;i++){
int chk=0;
for(int j=0;j<M;j++){
if (card[i][j]!=1){
chk=1;
}
}
if (chk!=1) ans++;
}
*/
cout << b - a + 1;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[M];
int R[M];
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
int a, b;
a = L[0];
b = R[0];
for (int i = 1; i < M; i++) {
if (a < L[i]) {
a = L[i];
}
if (b > R[i]) {
b = R[i];
}
}
if (b - a + 1 < 0)
a = b + 1;
cout << b - a + 1;
/*
int card[N][M];
for(int i=0;i<N;i++){
for(int j=0;j<M;j++){
card[i][j]=0;
}
}
for(int i=0;i<M;i++){
for(int j=i;j<M;j++){
card[L[j]][i]=1;
}
for(int j=0;j<=i;j++){
card[R[j]][i]=1;
}
}
int ans=0;
for(int i=0;i<N;i++){
int chk=0;
for(int j=0;j<M;j++){
if (card[i][j]!=1){
chk=1;
}
}
if (chk!=1) ans++;
}
*/
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 851,214 | 851,215 | u832158848 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int minimum = 0;
int maximum = N - 1;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
L--;
R--;
minimum = max(minimum, L);
maximum = min(maximum, R);
}
cout << maximum - minimum + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int minimum = 0;
int maximum = N - 1;
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
L--;
R--;
minimum = max(minimum, L);
maximum = min(maximum, R);
}
cout << max(maximum - minimum + 1, 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 851,220 | 851,221 | u426572476 | cpp |
p03037 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std::pair<int, int>
#define pli std::pair<ll, int>
#define pil std::pair<int, ll>
#define psi std::pair<string, int>
#define pll std::pair<ll, ll>
#define pci std::pair<char, int>
#define sll(x) scanf("%lld", &x)
#define prll(x) printf("%lld ", x)
#define pri(x) printf("%d ", x)
#define si(x) scanf("%d", &x)
#define pb push_back
#define vll std::vector<ll>
#define vpi std::vector<std::pair<int, int>>
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vvpil std::vector<std::vector<std::pair<int, ll>>>
#define vlpii std::vector<std::list<pii>>
#define vlpil std::vector<std::list<pil>>
#define li std::list<int>
#define lpil std::list<pil>
#define Endl printf("\n")
#define vli vector<list<int>>
#define vvll vector<vector<ll>>
#define mp make_pair
#define x first
#define y second
#define ull uint64_t
#define ma 100000000
#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
const ll INF = 10000000000000;
const ll mod = 1e9 + 7;
using namespace std;
void add(ll &a, ll b) {
a += b;
if (a >= mod)
a -= mod;
}
ll mul(ll a, ll b) { return (a * b) % mod; }
ull Pow(ull a, ull b) {
if (b == 0)
return 1;
ull c = Pow(a, b / 2);
if (b % 2)
return (a * ((c * c) % mod)) % mod;
return (c * c) % mod;
}
ll countDivisibles(ll A, ll B, ll M) {
// Add 1 explicitly as A is divisible by M
if (A % M == 0)
return (B / M) - (A / M) + 1;
// A is not divisible by M
return (B / M) - (A / M);
}
int main() {
IOS;
cout.precision(30);
int n, m;
cin >> n >> m;
int l = 1, r = n;
int l1, r1;
for (int i = 0; i < m; i++) {
cin >> l1 >> r1;
l = max(l, l1);
r = min(r1, r);
}
cout << r - l + 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std::pair<int, int>
#define pli std::pair<ll, int>
#define pil std::pair<int, ll>
#define psi std::pair<string, int>
#define pll std::pair<ll, ll>
#define pci std::pair<char, int>
#define sll(x) scanf("%lld", &x)
#define prll(x) printf("%lld ", x)
#define pri(x) printf("%d ", x)
#define si(x) scanf("%d", &x)
#define pb push_back
#define vll std::vector<ll>
#define vpi std::vector<std::pair<int, int>>
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vvpil std::vector<std::vector<std::pair<int, ll>>>
#define vlpii std::vector<std::list<pii>>
#define vlpil std::vector<std::list<pil>>
#define li std::list<int>
#define lpil std::list<pil>
#define Endl printf("\n")
#define vli vector<list<int>>
#define vvll vector<vector<ll>>
#define mp make_pair
#define x first
#define y second
#define ull uint64_t
#define ma 100000000
#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
const ll INF = 10000000000000;
const ll mod = 1e9 + 7;
using namespace std;
void add(ll &a, ll b) {
a += b;
if (a >= mod)
a -= mod;
}
ll mul(ll a, ll b) { return (a * b) % mod; }
ull Pow(ull a, ull b) {
if (b == 0)
return 1;
ull c = Pow(a, b / 2);
if (b % 2)
return (a * ((c * c) % mod)) % mod;
return (c * c) % mod;
}
ll countDivisibles(ll A, ll B, ll M) {
// Add 1 explicitly as A is divisible by M
if (A % M == 0)
return (B / M) - (A / M) + 1;
// A is not divisible by M
return (B / M) - (A / M);
}
int main() {
IOS;
cout.precision(30);
int n, m;
cin >> n >> m;
int l = 1, r = n;
int l1, r1;
for (int i = 0; i < m; i++) {
cin >> l1 >> r1;
l = max(l, l1);
r = min(r1, r);
}
cout << max(0, r - l + 1) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 851,224 | 851,225 | u752814744 | cpp |
p03037 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int minNumber = l[0];
int maxNumber = r[0];
for (int i = 1; i < m; i++) {
minNumber = max(l[i], minNumber);
maxNumber = min(r[i], maxNumber);
}
cout << maxNumber - minNumber + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int minNumber = l[0];
int maxNumber = r[0];
for (int i = 1; i < m; i++) {
minNumber = max(l[i], minNumber);
maxNumber = min(r[i], maxNumber);
}
cout << max(maxNumber - minNumber + 1, 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 851,231 | 851,232 | u647653350 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, maxi, mini;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; i++)
cin >> l[i] >> r[i];
maxi = n;
mini = 1;
for (int i = 0; i < m; i++) {
if (l[i] > mini)
mini = l[i];
if (r[i] < maxi)
maxi = r[i];
}
if (maxi > mini)
cout << maxi - mini + 1 << endl;
else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, maxi, mini;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; i++)
cin >> l[i] >> r[i];
maxi = n;
mini = 1;
for (int i = 0; i < m; i++) {
if (l[i] > mini)
mini = l[i];
if (r[i] < maxi)
maxi = r[i];
}
if (maxi >= mini)
cout << maxi - mini + 1 << endl;
else
cout << 0 << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,243 | 851,244 | u397130503 | cpp |
p03037 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define IFOR(i, a, b) for (int(i) = (a); (i) <= (b); (i)++)
#define RFOR(i, a, b) for (int(i) = (a); (i) >= (b); (i)--)
#define REP(i, n) FOR((i), 0, (n))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> void print_container(T &container, string delim = " ") {
bool first = true;
for (auto &t : container) {
if (!first) {
cout << delim;
}
first = false;
cout << t;
}
cout << endl;
}
int main() {
int n, m;
cin >> n >> m;
int left = -1, right = n + 1;
REP(i, m) {
int l, r;
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 <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define IFOR(i, a, b) for (int(i) = (a); (i) <= (b); (i)++)
#define RFOR(i, a, b) for (int(i) = (a); (i) >= (b); (i)--)
#define REP(i, n) FOR((i), 0, (n))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> void print_container(T &container, string delim = " ") {
bool first = true;
for (auto &t : container) {
if (!first) {
cout << delim;
}
first = false;
cout << t;
}
cout << endl;
}
int main() {
int n, m;
cin >> n >> m;
int left = -1, right = n + 1;
REP(i, m) {
int l, r;
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"
] | 851,247 | 851,248 | u120810144 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
vi l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
int L, R;
L = *max_element(l.begin(), l.end());
R = *min_element(r.begin(), r.end());
int ans = min(R, n) - max(L, 1) + 1;
if (L < R)
cout << ans << endl;
else
cout << 0 << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
vi l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
int L, R;
L = *max_element(l.begin(), l.end());
R = *min_element(r.begin(), r.end());
int ans = min(R, n) - max(L, 1) + 1;
if (L <= R)
cout << ans << endl;
else
cout << 0 << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,256 | 851,257 | u654115433 | cpp |
p03037 | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define pb push_back
#define MAX 1000000007
using namespace std;
int main() {
speed_up ll n, m;
cin >> n >> m;
ll lo, hi;
cin >> lo >> hi;
for (ll i = 1; i < m; i++) {
ll x, y;
cin >> x >> y;
if (x > lo)
lo = x;
if (y < hi)
hi = y;
}
if (hi - lo + 1)
cout << hi - lo + 1;
else
cout << 0;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define pb push_back
#define MAX 1000000007
using namespace std;
int main() {
speed_up ll n, m;
cin >> n >> m;
ll lo, hi;
cin >> lo >> hi;
for (ll i = 1; i < m; i++) {
ll x, y;
cin >> x >> y;
if (x > lo)
lo = x;
if (y < hi)
hi = y;
}
if ((hi - lo + 1) > 0)
cout << hi - lo + 1;
else
cout << 0;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 851,260 | 851,261 | u223028888 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n, m;
cin >> n >> m;
int l, r;
int i;
int a = 0, b = 1000000;
for (i = 0; i < m; i++) {
cin >> l >> r;
if (a < l) {
a = l;
}
if (r < b) {
b = r;
}
}
if (b <= a) {
cout << b - a + 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n, m;
cin >> n >> m;
int l, r;
int i;
int a = 0, b = 1000000;
for (i = 0; i < m; i++) {
cin >> l >> r;
if (a < l) {
a = l;
}
if (r < b) {
b = r;
}
}
if (a <= b) {
cout << b - a + 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 851,269 | 851,270 | u733391043 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l, r;
int i;
int a = 0, b = 1000000;
for (i = 0; i < m; i++) {
cin >> l >> r;
if (a < l) {
a = l;
}
if (r < b) {
b = r;
}
}
if (l <= r) {
cout << b - a + 1 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n, m;
cin >> n >> m;
int l, r;
int i;
int a = 0, b = 1000000;
for (i = 0; i < m; i++) {
cin >> l >> r;
if (a < l) {
a = l;
}
if (r < b) {
b = r;
}
}
if (a <= b) {
cout << b - a + 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"variable_declaration.type.widen.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 851,271 | 851,270 | u733391043 | cpp |
p03037 | #include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end() // ๆ้ ใฝใผใ ไพ๏ผsort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend() // ้้ ใฝใผใ ไพ:sort(DESC(vec));
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
#define In(vec) rep(i, n) cin >> vec[i];
#define ANS(s) cout << s << endl
#define inc(a, b) cin >> a >> b;
const int mod = 1000000007;
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 60;
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<pair<int, int>> vii;
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;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
int round_int(int a, int b) { return (a + (b - 1)) / b; }
// 4,8ๆนๅใซๆข็ดขใใ้ใซ็จใใ้
ๅ
// int dx[4] = { 0, 0, 1, -1 };
// int dy[4] = { 1, -1, 0, 0 };
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr auto MAX = 100010;
// โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
int main() {
int n, m;
cin >> n >> m;
vi l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
int LEFT = l[0], RIGHT = r[0];
for (int i = 1; i < m; ++i) {
LEFT = max(LEFT, l[i]);
RIGHT = min(RIGHT, r[i]);
}
cout << RIGHT - LEFT + 1 << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end() // ๆ้ ใฝใผใ ไพ๏ผsort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend() // ้้ ใฝใผใ ไพ:sort(DESC(vec));
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
#define In(vec) rep(i, n) cin >> vec[i];
#define ANS(s) cout << s << endl
#define inc(a, b) cin >> a >> b;
const int mod = 1000000007;
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 60;
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<pair<int, int>> vii;
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;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
int round_int(int a, int b) { return (a + (b - 1)) / b; }
// 4,8ๆนๅใซๆข็ดขใใ้ใซ็จใใ้
ๅ
// int dx[4] = { 0, 0, 1, -1 };
// int dy[4] = { 1, -1, 0, 0 };
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr auto MAX = 100010;
// โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
int main() {
int n, m;
cin >> n >> m;
vi l(m), r(m);
rep(i, m) cin >> l[i] >> r[i];
int LEFT = l[0], RIGHT = r[0];
for (int i = 1; i < m; ++i) {
LEFT = max(LEFT, l[i]);
RIGHT = min(RIGHT, r[i]);
}
cout << max(0, RIGHT - LEFT + 1) << endl;
} | [
"call.add",
"call.arguments.change"
] | 851,274 | 851,275 | u666683460 | cpp |
p03037 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l = 0;
int r = n;
for (int i = 0; i < m; i++) {
int ll, rr;
cin >> ll >> rr;
ll--;
l = max(l, ll);
r = min(r, rr);
}
cout << r - l << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l = 0;
int r = n;
for (int i = 0; i < m; i++) {
int ll, rr;
cin >> ll >> rr;
ll--;
l = max(l, ll);
r = min(r, rr);
}
cout << max(0, r - l) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 851,280 | 851,281 | u990764614 | cpp |
p03037 | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l = 0;
int r = n;
int x, y;
for (int i = 0; i < m; i++) {
cin >> x >> y;
l = max(x, l);
r = min(r, y);
}
cout << max(0, r - l) << endl;
}
| #include <algorithm> // sort
#include <bits/stdc++.h>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l = 0;
int r = n;
int x, y;
for (int i = 0; i < m; i++) {
cin >> x >> y;
l = max(x, l);
r = min(r, y);
}
cout << max(0, r - l + 1) << endl;
}
| [
"expression.operation.binary.add"
] | 851,282 | 851,283 | u704064492 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long mod = 1e9 + 7;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int l, r, l_m = 0, r_m = n + 1;
rep(i, m) {
cin >> l >> r;
l_m = max(l_m, l);
r_m = min(r_m, r);
}
cout << r_m - l_m + 1 << endl;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long mod = 1e9 + 7;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int l, r, l_m = 0, r_m = n + 1;
rep(i, m) {
cin >> l >> r;
l_m = max(l_m, l);
r_m = min(r_m, r);
}
cout << max(r_m - l_m + 1, 0) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 851,288 | 851,289 | u969617556 | cpp |
p03037 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author toshibablack
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long int
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(a) (a).begin(), (a).end()
#define OUT(x) out << (x) << endl;
#define M0(x) memset(x, 0, sizeof(x))
#define MINF(x) memset(x, 0x3f, sizeof(x))
#define MMINUS(a) memset(a, 0xff, sizeof(a))
#define ten(n) ((int)1e##n)
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
const double EPS = 1.0 / LINF;
const char ENDL = '\n'; // for JetBrains IDE only supports yen
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;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
using namespace std;
class CPrison {
public:
int N, M;
int L[100000], R[100000];
void solve(std::istream &in, std::ostream &out) {
in >> N >> M;
REP(i, M) in >> L[i] >> R[i];
sort(L, L + M, greater<>());
sort(R, R + M);
int lmax = L[0];
int rmin = R[0];
OUT(rmin - lmax + 1);
}
};
int main() {
CPrison solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author toshibablack
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long int
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(a) (a).begin(), (a).end()
#define OUT(x) out << (x) << endl;
#define M0(x) memset(x, 0, sizeof(x))
#define MINF(x) memset(x, 0x3f, sizeof(x))
#define MMINUS(a) memset(a, 0xff, sizeof(a))
#define ten(n) ((int)1e##n)
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
const double EPS = 1.0 / LINF;
const char ENDL = '\n'; // for JetBrains IDE only supports yen
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;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
using namespace std;
class CPrison {
public:
int N, M;
int L[100000], R[100000];
void solve(std::istream &in, std::ostream &out) {
in >> N >> M;
REP(i, M) in >> L[i] >> R[i];
sort(L, L + M, greater<>());
sort(R, R + M);
int lmax = L[0];
int rmin = R[0];
OUT(max(rmin - lmax + 1, 0));
}
};
int main() {
CPrison solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| [
"call.arguments.add"
] | 851,304 | 851,305 | u585670083 | cpp |
p03037 | #include <iostream>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define IN(v) \
int v; \
cin >> v;
#define OUT(v) cout << v << endl
int main() {
IN(N);
IN(M);
int L = 0, R = N;
REP(i, M) {
IN(l);
IN(r);
L = max(L, l);
R = min(R, r);
}
OUT(R - L + 1);
return 0;
} | #include <iostream>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define IN(v) \
int v; \
cin >> v;
#define OUT(v) cout << v << endl
int main() {
IN(N);
IN(M);
int L = 0, R = N;
REP(i, M) {
IN(l);
IN(r);
L = max(L, l);
R = min(R, r);
}
OUT(max(0, R - L + 1));
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 851,306 | 851,307 | u025592199 | cpp |
p03037 | #include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int a = l[0], b = r[0];
int break_flag = 0;
for (int i = 1; i < m; i++) {
if (r[i] < a || l[i] > b) {
break_flag = 1;
break;
} else if (l[i] >= a && r[i] <= b) {
a = l[i];
b = r[i];
} else if (r[i] >= a) {
b = r[i];
} else if (l[i] <= b) {
a = l[i];
}
}
if (break_flag == 1) {
cout << 0 << endl;
} else {
cout << b - a + 1 << endl;
}
}
| #include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int a = l[0], b = r[0];
int break_flag = 0;
for (int i = 1; i < m; i++) {
if (r[i] < a || l[i] > b) {
break_flag = 1;
break;
} else if (l[i] >= a && r[i] <= b) {
a = l[i];
b = r[i];
} else if (r[i] <= b) {
b = r[i];
} else if (l[i] >= a) {
a = l[i];
}
}
if (break_flag == 1) {
cout << 0 << endl;
} else {
cout << b - a + 1 << endl;
}
}
| [
"control_flow.loop.for.condition.change"
] | 851,310 | 851,311 | u161609067 | cpp |
p03037 | #include <bits/stdc++.h>
#define rt "\n"
#define sp " "
#define test1 cout << "test1" << endl;
#define test2 cout << "test2" << endl;
#define fixprecision(n) \
fixed; \
cout << setprecision(n)
#define kyopro \
ios::sync_with_stdio(false); \
cin.tie(NULL);
#define MOD 1000000007
#define rep(i, s, N) for (ll i{s}; i < N; i++)
using namespace std;
using ll = long long;
using iikae = ll &;
using ld = long double;
using P = pair<ll, ll>;
int main() {
kyopro;
ll N, M;
cin >> N >> M;
ll maxL{}, minR{N};
rep(i, 0, M) {
ll L, R;
cin >> L >> R;
maxL = max(L, maxL);
minR = min(R, minR);
}
cout << minR - maxL + 1 << rt;
} | #include <bits/stdc++.h>
#define rt "\n"
#define sp " "
#define test1 cout << "test1" << endl;
#define test2 cout << "test2" << endl;
#define fixprecision(n) \
fixed; \
cout << setprecision(n)
#define kyopro \
ios::sync_with_stdio(false); \
cin.tie(NULL);
#define MOD 1000000007
#define rep(i, s, N) for (ll i{s}; i < N; i++)
using namespace std;
using ll = long long;
using iikae = ll &;
using ld = long double;
using P = pair<ll, ll>;
int main() {
kyopro;
ll N, M;
cin >> N >> M;
ll maxL{}, minR{N};
rep(i, 0, M) {
ll L, R;
cin >> L >> R;
maxL = max(L, maxL);
minR = min(R, minR);
}
cout << max(minR - maxL + 1, 0LL) << rt;
} | [
"call.add",
"call.arguments.add"
] | 851,315 | 851,316 | u936790121 | 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++) {
int l, r;
cin >> l >> r;
L[i] = l;
R[i] = r;
}
int Lmax = 0;
for (int i = 0; i < M; i++) {
Lmax = max(Lmax, L[i]);
}
int Rmin = N;
for (int i = 0; i < M; i++) {
Rmin = min(Rmin, R[i]);
}
cout << Rmin - Lmax + 1 << 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++) {
int l, r;
cin >> l >> r;
L[i] = l;
R[i] = r;
}
int Lmax = 0;
for (int i = 0; i < M; i++) {
Lmax = max(Lmax, L[i]);
}
int Rmin = N;
for (int i = 0; i < M; i++) {
Rmin = min(Rmin, R[i]);
}
cout << max(Rmin - Lmax + 1, 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 851,321 | 851,322 | u132364782 | cpp |
p03037 |
#include <algorithm>
#include <cstdio>
using namespace std;
#define m_MAX (int)1e5
int n, m;
int L[m_MAX + 1];
int R[m_MAX + 1];
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d %d", &L[i], &R[i]);
}
int L_max = L[0];
int R_min = R[0];
for (int i = 0; i < m; i++) {
L_max = max(L_max, L[i]);
R_min = min(R_min, R[i]);
}
int ans;
ans = R_min - L_max + 1;
if (ans == 0) {
ans = 1;
}
printf("%d\n", ans);
return 0;
} |
#include <algorithm>
#include <cstdio>
using namespace std;
#define m_MAX (int)1e5
int n, m;
int L[m_MAX + 1];
int R[m_MAX + 1];
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d %d", &L[i], &R[i]);
}
int L_max = L[0];
int R_min = R[0];
for (int i = 0; i < m; i++) {
L_max = max(L_max, L[i]);
R_min = min(R_min, R[i]);
}
int ans;
ans = R_min - L_max + 1;
if (ans < 0) {
ans = 0;
}
printf("%d\n", ans);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"assignment.value.change"
] | 851,323 | 851,324 | u289709148 | cpp |
p03037 |
#include <algorithm>
#include <cstdio>
using namespace std;
#define m_MAX (int)1e5
int n, m;
int L[m_MAX + 1];
int R[m_MAX + 1];
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d %d", &L[i], R[i]);
}
int L_max = L[0];
int R_min = R[0];
for (int i = 0; i < m; i++) {
L_max = max(L_max, L[i]);
R_min = min(R_min, R[i]);
}
int ans;
ans = R_min - L_max + 1;
if (ans == 0) {
ans = 1;
}
printf("%d\n", ans);
return 0;
}
|
#include <algorithm>
#include <cstdio>
using namespace std;
#define m_MAX (int)1e5
int n, m;
int L[m_MAX + 1];
int R[m_MAX + 1];
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d %d", &L[i], &R[i]);
}
int L_max = L[0];
int R_min = R[0];
for (int i = 0; i < m; i++) {
L_max = max(L_max, L[i]);
R_min = min(R_min, R[i]);
}
int ans;
ans = R_min - L_max + 1;
if (ans < 0) {
ans = 0;
}
printf("%d\n", ans);
return 0;
} | [
"expression.operation.unary.reference.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"assignment.value.change"
] | 851,325 | 851,324 | u289709148 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int s = 0, l = n;
for (int i = 0; i < m; i++) {
int gs, ge;
cin >> gs >> ge;
if ((s < ge - 1) || (l > gs - 1)) {
l = -1;
s = 0;
break;
}
s = (s < gs - 1) ? gs - 1 : s;
l = (l > ge - 1) ? ge - 1 : l;
}
cout << l - s + 1;
} | #include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int s = 0, l = n;
for (int i = 0; i < m; i++) {
int gs, ge;
cin >> gs >> ge;
if ((s > ge - 1) || (l < gs - 1)) {
l = -1;
s = 0;
break;
}
s = (s < gs - 1) ? gs - 1 : s;
l = (l > ge - 1) ? ge - 1 : l;
}
cout << l - s + 1;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,327 | 851,328 | u533749093 | cpp |
p03037 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define FORSTEP(i, start, end, step) for (int i = start; i < end; i += step)
#define RFOR(i, start, end) for (int i = start; end <= i; i--)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1000000007
typedef long long ll;
using namespace std;
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;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
REP(i, M) cin >> L[i] >> R[i];
int start = L[0];
int end = R[0];
FOR(i, 1, M) {
chmax(start, L[i]);
chmin(end, R[i]);
}
int ans = end - start + 1;
std::cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define FORSTEP(i, start, end, step) for (int i = start; i < end; i += step)
#define RFOR(i, start, end) for (int i = start; end <= i; i--)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1000000007
typedef long long ll;
using namespace std;
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;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
REP(i, M) cin >> L[i] >> R[i];
int start = L[0];
int end = R[0];
FOR(i, 1, M) {
chmax(start, L[i]);
chmin(end, R[i]);
}
int ans = end - start + 1;
std::cout << max(ans, 0) << '\n';
return 0;
} | [
"call.add",
"call.arguments.add"
] | 851,339 | 851,340 | u324303263 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN = 1e9;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int left = 1, right = n;
for (int i = 0; i < m; i++) {
left = max(left, l[i]);
right = min(right, r[i]);
}
cout << right - left + 1 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN = 1e9;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int left = 1, right = n;
for (int i = 0; i < m; i++) {
left = max(left, l[i]);
right = min(right, r[i]);
}
cout << max(0, right - left + 1) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 851,349 | 851,350 | u700986952 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
// define
#define endl "\n"
#ifdef LOCAL
#define lout cerr
#else
ostream devnull(0);
#define lout devnull
#endif
#define AMULET \
cin.tie(0); \
ios::sync_with_stdio(false);
// https://github.com/kurokoji/.cpp-Template/blob/master/template/template2.cpp
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) \
GET_MACRO(__VA_ARGS__, rep4, rep3, rep2, rep1) \
(__VA_ARGS__)
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) rep4(i, a, n, 1)
#define rep4(i, a, n, d) rep5(i, a, n, d, <)
#define rep5(i, a, n, d, o) \
for (auto i = decltype(n)(a), _n = (n); i o _n; i += (d))
#define rrep(...) \
GET_MACRO(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1) \
(__VA_ARGS__)
#define rrep1(a) rrep2(_, a)
#define rrep2(i, a) rrep3(i, a, 0)
#define rrep3(i, a, n) rrep4(i, a, n, -1)
#define rrep4(i, a, n, d) rep5(i, (a)-1, n, d, >=)
#define repc(...) \
GET_MACRO(__VA_ARGS__, repc4, repc3, repc2, repc1) \
(__VA_ARGS__)
#define repc1(n) repc2(_, n)
#define repc2(i, n) repc3(i, 0, n)
#define repc3(i, a, n) repc4(i, a, n, 1)
#define repc4(i, a, n, d) rep5(i, a, n, d, <=)
#define dump(x) lout << #x << " = " << x << endl;
// alias
typedef long long ll;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
// func
template <class C> inline void vcin(C &c);
template <class C, class D> inline void vcin(C &c, D &d);
template <class C> inline void vcout(const C &c, const string separate = "\n");
template <class T = int> inline T in();
void solve() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
vcin(l, r);
cout << *min_element(r.begin(), r.end()) - *max_element(l.begin(), l.end()) +
1
<< endl;
}
signed main() {
AMULET
solve();
return 0;
}
template <class C> inline void vcin(C &c) {
for (auto &a : c) {
cin >> a;
}
}
template <class C, class D> inline void vcin(C &c, D &d) {
for (auto it1 = c.begin(), it2 = d.begin(); it1 != c.end() && it2 != d.end();
it1++, it2++) {
cin >> *it1 >> *it2;
}
}
template <class C> inline void vcout(const C &c, const string separate) {
for (auto it = c.begin(); it != c.end(); it++) {
if (it != c.begin())
cout << separate;
cout << *it;
}
}
template <class T = int> inline T in() {
T x;
cin >> x;
return (x);
}
| #include <bits/stdc++.h>
using namespace std;
// define
#define endl "\n"
#ifdef LOCAL
#define lout cerr
#else
ostream devnull(0);
#define lout devnull
#endif
#define AMULET \
cin.tie(0); \
ios::sync_with_stdio(false);
// https://github.com/kurokoji/.cpp-Template/blob/master/template/template2.cpp
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) \
GET_MACRO(__VA_ARGS__, rep4, rep3, rep2, rep1) \
(__VA_ARGS__)
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) rep4(i, a, n, 1)
#define rep4(i, a, n, d) rep5(i, a, n, d, <)
#define rep5(i, a, n, d, o) \
for (auto i = decltype(n)(a), _n = (n); i o _n; i += (d))
#define rrep(...) \
GET_MACRO(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1) \
(__VA_ARGS__)
#define rrep1(a) rrep2(_, a)
#define rrep2(i, a) rrep3(i, a, 0)
#define rrep3(i, a, n) rrep4(i, a, n, -1)
#define rrep4(i, a, n, d) rep5(i, (a)-1, n, d, >=)
#define repc(...) \
GET_MACRO(__VA_ARGS__, repc4, repc3, repc2, repc1) \
(__VA_ARGS__)
#define repc1(n) repc2(_, n)
#define repc2(i, n) repc3(i, 0, n)
#define repc3(i, a, n) repc4(i, a, n, 1)
#define repc4(i, a, n, d) rep5(i, a, n, d, <=)
#define dump(x) lout << #x << " = " << x << endl;
// alias
typedef long long ll;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
// func
template <class C> inline void vcin(C &c);
template <class C, class D> inline void vcin(C &c, D &d);
template <class C> inline void vcout(const C &c, const string separate = "\n");
template <class T = int> inline T in();
void solve() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
vcin(l, r);
cout << max(*min_element(r.begin(), r.end()) -
*max_element(l.begin(), l.end()) + 1,
0)
<< endl;
}
signed main() {
AMULET
solve();
return 0;
}
template <class C> inline void vcin(C &c) {
for (auto &a : c) {
cin >> a;
}
}
template <class C, class D> inline void vcin(C &c, D &d) {
for (auto it1 = c.begin(), it2 = d.begin(); it1 != c.end() && it2 != d.end();
it1++, it2++) {
cin >> *it1 >> *it2;
}
}
template <class C> inline void vcout(const C &c, const string separate) {
for (auto it = c.begin(); it != c.end(); it++) {
if (it != c.begin())
cout << separate;
cout << *it;
}
}
template <class T = int> inline T in() {
T x;
cin >> x;
return (x);
}
| [
"call.add",
"call.arguments.change",
"call.arguments.add"
] | 851,351 | 851,352 | u530606147 | cpp |
p03037 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Int int64_t
void printVec(std::vector<int> &vec) {
std::cout << "";
for (auto it = vec.begin(); it != vec.end(); ++it) {
std::cout << *it << " ";
}
std::cout << std::endl;
}
void printVec1(std::vector<string> &vec) {
std::cout << "";
for (auto it = vec.begin(); it != vec.end(); ++it) {
std::cout << *it << " ";
}
std::cout << std::endl;
}
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
int vector_finder(std::vector<string> vec, string number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // ็บ่ฆใงใใใจใ
return 1;
} else { // ็บ่ฆใงใใชใใฃใใจใ
return 0;
}
}
#include <sstream>
std::vector<std::string> StringSplit(const std::string &str, char sep) {
std::vector<std::string> v;
std::stringstream ss(str);
std::string buffer;
while (std::getline(ss, buffer, sep)) {
v.push_back(buffer);
}
return v;
}
Int gcd(Int a, Int b) { return b != 0 ? gcd(b, a % b) : a; }
Int lcm(Int a, Int b) { return a * b / gcd(a, b); }
int main() {
Int n, m, cnt;
cin >> n >> m;
// vector<int>l(m), r(m);
Int minz = 0, maxx = 1000000, l, r;
for (int i = 0; i < m; i++) {
cin >> l >> r;
minz = max(minz, l);
maxx = min(maxx, r);
}
cout << (Int)maxx - minz + 1;
// cout << cnt;
cout << endl;
return 0;
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Int int64_t
void printVec(std::vector<int> &vec) {
std::cout << "";
for (auto it = vec.begin(); it != vec.end(); ++it) {
std::cout << *it << " ";
}
std::cout << std::endl;
}
void printVec1(std::vector<string> &vec) {
std::cout << "";
for (auto it = vec.begin(); it != vec.end(); ++it) {
std::cout << *it << " ";
}
std::cout << std::endl;
}
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
int vector_finder(std::vector<string> vec, string number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // ็บ่ฆใงใใใจใ
return 1;
} else { // ็บ่ฆใงใใชใใฃใใจใ
return 0;
}
}
#include <sstream>
std::vector<std::string> StringSplit(const std::string &str, char sep) {
std::vector<std::string> v;
std::stringstream ss(str);
std::string buffer;
while (std::getline(ss, buffer, sep)) {
v.push_back(buffer);
}
return v;
}
Int gcd(Int a, Int b) { return b != 0 ? gcd(b, a % b) : a; }
Int lcm(Int a, Int b) { return a * b / gcd(a, b); }
int main() {
Int n, m, cnt;
cin >> n >> m;
// vector<int>l(m), r(m);
int minz = 0, maxx = 1000000, l, r;
for (int i = 0; i < m; i++) {
cin >> l >> r;
minz = max(minz, l);
maxx = min(maxx, r);
}
cout << (Int)max(maxx - minz + 1, 0);
// cout << cnt;
cout << endl;
return 0;
} | [
"variable_declaration.type.change",
"call.add",
"call.arguments.add"
] | 851,362 | 851,363 | u565624841 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<bool>> ve_veb;
typedef vector<vector<string>> ve_ves;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define fs first
#define sc second
#define pub push_back
#define pob pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vei L(M), R(M);
rep(i, M) cin >> L[i] >> R[i];
if (maxel(L) >= minel(R))
cout << 0 << endl;
else
cout << minel(R) - maxel(L) + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<bool>> ve_veb;
typedef vector<vector<string>> ve_ves;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define fs first
#define sc second
#define pub push_back
#define pob pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vei L(M), R(M);
rep(i, M) cin >> L[i] >> R[i];
if (maxel(L) > minel(R))
cout << 0 << endl;
else
cout << minel(R) - maxel(L) + 1 << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,366 | 851,367 | u263715385 | 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, cnt = 0;
cin >> N >> M;
vector<pair<int, int>> gates(M);
rep(i, M) {
int l, r;
cin >> l >> r;
gates[i] = make_pair(l, r);
}
int minl = 1, minr = N;
rep(i, M) {
if (gates[i].first > minl)
minl = gates[i].first;
if (gates[i].second < minr)
minr = gates[i].second;
if (minl >= minr) {
cout << 0 << endl;
return 0;
}
}
cout << minr - minl + 1 << 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, cnt = 0;
cin >> N >> M;
vector<pair<int, int>> gates(M);
rep(i, M) {
int l, r;
cin >> l >> r;
gates[i] = make_pair(l, r);
}
int minl = 1, minr = N;
rep(i, M) {
if (gates[i].first > minl)
minl = gates[i].first;
if (gates[i].second < minr)
minr = gates[i].second;
if (minl > minr) {
cout << 0 << endl;
return 0;
}
}
cout << minr - minl + 1 << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,368 | 851,369 | u703503553 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.