problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03037 | #include <bits/stdc++.h>
using namespace std;
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)
c... | #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)
c... | [
"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)
c... | #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)
c... | [
"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)
co... | #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)
cou... | [
"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;... | #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 ... | [
"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 ... | #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 ... | [
"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)... | #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)... | [
"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> inlin... | //#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> inlin... | [
"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 Gr... | #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 Gr... | [
"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.beg... | #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.beg... | [
"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;
}
te... | #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;
}
te... | [
"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... | #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... | [
"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... | /**
* 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... | [
"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
#def... | #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
#def... | [
"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 (ca... | #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 (ca... | [
"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)... | #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)... | [
"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;
}
... | #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;
}
... | [
"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;
... | #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;
... | [
"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)
c... | #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)
... | [
"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 ... | #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 ... | [
"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,... | #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,... | [
"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 >... | #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 >... | [
"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;
cou... | #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;
cou... | [
"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; } //最大公... | #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; } //最大公... | [
"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 in... | #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 in... | [
"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... | #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... | [
"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... | #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... | [
"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 <... | #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 <... | [
"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 <... | #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 {
c... | [
"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] >>... | #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] >>... | [
"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)
#defin... | #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)
#defin... | [] | 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 ... | #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 ... | [
"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()
#defin... | #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()
#defin... | [
"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... | #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... | [
"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 ... | #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 ... | [
"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 cV... |
/*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 cV... | [
"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... | #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... | [
"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;
re... | #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) << en... | [
"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 &op... | #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 &op... | [
"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 &op... | #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 &op... | [
"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... | #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... | [
"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... | #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... | [
"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]... | #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]... | [
"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 -... | #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 -... | [
"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) {
... |
#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) {
... | [
"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... | #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... | [
"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.beg... | #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.beg... | [
"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) << ... | #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)... | [
"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] < upm... | #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] < upm... | [
"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 150000... | #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 150000... | [
"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]);
}
i... | #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]);
}
i... | [
"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]... | //#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[... | [
"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... | #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... | [
"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();
}... | #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();
}... | [
"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 >... | #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 >... | [
"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;
... | #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;
... | [
"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)
#... | #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)
#... | [
"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;
... | #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;
... | [
"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;
card... | #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;
card... | [
"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;
u... | // 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;
u... | [
"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};
i... | #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};
i... | [
"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) {... | #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) {
... | [
"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 -... | #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(... | [
"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;
... | #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;
c... | [
"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, ...) ... | #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, ...) ... | [
"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... | #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... | [
"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];
... | #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];
... | [
"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;... | #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) ... | [
"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:... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std:... | [
"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);
ma... | #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);
ma... | [
"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... | #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... | [
"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 <ss... | #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 <ss... | [
"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.en... | #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.en... | [
"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... | #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... | [
"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 ... | #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 ... | [
"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 {
... | #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 ... | [
"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];
#d... | #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];
#d... | [
"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);... | #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);... | [
"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 ... | #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 ... | [
"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() {
... | #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() {
... | [
"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 ... | /**
* 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 ... | [
"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... | #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... | [
"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_fla... | #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_fla... | [
"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... | #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... | [
"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 Rmi... | #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 Rmi... | [
"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... |
#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... | [
"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_... |
#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... | [
"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;
}
... | #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;
}
... | [
"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... | #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... | [
"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 =... | #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 =... | [
"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); \... | #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); \... | [
"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... | #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... | [
"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 ve... | #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 ve... | [
"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].... | #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].... | [
"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.