problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
long long int l, r;
int ama = 2020000;
cin >> l >> r;
if (r - l <= 2019)
cout << 0 << endl;
else {
l = l % 2019;
r = r % 2019;
if (l < r) {
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
long long int l, r;
int ama = 2020000;
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else {
l = l % 2019;
r = r % 2019;
if (l < r) {
for (int i = l; i <= r - 1; i++) {
for (int j = i + 1... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,677 | 790,676 | u098700286 | cpp |
p02983 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll long long
#define ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll long long
#define ... | [
"expression.operation.binary.remove"
] | 790,678 | 790,679 | u241367243 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2020;
for (int i = l; i <= r; ++i) {
for (int j = i + 1; j <= r; ++j) {
ans = min(ans, (i % 2019) * (j % 2019));
}
}
cout << ans << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2020;
for (int i = l; i <= r; ++i) {
for (int j = i + 1; j <= r; ++j) {
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
}
cout << ... | [
"assignment.change"
] | 790,680 | 790,681 | u559765551 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
}
int ans = 2020;
for (int i = l; i <= r; ++i) {
for (int j = i + 1; j <= r; ++j) {
ans = min(ans, (i % 2019) * (j % 2019));
}
}
cout << ans << endl;
return... | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2020;
for (int i = l; i <= r; ++i) {
for (int j = i + 1; j <= r; ++j) {
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
}
cout << ... | [
"control_flow.return.add",
"control_flow.return.0.add",
"assignment.change"
] | 790,682 | 790,681 | u559765551 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
int Lmod = L % 2019;
int Rmod = R % 2019;
int ans = 2019;
if ((R - L) >= 2018) {
ans = 0;
} else if (Lmod > Rmod) {
ans = 0;
} else {
for (int i = Lmod; i < Rmod; i++) {
for (int j = Lmod; j <... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
int Lmod = L % 2019;
int Rmod = R % 2019;
int ans = 2019;
if ((R - L) >= 2018) {
ans = 0;
} else if (Lmod > Rmod) {
ans = 0;
} else {
for (int i = Lmod; i <= Rmod; i++) {
for (int j = Lmod; j ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,683 | 790,684 | u661125964 | cpp |
p02983 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1000000000;
const int MOD = (int)1e9 + 7;
signed main() {
int l, r;
cin >> l >> r;
int L = l % 2019;
int R = r % 2019;
int minV = INF;
if (r - l > 2019) {
cout << 0 << "\n";
}
if (L >= R)
R += 2019;
for (int i... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1000000000;
const int MOD = (int)1e9 + 7;
signed main() {
int l, r;
cin >> l >> r;
int L = l % 2019;
int R = r % 2019;
int minV = INF;
if (r - l >= 2019) {
cout << 0 << "\n";
return 0;
}
if (L >= R)
R += 201... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 790,685 | 790,686 | u422029490 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define mod 2019
// long int min(long int a,long int b)
long int solve(long int l, long int r) {
vector<long int> m;
long int ans = INT_MAX;
for (long int i = l; i <= min(l + 2019, r) + 1; i++) {
for (long int j = i + 1; j <= min(l + 2019, r) + 1; j++)
a... | #include <bits/stdc++.h>
using namespace std;
#define mod 2019
// long int min(long int a,long int b)
long int solve(long int l, long int r) {
vector<long int> m;
long int ans = INT_MAX;
for (long int i = l; i <= min(l + 2019, r); i++) {
for (long int j = i + 1; j <= min(l + 2019, r); j++)
ans = min... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"call.arguments.change"
] | 790,691 | 790,692 | u453299312 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
long long ans = 0;
long long L_by_2019 = L / 201... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
long long ans = 0;
long long L_by_2019 = L / 201... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,697 | 790,698 | u430797067 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long int L, R;
long long int lm, rm, ans;
ans = 2019;
cin >> L >> R;
lm = L % 2019;
rm = R % 2019;
if (rm - lm > 2018) {
ans = 0;
} else if (lm > rm) {
ans = 0;
}
if (ans != 0) {
for (int i = lm;... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long int L, R;
long long int lm, rm, ans;
ans = 2019;
cin >> L >> R;
lm = L % 2019;
rm = R % 2019;
if (R - L > 2018) {
ans = 0;
} else if (lm > rm) {
ans = 0;
}
if (ans != 0) {
for (int i = lm; i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 790,705 | 790,706 | u431042158 | cpp |
p02983 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include ... | [] | 790,707 | 790,708 | u054652697 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r, l2, r2, diff, i, rival, j, j2, i2;
int ans;
cin >> l >> r;
l2 = l % 2019;
r2 = r % 2019;
diff = r - l;
if (diff > 2019) {
diff = 2019;
}
ans = (l2 * r2) % 2019;
for (j = l2; j <= l2 + diff - 1; j++) {
j2 = j % 20... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r, l2, r2, diff, i, rival, j, j2, i2;
int ans;
cin >> l >> r;
l2 = l % 2019;
r2 = r % 2019;
diff = r - l;
if (diff > 2019) {
diff = 2019;
}
ans = (l2 * r2) % 2019;
for (j = l2; j <= l2 + diff - 1; j++) {
j2 = j % 20... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 790,719 | 790,720 | u018807058 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r, l2, r2, diff, i, rival, j, j2, i2;
int ans;
cin >> l >> r;
l2 = l % 2019;
r2 = r % 2019;
diff = r - l;
if (diff > 2019) {
diff = 2019;
}
ans = (l2 * r2) % 2019;
for (j = l2; j <= j + diff - 1; j++) {
j2 = j % 201... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r, l2, r2, diff, i, rival, j, j2, i2;
int ans;
cin >> l >> r;
l2 = l % 2019;
r2 = r % 2019;
diff = r - l;
if (diff > 2019) {
diff = 2019;
}
ans = (l2 * r2) % 2019;
for (j = l2; j <= l2 + diff - 1; j++) {
j2 = j % 20... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 790,721 | 790,720 | u018807058 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r, l2, r2, diff, i, rival, j, j2, i2;
int ans;
cin >> l >> r;
l2 = l % 2019;
r2 = r % 2019;
diff = r - l;
if (diff > 2019) {
diff = 2019;
}
ans = (l2 * r2) % 2019;
for (j = l2; j <= diff - 1; j++) {
j2 = j % 2019;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r, l2, r2, diff, i, rival, j, j2, i2;
int ans;
cin >> l >> r;
l2 = l % 2019;
r2 = r % 2019;
diff = r - l;
if (diff > 2019) {
diff = 2019;
}
ans = (l2 * r2) % 2019;
for (j = l2; j <= l2 + diff - 1; j++) {
j2 = j % 20... | [
"control_flow.loop.for.condition.change"
] | 790,722 | 790,720 | u018807058 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long l, r;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
} else {
vector<long> num(r - l + 1);
for (long i = 0; i < r - l + 1; i++) {
num[i] = (l + i) % 2019;
}
long ans = 5000000;
for (long i = 0; i < r - l; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long l, r;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
} else {
vector<long> num(r - l + 1);
for (long i = 0; i < r - l + 1; i++) {
num[i] = (l + i) % 2019;
}
long ans = 5000000;
for (long i = 0; i < r - l; i++) ... | [
"call.arguments.change",
"call.arguments.add"
] | 790,723 | 790,724 | u637284188 | cpp |
p02983 | /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define vvi vector<vector<int>>
#define FZ(n) memset((n), 0, sizeof())
#define FMO(n) me... | /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define vvi vector<vector<int>>
#define FZ(n) memset((n), 0, sizeof())
#define FMO(n) me... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 790,735 | 790,736 | u210484769 | cpp |
p02983 | /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define vvi vector<vector<int>>
#define FZ(n) memset((n), 0, sizeof())
#define FMO(n) me... | /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
//#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define vvi vector<vector<int>>
#define FZ(n) memset((n), 0, sizeof())
#define FMO(n) me... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 790,737 | 790,736 | u210484769 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define REP(i, n) for (int i = 0; i < (n); i++)
#define SREP(i, s) for (int i = 0; i < (s.size()); i++)
#define SORT(v, n) sort(v, v + n);
#define GSORT(v, n) sort(v, v + n, greater<int>());
#define VSORT(v) sort(v.begin(), v.end());
#define VGSO... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define REP(i, n) for (int i = 0; i < (n); i++)
#define SREP(i, s) for (int i = 0; i < (s.size()); i++)
#define SORT(v, n) sort(v, v + n);
#define GSORT(v, n) sort(v, v + n, greater<int>());
#define VSORT(v) sort(v.begin(), v.end());
#define VGSO... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 790,743 | 790,744 | u398211442 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i <... | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i <... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 790,747 | 790,748 | u556660175 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
long long l, r;
cin >> l >> r;
long long mod = 2019;
bool frag = false;
long long minNum = -1;
for (long long i = l; i < r + 1; i++) {
if (i % mod ==... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
long long l, r;
cin >> l >> r;
long long mod = 2019;
bool frag = false;
long long minNum = -1;
for (long long i = l; i < r + 1; i++) {
if (i % mod ==... | [
"assignment.change"
] | 790,782 | 790,783 | u205912769 | cpp |
p02983 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 790,799 | 790,800 | u300866293 | cpp |
p02983 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 790,801 | 790,800 | u300866293 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = 2019;
for (int i = a; i < min(b, a + 2019); i++) {
for (int j = i + 1; j < min(b, a + 2019 + 1); j++) {
c = min(c, i % 2019 * (j % 2019) % 2019);
}
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = 2019;
for (int i = a; i < min(b, a + 2019); i++) {
for (int j = i + 1; j < min(b + 1, a + 2019 + 1); j++) {
c = min(c, i % 2019 * (j % 2019) % 2019);
}
}
cout << c << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 790,802 | 790,803 | u322177979 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
bool modx(lint l, lint r, lint x) {
if (l % x + (r - l) >= x || l % x == 0 || r % x == 0) {
retu... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
bool modx(lint l, lint r, lint x) {
if (l % x + (r - l) >= x || l % x == 0 || r % x == 0) {
retu... | [
"literal.number.change",
"variable_declaration.value.change"
] | 790,817 | 790,818 | u517411077 | cpp |
p02983 | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = unsigned long long;
const long long INF = 1LL << 60;
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 ... | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = unsigned long long;
const long long INF = 1LL << 60;
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 ... | [
"call.arguments.change",
"assignment.change"
] | 790,819 | 790,820 | u720721463 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, ans = 2019;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0;
} else {
for (int i = l; i <= r; i++) {
for (int j = l + 1; j <= r; j++) {
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
}
cout << ans << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, ans = 2019;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0;
} else {
for (int i = l; i <= r - 1; i++) {
for (int j = l + 1; j <= r; j++) {
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
}
cout << ans <<... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 790,821 | 790,822 | u249546633 | cpp |
p02983 | #include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
long long int anser = 2020 * 2020;
long long int ans;
for (int i = a; i < b && i < a + 2020; i++) {
for (int j = a + 1; j < b && j < a + 2020; j++) {
ans = ((i % 2019) * (... | #include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
long long int anser = 2020 * 2020;
long long int ans;
for (int i = a; (i < b && i < a + 2020); i++) {
for (int j = a + 1; (j <= b && j < a + 2020); j++) {
ans = ((i % 2019... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 790,825 | 790,826 | u048128931 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (long long(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = max((a), (b))
#define chmin(a,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (long long(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = max((a), (b))
#define chmin(a,... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 790,829 | 790,830 | u943094398 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (long long(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = max((a), (b))
#define chmin(a,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (long long(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = max((a), (b))
#define chmin(a,... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change"
] | 790,831 | 790,830 | u943094398 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
ll l, r;
cin >> l >> r;
ll imn = min(r - 1, l + 2030);
ll a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
ll l, r;
cin >> l >> r;
ll imn = min(r - 1, l + 2030);
ll a... | [
"assignment.change"
] | 790,834 | 790,835 | u214304095 | cpp |
p02983 | #include <cmath>
#include <iostream>
using namespace std;
long long int l, r;
long long int mn = 0x3f3f3f3f;
int main() {
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else if (r - l == 1)
cout << (l * r) % 2019 << endl;
else {
for (long long int i = l; i < r - 1; i++) {
for (long lon... | #include <cmath>
#include <iostream>
using namespace std;
long long int l, r;
long long int mn = 0x3f3f3f3f;
int main() {
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else if (r - l == 1)
cout << (l * r) % 2019 << endl;
else {
for (long long int i = l; i < r; i++) {
for (long long in... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,840 | 790,841 | u817334641 | cpp |
p02983 | #include <cmath>
#include <iostream>
using namespace std;
long long int l, r;
long long int mn = 0x3f3f3f3f;
int main() {
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else if (r - l == 1)
cout << ((l * r) % 2019) << endl;
else {
for (long long int i = l; i < r - 1; i++) {
for (long l... | #include <cmath>
#include <iostream>
using namespace std;
long long int l, r;
long long int mn = 0x3f3f3f3f;
int main() {
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else if (r - l == 1)
cout << (l * r) % 2019 << endl;
else {
for (long long int i = l; i < r; i++) {
for (long long in... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,842 | 790,841 | u817334641 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 2019;
ll a[2] = {3, 673};
int main() {
ll L, R;
cin >> L >> R;
if (R - L + 1 >= mod) {
cout << 0 << endl;
return 0;
}
if (R - L == 1) {
cout << R * L % mod << endl;
return 0;
}
ll b = L % a[1] == 0 ? L : L + (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 2019;
ll a[2] = {3, 673};
int main() {
ll L, R;
cin >> L >> R;
if (R - L + 1 >= mod) {
cout << 0 << endl;
return 0;
}
if (R - L == 1) {
cout << R * L % mod << endl;
return 0;
}
ll b = L % a[1] == 0 ? L : L + (... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,852 | 790,851 | u084968244 | cpp |
p02983 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b;
int c = 2019;
cin >> a >> b;
if (b / 2019 != a / 2019) {
cout << 0 << endl;
return 0;
}
a %= 2019;
b %= 2019;
for (int i = a; i < b; i++)
for (int j = i + 1; j <= b; j++) {
int d = (a * b) % 2019;
if... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b;
int c = 2019;
cin >> a >> b;
if (b / 2019 != a / 2019) {
cout << 0 << endl;
return 0;
}
a %= 2019;
b %= 2019;
for (int i = a; i < b; i++)
for (int j = i + 1; j <= b; j++) {
int d = (i * j) % 2019;
if... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 790,862 | 790,863 | u300590099 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b;
cin >> i >> j;
a = i % 2019;
b = j % 2019;
int mini = 2018;
for (int k = a; k < b + 1; k++) {
for (int l = a + 1; l < b + 1; l++) {
mini = min(((k * l) % 2019), mini);
}
}
if (b <= a)
mini = 0;
if (j - i >... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b;
cin >> i >> j;
a = i % 2019;
b = j % 2019;
int mini = 2018;
for (int k = a; k < b; k++) {
for (int l = a + 1; l < b + 1; l++) {
mini = min(((k * l) % 2019), mini);
}
}
if (b <= a)
mini = 0;
if (j - i >= 20... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 790,899 | 790,900 | u594803920 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b;
cin >> i >> j;
a = i % 2019;
b = j % 2019;
int mini = 2018;
for (int k = a; k < b + 1; k++) {
for (int l = a + 1; l < b + 1; l++) {
mini = min(((k * l) % 2019), mini);
}
}
if (b <= a)
mini = 0;
if (j - i >... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b;
cin >> i >> j;
a = i % 2019;
b = j % 2019;
int mini = 2018;
for (int k = a; k < b; k++) {
for (int l = a + 1; l < b + 1; l++) {
mini = min(((k * l) % 2019), mini);
}
}
if (b <= a)
mini = 0;
if (j - i >= 20... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 790,901 | 790,900 | u594803920 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b;
cin >> i >> j;
a = i % 2019;
b = j % 2019;
int mini = 2018;
for (int k = a; k < b + 1; k++) {
for (int l = a + 1; l < b + 1; l++) {
mini = min(((k * l) % 2019), mini);
}
}
if (b <= a)
mini = 0;
if (b - a >... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b;
cin >> i >> j;
a = i % 2019;
b = j % 2019;
int mini = 2018;
for (int k = a; k < b; k++) {
for (int l = a + 1; l < b + 1; l++) {
mini = min(((k * l) % 2019), mini);
}
}
if (b <= a)
mini = 0;
if (j - i >= 20... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 790,902 | 790,900 | u594803920 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r >= l + 2019) {
cout << 0;
return 0;
}
long long mini = 1000000000;
for (long long i = l; i <= r; i += 1) {
for (long long j = l + 1; j <= r; j += 1) {
long long val = i * j;
val %= 2019;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r >= l + 2019) {
cout << 0;
return 0;
}
long long mini = 1000000000;
for (long long i = l; i <= r; i += 1) {
for (long long j = i + 1; j <= r; j += 1) {
long long val = i * j;
val %= 2019;
... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 790,903 | 790,904 | u689442090 | cpp |
p02983 | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#d... | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#d... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 790,905 | 790,906 | u841421760 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
// Repetitions
#define FOR(i, a, n) for (ll i = ((ll)a); i < ((ll)n); ++i)
#define FORR(i, s, g) for (ll i = ((ll)s - 1); i >= ((ll)g); --i)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) FORR(i, n, 0)
// Container Utils
#define ALL(v) (v).begin(), (v).end()
#define R... | #include <bits/stdc++.h>
using namespace std;
// Repetitions
#define FOR(i, a, n) for (ll i = ((ll)a); i < ((ll)n); ++i)
#define FORR(i, s, g) for (ll i = ((ll)s - 1); i >= ((ll)g); --i)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) FORR(i, n, 0)
// Container Utils
#define ALL(v) (v).begin(), (v).end()
#define R... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 790,907 | 790,908 | u203062059 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, D;
cin >> L >> D;
if (D - L >= 2018) {
cout << 0;
return 0;
}
int min = 2018;
int l = L % 2019;
int d = D % 2019;
if (d - l <= 0) {
cout << 0;
return 0;
}
for (int i = 0; i < (d - l); i++) {
for (int j = i + 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, D;
cin >> L >> D;
if (D - L >= 2018) {
cout << 0;
return 0;
}
int min = 2018;
int l = L % 2019;
int d = D % 2019;
if (d - l <= 0) {
cout << 0;
return 0;
}
for (int i = 0; i < (d - l); i++) {
for (int j = i + 1... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 790,925 | 790,926 | u947426792 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, D;
cin >> L >> D;
if (D - L >= 2018) {
cout << 0;
return 0;
}
int min = 2018;
int l = L % 2019;
int d = D % 2019;
if (d - l <= 0) {
cout << 0;
return 0;
}
for (int i = 0; i <= (d - l); i++) {
for (int j = i + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, D;
cin >> L >> D;
if (D - L >= 2018) {
cout << 0;
return 0;
}
int min = 2018;
int l = L % 2019;
int d = D % 2019;
if (d - l <= 0) {
cout << 0;
return 0;
}
for (int i = 0; i < (d - l); i++) {
for (int j = i + 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 790,927 | 790,926 | u947426792 | cpp |
p02983 | // include
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numer... | // include
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numer... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 790,932 | 790,933 | u946378574 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1000000007
// P pa(114,514); ,vector<P>vec(N,0);
// vector<vector<int>> vec(縦, vector<int>(横));
#define REP(i, N) for (int i = 0; i < N; i++)
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
while (b % a != 0) {
b %= a;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1000000007
// P pa(114,514); ,vector<P>vec(N,0);
// vector<vector<int>> vec(縦, vector<int>(横));
#define REP(i, N) for (int i = 0; i < N; i++)
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
while (b % a != 0) {
b %= a;
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 790,949 | 790,950 | u503022110 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll l, r;
cin >> l >> r;
ll i = l % 2019;
ll j = r % 2019;
ll ans = INT_MAX;
if ((r - l + 1) >= 2019) {
cout << 0 << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll l, r;
cin >> l >> r;
ll i = l % 2019;
ll j = r % 2019;
ll ans = INT_MAX;
if ((r - l + 1) >= 2019) {
cout << 0 << endl;
ret... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 790,958 | 790,959 | u482090956 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll l, r;
cin >> l >> r;
ll i = l % 2019;
ll j = r % 2019;
ll ans = INT_MAX;
if ((r - l + 1) >= 2019) {
cout << 0 << endl;
} els... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll l, r;
cin >> l >> r;
ll i = l % 2019;
ll j = r % 2019;
ll ans = INT_MAX;
if ((r - l + 1) >= 2019) {
cout << 0 << endl;
ret... | [
"control_flow.return.add",
"control_flow.return.0.add",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 790,960 | 790,959 | u482090956 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
int l, r;
cin >> l >> r;
if (r - l + 1 > 2050) {
cout << 0 << endl;
} else {
ll mi = 2019 * 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
ll l, r;
cin >> l >> r;
if (r - l + 1 > 2050) {
cout << 0 << endl;
} else {
ll mi = 2019 * 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <=... | [
"variable_declaration.type.change",
"call.arguments.change",
"call.arguments.add"
] | 790,965 | 790,966 | u376817785 | cpp |
p02983 | #include <iostream>
using namespace std;
const long MOD = 2019;
int main() {
long L, R;
long ans = 2019;
cin >> L >> R;
if ((R - L) >= 2019) {
cout << 0 << endl;
} else {
for (long i = L; i <= R; i++) {
for (long j = i + 1; j <= R; j++) {
long l = i % MOD;
long r = j % MOD;
... | #include <iostream>
using namespace std;
const long MOD = 2019;
int main() {
long L, R;
long ans = 2019;
cin >> L >> R;
if ((R - L) >= 2019) {
cout << 0 << endl;
} else {
for (long i = L; i <= R; i++) {
for (long j = i + 1; j <= R; j++) {
long l = i % MOD;
long r = j % MOD;
... | [] | 790,975 | 790,976 | u693133807 | cpp |
p02983 | #include <iostream>
using namespace std;
const long MOD = 2019;
int main() {
long L, R;
long ans = 2019;
cin >> L >> R;
if ((R - L) >= 2019) {
cout << 0 << endl;
} else {
for (long i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
long l = i % MOD;
long r = j % MOD;
... | #include <iostream>
using namespace std;
const long MOD = 2019;
int main() {
long L, R;
long ans = 2019;
cin >> L >> R;
if ((R - L) >= 2019) {
cout << 0 << endl;
} else {
for (long i = L; i <= R; i++) {
for (long j = i + 1; j <= R; j++) {
long l = i % MOD;
long r = j % MOD;
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change"
] | 790,977 | 790,976 | u693133807 | cpp |
p02983 | #include <iostream>
using namespace std;
const int MOD = 2019;
int main() {
long L, R;
long ans = 2019;
cin >> L >> R;
if ((R - L) >= 2019) {
cout << 0 << endl;
} else {
for (long i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
long l = i % MOD;
long r = j % MOD;
... | #include <iostream>
using namespace std;
const long MOD = 2019;
int main() {
long L, R;
long ans = 2019;
cin >> L >> R;
if ((R - L) >= 2019) {
cout << 0 << endl;
} else {
for (long i = L; i <= R; i++) {
for (long j = i + 1; j <= R; j++) {
long l = i % MOD;
long r = j % MOD;
... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 790,978 | 790,976 | u693133807 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (b - a >= 2019)
cout << "0" << '\n';
else {
int ans = 2018;
for (long long i = a + 1; i <= b; i++) {
for (long long j = a; j <= i; j++) {
if ((i * j) % 2019 < ans)
ans = (i * j) % 2019;
... | #include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (b - a >= 2019)
cout << "0" << '\n';
else {
int ans = 2018;
for (long long i = a + 1; i <= b; i++) {
for (long long j = a; j < i; j++) {
if ((i * j) % 2019 < ans)
ans = (i * j) % 2019;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 790,979 | 790,980 | u477734611 | cpp |
p02983 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define len length()
#define sz size()
#define rng(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) rng(i, 0, n)
#define srt(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define len length()
#define sz size()
#define rng(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) rng(i, 0, n)
#define srt(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin... | [
"assignment.change"
] | 790,981 | 790,982 | u676578971 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
const ll M = 2019;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
ll ans = M - 1;
for (ll l = L; l <= m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
const ll M = 2019;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
ll ans = M - 1;
for (ll l = L; l <= m... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 790,987 | 790,988 | u637771514 | cpp |
p02983 | #include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define pb push_back
#define int long long
#define all(x) (x).begin(), (x).end()
using LL = long long;
using LD = long double;
using pii = pair<int, int>;
using vii = vector<pii>;
const int INF = 1e18;
const int MOD = 2019;
const int N ... | #include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define pb push_back
#define int long long
#define all(x) (x).begin(), (x).end()
using LL = long long;
using LD = long double;
using pii = pair<int, int>;
using vii = vector<pii>;
const int INF = 1e18;
const int MOD = 2019;
const int N ... | [
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 790,997 | 790,996 | u192295874 | cpp |
p02983 | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------... | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 790,998 | 790,999 | u150376070 | cpp |
p02983 | #include <bits/stdc++.h>
#ifndef LOCAL
#pragma GCC optimize(3)
#endif
#define ls (rt << 1)
#define rs (rt << 1) | 1
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1e6 + 100;
const int mod = 1e9 + 7;
ll loc[100][30];
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
fr... | #include <bits/stdc++.h>
#ifndef LOCAL
#pragma GCC optimize(3)
#endif
#define ls (rt << 1)
#define rs (rt << 1) | 1
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1e6 + 100;
const int mod = 1e9 + 7;
ll loc[100][30];
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
fr... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 791,000 | 791,001 | u924249565 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans = 2018;
cin >> a >> b;
if (b - a >= 2019)
puts("0");
else {
for (int i = a; i <= b; i++) {
for (int j = i + 1; j <= b; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
}
cout << ans << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans = 2018;
cin >> a >> b;
if (b - a >= 2019)
puts("0");
else {
for (int i = a; i <= b; i++) {
for (int j = i + 1; j <= b; j++) {
ans = min(ans, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << ans << endl;
... | [] | 791,002 | 791,003 | u432702669 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int l, r;
int main() {
scanf("%d %d", &l, &r);
if (r - l + 1 >= 2019)
printf("0");
else {
int minn = 2020;
for (int i = l; i < r - 1; i++) {
for (int j = i + 1; j < r; j++) {
minn = min(minn, ((i % 2019) * (j % 2019)) % 2019);
}
}
... | #include <bits/stdc++.h>
using namespace std;
int l, r;
int main() {
scanf("%d %d", &l, &r);
if (r - l + 1 >= 2019)
printf("0");
else {
int minn = 2020;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
minn = min(minn, ((i % 2019) * (j % 2019)) % 2019);
}
}
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,006 | 791,007 | u076783581 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019)
cout << 0 << endl;
ll res = numeric_limits<ll>::max();
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
res = min(res, (i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019)
cout << 0 << endl;
else {
ll res = numeric_limits<ll>::max();
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
r... | [
"control_flow.branch.else.add"
] | 791,008 | 791,009 | u235057691 | cpp |
p02983 | //#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// na... | //#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// na... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,014 | 791,015 | u569367525 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,038 | 791,039 | u640323045 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - ... | [
"expression.operation.binary.add"
] | 791,042 | 791,043 | u991974907 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
ll l, r;
cin >> l >> r;
if (l / 2019 < r / 2019) {
cout << 0;
return 0;
}
l %= 2019;
r %= 2019;
ll m = 1e+9;
for (int i = l; i < r - 1; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
ll l, r;
cin >> l >> r;
if (l / 2019 < r / 2019) {
cout << 0;
return 0;
}
l %= 2019;
r %= 2019;
ll m = 1e+9;
for (int i = l; i <= r - 1; ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,044 | 791,045 | u129667379 | cpp |
p02983 | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, k, cc[50000][20], dd[500000], a, b;
char s[500000];
int main() {
scanf("%d%d", &n, &a);
if (n - a >= 2018)
printf("0\n");
else {
n %= 2019;
a %= 2019;
m = 2019;
if (n > a)
printf("0\n");
else {
for (int i = n... | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, k, cc[50000][20], dd[500000], a, b;
char s[500000];
int main() {
scanf("%d%d", &n, &a);
if (a - n >= 2018)
printf("0\n");
else {
n %= 2019;
a %= 2019;
m = 2019;
if (n > a)
printf("0\n");
else {
for (int i = n... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 791,050 | 791,051 | u704549083 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<cha... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<cha... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 791,052 | 791,053 | u644070128 | cpp |
p02983 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 2019;
signed main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
l %= mod;
r %= mod;
if (r < l)
r += mod;
int ans = 2020;
for (int i = l; i <= r; ++i) {
for (int j = ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 2019;
signed main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
l %= mod;
r %= mod;
if (r < l)
r += mod;
int ans = 2020;
for (int i = l; i <= r; ++i) {
for (int j = ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,054 | 791,055 | u698760125 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ... | [
"assignment.change"
] | 791,058 | 791,059 | u953587543 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll p, q;
cin >> p >> q;
ll ans = 1e16;
if (q - p >= 2019)
cout << 0;
else {
for (ll i = p; i <= q; i++) {
for (ll j = p + 1; j <= q; j++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll p, q;
cin >> p >> q;
ll ans = 1e16;
if (q - p >= 2019)
cout << 0;
else {
for (ll i = p; i <= q; i++) {
for (ll j = i + 1; j <= q; j++) {
... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,066 | 791,067 | u221372861 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll p, q;
cin >> p >> q;
ll ans = 1e16;
if (q - p >= 2019)
cout << 0;
else {
for (ll i = p; i <= q; i++) {
for (ll j = p + 1; j <= q; j++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll p, q;
cin >> p >> q;
ll ans = 1e16;
if (q - p >= 2019)
cout << 0;
else {
for (ll i = p; i <= q; i++) {
for (ll j = i + 1; j <= q; j++) {
... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,068 | 791,067 | u221372861 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#de... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#de... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,090 | 791,091 | u764234894 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
int n, d;
long long x[30][30];
int main() {
ios_base::sync_with_std... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
int n, d;
long long x[30][30];
int main() {
ios_base::sync_with_std... | [] | 791,092 | 791,093 | u432617434 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int L, R;
cin >> L >> R;
int mmin = 2020;
for (int i = L; i <= min(L + 2030, R); i++) {
for (int j = i + 1; j < min(i + 2030, R); j++) {
int val = 1LL * i * j % 2019;
mmin = min(mmin, val);
}
}
cout << mmin << endl;
return... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int L, R;
cin >> L >> R;
int mmin = 2020;
for (int i = L; i <= min(L + 2030, R); i++) {
for (int j = i + 1; j <= min(i + 2030, R); j++) {
int val = 1LL * i * j % 2019;
mmin = min(mmin, val);
}
}
cout << mmin << endl;
retur... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,094 | 791,095 | u305757380 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
ostream &operator<<(ostream &out, string str) {
for (char c : str)
cout << c;
return out;
}
template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template <class T>
auto operator... | #include <bits/stdc++.h>
using namespace std;
ostream &operator<<(ostream &out, string str) {
for (char c : str)
cout << c;
return out;
}
template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template <class T>
auto operator... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 791,096 | 791,097 | u765393825 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
long long m = 1000000000;
for (long long i = l; i < r + 1; i++) {
for (long long j = l + 1; j < r + 1; j++) {
long long tmp = ((i % 2019) * ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r - l >= 2018) {
cout << 0 << endl;
return 0;
}
long long m = 1000000000;
for (long long i = l; i < r + 1; i++) {
for (long long j = i + 1; j < r + 1; j++) {
long long tmp = ((i % 2019) * (j %... | [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,105 | 791,106 | u679245300 | cpp |
p02983 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int mod = 2019;
int l, r;
cin >> l >> r;
if (r - l <= 2019) {
cout << 0 << endl;
return 0;
}
l = l % mod;
r = r % mod;
if (l >= r) {
cout << 0 << endl;
retur... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int mod = 2019;
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
l = l % mod;
r = r % mod;
if (l >= r) {
cout << 0 << endl;
retur... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,127 | 791,128 | u639426108 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define... | [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,131 | 791,132 | u139031151 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 791,133 | 791,134 | u550398291 | cpp |
p02983 | #include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll... | #include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 791,135 | 791,136 | u262288723 | cpp |
p02983 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.remove",
"assignment.change"
] | 791,137 | 791,138 | u956947269 | cpp |
p02983 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include... | [
"identifier.change",
"call.function.change",
"assignment.change"
] | 791,139 | 791,138 | u956947269 | cpp |
p02983 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include... | [
"assignment.change"
] | 791,140 | 791,141 | u956947269 | cpp |
p02983 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include... | [
"identifier.change",
"call.function.change",
"assignment.change"
] | 791,137 | 791,141 | u956947269 | cpp |
p02983 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 791,139 | 791,141 | u956947269 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,145 | 791,146 | u966097196 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), ... | #include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), ... | [
"call.arguments.change",
"call.arguments.add"
] | 791,149 | 791,150 | u276588887 | cpp |
p02983 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int l, r, mi = 2019;
cin >> l >> r;
if (r - l >= 2019)
cout << "0";
else
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= r; j++) {
if (((i % 2019) * (j % 2019)) % 2019 < mi)
mi = ((i % 2019) * (j % 2019... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int l, r, mi = 2019;
cin >> l >> r;
if (r - l >= 2019)
cout << "0";
else {
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= r; j++) {
if (((i % 2019) * (j % 2019)) % 2019 < mi)
mi = ((i % 2019) * (j % 20... | [] | 791,151 | 791,152 | u730298763 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int ans = 2019;
int l, r;
if (R - L + 1 >= 2019)
cout << 0 << endl;
else {
for (int i = L; i < R; i++) {
for (int j = i + 1; j <= R; j++) {
l = i % 2019;
r = j % 2019;
ans = min(ans, (l... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
int ans = 2019;
int l, r;
if (R - L + 1 >= 2019)
cout << 0 << endl;
else {
for (int i = L; i < R; i++) {
for (int j = i + 1; j <= R; j++) {
l = i % 2019;
r = j % 2019;
ans = m... | [
"variable_declaration.type.widen.change"
] | 791,153 | 791,154 | u055447809 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#include <unordered_set>
using namespace std;
constexpr size_t kMod = 2019;
int main() {
size_t L, R;
cin >> L >> R;
if ((L % kMod == 0) || (R - L) >= 2019) {
cout << 0 << endl;
return 0;
}
if (R - L == 1) {
cout << (L * R) % kMod << endl;
return 0... | #include <algorithm>
#include <iostream>
#include <unordered_set>
using namespace std;
constexpr size_t kMod = 2019;
int main() {
size_t L, R;
cin >> L >> R;
if ((L % kMod == 0) || (R - L) >= kMod) {
cout << 0 << endl;
return 0;
}
if (R - L == 1) {
cout << (L * R) % kMod << endl;
return 0... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,175 | 791,176 | u840713046 | cpp |
p02983 | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 11111111111;
const int c_mINF = -11111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int... | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 11111111111;
const int c_mINF = -11111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int... | [
"control_flow.branch.else.add"
] | 791,181 | 791,182 | u433195318 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
... | [
"assignment.change"
] | 791,188 | 791,189 | u413763374 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (n); ++(i))
#define FOR(i, n) for (int i = 1; (i) <= (n); ++(i))
#define dump(x) cout << #x << " =... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (n); ++(i))
#define FOR(i, n) for (int i = 1; (i) <= (n); ++(i))
#define dump(x) cout << #x << " =... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 791,190 | 791,191 | u697232864 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
... | [
"assignment.change"
] | 791,200 | 791,201 | u719183609 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int res = 2019;
if (R - L >= 2019) {
cout << 0 << endl;
} else {
int N = R - L + 1;
vector<int> cands;
for (long long i = L; i <= R; ++i) {
cands.push_back(i % 2019);
}
for (int i = 0; i < N... | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int res = 2019;
if (R - L >= 2019) {
res = 0;
} else {
int N = R - L + 1;
vector<int> cands;
for (long long i = L; i <= R; ++i) {
cands.push_back(i % 2019);
}
for (int i = 0; i < N - 1; ++i)... | [
"expression.operation.binary.remove"
] | 791,204 | 791,205 | u785773061 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
#de... | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,217 | 791,218 | u282860133 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll l, r;
cin >> l >> r;
if (l % 2019 == 0 || r % 2019 == 0 || l == 0) {... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll l, r;
cin >> l >> r;
if (l % 2019 == 0 || r % 2019 == 0 || l == 0) {... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 791,225 | 791,226 | u666625234 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(... | [
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,242 | 791,243 | u961528573 | cpp |
p02983 | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,260 | 791,261 | u209713918 | cpp |
p02983 | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,262 | 791,261 | u209713918 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void FastInputOutput() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
inline int D() {
int t;
scanf("%d", &t);
return t;
}
inline ll LLD() {
ll t;
scanf("%lld", &t);
return t;
}
inline ll power(ll x, ll p, ll m) {
ll re... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void FastInputOutput() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
inline int D() {
int t;
scanf("%d", &t);
return t;
}
inline ll LLD() {
ll t;
scanf("%lld", &t);
return t;
}
inline ll power(ll x, ll p, ll m) {
ll re... | [
"call.add",
"call.arguments.add"
] | 791,289 | 791,290 | u841802158 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1,... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1,... | [
"literal.number.change",
"expression.operation.binary.change"
] | 791,293 | 791,294 | u914173586 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1,... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1,... | [
"variable_declaration.type.change",
"literal.number.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 791,295 | 791,294 | u914173586 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.