problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02983 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) ... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) ... | replace | 78 | 79 | 78 | 79 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const ll MOD = (ll)(2019);
ll l, r;
ll ans;
int main(void) {
// Here your code !
scanf("%lld %lld", &l, &r);
ans = INF;
for (ll i = l; i <= min(r - 1, i + MOD - 1); ++i)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const ll MOD = (ll)(2019);
ll l, r;
ll ans;
int main(void) {
// Here your code !
scanf("%lld %lld", &l, &r);
ans = INF;
for (ll i = l; i <= l + MOD - 1; ++i) {
for (... | replace | 20 | 22 | 20 | 24 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a... | #include <bits/stdc++.h>
#define ll long long
#define speed_up \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, a... | replace | 15 | 16 | 15 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespa... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespa... | replace | 77 | 78 | 77 | 78 | TLE | |
p02983 | C++ | Time Limit Exceeded | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | replace | 126 | 130 | 126 | 128 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) ... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) ... | replace | 31 | 32 | 31 | 32 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 2019;
void solve(long long L, long long R) {
long long ans = 1000000000;
for (long long i = L; i <= R - 1; i++) {
for (long long j = i + 1; j <= R; j++) {
if (ans > (i * j) % MOD)
ans = (i * j) % MOD;
if (ans == 0)
... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 2019;
void solve(long long L, long long R) {
long long ans = 1e9;
if (R - L > 2019) {
cout << 0 << endl;
return;
}
for (long long i = L; i <= R - 1; i++) {
for (long long j = i + 1; j <= R; j++) {
if (ans > (i * j) % MOD)
... | replace | 6 | 7 | 6 | 12 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define N 100010
#define INF 10000000000
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) int(x.size())
#define IN(a) cin >> (a)
#define OUT(a) cout << (a) << endl
typedef pair<int, int> P;
const int M... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define N 100010
#define INF 10000000000
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) int(x.size())
#define IN(a) cin >> (a)
#define OUT(a) cout << (a) << endl
typedef pair<int, int> P;
const int M... | replace | 17 | 18 | 17 | 18 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = a; i <= (int)(b); i++)
int main() {
int l, r;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
return 0;
}
int ans = 1001001001;
repi(i, l, r - 1) repi(j, i +... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = a; i <= (int)(b); i++)
int main() {
int l, r;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
return 0;
}
int ans = 1001001001;
repi(i, l, r - 1) repi(j, i +... | replace | 16 | 20 | 16 | 20 | TLE | |
p02983 | C++ | Time Limit Exceeded | /* When Talent doesn't work, Hard work beats Talent*/
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
#define Fast_D cout << fixed << setprecision(13);
#define FastIO ... | /* When Talent doesn't work, Hard work beats Talent*/
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
#define Fast_D cout << fixed << setprecision(13);
#define FastIO ... | replace | 33 | 34 | 33 | 34 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define Imax 2147483... | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define Imax 2147483... | replace | 57 | 58 | 57 | 58 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long ll;
int a[N], n, m, sum, ans, l, r;
char s[N];
int main() {
int ans = 2019;
scanf("%d%d", &l, &r);
for (int i = l; i < min(l + 2019, r + 1); i++) {
for (int j = i + 1; j < min(j + 2019, r + 1); j++) {
int curr =... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long ll;
int a[N], n, m, sum, ans, l, r;
char s[N];
int main() {
int ans = 2019;
scanf("%d%d", &l, &r);
for (int i = l; i < min(l + 2019, r + 1); i++) {
for (int j = i + 1; j < min(i + 2019, r + 1); j++) {
int curr =... | replace | 16 | 17 | 16 | 17 | TLE | |
p02983 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
ll L, R;
cin >> L >> R;
ll ans = 1 << 30;
for (ll i = L; i <= R; ++i) {
for (ll j = i + 1; j <= R; ++j) {
ll tmp = i * j % 2019;
... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
ll L, R;
cin >> L >> R;
ll ans = 1 << 30;
for (ll i = L; i <= R; ++i) {
for (ll j = i + 1; j <= R; ++j) {
ll tmp = i * j % 2019;
... | replace | 17 | 19 | 17 | 21 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <cstring>
#include <iostream>
#include <map> // pair
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
... | #include <algorithm>
#include <algorithm> // sort
#include <cmath>
#include <cstring>
#include <iostream>
#include <map> // pair
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
... | replace | 39 | 40 | 39 | 40 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define repd(i, a, b) for (int i = a; i < int(b); i++)
#define rep(i, n) repd(i, 0, n)
#define VARNAME(v) #v
using P = pair<int, int>;
// constexpr int MOD = 1000000007;
constexpr int MOD = 9982... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define repd(i, a, b) for (int i = a; i < int(b); i++)
#define rep(i, n) repd(i, 0, n)
#define VARNAME(v) #v
using P = pair<int, int>;
// constexpr int MOD = 1000000007;
constexpr int MOD = 9982... | replace | 170 | 171 | 170 | 171 | TLE | |
p02983 | C++ | Time Limit Exceeded | /**
* created: 04 July 2019 20:06:43
**/
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vii;
typedef long long ll;
typedef vector<long long> vl;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vll;... | /**
* created: 04 July 2019 20:06:43
**/
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vii;
typedef long long ll;
typedef vector<long long> vl;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vll;... | insert | 72 | 72 | 72 | 73 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(ALL(x)), (x).end())
#define SORT(x) sort(ALL(x))
#define REV(x) reverse(ALL(x))
#define foreach(it, x) \
for (__typeof((x).begin()) it = (x).begi... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(ALL(x)), (x).end())
#define SORT(x) sort(ALL(x))
#define REV(x) reverse(ALL(x))
#define foreach(it, x) \
for (__typeof((x).begin()) it = (x).begi... | replace | 23 | 24 | 23 | 24 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l == r - 1)
cout << (l * r) % 2019 << endl;
else if (l - r >= 673)
cout << "0" << endl;
else {
long long min = INT_MAX;
for (int i = l; i <= r; i++) {
for (int j... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l == r - 1)
cout << (l * r) % 2019 << endl;
else if (r - l >= 673)
cout << "0" << endl;
else {
long long min = INT_MAX;
for (int i = l; i <= r; i++) {
for (int j... | replace | 11 | 12 | 11 | 12 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | replace | 34 | 35 | 34 | 35 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long result = l * (l + 1) % 2019;
for (long long i = l; i <= r; i++) {
for (long long j = i + 1; j <= r; j++) {
long long v = (i * j) % 2019;
if (result > v) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long result = l * (l + 1) % 2019;
for (long long i = l; i <= r && i <= l + 2019; i++) {
for (long long j = i + 1; j <= r && j <= i + 2019; j++) {
long long v = (i * j) % ... | replace | 11 | 13 | 11 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
long long l, r;
long long minn = 1e16;
int main() {
cin >> l >> r;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
long long ANS = ((i % 2019) * (j % 2019)) % 2019;
if (ANS < minn)
mi... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
long long l, r;
long long minn = 1e16;
int main() {
cin >> l >> r;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
long long ANS = ((i % 2019) * (j % 2019)) % 2019;
if (ANS < minn)
mi... | insert | 13 | 13 | 13 | 17 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
int ans = 2018;
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j <= r; j++) {
int num = i * j % 2019;
ans = min(ans, num);
if (ans == 0)
break;
}
}
cou... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
int ans = 2018;
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j <= r; j++) {
int num = i * j % 2019;
ans = min(ans, num);
if (ans == 0)
break;
}
if (a... | insert | 16 | 16 | 16 | 18 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
ll l, r;
cin >> l >> r;
ll i_max = min(r ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(20);
ll l, r;
cin >> l >> r;
ll i_max = min(r ... | replace | 13 | 14 | 13 | 14 | TLE | |
p02983 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define max(x, y) (x > y ? x : y)
#define min(x, y) (x < y ? x : y)
int main() {
long long int L, R;
long long int ans = 1000000000000;
scanf("%lld%lld", &L, &R);
for (long long int i = L; i < R; i++) {
for (long long int j = i... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define max(x, y) (x > y ? x : y)
#define min(x, y) (x < y ? x : y)
int main() {
long long int L, R;
long long int ans = 1000000000000;
scanf("%lld%lld", &L, &R);
for (long long int i = L; i < R; i++) {
for (long long int j = i... | replace | 19 | 23 | 19 | 23 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
ll min = 100000000000;
int ans;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
ans = i * j % 2019;
if (ans < min) {
min = ans;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
ll min = 100000000000;
int ans;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
ans = i * j % 2019;
if (ans < min) {
min = ans;
... | replace | 19 | 21 | 19 | 23 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> s... | insert | 26 | 26 | 26 | 27 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll L, R;
ll min = 1e+9;
cin >> L >> R;
for (ll i = L; i <= R - 1; i++) {
for (ll j = i + 1; j <= R; j++) {
ll mod = i * j;
while (mod > 2019) {
mod -= 2019;
}
if (min > mod)
min = mod;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll L, R;
ll min = 1e+9;
cin >> L >> R;
for (ll i = L; i <= R - 1; i++) {
for (ll j = i + 1; j <= R; j++) {
ll mod = (i * j) % 2019;
if (mod == 0) {
cout << mod << endl;
return 0;
}
if (min... | replace | 9 | 12 | 9 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// 990589
// 4076361
const int mod = 2019;
int a[990589 + 10];
int main() {
int l, r;
cin >> l >> r;
int n1 = l / mod;
int n2 = r / mod;
// if(r%mod==0) n2--;
int qq = 0;
// a[qq++]=n*mod;
if (n1 == n2) {
// printf("%d %d\n",(l%mod),((l+1)%mod));
//... | #include <bits/stdc++.h>
using namespace std;
// 990589
// 4076361
const int mod = 2019;
int a[990589 + 10];
int main() {
int l, r;
cin >> l >> r;
int n1 = l / mod;
int n2 = r / mod;
// if(r%mod==0) n2--;
int qq = 0;
// a[qq++]=n*mod;
if (n1 == n2) {
// printf("%d %d\n",(l%mod),((l+1)%mod));
//... | replace | 37 | 39 | 37 | 38 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
inline ll ceil_ll(ll x, ll y) { return (x + y - 1) / y; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << setprecision(8) << setiosflags(ios::fixed);
ll L, R;
cin >> L >> R;
ll min_v = 2018;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
inline ll ceil_ll(ll x, ll y) { return (x + y - 1) / y; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << setprecision(8) << setiosflags(ios::fixed);
ll L, R;
cin >> L >> R;
ll min_v = 2018;
... | replace | 19 | 20 | 19 | 20 | TLE | |
p02983 | C++ | Time Limit Exceeded | /*author: hyperion_1724
date:
*/
// Required Libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// Required namespaces
using namespace std;
using namespace __gnu_pbds;
// Required defines
#define READ... | /*author: hyperion_1724
date:
*/
// Required Libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// Required namespaces
using namespace std;
using namespace __gnu_pbds;
// Required defines
#define READ... | replace | 80 | 81 | 80 | 81 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int l, r, i, j, ans = 2019;
cin >> l >> r;
for (i = l; i < r; i++)
for (j = i + 1; j <= r; j++)
ans = min((i * j) % 2019, ans);
cout << ans;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int l, r, i, j, ans = 2019;
cin >> l >> r;
if (r - l > 2018)
ans = 0;
else {
l = l % 2019;
r = r % 2019;
if (l > r)
ans = 0;
else
for (i = l; i < r; i++)
for (j = i + 1; j <= r; j++)
... | replace | 6 | 9 | 6 | 18 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | replace | 26 | 27 | 26 | 27 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll m = min(l + 4038, r);
ll x = 1000100010;
ll res = 2019;
for (ll i = l; i <= r; ++i) {
for (ll j = i + 1; j <= r; ++j) {
ll x = i * j % 2019;
res = min(res, x);
}
}
cout << res ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll m = min(l + 4038, r);
ll x = 1000100010;
ll res = 2019;
for (ll i = l; i <= m; ++i) {
for (ll j = i + 1; j <= m; ++j) {
ll x = i * j % 2019;
res = min(res, x);
}
}
cout << res ... | replace | 9 | 11 | 9 | 11 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R, ans = 2e9, tmp;
vector<int> v(3000, 0);
cin >> L >> R;
for (int i = L; i <= R; i++) {
tmp = i % 2019;
v[tmp]++;
}
for (int i = 0; i <= 2019; i++) {
for (int j = 0; j <= 2019; j++) {
if (v[i] == 0 || v[j] == 0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, R, ans = 2e9, tmp;
vector<int> v(3000, 0);
cin >> L >> R;
if (R - L > 3000) {
cout << 0 << endl;
return 0;
}
for (int i = L; i <= R; i++) {
tmp = i % 2019;
v[tmp]++;
}
for (int i = 0; i <= 2019; i++) {
for (int j =... | insert | 7 | 7 | 7 | 12 | TLE | |
p02983 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | replace | 41 | 42 | 41 | 42 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
long L, R, ans = 0;
cin >> L >> R;
if (673 > L - R) {
ans = LONG_MAX;
for (long i = L; i < R; ++i) {
for (long j = 1 + L; j <= R; ++j)
ans = min(ans, i * j % 2019);
}
}
cout << ans;
} | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
long L, R, ans = 0;
cin >> L >> R;
if (673 > R - L) {
ans = LONG_MAX;
for (long i = L; i < R; ++i) {
for (long j = 1 + L; j <= R; ++j)
ans = min(ans, i * j % 2019);
}
}
cout << ans;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
typedef pair<long long, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#def... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
typedef pair<long long, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#def... | insert | 104 | 104 | 104 | 108 | TLE | |
p02983 | C++ | Time Limit Exceeded | // ConsoleApplication1.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string... | // ConsoleApplication1.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string... | insert | 315 | 315 | 315 | 320 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
int l, r, i, j, res = 2019 * 2019;
cin >> l >> r;
for (i = l; i < min(l + 2019, r); i++) {
for (j = i + 1; i <= min(l + 2019, r); j++) {
res = min(res, ((i % 2019) * (j % 20... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
int l, r, i, j, res = 2019 * 2019;
cin >> l >> r;
for (i = l; i < min(l + 2019, r); i++) {
for (j = i + 1; j <= min(l + 2019, r); j++) {
res = min(res, ((i % 2019) * (j % 20... | replace | 10 | 11 | 10 | 11 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, n, ou = 2018, tp = 0;
cin >> l >> r;
n = r - l + 1;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j < r + 1; j++) {
tp = (i * j) % 2019;
if (tp < ou)
ou = tp;
}
}
cout << ou << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, n, ou = 2018, tp = 0;
cin >> l >> r;
n = r - l + 1;
if (n > 3000) {
cout << 0 << endl;
return 0;
}
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j < r + 1; j++) {
tp = (i * j) % 2019;
if (tp < ... | insert | 6 | 6 | 6 | 10 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long minmod = 2019;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
minmod = min(minmod, (i * j) % 2019);
if (minmod == 0) {
break;... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long minmod = 2019;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
minmod = min(minmod, (i * j) % 2019);
if (minmod == 0) {
cout <... | replace | 12 | 13 | 12 | 14 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all... | insert | 82 | 82 | 82 | 84 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | insert | 223 | 223 | 223 | 230 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long i = l, j = l + 1, d = ((i % 2019) * (j % 2019)) % 2019,
k = ((r % 2019) + (l % 2019)) % 2019;
if (k > 2019) {
cout << 0;
return 0;
} else {
for (i; i < r; i++) {
for (j = i + 1; j <= ... | #include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
long long i = l, j = l + 1, d = ((i % 2019) * (j % 2019)) % 2019, k = r - l;
if (k >= 2019) {
cout << 0;
return 0;
} else {
for (i; i < r; i++) {
for (j = i + 1; j <= r; j++) {
d = min(((i % 2019) ... | replace | 7 | 10 | 7 | 9 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
int L, R;
cin >> L >> R;
if (R - L > 3000) {
cout << 0 << endl;
}
// (i * j) mod 2019
// (... | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
int L, R;
cin >> L >> R;
if (R - L > 3000) {
cout << 0 << endl;
return (0);
}
// (i * j)... | insert | 14 | 14 | 14 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
const int mod = 2019;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2019 * 2019;
if (l - r >= mod) {
cout << 0 << endl;
return 0;
} e... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
const int mod = 2019;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2019 * 2019;
if (r - l >= mod) {
cout << 0 << endl;
return 0;
} e... | replace | 14 | 15 | 14 | 15 | TLE | |
p02983 | C++ | Runtime Error | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <algorithm>
#include <bitset> // bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <cctype>
#include <climits> // A/Bを計算するときA==LLONG_MIN && B==-1のみ(1ull<<63)で代用
#include <cmath>
#include <cstdio>
#include <cs... | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <algorithm>
#include <bitset> // bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <cctype>
#include <climits> // A/Bを計算するときA==LLONG_MIN && B==-1のみ(1ull<<63)で代用
#include <cmath>
#include <cstdio>
#include <cs... | replace | 132 | 136 | 132 | 147 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
if (L - R >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
int x = (i * j) % 2019;
ans = min(ans, x);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
int x = (i * j) % 2019;
ans = min(ans, x);
... | replace | 7 | 8 | 7 | 8 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
ll l, r;
cin >> l >> r;
ll mod = 2019;
ll mini = 1LL << 60;
int cnt = 0;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll x = i % mod;
ll y = j % mod;
ll e = x * y % mod;
mini = m... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
ll l, r;
cin >> l >> r;
ll mod = 2019;
ll mini = 1LL << 60;
int cnt = 0;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll x = i % mod;
ll y = j % mod;
ll e = x * y % mod;
mini = m... | replace | 18 | 20 | 18 | 22 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2019;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019) {
l %= 2019;
r = l + 2019;
}
ll ans = 2019;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= ... | insert | 10 | 10 | 10 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define ... | replace | 27 | 32 | 27 | 36 | TLE | |
p02983 | C++ | Time Limit Exceeded | // author: zekigurbuz
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<pii> vpii;
typedef queue<int... | // author: zekigurbuz
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<pii> vpii;
typedef queue<int... | replace | 329 | 332 | 329 | 331 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
using ll = long long;
int main() {
ll L, R;
cin >> L >> R;
int a[2019];
for (ll i = 0; i < 2019; i++) {
a[i] = 0;
}
for (ll i = L; i <= R; i++) {
ll temp = i % 2019;
a[temp]++;
}
ll min_value = 2020;
for (ll i = 0; i < 2019; i++) {... | #include <cmath>
#include <iostream>
using namespace std;
using ll = long long;
int main() {
ll L, R;
cin >> L >> R;
int a[2019];
for (ll i = 0; i < 2019; i++) {
a[i] = 0;
}
for (ll i = L; i <= R; i++) {
ll temp = i % 2019;
if (temp == 0) {
cout << 0 << endl;
return 0;
}
a[t... | insert | 14 | 14 | 14 | 18 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
#define ll long long
using namespace std;
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll k = i + 1; k <= R; k++) {
if (i >= k)
continue;
if (ans == 0)
break;
ans = min(ans, (i * k) % 2019);
}
}
cout... | #include <iostream>
#define ll long long
using namespace std;
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2018;
for (ll i = L; i <= R; i++) {
for (ll k = i + 1; k <= R; k++) {
if (i >= k)
continue;
if (ans == 0)
break;
ans = min(ans, (i * k) % 2019);
}
if (ans... | insert | 19 | 19 | 19 | 21 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef lon... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef lon... | replace | 18 | 19 | 18 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int l, r;
cin >> l >> r;
ll ans = 2019;
if (l - r >= 2019) {
cout << 0 << endl;
}
repi... | #include <algorithm>
#include <iomanip>
#include <iostream>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int l, r;
cin >> l >> r;
ll ans = 2019;
if (l - r >= 2019) {
cout << 0 << endl;
}
repi... | replace | 17 | 18 | 17 | 24 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
// cout << setprecision(20) <<
int main() {
ll L, R;
cin >> L >> R;
ll mod_min = 2019;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
mod_min = min(mod_min, i * j % 2019);
}
if (mod... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
// cout << setprecision(20) <<
int main() {
ll L, R;
cin >> L >> R;
ll mod_min = 2019;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
mod_min = min(mod_min, i * j % 2019);
if (mod_min... | insert | 13 | 13 | 13 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | insert | 228 | 228 | 228 | 230 | TLE | |
p02983 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#defi... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#defi... | replace | 292 | 297 | 292 | 312 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
bool a[2020] = {false};
bool isZero = false;
for (long long i = L; i <= R; i++) {
a[i % 2019] = true... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
bool a[2020] = {false};
bool isZero = false;
for (long long i = L; i <= min(R, L + 2019); i++) {
a[i... | replace | 12 | 13 | 12 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 100000000007
int main() {
ll l, r, a = 2019;
cin >> l >> r;
ll ans = inf;
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= r; j++) {
ans = min(ans, (i % a) * (j % a) % a);
}
if (ans == 0) {
break;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 100000000007
int main() {
ll l, r, a = 2019;
cin >> l >> r;
ll ans = inf;
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= r; j++) {
ans = min(ans, (i % a) * (j % a) % a);
if (ans == 0) {
break;
... | insert | 12 | 12 | 12 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>... | #include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>... | replace | 175 | 176 | 175 | 176 | TLE | |
p02983 | C++ | Time Limit Exceeded | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) // 小さい方からソート
#define REV(V) reverse(ALL(V)) // リバース
#define RSORT(V... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) // 小さい方からソート
#define REV(V) reverse(ALL(V)) // リバース
#define RSORT(V... | insert | 104 | 104 | 104 | 106 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pa pair<int, int>
#define F first
#define S second
#define maxth 9999
#define d n % 3
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
ll MIN = 0x8000000;
ll a, b;
if (n - m >= 2019) {
cout << "0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pa pair<int, int>
#define F first
#define S second
#define maxth 9999
#define d n % 3
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
ll MIN = 0x8000000;
ll a, b;
if (m - n >= 2019) {
cout << "0... | replace | 15 | 16 | 15 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | /*
ID: Nipun Paul
LANG: C++
PROB: God knows
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c = 2019;
cin >> a >> b;
for (long long int i = a; i <= b; i++) {
for (long long int j = i + 1; j <= b; j++) {
c = min(c, (i * j) % 2019);
if (c == 0) {
break;
... | /*
ID: Nipun Paul
LANG: C++
PROB: God knows
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c = 2019;
cin >> a >> b;
for (long long int i = a; i <= b; i++) {
for (long long int j = i + 1; j <= b; j++) {
c = min(c, (i * j) % 2019);
if (c == 0) {
break;
... | insert | 19 | 19 | 19 | 22 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <vector>
int main() {
long long L, R;
std::cin >> L >> R;
if (R - L >= 2019) {
std::cout << 0 << std::endl;
return 0;
}
long long l = L % 2019;
long long r = R % 2019;
long long min = 2019;
for (long long i = l; i <= r; ++i, i %= 2019) {
for ... | #include <cmath>
#include <iostream>
#include <vector>
int main() {
long long L, R;
std::cin >> L >> R;
if (R - L >= 2019) {
std::cout << 0 << std::endl;
return 0;
}
long long l = L % 2019;
long long r = R % 2019;
long long min = 2019;
for (long long i = l; i <= r; ++i) {
if (i >= 2019)
... | replace | 17 | 19 | 17 | 24 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int x, y;
int z;
int ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
x = i % 2019;
y = j % 2019;
z =... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int x, y;
int z;
int ans = 2019;
if (r - l > 2020) {
for (int i = 0; i <= 2019; i++) {
for (int j = i + 1; j <= 2019; j++) {
x = i % 2... | replace | 14 | 21 | 14 | 34 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<pair<ll, ll>> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define popcount(x) __builtin_popcountll(x)
const long double PI = acos(-1);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<pair<ll, ll>> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define popcount(x) __builtin_popcountll(x)
const long double PI = acos(-1);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll... | replace | 28 | 30 | 28 | 32 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define INF 2e9
typedef long long ll;
typedef pair<int, int> P;
int main() {
int l, r;
cin >> l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define INF 2e9
typedef long long ll;
typedef pair<int, int> P;
int main() {
int l, r;
cin >> l... | replace | 14 | 15 | 14 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define el "\n"
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define M 1000000007
#define all(v) v.begin(), v.end()
long long pow(long long int a, long long int b, long long int MOD) {
l... | #include <bits/stdc++.h>
using namespace std;
#define el "\n"
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define M 1000000007
#define all(v) v.begin(), v.end()
long long pow(long long int a, long long int b, long long int MOD) {
l... | insert | 36 | 36 | 36 | 42 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define v(dt) vector<dt>
#define pr(x, y) pair<x, y>
#define loop(x, s, e) for (int x = 0; x <= e; x++)
#define in_arr(n) \
loop(i, 0, n - 1) { cin >> a[i]; }
#define out_arr(n) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define v(dt) vector<dt>
#define pr(x, y) pair<x, y>
#define loop(x, s, e) for (int x = 0; x <= e; x++)
#define in_arr(n) \
loop(i, 0, n - 1) { cin >> a[i]; }
#define out_arr(n) ... | replace | 34 | 35 | 34 | 35 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MOD 2019
int main() {
long long l, r, minv;
cin >> l >> r;
minv = l * (l + 1) % MOD;
for (long long i = l; i <= r; i++) {
for (long long j = i + 1; j <= r; j++) {
minv = min(minv, (i * j) % MOD);
if (minv == 0)
break;
}
}
cout... | #include <bits/stdc++.h>
using namespace std;
#define MOD 2019
int main() {
long long l, r, minv;
cin >> l >> r;
minv = l * (l + 1) % MOD;
for (long long i = l; i <= r; i++) {
for (long long j = i + 1; j <= r; j++) {
minv = min(minv, (i * j) % MOD);
if (minv == 0)
break;
}
if (mi... | insert | 13 | 13 | 13 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using ll = long long;
#define rep(i, j, n) for (ll i = (j); i < (n); i++)
#define per(i, n, j) for (ll i = (n); i >= (j); i--)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T ... | #include <bits/stdc++.h>
using ll = long long;
#define rep(i, j, n) for (ll i = (j); i < (n); i++)
#define per(i, n, j) for (ll i = (n); i >= (j); i--)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T ... | replace | 28 | 32 | 28 | 30 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Welcome to my source code!
int main() {
ll l, r;
cin >> l >> r;
if (l - r >= 2019) {
cout << 0 << endl;
return 0;
}
ll ans = 3000;
for (ll i = l; i <= r - 1; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i *... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Welcome to my source code!
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
ll ans = 3000;
for (ll i = l; i <= r - 1; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i *... | replace | 8 | 9 | 8 | 9 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mod (ll)2019
#define inf (ll)(3e18 + 7)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
ll L, R, m = inf;
cin >> L >> R;
for (int i = 0; i < 1000000000; ... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mod (ll)2019
#define inf (ll)(3e18 + 7)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(x) x.begin(), x.end()
using namespace std;
int main() {
ll L, R, m = inf;
cin >> L >> R;
if (R - L >= 2019) {
cout <<... | replace | 13 | 18 | 13 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll L;
ll R;
cin >> L >> R;
if (R - L > 2019) {
cout << 0 << endl;
}
ll ans = INF;
for (ll i = L; i <= R - 1; i++) {
for (ll j = i + 1; j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll L;
ll R;
cin >> L >> R;
if (R - L > 2019) {
cout << 0 << endl;
return 0;
}
ll ans = INF;
for (ll i = L; i <= R - 1; i++) {
for (l... | insert | 18 | 18 | 18 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r / 2019 - l / 2019) {
cout << 0 << endl;
}
long long i, j;
long long min = l * r % 2019;
long long temp;
for (i = l; i <= r - 1; ++i) {
for (j = i + 1; j <= r; ++j) {... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r / 2019 - l / 2019) {
cout << 0 << endl;
return 0;
}
long long i, j;
long long min = l * r % 2019;
long long temp;
for (i = l; i <= r - 1; ++i) {
for (j = i + 1; ... | insert | 10 | 10 | 10 | 11 | TLE | |
p02983 | C++ | Time Limit Exceeded | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void ... | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void ... | replace | 52 | 59 | 52 | 62 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) ... | replace | 101 | 102 | 101 | 102 | TLE | |
p02983 | C++ | Time Limit Exceeded | // 自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i+... | // 自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i+... | replace | 18 | 19 | 18 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main(... | replace | 14 | 15 | 14 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long l, r, i, j, ans = 100009;
cin >> l >> r;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
ans = min(ans, (long long)(i * j) % 2019);
}
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long l, r, i, j, ans = 100009;
cin >> l >> r;
for (i = l; i <= min(l + 2020, r); i++) {
for (j = i + 1; j <= min(i + 2020, r); j++) {
ans = min(ans, (long long)(i * j) % 2019);
}
}
cout ... | replace | 8 | 10 | 8 | 10 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
long long int ans = 3000;
for (long long int ii = L; ii <= R; ii++) {
for (long long int jj = ii + 1; jj <= min(R, ii + 1 + 2019); jj++) {
ans = min(ans, (ii * jj) % 2019);
}
}
cout << ans << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
long long int ans = 3000;
for (long long int ii = L; ii <= min(R, L + 2019); ii++) {
for (long long int jj = ii + 1; jj <= min(R, ii + 1 + 2019); jj++) {
ans = min(ans, (ii * jj) % 2019);
}
}
cout <<... | replace | 7 | 8 | 7 | 8 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll L, R;
cin >> L >> R;
ll num;
ll subLR = R - L;
L %= 2019;
R %= 2019;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll L, R;
cin >> L >> R;
ll num;
ll subLR = R - L;
subLR = min(subLR, (ll)20... | insert | 16 | 16 | 16 | 17 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
if (L - R >= 2018) {
cout << 0 << endl;
return 0;
}
int out = 10000;
for (long long int i = L; i < R + 1; i++) {
for (long long int j = i + 1; j < R + 1; j++) {
int t... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
if (L - R >= 2018) {
cout << 0 << endl;
return 0;
}
int out = 10000;
for (long long int i = L; i < R + 1; i++) {
for (long long int j = i + 1; j < R + 1; j++) {
int t... | insert | 17 | 17 | 17 | 21 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include "stdio.h"
#include <math.h>
#include <stdlib.h>
int main() {
int L, R;
scanf("%d %d", &L, &R);
int valid[2019];
for (int i = 0; i < 2019; i++) {
valid[i] = 0;
}
int mod = 0;
for (int i = L; i <= R; i++) {
mod = i % 2019;
if (valid[mod] < 2) {
valid[mod]++;
}
}
int min... | #include "stdio.h"
#include <math.h>
#include <stdlib.h>
int main() {
int L, R;
scanf("%d %d", &L, &R);
int valid[2019];
for (int i = 0; i < 2019; i++) {
valid[i] = 0;
}
int mod = 0;
if (R - L > 2019 * 2) {
for (int i = 0; i < 2019; i++) {
valid[i] = 2;
}
} else {
for (int i = L;... | replace | 13 | 17 | 13 | 23 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (long long i = (a), i##Len_ = (b); i < i##Len_; i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
int... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (long long i = (a), i##Len_ = (b); i < i##Len_; i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
int... | insert | 19 | 19 | 19 | 30 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (long long i = (a), i##Len_ = (b); i < i##Len_; i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
int... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (long long i = (a), i##Len_ = (b); i < i##Len_; i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
int... | insert | 25 | 25 | 25 | 27 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 2019;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll l, r;
cin >> l >> r;
// map<ll,ll> ma;
in... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 2019;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll l, r;
cin >> l >> r;
// map<ll,ll> ma;
in... | replace | 22 | 23 | 22 | 23 | TLE | |
p02983 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | replace | 210 | 211 | 210 | 212 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
struct edge {
ll to;
char cost... | #include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
struct edge {
ll to;
char cost... | replace | 35 | 38 | 35 | 40 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int INF = 2000000;
bool w[105];
vector<int> v[105];
int main() {
ll l, r;
cin >> l >> r;
ll nin = INF;
while (r > l + 2019 * 10) {
l -= 2019 * 10;
}
while (r > l + 2019) {
l -= 2019;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int INF = 2000000;
bool w[105];
vector<int> v[105];
int main() {
ll l, r;
cin >> l >> r;
ll nin = INF;
if (r > l + 2019) {
cout << 0 << endl;
return 0;
}
for (ll i = l; i < r; i++) {
... | replace | 13 | 18 | 13 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll l, r;
cin >> l >> r;
ll ans;
ll modans = LLONG_MAX;
for (ll x = l; x < r; x++) {
for (ll y = x + 1; y <= r; y++) {
ans = (x * y);
modans = min(modans, (ans % 2019));
}
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll l, r;
cin >> l >> r;
if ((r - l) >= 2019) {
cout << 0;
return 0;
}
l = l % 2019;
r = r % 2019;
ll ans;
ll modans = LLONG_MAX;
for (ll x = l; x < r; x++) {
for (ll y = x + 1; y <= r... | insert | 8 | 8 | 8 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define ... | #include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define ... | insert | 47 | 47 | 47 | 48 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
long long m = LLONG_MAX;
for (long long i = L; i < R; i++) {
for (long long j = i + 1; j <= R; j++) {
l... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
L = L;
R = min(R, L + 2019);
long long m = 2018;
for (long long i = L; i < R; i++) {
for (long long j = i... | replace | 14 | 15 | 14 | 17 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#define int long long
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int l, r;
cin >> l >> r;
if (l - r > 2019)
cout << 0 << endl;
else {
int ans = 2020;
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= ... | #include <algorithm>
#include <iostream>
#define int long long
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int l, r;
cin >> l >> r;
if (r - l > 2019)
cout << 0 << endl;
else {
int ans = 2020;
for (int i = l; i < r; i++) {
for (int j = l + 1; j <= ... | replace | 12 | 13 | 12 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits //stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll cnt = 2019;
bool t = false;
for (ll i = 0; i < r - l; i++) {
for (ll j = 1; j < r - l + 1; j++) {
if ((l + i) * (l + j) == 0) {
cnt = 0... | #include <bits //stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
ll cnt = 2019;
bool t = false;
for (ll i = 0; i < r - l; i++) {
for (ll j = 1; j < r - l + 1; j++) {
if ((l + i) * (l + j) % 2019 == 0) {
... | replace | 12 | 13 | 12 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int a[1001][1001];
int main() {
int a, b;
cin >> a >> b;
int ans = 2020;
for (int i = a; i < b; i++) {
for (int j = i + 1; j <= b; j++) {
ans = min((i % 2019) * (j % 2019) % 2019, ans);
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[1001][1001];
int main() {
int a, b;
cin >> a >> b;
int ans = 2020;
for (int i = a; i < b; i++) {
for (int j = i + 1; j <= b; j++) {
if (ans != 0)
ans = min((i % 2019) * (j % 2019) % 2019, ans);
else {
cout << ans;
retu... | replace | 11 | 12 | 11 | 17 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int exists[2019];
int l, r, min;
cin >> l >> r;
for (int i = 0; i < 2019; i++) {
exists[i] = 0;
}
for (int i = l; i <= r; i++) {
exists[i % 2019] = 1;
}
min = 2019;
for (int i = 0; i < 2018; i++) {
if (exists[i]) {
for (int j ... | #include <iostream>
using namespace std;
int main() {
int exists[2019];
int l, r, min;
cin >> l >> r;
for (int i = 0; i < 2019; i++) {
exists[i] = 0;
}
for (int i = l; i <= r && i <= l + 2019; i++) {
exists[i % 2019] = 1;
}
min = 2019;
for (int i = 0; i < 2018; i++) {
if (exists[i]) {
... | replace | 12 | 13 | 12 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
const int INF = 0x3fffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
#define rrep(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
const int INF = 0x3fffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
#define rrep(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, ... | replace | 28 | 32 | 28 | 34 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.