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 <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 1ll << 60;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
return f.second > s.second;
}
int mai... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 1ll << 60;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
return f.second > s.second;
}
int mai... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 851,373 | 851,374 | u845000384 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
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 l_max = INT_MIN;
int r_min = INT_MAX;
for (int i = 0; i < m; i++) {
l_max = max(l[i], l_max);
r_min = min... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
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 l_max = INT_MIN;
int r_min = INT_MAX;
for (int i = 0; i < m; i++) {
l_max = max(l[i], l_max);
r_min = min... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 851,375 | 851,376 | u680087927 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
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 l_max = INT_MIN;
int r_min = INT_MAX;
for (int i = 0; i < m; i++) {
l_max = max(l[i], l_max);
r_min = min... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
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 l_max = INT_MIN;
int r_min = INT_MAX;
for (int i = 0; i < m; i++) {
l_max = max(l[i], l_max);
r_min = min... | [
"call.add",
"call.arguments.add"
] | 851,377 | 851,376 | u680087927 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define lpsbd(i, s, b, d) for (size_t i = (s); i < (b); i += (d))
#define lpsb(i, s, b) for (size_t i = (s); i < (b); i++)
#define lpn(i, n) for (size_t i = 0; i < (n); i++)
#define fa(i, x) for (auto &i : x)
#define vcd(t, n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define lpsbd(i, s, b, d) for (size_t i = (s); i < (b); i += (d))
#define lpsb(i, s, b) for (size_t i = (s); i < (b); i++)
#define lpn(i, n) for (size_t i = 0; i < (n); i++)
#define fa(i, x) for (auto &i : x)
#define vcd(t, n... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"expression.operation.binary.remove"
] | 851,385 | 851,384 | u330913290 | cpp |
p03037 | #include <iostream>
using namespace std;
int N, M, L[100000], R[100000];
int main() {
cin >> N >> M;
int l = 1, r = N;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
l = max(l, L[i]);
r = min(r, R[i]);
}
cout << r - l + 1 << endl;
}
| #include <iostream>
using namespace std;
int N, M, L[100000], R[100000];
int main() {
cin >> N >> M;
int l = 1, r = N;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
l = max(l, L[i]);
r = min(r, R[i]);
}
cout << max(0, r - l + 1) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 851,392 | 851,393 | u425351967 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[100010], R[100010];
for (int i = 1; i <= M; i++) {
cin >> L[i] >> R[i];
}
sort(L - 1, L + M - 1);
sort(R - 1, R + M - 1);
int ans = 0;
for (int i = 1; i <= N; i++) {
if ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[100010], R[100010];
for (int i = 1; i <= M; i++) {
cin >> L[i] >> R[i];
}
sort(L + 1, L + M + 1);
sort(R + 1, R + M + 1);
int ans = 0;
for (int i = 1; i <= N; i++) {
if ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 851,398 | 851,399 | u582357587 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int vector_max(vector<int> &vec) {
int maximum = vec.at(0);
for (int i = 1; i < vec.size(); i++) {
maximum = max(maximum, vec.at(i));
}
return maximum;
}
int vector_min(vector<int> &vec)... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int vector_max(vector<int> &vec) {
int maximum = vec.at(0);
for (int i = 1; i < vec.size(); i++) {
maximum = max(maximum, vec.at(i));
}
return maximum;
}
int vector_min(vector<int> &vec)... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 851,401 | 851,402 | u366651777 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int n, m, i, l, r;
cin >> n >> m;
int begin = 1, end = n;
for (i = 1; i <= m; i++) {
cin >> l >> r;
begin = max(begin, l);
end = min(end, r);
}
cout << end - begin + 1;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, m, i, l, r;
cin >> n >> m;
int begin = 1, end = n;
for (i = 1; i <= m; i++) {
cin >> l >> r;
begin = max(begin, l);
end = min(end, r);
}
cout << max(end - begin + 1, 0);
return 0;
} | [
"call.add",
"call.arguments.add"
] | 851,412 | 851,413 | u526990197 | cpp |
p03037 | //**KEEP IT SHORT AND SIMPLE**
#include <bits/stdc++.h>
#define IO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#defin... | //**KEEP IT SHORT AND SIMPLE**
#include <bits/stdc++.h>
#define IO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#defin... | [
"call.add",
"call.arguments.add"
] | 851,432 | 851,433 | u089049901 | cpp |
p03037 | #include <iostream>
#define INF 1e9
using namespace std;
int n, m;
int main() {
cin >> n >> m;
int l_max = -INF;
int r_min = INF;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
l_max = max(l, l_max);
r_min = min(r, r_min);
}
if (r_min > l_max)
cout << (r_min - l_max + 1) << ... | #include <iostream>
#define INF 1e9
using namespace std;
int n, m;
int main() {
cin >> n >> m;
int l_max = -INF;
int r_min = INF;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
l_max = max(l, l_max);
r_min = min(r, r_min);
}
if (r_min >= l_max)
cout << (r_min - l_max + 1) <<... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,442 | 851,443 | u194268736 | cpp |
p03037 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, l, r, lmax = 0, rmin;
cin >> n >> m;
rmin = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
if (l > lmax)
lmax = l;
if (r < rmin)
rmin = r;
}
cout << rmin - lmax + 1;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, l, r, lmax = 0, rmin;
cin >> n >> m;
rmin = n;
for (int i = 0; i < m; i++) {
cin >> l >> r;
if (l > lmax)
lmax = l;
if (r < rmin)
rmin = r;
}
cout << max(rmin - lmax + 1, 0);
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 851,448 | 851,449 | u340494803 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...... | [
"call.arguments.add"
] | 851,454 | 851,455 | u375405838 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int n, m;
int lmax, rmin;
int l, r;
int i;
cin >> n >> m;
cin >> l >> r;
lmax = l;
rmin = r;
for (i = 1; i < m; i++) {
cin >> l >> r;
if (lmax < l)
lmax = l;
if (r < rmin)
rmin = r;
}
if (lmax < rmin)
i = rmin -... | #include <iostream>
using namespace std;
int main() {
int n, m;
int lmax, rmin;
int l, r;
int i;
cin >> n >> m;
cin >> l >> r;
lmax = l;
rmin = r;
for (i = 1; i < m; i++) {
cin >> l >> r;
if (lmax < l)
lmax = l;
if (r < rmin)
rmin = r;
}
if (lmax <= rmin)
i = rmin ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,474 | 851,475 | u417817281 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[100000], R[100000];
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
int a = 0, b = 0;
for (int i = 0; i < M; i++) {
if (i == 0) {
a = L[i];
b = R[i];
} else {
if (a <= L[i]) {
i... | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L[100000], R[100000];
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
int a = 0, b = 0;
for (int i = 0; i < M; i++) {
if (i == 0) {
a = L[i];
b = R[i];
} else {
if (a <= L[i]) {
i... | [
"call.add",
"call.arguments.change"
] | 851,476 | 851,477 | u367177642 | cpp |
p03037 | #include <algorithm>
#include <iostream>
using namespace std;
int N, M, L, R;
int l, r;
int main() {
cin >> N >> M;
l = 1, r = N;
bool zero = false;
while (M--) {
cin >> L >> R;
if (zero)
continue;
if (r < L || l > R) {
zero = true;
continue;
}
l = max(l, L);
r = min(r... | #include <algorithm>
#include <iostream>
using namespace std;
int N, M, L, R;
int l, r;
int main() {
cin >> N >> M;
l = 1, r = N;
bool zero = false;
while (M--) {
cin >> L >> R;
if (zero)
continue;
if (r < L || l > R) {
zero = true;
continue;
}
l = max(l, L);
r = min(r... | [] | 851,499 | 851,500 | u416526752 | cpp |
p03037 | #include <algorithm>
#include <iostream>
using namespace std;
int N, M, L, R;
int l, r;
int main() {
cin >> N >> M;
l = 1, r = N;
bool zero = false;
while (M--) {
cin >> L >> R;
if (zero)
continue;
if (r < L) {
zero = true;
continue;
}
l = max(l, L);
r = min(r, R);
}... | #include <algorithm>
#include <iostream>
using namespace std;
int N, M, L, R;
int l, r;
int main() {
cin >> N >> M;
l = 1, r = N;
bool zero = false;
while (M--) {
cin >> L >> R;
if (zero)
continue;
if (r < L || l > R) {
zero = true;
continue;
}
l = max(l, L);
r = min(r... | [
"control_flow.branch.if.condition.change"
] | 851,501 | 851,500 | u416526752 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <math.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];
int ma = l[0];
int mi = r[0];
for (int i = 1; i < M; i++) {
... | #include <algorithm>
#include <iostream>
#include <math.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];
int ma = l[0];
int mi = r[0];
for (int i = 1; i < M; i++) {
... | [
"call.add",
"call.arguments.add"
] | 851,508 | 851,509 | u640827947 | cpp |
p03037 | // Author: Rahul Purohit
#include <bits/stdc++.h>
#define vi vector<int>
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define ll long long int
#define pi pair<ll, ll>
#define f first
#define mp make_pair
#define mod 1000000007
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
int gcd(i... | // Author: Rahul Purohit
#include <bits/stdc++.h>
#define vi vector<int>
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define ll long long int
#define pi pair<ll, ll>
#define f first
#define mp make_pair
#define mod 1000000007
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
int gcd(i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,510 | 851,511 | u707655771 | cpp |
p03037 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000000;
using namespace std;
int points[100009];
int allp;
pair<int, int> gate;
vector<int> counto;
int main() {
int n = 0, m = 0;
cin >> n >> m;
in... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000000;
using namespace std;
int points[100009];
int allp;
pair<int, int> gate;
vector<int> counto;
int main() {
int n = 0, m = 0;
cin >> n >> m;
in... | [
"control_flow.branch.if.condition.change"
] | 851,518 | 851,519 | u019465635 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#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];
}
cou... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#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];
}
cou... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 851,526 | 851,527 | u382176401 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int lb = 0, ub = n;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
lb = max(lb, l);
ub = min(ub, r + 1);
}
cout << max(ub - lb, 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int lb = 0, ub = n;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
l--;
lb = max(lb, l);
ub = min(ub, r);
}
cout << max(ub - lb, 0) << endl;
return 0;
} | [
"expression.unary.arithmetic.add",
"expression.operation.binary.remove"
] | 851,541 | 851,542 | u283229916 | cpp |
p03037 | #include <iostream>
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];
if (i > 0) {
l[0] = max(l[i], l[0]);
r[0] = min(r[i], r[0]);
}
}
int distance;
distance = (r[0] > l[0]) ? (r[0] - l[0] + 1) : 0;
... | #include <iostream>
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];
if (i > 0) {
l[0] = max(l[i], l[0]);
r[0] = min(r[i], r[0]);
}
}
int distance;
distance = (r[0] >= l[0]) ? (r[0] - l[0] + 1) : 0;
... | [
"expression.operator.compare.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 851,543 | 851,544 | u360765331 | cpp |
p03037 | //
// main.cpp
// prison
//
// Created by Dong Truong on 5/28/19.
// Copyright © 2019 Dong Truong. All rights reserved.
//
#include <algorithm>
#include <fstream>
#include <iostream>
#include <stdio.h>
using namespace std;
#define maxn 1000001
struct elem {
int l, r;
};
int n, m;
elem a[maxn];
bool cmp(elem a... | //
// main.cpp
// prison
//
// Created by Dong Truong on 5/28/19.
// Copyright © 2019 Dong Truong. All rights reserved.
//
#include <algorithm>
#include <fstream>
#include <iostream>
#include <stdio.h>
using namespace std;
#define maxn 1000001
struct elem {
int l, r;
};
int n, m;
elem a[maxn];
bool cmp(elem a... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 851,551 | 851,552 | u293313826 | cpp |
p03037 | #include <iostream>
#include <stdio.h>
using namespace std;
const int N = 1e5 + 5;
int a[N], b[N];
int L, R, n, m;
int pointer[N];
void enter() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &a[i], &b[i]);
pointer[a[i]]++;
}
}
void qsort(int l, int r, int a[], int b[]) {
int i... | #include <iostream>
#include <stdio.h>
using namespace std;
const int N = 1e5 + 5;
int a[N], b[N];
int L, R, n, m;
int pointer[N];
void enter() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &a[i], &b[i]);
pointer[a[i]]++;
}
}
void qsort(int l, int r, int a[], int b[]) {
int i... | [
"call.add",
"call.arguments.add"
] | 851,553 | 851,554 | u287877771 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int N, M;
int L, R;
int ans = 0;
int main() {
cin >> N >> M;
vector<int> le(M + 1);
vector<int> ri(M + 1);
for (int i = 0; i < M; i++) {
cin >> le.at(i) >> ri.at(i);
}
L = le.at(0);
R = ri.at(0);
for (int i = 1; i < M; i++) {
// if(ri.at(i)>=L... | #include <bits/stdc++.h>
using namespace std;
int N, M;
int L, R;
int ans = 0;
int main() {
cin >> N >> M;
vector<int> le(M + 1);
vector<int> ri(M + 1);
for (int i = 0; i < M; i++) {
cin >> le.at(i) >> ri.at(i);
}
L = le.at(0);
R = ri.at(0);
for (int i = 1; i < M; i++) {
// if(ri.at(i)>=L || ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,555 | 851,556 | u955422652 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int N, M;
int L, R;
int ans = 0;
int main() {
cin >> N >> M;
vector<int> le(M + 1);
vector<int> ri(M + 1);
for (int i = 0; i < M; i++) {
cin >> le.at(i) >> ri.at(i);
}
L = le.at(0);
R = ri.at(0);
for (int i = 1; i < M; i++) {
// if(ri.at(i)>=L... | #include <bits/stdc++.h>
using namespace std;
int N, M;
int L, R;
int ans = 0;
int main() {
cin >> N >> M;
vector<int> le(M + 1);
vector<int> ri(M + 1);
for (int i = 0; i < M; i++) {
cin >> le.at(i) >> ri.at(i);
}
L = le.at(0);
R = ri.at(0);
for (int i = 1; i < M; i++) {
// if(ri.at(i)>=L... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,555 | 851,558 | u955422652 | cpp |
p03037 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#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.rbegin(), L.rend... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#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.rbegin(), L.rend... | [
"call.add",
"call.arguments.add"
] | 851,568 | 851,569 | u976560086 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
using ll = long long;
int u, v, k, d, c, n, m, dp[N][19], ans[N], tc;
pair<int, int> a[N];
int main() {
scanf("%d%d", &n, &m);
int l = 1, r = n;
for (int i = 0; i < m; i++) {
scanf("%d%d", &a[i].first, &a[i].second);
l = max(a[i].f... | #include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
using ll = long long;
int u, v, k, d, c, n, m, dp[N][19], ans[N], tc;
pair<int, int> a[N];
int main() {
scanf("%d%d", &n, &m);
int l = 1, r = n;
for (int i = 0; i < m; i++) {
scanf("%d%d", &a[i].first, &a[i].second);
l = max(a[i].f... | [
"call.add",
"call.arguments.add"
] | 851,572 | 851,573 | u318875010 | cpp |
p03037 | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#if __cplusplus >= 201103L
#include <chrono>
using namespace std::chrono;
#endif
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#ifdef LOCAL
#d... | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#if __cplusplus >= 201103L
#include <chrono>
using namespace std::chrono;
#endif
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#ifdef LOCAL
#d... | [
"expression.operation.binary.add"
] | 851,577 | 851,578 | u625893557 | cpp |
p03037 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> left, right;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
left.push_back(l);
right.push_back(r);
}
sort(left.rbegin(), left.rend());
sort(right.begin(), right.en... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> left, right;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
left.push_back(l);
right.push_back(r);
}
sort(left.rbegin(), left.rend());
sort(right.begin(), right.en... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 851,588 | 851,589 | u479371430 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
cout << *min_element(r, r + m) - *max_element(l, l + m) + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
cout << max(*min_element(r, r + m) - *max_element(l, l + m) + 1, 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 851,596 | 851,597 | u336130820 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
vector<int> xx, yy;
const int maxn = 1e5 + 7;
struct q {
int x, y;
} N[maxn];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y;
scanf("%d%d", &x, &y);
xx.push_back(x);
yy.push_back(y);
}
sort(xx.begin(), xx.end());
... | #include <bits/stdc++.h>
using namespace std;
vector<int> xx, yy;
const int maxn = 1e5 + 7;
struct q {
int x, y;
} N[maxn];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y;
scanf("%d%d", &x, &y);
xx.push_back(x);
yy.push_back(y);
}
sort(xx.begin(), xx.end());
... | [
"call.add",
"call.arguments.add"
] | 851,628 | 851,629 | u491404948 | cpp |
p03037 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, limit) for (int i = 0; i < limit; ++i)
#define FOR(i, j, limit) for (int i = j; i < limit; ++i)
#define DUMP(a) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, limit) for (int i = 0; i < limit; ++i)
#define FOR(i, j, limit) for (int i = j; i < limit; ++i)
#define DUMP(a) ... | [
"call.add",
"call.arguments.add"
] | 851,634 | 851,635 | u111742294 | cpp |
p03037 | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 851,638 | 851,639 | u055131803 | cpp |
p03037 | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 851,640 | 851,639 | u055131803 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, m, l, r, a, b, i;
cin >> n >> m;
a = 0, b = n + 1;
for (i = 0; i < m; i++) {
cin >> l >> r;
a = max(a, l);
b = min(b, r);
}
if (b >= a)
cout << b - a << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, m, l, r, a, b, i;
cin >> n >> m;
a = 0, b = n + 1;
for (i = 0; i < m; i++) {
cin >> l >> r;
a = max(a, l);
b = min(b, r);
}
if (b >= a)
cout << b - a + 1 << endl;
else
cout << 0 << endl;
} | [
"expression.operation.binary.add"
] | 851,641 | 851,642 | u388528458 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define el '\n'
#define MOD 1000000007
int n, m;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m;
int lmax = -1;
int rmin = 1000000000;
while (m--) {
int a, b;
cin >> a >> b;
lm... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define el '\n'
#define MOD 1000000007
int n, m;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m;
int lmax = -1;
int rmin = 1000000000;
while (m--) {
int a, b;
cin >> a >> b;
lm... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 851,643 | 851,644 | u673706514 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int s[m][2];
for (int i = 0; i < m; i++) {
for (int j = 0; j < 2; j++) {
cin >> s[i][j];
}
}
int minimum = INT_MAX;
int maximum = 1;
for (int i = 0; i < m; i++) {
minimum = min(s[i][1], minimum);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int s[m][2];
for (int i = 0; i < m; i++) {
for (int j = 0; j < 2; j++) {
cin >> s[i][j];
}
}
int minimum = INT_MAX;
int maximum = 1;
for (int i = 0; i < m; i++) {
minimum = min(s[i][1], minimum);
... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 851,649 | 851,650 | u489117389 | cpp |
p03037 | // https://atcoder.jp/contests/abc127/tasks/abc127_c
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll... | // https://atcoder.jp/contests/abc127/tasks/abc127_c
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll... | [
"call.add",
"call.arguments.change"
] | 851,651 | 851,652 | u858107870 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int r = n;
int l = 0;
int R = 0;
int L = n;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
l = max(l, x);
r = min(r, y);
L = min(L, x);
R = max(R, y);
}
cout << (R - L > 0 && r - l >= 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int r = n;
int l = 0;
int R = 0;
int L = n;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
l = max(l, x);
r = min(r, y);
L = min(L, x);
R = max(R, y);
}
cout << (R - L >= 0 && r - l >= ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 851,659 | 851,660 | u881647420 | cpp |
p03037 | #include <algorithm>
#include <stdio.h>
#define BUF 200002
#define LIM_N 100001
char str[BUF];
int N, M;
int L[LIM_N];
int R[LIM_N];
void receive_input() {
fgets(str, sizeof(str), stdin);
sscanf(str, "%d %d", &N, &M);
for (size_t i = 0; i < M; i++) {
scanf("%d %d", &L[i], &R[i]);
}
}
int solve() {
i... | #include <algorithm>
#include <stdio.h>
#define BUF 200002
#define LIM_N 100001
char str[BUF];
int N, M;
int L[LIM_N];
int R[LIM_N];
void receive_input() {
fgets(str, sizeof(str), stdin);
sscanf(str, "%d %d", &N, &M);
for (size_t i = 0; i < M; i++) {
scanf("%d %d", &L[i], &R[i]);
}
}
int solve() {
i... | [
"expression.operation.binary.add"
] | 851,661 | 851,662 | u869153175 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, i, n, m, max = 0, min = 100000;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> a;
if (a < min) {
min = a;
}
cin >> a;
if (a > max) {
max = a;
}
}
if (max - min > 0) {
cout << 0;
} else {
cout << m... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, i, n, m, max = 1000000, min = 0;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> a;
if (a > min) {
min = a;
}
cin >> a;
if (a < max) {
max = a;
}
}
if (max - min < 0) {
cout << 0;
} else {
cout << ... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,663 | 851,664 | u016726316 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, i, n, m, max = 1000000, min = 0;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> a;
if (a > min) {
min = a;
}
cin >> a;
if (a < max) {
max = a;
}
}
if (max - min < 0) {
cout << 0;
} else {
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, i, n, m, max = 1000000, min = 0;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> a;
if (a > min) {
min = a;
}
cin >> a;
if (a < max) {
max = a;
}
}
if (max - min < 0) {
cout << 0;
} else {
cout << ... | [
"expression.operation.binary.add"
] | 851,665 | 851,664 | u016726316 | cpp |
p03037 | #include <bits/stdc++.h>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
int L_max = 1;
int R_min = N;
int ans = 0;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
L_max = max(L_max, L[i]);
... | #include <bits/stdc++.h>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
int L_max = 1;
int R_min = N;
int ans = 0;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
L_max = max(L_max, L[i]);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,675 | 851,676 | u774910314 | cpp |
p03037 | #include <bits/stdc++.h>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
int L_max = 1;
int R_min = N;
int ans = 0;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
L_max = max(L_max, L[i]);
... | #include <bits/stdc++.h>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
int L_max = 1;
int R_min = N;
int ans = 0;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
L_max = max(L_max, L[i]);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,677 | 851,676 | u774910314 | cpp |
p03037 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
// #include <numeric>
using namespace std;
typedef unsigned long ul;
ty... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
// #include <numeric>
using namespace std;
typedef unsigned long ul;
ty... | [
"call.add",
"call.arguments.add"
] | 851,688 | 851,689 | u644070128 | cpp |
p03037 | #include <algorithm>
#include <iostream>
using namespace std;
int N, M;
int l[100005], r[100005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> l[i] >> r[i];
}
int ans = 0;
sort(l, l + M);
sort(r, r + M);
if (l[0] <= r[0])
ans = r... | #include <algorithm>
#include <iostream>
using namespace std;
int N, M;
int l[100005], r[100005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> l[i] >> r[i];
}
int ans = 0;
sort(l, l + M);
sort(r, r + M);
if (l[M - 1] <= r[0])
ans... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 851,697 | 851,698 | u525137785 | cpp |
p03037 | #include <bits/stdc++.h>
#define Rint register int
using namespace std;
int n, m, l, r;
int main() {
scanf("%d%d", &n, &m);
l = 1;
r = n;
for (Rint i = 1; i <= m; i++) {
int x, y;
scanf("%d%d", &x, &y);
l = max(x, l);
r = min(y, r);
}
printf("%d\n", r - l + 1);
} | #include <bits/stdc++.h>
#define Rint register int
using namespace std;
int n, m, l, r;
int main() {
scanf("%d%d", &n, &m);
l = 1;
r = n;
for (Rint i = 1; i <= m; i++) {
int x, y;
scanf("%d%d", &x, &y);
l = max(x, l);
r = min(y, r);
}
printf("%d\n", max(r - l + 1, 0));
} | [
"call.add",
"call.arguments.add"
] | 851,699 | 851,700 | u680164084 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - 48;
ch = getchar();
}
return x * f;
}
int main() {
i... | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - 48;
ch = getchar();
}
return x * f;
}
int main() {
i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,701 | 851,702 | u855248478 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl '\n'
#define fcin \
ios::sync_with_stdio(false); \
cin.tie(nullptr);
#define inf 0x3f3f3f3f
const i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl '\n'
#define fcin \
ios::sync_with_stdio(false); \
cin.tie(nullptr);
#define inf 0x3f3f3f3f
const i... | [
"call.add",
"call.arguments.add"
] | 851,707 | 851,708 | u189873906 | cpp |
p03037 | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define int ll
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
... | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define int ll
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
... | [
"call.add",
"call.arguments.add"
] | 851,732 | 851,733 | u055148700 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int lmax = l[0];
int rmin = r[0];
for (int i = 1; i < m; i++) {
if (lmax < l[i]) {
lmax = l[i];
}
if (rmin > r[i]) {
rmin = r[... | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int lmax = l[0];
int rmin = r[0];
for (int i = 1; i < m; i++) {
if (lmax < l[i]) {
lmax = l[i];
}
if (rmin > r[i]) {
rmin = r[... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"identifier.replace.remove",
"literal.replace.add"
] | 851,734 | 851,735 | u815060106 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int lmax = l[0];
int rmin = r[0];
for (int i = 1; i < m; i++) {
if (lmax < l[i]) {
lmax = l[i];
}
if (rmin > r[i]) {
rmin = r[... | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int lmax = l[0];
int rmin = r[0];
for (int i = 1; i < m; i++) {
if (lmax < l[i]) {
lmax = l[i];
}
if (rmin > r[i]) {
rmin = r[... | [
"call.add",
"call.arguments.add"
] | 851,736 | 851,735 | u815060106 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int N, M;
int l, r;
int l_max, r_min;
cin >> N >> M;
cin >> l_max >> r_min;
for (int i = 1; i < M; i++) {
cin >> l >> r;
if (l > l_max)
l_max = l;
if (r < r_min)
r_min = r;
}
if (r_min < l_max) {
cout << r_min - l_ma... | #include <iostream>
using namespace std;
int main() {
int N, M;
int l, r;
int l_max, r_min;
cin >> N >> M;
cin >> l_max >> r_min;
for (int i = 1; i < M; i++) {
cin >> l >> r;
if (l > l_max)
l_max = l;
if (r < r_min)
r_min = r;
}
if (r_min >= l_max) {
cout << r_min - l_m... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,739 | 851,740 | u081275802 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int N, M;
int l, r;
int l_max, r_min;
cin >> N >> M;
cin >> l_max >> r_min;
for (int i = 1; i < M; i++) {
cin >> l >> r;
if (l > l_max)
l_max = l;
if (r < r_min)
r_min = r;
}
if (r_min > l_max) {
cout << r_min - l_ma... | #include <iostream>
using namespace std;
int main() {
int N, M;
int l, r;
int l_max, r_min;
cin >> N >> M;
cin >> l_max >> r_min;
for (int i = 1; i < M; i++) {
cin >> l >> r;
if (l > l_max)
l_max = l;
if (r < r_min)
r_min = r;
}
if (r_min >= l_max) {
cout << r_min - l_m... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,741 | 851,740 | u081275802 | cpp |
p03037 | #include <iostream>
int main() {
int n, m;
std::cin >> n >> m;
int l_max = 0, r_min = 1145141919810;
for (int i = 0; i < m; i++) {
int l_i, r_i;
std::cin >> l_i >> r_i;
l_max = std::max(l_max, l_i);
r_min = std::min(r_min, r_i);
}
if (r_min < l_max) {
std::cout << 0 << std::endl;
} el... | #include <iostream>
int main() {
int n, m;
std::cin >> n >> m;
int l_max = 0, r_min = 10000000;
for (int i = 0; i < m; i++) {
int l_i, r_i;
std::cin >> l_i >> r_i;
l_max = std::max(l_max, l_i);
r_min = std::min(r_min, r_i);
}
if (r_min < l_max) {
std::cout << 0 << std::endl;
} else {
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 851,744 | 851,745 | u675512317 | cpp |
p03037 | #include <iostream>
int main() {
int n, m;
std::cin >> n >> m;
int l_max = 0, r_min = 0;
for (int i = 0; i < m; i++) {
int l_i, r_i;
std::cin >> l_i >> r_i;
l_max = std::max(l_max, l_i);
r_min = std::min(r_min, r_i);
}
if (r_min < l_max) {
std::cout << 0 << std::endl;
} else {
std... | #include <iostream>
int main() {
int n, m;
std::cin >> n >> m;
int l_max = 0, r_min = 10000000;
for (int i = 0; i < m; i++) {
int l_i, r_i;
std::cin >> l_i >> r_i;
l_max = std::max(l_max, l_i);
r_min = std::min(r_min, r_i);
}
if (r_min < l_max) {
std::cout << 0 << std::endl;
} else {
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 851,746 | 851,745 | u675512317 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, l, r, lmax, rmin, gen;
cin >> n >> m;
int i = 0;
cin >> lmax >> rmin;
for (int i = 1; i < m; i++) {
cin >> l >> r;
if (lmax < l)
lmax = l;
if (rmin > r)
rmin = r;
}
gen = rmin - lmax + 1;
if (l > r) {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, l, r, lmax, rmin, gen;
cin >> n >> m;
int i = 0;
cin >> lmax >> rmin;
for (int i = 1; i < m; i++) {
cin >> l >> r;
if (lmax < l)
lmax = l;
if (rmin > r)
rmin = r;
}
gen = rmin - lmax + 1;
if (lmax > rmin) {... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 851,755 | 851,756 | u341980602 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, d = 0, mi = 1000001, ma = 0;
scanf("%d %d", &n, &m);
int l, r;
for (i = 1; i <= m; i++) {
scanf("%d %d", &l, &r);
if (l > ma) {
ma = l;
}
if (r < mi) {
mi = r;
}
}
d = abs(ma - mi) + 1;
if (d < 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, d = 0, mi = 1000001, ma = 0;
scanf("%d %d", &n, &m);
int l, r;
for (i = 1; i <= m; i++) {
scanf("%d %d", &l, &r);
if (l > ma) {
ma = l;
}
if (r < mi) {
mi = r;
}
}
d = mi - ma + 1;
if (d < 0) {
d = ... | [
"call.remove",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 851,771 | 851,772 | u425970024 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int m, n;
cin >> m >> n;
int l, r;
int ans;
int max = n + 1;
int min = 1;
for (int j = 0; j < m; j++) {
cin >> l >> r;
if (min < l)
min = l;
if (max > r)
max = r;
}
ans = max - min + 1;
if (ans < 0)
ans = 0;
cout... | #include <iostream>
using namespace std;
int main() {
int m, n;
cin >> n >> m;
int l, r;
int ans;
int max = n;
int min = 1;
for (int j = 0; j < m; j++) {
cin >> l >> r;
if (min < l)
min = l;
if (max > r)
max = r;
}
ans = max - min + 1;
if (ans < 0)
ans = 0;
cout << ... | [
"expression.operation.binary.remove"
] | 851,777 | 851,778 | u057617112 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int m, n;
cin >> m >> n;
int l, r;
int ans;
int max = n;
int min = 1;
for (int j = 0; j < m; j++) {
cin >> l >> r;
if (min < l)
min = l;
if (max > r)
max = r;
}
ans = max - min + 1;
if (ans < 0)
ans = 0;
cout << ... | #include <iostream>
using namespace std;
int main() {
int m, n;
cin >> n >> m;
int l, r;
int ans;
int max = n;
int min = 1;
for (int j = 0; j < m; j++) {
cin >> l >> r;
if (min < l)
min = l;
if (max > r)
max = r;
}
ans = max - min + 1;
if (ans < 0)
ans = 0;
cout << ... | [
"expression.operation.binary.remove"
] | 851,779 | 851,778 | u057617112 | cpp |
p03037 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"call.add",
"call.arguments.change"
] | 851,787 | 851,788 | u838742270 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
inline int_fast64_t read() {
int_fast64_t x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
inline string read... | #include <bits/stdc++.h>
using namespace std;
inline int_fast64_t read() {
int_fast64_t x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
inline string read... | [
"call.add",
"call.arguments.add"
] | 851,791 | 851,792 | u572532976 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
using namespace std;
int main(void) {
int n, m, ans = 0;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; ++i)
scanf("%d %d", &l[i], &r[i]);
if (*min_element(r, r + m) - *max_element(l, l + m) + 1 >= 0)
ans = *min_... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
using namespace std;
int main(void) {
int n, m, ans = 0;
cin >> n >> m;
int l[m], r[m];
for (int i = 0; i < m; ++i)
scanf("%d %d", &l[i], &r[i]);
if (*min_element(r, r + m) - *max_element(l, l + m) + 1 >= 0)
ans = *min_... | [
"expression.operation.binary.remove"
] | 851,809 | 851,810 | u459317879 | cpp |
p03037 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
using ll = long long;
int main() {
ll N, M;
cin >> N >> M;
ll L[100100], R[100100];
for (int i = 0; i < M; i++)
cin >> L[i] >> R[i];
ll *lmax = max_element(L, L + M);
ll *rmin = min_element(R, R + M);
ll res = 0;
if (*rmin - *lmax ... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
using ll = long long;
int main() {
ll N, M;
cin >> N >> M;
ll L[100100], R[100100];
for (int i = 0; i < M; i++)
cin >> L[i] >> R[i];
ll *lmax = max_element(L, L + M);
ll *rmin = min_element(R, R + M);
ll res = 0;
if (*rmin - *lmax ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,813 | 851,814 | u108648546 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l_max = 0, r_min = n;
for (int j = 0; j < m; j++) {
int l, r;
cin >> l >> r;
if (l > l_max)
l_max = l;
if (r < r_min)
r_min = r;
}
if (l_max < r_min)
cout << 0 << endl;
else
cout << r... | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l_max = 0, r_min = n;
for (int j = 0; j < m; j++) {
int l, r;
cin >> l >> r;
if (l > l_max)
l_max = l;
if (r < r_min)
r_min = r;
}
if (l_max > r_min)
cout << 0 << endl;
else
cout << r... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,829 | 851,830 | u927804708 | cpp |
p03037 | #include <cmath>
#include <iostream>
using namespace std;
// bool f[200000];
int main() {
int N, M;
cin >> N >> M;
int L[200000], R[200000];
int Lmax = 0, Rmin = 1e9;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
Lmax = max(L[i], Lmax);
Rmin = min(R[i], Rmin);
}
cout << max(Rmin - Lmax,... | #include <cmath>
#include <iostream>
using namespace std;
// bool f[200000];
int main() {
int N, M;
cin >> N >> M;
int L[200000], R[200000];
int Lmax = 0, Rmin = 1e9;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
Lmax = max(L[i], Lmax);
Rmin = min(R[i], Rmin);
}
cout << max(Rmin - Lmax ... | [
"expression.operation.binary.add"
] | 851,839 | 851,840 | u100499821 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, lint>
const lint INF = 1E15;
int main() {
int N, M;
cin >> N >> M;
int L[M], R[M];
int Min = 0, Max = 1000000;
for (int i = 0; i < M; ++i) {
cin >> L[i] >> R[i];
Min = max(Min, L[i]);
Max = min(Max, R[i])... | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, lint>
const lint INF = 1E15;
int main() {
int N, M;
cin >> N >> M;
int L[M], R[M];
int Min = 0, Max = 1000000;
for (int i = 0; i < M; ++i) {
cin >> L[i] >> R[i];
Min = max(Min, L[i]);
Max = min(Max, R[i])... | [
"call.add",
"call.arguments.add"
] | 851,847 | 851,848 | u432456012 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define all(V) V.begin, V.end
const int N = 100005;
int n, m;
const int inf = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
int low = -1, high = inf;
while (m--) {
int l, r;
cin >> l ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define all(V) V.begin, V.end
const int N = 100005;
int n, m;
const int inf = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
int low = -1, high = inf;
while (m--) {
int l, r;
cin >> l ... | [
"call.add",
"call.arguments.add"
] | 851,849 | 851,850 | u595786324 | cpp |
p03037 |
#if 1
#include <bits/stdc++.h>
using namespace std;
int l, r;
int n, m;
pair<int, int> a[100005];
int main() {
scanf("%d %d", &n, &m);
r = n + 1;
for (int i = 1; i <= m; i++) {
scanf("%d %d", &a[i].first, &a[i].second);
l = max(l, a[i].first);
r = min(r, a[i].second);
}
printf("%d", r - l + 1);... | #if 1
#include <bits/stdc++.h>
using namespace std;
int l, r;
int n, m;
pair<int, int> a[100005];
int main() {
scanf("%d %d", &n, &m);
r = n + 1;
for (int i = 1; i <= m; i++) {
scanf("%d %d", &a[i].first, &a[i].second);
l = max(l, a[i].first);
r = min(r, a[i].second);
}
printf("%d", max(r - l + ... | [
"call.add",
"call.arguments.add"
] | 851,851 | 851,852 | u998677610 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, L, R;
int Lmax = 0;
int Rmin = 1000000;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> L >> R;
if (L >= Lmax) {
Lmax = L;
}
if (R <= Rmin) {
Rmin = R;
}
}
if (Rmin > Lmax) {
cout << Rmin - Lmax + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, L, R;
int Lmax = 0;
int Rmin = 1000000;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> L >> R;
if (L >= Lmax) {
Lmax = L;
}
if (R <= Rmin) {
Rmin = R;
}
}
if (Rmin >= Lmax) {
cout << Rmin - Lmax +... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,866 | 851,867 | u218036413 | cpp |
p03037 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L, R;
int left_end = 0, right_end = 10001;
for (int i = 0; i < M; i++) {
cin >> L >> R;
if (left_end < L)
left_end = L;
if (right_end > R)
right_end = R;
// cout << left_end << end... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L, R;
int left_end = 0, right_end = N;
for (int i = 0; i < M; i++) {
cin >> L >> R;
if (left_end < L)
left_end = L;
if (right_end > R)
right_end = R;
// cout << left_end << endl;
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 851,868 | 851,869 | u929829215 | cpp |
p03037 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L, R;
int left_end = 0, right_end = 10001;
for (int i = 0; i < M; i++) {
cin >> L >> R;
if (left_end > L)
left_end = L;
if (right_end < R)
right_end = R;
}
if (left_end <= right_en... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L, R;
int left_end = 0, right_end = N;
for (int i = 0; i < M; i++) {
cin >> L >> R;
if (left_end < L)
left_end = L;
if (right_end > R)
right_end = R;
// cout << left_end << endl;
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,870 | 851,869 | u929829215 | cpp |
p03037 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
int min = 1000000;
int max = 1;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
int Ans = 0;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
max = std::max(max, L[i]);
min = std::m... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
int min = 1000000;
int max = 1;
cin >> N >> M;
vector<int> L(M);
vector<int> R(M);
int Ans = 0;
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
max = std::max(max, L[i]);
min = std::m... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,876 | 851,877 | u142946678 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L, R;
int Lm = 1, Rm = N;
for (int i = 0; i < M; i++) {
cin >> L >> R;
Lm = max(Lm, L);
Rm = min(Rm, R);
}
cout << Rm - Lm + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L, R;
int Lm = 1, Rm = N;
for (int i = 0; i < M; i++) {
cin >> L >> R;
Lm = max(Lm, L);
Rm = min(Rm, R);
}
cout << max(0, Rm - Lm + 1) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 851,878 | 851,879 | u572077985 | cpp |
p03037 | #include "bits/stdc++.h"
using namespace std;
int N, M;
vector<int> L;
vector<int> R;
int main() {
cin >> N >> M;
for (int i = 1; i <= M; i++) {
int l, r;
cin >> l >> r;
L.emplace_back(l);
R.emplace_back(r);
}
int card_min = 1;
int card_max = N;
for (int i = 1; i <= M; i++) {
if (card... | #include "bits/stdc++.h"
using namespace std;
int N, M;
vector<int> L;
vector<int> R;
int main() {
cin >> N >> M;
for (int i = 1; i <= M; i++) {
int l, r;
cin >> l >> r;
L.emplace_back(l);
R.emplace_back(r);
}
int card_min = 1;
int card_max = N;
for (int i = 1; i <= M; i++) {
if (card... | [
"call.add",
"call.arguments.change"
] | 851,886 | 851,887 | u436976004 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L, R, roop;
int maxL = 1, minR = N;
for (roop = 0; roop < M; roop++) {
cin >> L >> R;
if (maxL < L)
maxL = L;
if (minR > R)
minR = R;
}
int ans = minR - maxL + 1;
if (ans > 0)
ans = 0;
cout ... | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L, R, roop;
int maxL = 1, minR = N;
for (roop = 0; roop < M; roop++) {
cin >> L >> R;
if (maxL < L)
maxL = L;
if (minR > R)
minR = R;
}
int ans = minR - maxL + 1;
if (ans < 0)
ans = 0;
cout ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,893 | 851,894 | u541263126 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | [
"call.add",
"call.arguments.change"
] | 851,906 | 851,907 | u172929647 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, m, minv = 0, maxv = INT_MAX, l, r;
scanf("%d %d", &n, &m);
for (i = 0; i < m; i++) {
scanf("%d %d", &l, &r);
maxv = min(maxv, r);
minv = max(minv, l);
}
printf("%d", maxv - minv + 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, m, minv = 0, maxv = INT_MAX, l, r;
scanf("%d %d", &n, &m);
for (i = 0; i < m; i++) {
scanf("%d %d", &l, &r);
maxv = min(maxv, r);
minv = max(minv, l);
}
printf("%d", max(maxv - minv + 1, 0));
return 0;
} | [
"call.add",
"call.arguments.add"
] | 851,916 | 851,917 | u379393519 | cpp |
p03037 |
#include "bits/stdc++.h"
// #define int long long
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int l = 1, r = n;
for (int i = 0; i < m; ++i) {
int _l, _r;
cin >> _l >> _r;
l = max(l, _l);
r = min(r, _r);
}
cout << r - l + 1 << endl;
return 0;
}
|
#include "bits/stdc++.h"
// #define int long long
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
int l = 1, r = n;
for (int i = 0; i < m; ++i) {
int _l, _r;
cin >> _l >> _r;
l = max(l, _l);
r = min(r, _r);
}
cout << max(0, r - l + 1) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 851,920 | 851,921 | u076865901 | cpp |
p03037 | //
// main.c
// Prison
//
// Created by yuta on 2019/05/25.
// Copyright © 2019 501Software. All rights reserved.
//
#include <stdio.h>
int main(int argc, const char *argv[]) {
int N, M;
int L, R;
int l = 1, r;
int t = 0;
// スペース区切りの整数の入力
scanf("%d %d", &N, &M);
r = N;
// ゲート
for (int i = 0;... | //
// main.c
// Prison
//
// Created by yuta on 2019/05/25.
// Copyright © 2019 501Software. All rights reserved.
//
#include <stdio.h>
int main(int argc, const char *argv[]) {
int N, M;
int L, R;
int l = 1, r;
int t = 0;
// スペース区切りの整数の入力
scanf("%d %d", &N, &M);
r = N;
// ゲート
for (int i = 0;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 851,934 | 851,935 | u156723325 | cpp |
p03037 | #include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
typedef unsigned long long int ulli;
typedef long long int lli;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
... | #include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
typedef unsigned long long int ulli;
typedef long long int lli;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
... | [
"call.add",
"call.arguments.add"
] | 851,946 | 851,947 | u806999568 | cpp |
p03037 | //#pragma warning(disable:4996)
#include <stdio.h>
int main() {
/*int n, m;
int L[100000];
int R[100000];
bool a[100000];//false：ダメ,true：いける
for (int i = 0; i < 100000; i++) {
a[i] = true;
}
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d %d", &L[i], &R[i]);
}
... | //#pragma warning(disable:4996)
#include <stdio.h>
int main() {
/*int n, m;
int L[100000];
int R[100000];
bool a[100000];//false：ダメ,true：いける
for (int i = 0; i < 100000; i++) {
a[i] = true;
}
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d %d", &L[i], &R[i]);
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,950 | 851,951 | u691912637 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int r, l;
l = 0;
r = N;
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
if (l < a)
l = a;
if (r > b)
r = b;
}
cout << min(r - l + 1, 0) << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int r, l;
l = 0;
r = N;
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
if (l < a)
l = a;
if (r > b)
r = b;
}
cout << max(r - l + 1, 0) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 851,956 | 851,957 | u058186113 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
int minR = *min_element(R.begin(), R.end());
int maxL = *max_element(L.begin(), L.end());
int count = 0;
for (int i = 0; i < N; i++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
int minR = *min_element(R.begin(), R.end());
int maxL = *max_element(L.begin(), L.end());
int count = 0;
for (int i = 1; i <= N; i++) ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 851,962 | 851,963 | u692650171 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define ROUNDUP(divisor, dividend) (divisor + (dividend - 1)) / dividend
int n, m;
int a, b, am, bm;
int temp1 = 0, temp2 = 999999;
int main() {
cin >> n >> m;
bool wa = false;
for (int i = 0; i < m; i++) {
cin >> a >> b;
temp1 = max(temp1, a);
temp2 = min... | #include <bits/stdc++.h>
using namespace std;
#define ROUNDUP(divisor, dividend) (divisor + (dividend - 1)) / dividend
int n, m;
int a, b, am, bm;
int temp1 = 0, temp2 = 999999;
int main() {
cin >> n >> m;
bool wa = false;
for (int i = 0; i < m; i++) {
cin >> a >> b;
temp1 = max(temp1, a);
temp2 = min... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 851,964 | 851,965 | u890807039 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const ll N = 1e5 + 5, MOD = 1e9 + 7;
ll n, m;
ll l, r;
vector<pair<ll, ll>> v1, v2;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m;
for (ll i = 1; i <= m; i++) {
cin >>... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const ll N = 1e5 + 5, MOD = 1e9 + 7;
ll n, m;
ll l, r;
vector<pair<ll, ll>> v1, v2;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m;
for (ll i = 1; i <= m; i++) {
cin >>... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 851,968 | 851,969 | u769602639 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int mxLi = -1, mnRi = (int)1e8;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
mxLi = max(mxLi, x);
mnRi = min(mnRi, y);
}
cout << -mxLi + 1 + mnRi << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int mxLi = -1, mnRi = (int)1e8;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
mxLi = max(mxLi, x);
mnRi = min(mnRi, y);
}
cout << max(0, -mxLi + 1 + mnRi) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 851,980 | 851,981 | u095814925 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
#define pp pop_back
#define mk make_pair
#define EPS 1e-9
#define INF 1 << 25
#define ln '\n'
#define sp ' '
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define mem(a, b) memset(a, b, sizeof(a))
#defin... | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
#define pp pop_back
#define mk make_pair
#define EPS 1e-9
#define INF 1 << 25
#define ln '\n'
#define sp ' '
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define mem(a, b) memset(a, b, sizeof(a))
#defin... | [
"call.add",
"call.arguments.change"
] | 851,989 | 851,990 | u613686673 | cpp |
p03037 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define mod (1e9 + 7)
#define pb push_back
using namespace std;
typedef pair<int, int> pii;
int main() {
int n, m;
cin >> n >> m;
int l, r, ll, rr;
ll = 0;
rr = n;
for (int i ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define mod (1e9 + 7)
#define pb push_back
using namespace std;
typedef pair<int, int> pii;
int main() {
int n, m;
cin >> n >> m;
int l, r, ll, rr;
ll = 0;
rr = n;
for (int i ... | [
"call.add",
"call.arguments.add"
] | 851,991 | 851,992 | u733823138 | cpp |
p03037 | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N, M, i, j;
cin >> N >> M;
vector<int> Pass(N + 1, 0);
int L, R;
int ans = 0;
int MaxL = 0;
int MinR = N;
for (i = 0; i < M; i++) {
cin >> L >> R;
if (MaxL < L) {
MaxL = L;
}
if (MinR ... | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int N, M, i, j;
cin >> N >> M;
vector<int> Pass(N + 1, 0);
int L, R;
int ans = 0;
int MaxL = 0;
int MinR = N;
for (i = 0; i < M; i++) {
cin >> L >> R;
if (MaxL < L) {
MaxL = L;
}
if (MinR ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,993 | 851,994 | u875570028 | cpp |
p03037 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <sstream>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> imos(N + 5, 0);
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
imos[L]++;
imos[R + 1]--;
}
for (int i = 0; ... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <sstream>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> imos(N + 5, 0);
for (int i = 0; i < M; i++) {
int L, R;
cin >> L >> R;
imos[L]++;
imos[R + 1]--;
}
for (int i = 0; ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 852,004 | 852,005 | u013936801 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n, a, b;
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);
}
a = L.at(0), b = R.at(0);
for (int i = 1; i < m; i++) {
if (a < L.at(i)) {
a = L.at(i);
}
if (b ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n, a, b;
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);
}
a = L.at(0), b = R.at(0);
for (int i = 1; i < m; i++) {
if (a < L.at(i)) {
a = L.at(i);
}
if (b ... | [
"control_flow.branch.else.add"
] | 852,010 | 852,011 | u201743726 | cpp |
p03037 | #include <iostream>
using namespace std;
main() {
int N, M, L, R, min_x, max_x;
cin >> N >> M;
min_x = 1;
max_x = N;
for (int j = 1; j < M + 1; j++) {
cin >> L >> R;
if (R <= min_x || L >= max_x) {
cout << 0 << endl;
exit(0);
}
if (L >= min_x)
min_x = L;
if (R <= ma... | #include <iostream>
using namespace std;
main() {
int N, M, L, R, min_x, max_x;
cin >> N >> M;
min_x = 1;
max_x = N;
for (int j = 1; j < M + 1; j++) {
cin >> L >> R;
if (R < min_x || L > max_x) {
cout << 0 << endl;
exit(0);
}
if (L >= min_x)
min_x = L;
if (R <= max_... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 852,012 | 852,013 | u139112688 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m], r[m];
int left, right;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int count = 0;
for (int j = 0; j < m; j++) {
if (j == 0) {
left = l[0];
right = r[0];
}
if (j > 0) { // 2nd ... | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m], r[m];
int left, right;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int count = 0;
for (int j = 0; j < m; j++) {
if (j == 0) {
left = l[0];
right = r[0];
}
if (j > 0) { // 2nd ... | [
"control_flow.branch.if.condition.change"
] | 852,014 | 852,015 | u793225530 | cpp |
p03037 | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m], r[m];
int left, right;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int count = 0;
for (int j = 0; j < m; j++) {
if (j == 0) {
left = l[0];
right = r[0];
}
if (j > 0) { // 2nd ... | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int l[m], r[m];
int left, right;
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i];
}
int count = 0;
for (int j = 0; j < m; j++) {
if (j == 0) {
left = l[0];
right = r[0];
}
if (j > 0) { // 2nd ... | [
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 852,016 | 852,015 | u793225530 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | [
"call.add"
] | 852,017 | 852,018 | u319234342 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 852,019 | 852,018 | u319234342 | cpp |
p03037 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 852,020 | 852,018 | u319234342 | cpp |
p03037 | #include <stdio.h>
int main(void) {
int n, m, i, j, k = 0, o = 0, p = 9999999, s, t;
scanf("%d %d", &n, &m);
int l[m];
int r[m];
for (i = 0; i < m; i++) {
scanf("%d %d", &l[i], &r[i]);
}
for (s = 0; s < m; s++) {
if (o < l[s]) {
o = l[s];
}
}
for (t = 0; t < m; t++) {
if (p > l[t... | #include <stdio.h>
int main(void) {
int n, m, i, j, k = 0, o = 0, p = 9999999, s, t;
scanf("%d %d", &n, &m);
int l[m];
int r[m];
for (i = 0; i < m; i++) {
scanf("%d %d", &l[i], &r[i]);
}
for (s = 0; s < m; s++) {
if (o < l[s]) {
o = l[s];
}
}
for (t = 0; t < m; t++) {
if (p > r[t... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 852,022 | 852,023 | u222643545 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.