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>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll l, r, minn = 2020;
cin >> l >> r;
for (ll i = l; i < r; i++) {
for (ll j = r; j > l; j--) {
minn = min(minn, (i * j) % 2019);
// cout<<i*j<<" "<<i*j%2019<<endl;
}
}
cout << m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll l, r, minn = 2020;
cin >> l >> r;
for (ll i = l; i < r; i++) {
for (ll j = r; j > l; j--) {
minn = min(minn, (i * j) % 2019);
if (minn == 0) {
cout << minn;
return 0;... | insert | 10 | 10 | 10 | 14 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define push_back pd
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
int main() {
ll l = 0;
ll r = 0;
constexpr ll waru = 2019;
cin >> l >> r;
ll minValue = 10e10;
for (ll i = l; i < r; ++i) {
for (ll j = i + ... | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define push_back pd
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
int main() {
ll l = 0;
ll r = 0;
constexpr ll waru = 2019;
cin >> l >> r;
ll minValue = 10e10;
for (ll i = l; i < r; ++i) {
for (ll j = i + ... | insert | 19 | 19 | 19 | 23 | TLE | |
p02983 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
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 &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
long long l, r;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
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 &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
long long l, r;
... | insert | 24 | 24 | 24 | 26 | TLE | |
p02983 | Python | Time Limit Exceeded | L, R = map(int, input().split())
# max_loop = 2019 * 2 + 1
max_loop = 2019**2
count = 0
ans = 2019
for i in range(L, R + 1):
for j in range(i + 1, R + 1):
x = (i * j) % 2019
ans = min(ans, x)
if ans == 0:
break
print(ans)
| L, R = map(int, input().split())
# max_loop = 2019 * 2 + 1
max_loop = 2019**2
count = 0
ans = 2019
for i in range(L, R + 1):
for j in range(i + 1, R + 1):
x = (i * j) % 2019
ans = min(ans, x)
if ans == 0:
print(0)
exit()
print(ans)
| replace | 10 | 12 | 10 | 13 | TLE | |
p02983 | Python | Time Limit Exceeded | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
L, R = map(int, input().split())
result = []
for i in range(L, R + 1):
for j in range(i + 1, R + 1):
result.append(i * j % 2019)
print(min(result))
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
L, R = map(int, input().split())
mod = 2019
min_mod = float("inf")
for i in range(L, min(R, L + mod)):
for j in range(i + 1, min(R + 1, i + 1 + mod)):
curr_mod = i * j % mod
min_mod = min(min_mod, curr_mod)
... | replace | 6 | 11 | 6 | 18 | TLE | |
p02983 | Python | Time Limit Exceeded | L, R = map(int, input().split())
a = 0
b = 2019
for i in range(L, R):
for j in range(i + 1, R + 1):
a = i * j % 2019
if a <= b:
b = a
print(b)
| L, R = map(int, input().split())
a = 0
b = 2019
if R - L >= 2018:
b = 0
else:
for i in range(L, R):
for j in range(i + 1, R + 1):
a = i * j % 2019
if a <= b:
b = a
print(b)
| replace | 3 | 8 | 3 | 11 | TLE | |
p02983 | Python | Time Limit Exceeded | #!/usr/bin/env python3
def read_h(typ=int):
return list(map(typ, input().split()))
def read_v(n, m=1, typ=int):
return [read_h() if m > 1 else typ(input()) for _ in range(n)]
def main():
L, R = read_h()
if R % 2019 == 0 or L % 2019 == 0 or (R - L) % 2019 == 0:
print(0)
return
... | #!/usr/bin/env python3
def read_h(typ=int):
return list(map(typ, input().split()))
def read_v(n, m=1, typ=int):
return [read_h() if m > 1 else typ(input()) for _ in range(n)]
def main():
L, R = read_h()
if R - L >= 2019 or R % 2019 <= L % 2019:
print(0)
return
ans = 2019
... | replace | 14 | 15 | 14 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
int l, r;
scanf("%d", &l);
scanf("%d", &r);
int result = 2019;
int mod = 2019;
long i, j;
for (i = l; i < r; i++) {
for (j = l + 1; j <= r; j++) {
mod = (i * j) % 2019;
if (mod < result) {
result = mod;
if (result == 0)
break;
... | #include <stdio.h>
int main() {
int l, r;
scanf("%d", &l);
scanf("%d", &r);
if (r - l >= 2019)
r = l + 2018;
int result = 2019;
int mod = 2019;
long i, j;
for (i = l; i < r; i++) {
for (j = l + 1; j <= r; j++) {
mod = (i * j) % 2019;
if (mod < result) {
result = mod;
... | insert | 6 | 6 | 6 | 9 | TLE | |
p02983 | Python | Time Limit Exceeded | def main():
N, M = map(int, input().split())
ans = -1
for n in range(M)[N:]:
for i in range(M + 1)[n + 1 :]:
mod = n * i % 2019
if ans < 0 or mod < ans:
ans = mod
if mod == 0:
break
print(ans)
if __name__ == "__main__":
main()
| def main():
N, M = map(int, input().split())
ans = -1
for n in range(M)[N:]:
for i in range(M + 1)[n + 1 :]:
mod = n * i % 2019
if ans < 0 or mod < ans:
ans = mod
if ans == 0:
break
if ans == 0:
break
... | replace | 8 | 9 | 8 | 11 | TLE | |
p02983 | Python | Time Limit Exceeded | def make_list(L, R):
mod_list = list()
if R - L <= 2019:
for i in range(L, R):
for j in range(i + 1, R + 1):
mod_list.append((i * j) % 2019)
else:
for i in range(L, R):
for j in range(i + 1, i + 2021):
mod_list.append((i * j) % 2019)
... | def make_list(L, R):
mod_list = list()
if R - L <= 2019:
for i in range(L, R):
for j in range(i + 1, R + 1):
mod_list.append((i * j) % 2019)
else:
for i in range(L, L + 2020):
for j in range(i + 1, i + 2021):
mod_list.append((i * j) % ... | replace | 8 | 9 | 8 | 9 | TLE | |
p02983 | Python | Time Limit Exceeded | L, R = map(int, input().split())
res = float("inf")
for i in range(L, R + 1):
for j in range(i + 1, R + 1):
res = min(res, (i * j) % 2019)
print(res)
| L, R = map(int, input().split())
if R - L >= 2019:
res = 0
else:
res = float("inf")
L = L % 2019
R = R % 2019
for i in range(L, R + 1):
for j in range(i + 1, R + 1):
res = min(res, (i * j) % 2019)
print(res)
| replace | 2 | 6 | 2 | 11 | TLE | |
p02983 | Python | Runtime Error | L, R = [int(_) for _ in input().split()]
diff = R - L
if diff >= 2019:
print("0")
else:
ans = min([i * j % 2019 for j in range(L + 1, R) for i in range(L, R)])
print(ans)
| L, R = [int(_) for _ in input().split()]
diff = R - L
if diff >= 2019:
print("0")
else:
ans = min([i * j % 2019 for j in range(L + 1, R + 1) for i in range(L, R)])
print(ans)
| replace | 6 | 7 | 6 | 7 | 0 | |
p02983 | Python | Time Limit Exceeded | L, R = map(int, input().split())
tmp = R - L + 1
if tmp >= 2019:
print(0)
exit()
else:
start = L % 2019
end = R % 2019
candidate = []
for i in range(start, end + 1):
candidate.append(i % 2019)
candidate.sort()
ans = []
for i in range(len(candidate)):
for j in range(l... | L, R = map(int, input().split())
tmp = R - L + 1
if tmp >= 2019:
print(0)
exit()
else:
start = L % 2019
end = R % 2019
candidate = []
for i in range(start, end + 1):
candidate.append(i % 2019)
candidate.sort()
ans = []
for i in range(len(candidate)):
if i == (len(can... | replace | 15 | 16 | 15 | 18 | TLE | |
p02983 | Python | Time Limit Exceeded | def slove():
import sys
input = sys.stdin.readline
l, r = list(map(int, input().rstrip("\n").split()))
mmod = 10**10
for i in range(l, r + 1):
for j in range(i + 1, r + 1):
mmod = min(mmod, (i * j) % 2019)
if mmod == 0:
break
print(mmod)
if __na... | def slove():
import sys
input = sys.stdin.readline
l, r = list(map(int, input().rstrip("\n").split()))
mmod = 10**10
for i in range(l, r + 1):
for j in range(i + 1, r + 1):
mmod = min(mmod, (i * j) % 2019)
if mmod == 0:
break
if mmod == 0:
... | insert | 11 | 11 | 11 | 13 | TLE | |
p02983 | Python | Time Limit Exceeded | L, R = map(int, input().split())
min_mod = 10**9
for i in range(L, R):
for j in range(i + 1, min(L + 2019, R + 1)):
min_mod = min(min_mod, (i * j) % 2019)
print(min_mod)
| L, R = map(int, input().split())
min_mod = 10**9
for i in range(L, min(L + 2019, R + 1)):
for j in range(i + 1, min(L + 2019, R + 1)):
min_mod = min(min_mod, (i * j) % 2019)
print(min_mod)
| replace | 2 | 3 | 2 | 3 | TLE | |
p02983 | Python | Time Limit Exceeded | L, R = map(int, input().split())
ans = 2018
for i in range(L, R):
for j in range(i + 1, R + 1):
ans = min(ans, (i * j) % 2019)
if ans == 0:
break
print(ans)
| L, R = map(int, input().split())
ans = 2018
for i in range(L, R):
for j in range(i + 1, R + 1):
ans = min(ans, (i * j) % 2019)
if ans == 0:
print(ans)
exit()
print(ans)
| replace | 6 | 7 | 6 | 8 | TLE | |
p02983 | Python | Runtime Error | from itertools import combinations
L, R = map(int, input().split())
ans = 2018
for i, j in combinations(range(L, R + 1), 2):
a = i % 2019
b = j % 2019
mod = (a * b) % 2019
if ans > mod:
ans = mod
print(ans)
| from itertools import combinations
L, R = map(int, input().split())
if (L % 2019 > R % 2019) or R - L >= 2019:
print(0)
else:
ans = 2018
for i, j in combinations(range(L, R + 1), 2):
a = i % 2019
b = j % 2019
mod = (a * b) % 2019
if ans > mod:
ans = mod
print... | replace | 3 | 11 | 3 | 14 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main()... | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority_queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
typedef pair<int, int> P; // Pでpair<-,->を表す。
typedef long long LL;
LL MOD = 1000000007;
int main()... | insert | 25 | 25 | 25 | 31 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 100000000... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 100000000... | replace | 112 | 113 | 112 | 113 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "ctime"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "str... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "ctime"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "str... | insert | 29 | 29 | 29 | 33 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
unsigned int L, R;
cin >> L >> R;
unsigned long mn = 2 * 1000000000;
int ci, cj;
ci = 0;
for (int si = L; si < R; si++) {
for (int sj = si + 1; sj <= R; sj++) {
// cout << si << " " << sj << " ";
unsigned long ijmod = ((unsi... | #include <iostream>
using namespace std;
int main() {
unsigned int L, R;
cin >> L >> R;
unsigned long mn = 2 * 1000000000;
int ci, cj;
ci = 0;
for (int si = L; si < R; si++) {
cj = 0;
for (int sj = si + 1; sj <= R; sj++) {
// cout << si << " " << sj << " ";
unsigned long ij... | insert | 12 | 12 | 12 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
// #include <iomanip>
// std::cout << std::fixed << std::setprecision(5);
int main() {
unsigned long long int L, R;
std::cin >> L >> R;
unsigned long long i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
// #include <iomanip>
// std::cout << std::fixed << std::setprecision(5);
int main() {
unsigned long long int L, R;
std::cin >> L >> R;
if (R - L > 10000) {... | insert | 15 | 15 | 15 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define ll long long
ll mod = 1000000007;
using namespace std;
priority_queue<ll int> QUE; // きゅー
int length(char *str) {
int len = strlen(str);
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define ll long long
ll mod = 1000000007;
using namespace std;
priority_queue<ll int> QUE; // きゅー
int length(char *str) {
int len = strlen(str);
... | insert | 117 | 117 | 117 | 118 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long L, R;
cin >> L >> R;
int min = 2019;
for (long i = L; i < R; i++) {
for (long j = i + 1, count = 0; j <= R; j++, count++) {
if (count > 2019)
break;
int num = (i * j) % 2019;
if (min > num)
min = num;
}
}
c... | #include <iostream>
using namespace std;
int main() {
long L, R;
cin >> L >> R;
int min = 2019;
for (long i = L, counti = 0; i < R; i++, counti++) {
if (counti > 2019)
break;
for (long j = i + 1, countj = 0; j <= R; j++, countj++) {
if (countj > 2019)
break;
int num = (i * j) ... | replace | 7 | 10 | 7 | 12 | TLE | |
p02983 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <stdio.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 arr[2019];
ll limit = 2019 <= R - (L - 1) ? 2019 : R - (L - 1);
limit = limit;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <stdio.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 arr[2019];
ll limit = 2019 <= R - (L - 1) ? 2019 : R - (L - 1);
limit = limit;... | replace | 23 | 24 | 23 | 24 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll L, R;
ll ans = 1 << 30;
ll i, j;
cin >> L >> R;
for (i = L; i <= L + 2019 && i <= R; ... | #include <bits/stdc++.h>
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll L, R;
ll ans = 1 << 30;
ll i, j;
cin >> L >> R;
for (i = L; i <= L + 2019 && i <= R; ... | insert | 23 | 23 | 23 | 27 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
inline namespace atcoder {
template <typename T, size_t Depth> struct vector_helper {
using type = vector<typename vector_helper<T, Depth - 1>::typ... | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
inline namespace atcoder {
template <typename T, size_t Depth> struct vector_helper {
using type = vector<typename vector_helper<T, Depth - 1>::typ... | replace | 43 | 45 | 43 | 45 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long l, r;
scanf("%lld%lld", &l, &r);
long long a = (l * (l + 1)) % 2019;
for (long long i = l; i <= min(r, l + 2018); ++i) {
for (long long j = i + 1; j <= r; ++j) {
if ((i * j) % 2019 < a)
a = ... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long l, r;
scanf("%lld%lld", &l, &r);
long long a = (l * (l + 1)) % 2019;
for (long long i = l; i <= min(r, l + 2018); ++i) {
for (long long j = i + 1; j <= min(r, i + 2019); ++j) {
if ((i * j) % 2019 < ... | replace | 10 | 11 | 10 | 11 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long... | replace | 26 | 27 | 26 | 27 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef... | replace | 41 | 43 | 41 | 43 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int iminimum = 2018;
for (int in = l; in < r; in++) {
for (int im = in + 1; im < r + 1; im++) {
int jn = in % 2019;
int jm = im % 2019;
iminimum = min(iminimum, (jn * jm) % 2019);
}
}
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int iminimum = 2018;
for (int in = l; in < r; in++) {
for (int im = in + 1; im < r + 1; im++) {
int jn = in % 2019;
int jm = im % 2019;
iminimum = min(iminimum, (jn * jm) % 2019);
if (im... | insert | 14 | 14 | 14 | 18 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int mai... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int mai... | replace | 24 | 25 | 24 | 25 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
long l, r;
cin >> l >> r;
int ans = 2020... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
long l, r;
cin >> l >> r;
int ans = 2020... | replace | 12 | 14 | 12 | 16 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vec... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vec... | insert | 29 | 29 | 29 | 30 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vec... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vec... | replace | 42 | 43 | 42 | 44 | 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 REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end()... | replace | 24 | 25 | 24 | 25 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define ALL(obj) (obj).begin, (obj).end()
#define SORT(list) sort(ALL((list)));
using n... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define ALL(obj) (obj).begin, (obj).end()
#define SORT(list) sort(ALL((list)));
using n... | insert | 27 | 27 | 27 | 31 | TLE | |
p02983 | Python | Time Limit Exceeded | def main():
l, r = map(int, input().split())
res = 1 << 30
for i in range(l, r):
for j in range(i + 1, r + 1):
res = min(res, (i * j) % 2019)
if res == 0:
break
print(res)
if __name__ == "__main__":
main()
| def main():
l, r = map(int, input().split())
res = 1 << 30
for i in range(l, r):
for j in range(i + 1, r + 1):
res = min(res, (i * j) % 2019)
if res == 0:
print(res)
return
print(res)
if __name__ == "__main__":
main()
| replace | 7 | 8 | 7 | 9 | TLE | |
p02983 | Python | Runtime Error | L, R = map(int, input().split())
MOD = 2019
L %= MOD
R %= MOD
print(min(i * j % 2019 for i in range(L, R) for j in range(i + 1, R + 1)))
| L, R = map(int, input().split())
MOD = 2019
ans = float("inf")
for i in range(L, R):
for j in range(i + 1, R + 1):
ans = min(ans, i * j % MOD)
if ans == 0:
print(0)
exit()
print(ans)
| replace | 2 | 5 | 2 | 10 | 0 | |
p02983 | Python | Time Limit Exceeded | l, r = map(int, input().split())
x = []
for i in range(l, r):
for j in range(i + 1, r + 1):
mod = i * j % 2019
x.append(mod)
print(min(x))
| l, r = map(int, input().split())
x = []
for i in range(l, r):
for j in range(i + 1, r + 1):
mod = i * j % 2019
x.append(mod)
if mod == 0:
print(0)
exit()
print(min(x))
| insert | 6 | 6 | 6 | 9 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
int main() {
long l, r;
std::cin >> l >> r;
long min = 2019;
for (long i = l; i <= r - 1; i++)
for (long j = i + 1; j <= r; j++) {
long mod = (i * j) % 2019L;
min = (mod < min) ? mod : min;
}
std::cout << min << std::endl;
return 0;
} | #include <iostream>
int main() {
long l, r;
std::cin >> l >> r;
long min = 2019L;
if (r - l + 1 >= 2019L) {
std::cout << 0 << std::endl;
return 0;
}
long size = r - l + 1;
long *rem = new long[size];
for (long i = 0; i < size; i++)
rem[i] = (l + i) % 2019L;
for (long i = 0; i < size - 1... | replace | 5 | 9 | 5 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | replace | 57 | 59 | 57 | 59 | TLE | |
p02983 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < ... | replace | 34 | 38 | 34 | 35 | -11 | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, end) rep2(i, 0, (end))
#define rep2(i, beg, end... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, end) rep2(i, 0, (end))
#define rep2(i, beg, end... | insert | 37 | 37 | 37 | 41 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll l, r, ans = 3000;
cin >> l >> r;
for (ll i = l; i <= r; i++) {
ll num = i % 2019;
if (num == 0) {
cout << 0;
return 0;
}
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll l, r, ans = 3000;
cin >> l >> r;
for (ll i = l; i <= r; i++) {
ll num = i % 2019;
if (num == 0) {
cout << 0;
return 0;
}
for (ll j = i + 1; j <= r; j++) {
if (j % 2019 == 0) {
cout << 0;
... | insert | 14 | 14 | 14 | 18 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int n, m;
int ans = 2020;
int main() {
cin >> n >> m;
if (n - m + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
for (int i = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int n, m;
int ans = 2020;
int main() {
cin >> n >> m;
if (m - n + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
for (int i = ... | replace | 14 | 15 | 14 | 15 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
int main() {
uint64_t L, R;
cin >> L >> R;
uint64_t min_ = 2018;
for (uint64_t ii = L; ii < R; ++ii) {
for (uint64_t jj = ii + 1; jj <= R && jj < ii + 2020; ++jj) {
min_ = min((ii * jj) % 2019, min_);
}
}
cout... | #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
int main() {
uint64_t L, R;
cin >> L >> R;
uint64_t min_ = 2018;
for (uint64_t ii = L; ii < R && ii < L + 2030; ++ii) {
for (uint64_t jj = ii + 1; jj <= R && jj < ii + 2030; ++jj) {
min_ = min((ii * jj) % 2019, min_);
... | replace | 12 | 14 | 12 | 14 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define sswap(x, y) \
{ \
x += y; \
y = x - y; ... | #include <bits/stdc++.h>
using namespace std;
#define sswap(x, y) \
{ \
x += y; \
y = x - y; ... | replace | 37 | 38 | 37 | 38 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef long double ld;
typedef vector<ld> vd;
typedef bool bl;
typedef vector<bl> vb;
typedef vector<vl> mt;
typedef unordered_map<ll, unordered_map<ll, ll>> graph;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vec... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef long double ld;
typedef vector<ld> vd;
typedef bool bl;
typedef vector<bl> vb;
typedef vector<vl> mt;
typedef unordered_map<ll, unordered_map<ll, ll>> graph;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vec... | insert | 33 | 33 | 33 | 35 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define REP(i, n) for (LL i = 0, i##_len = (n); i < i##_len; ++i)
int main() {
LL L, R;
std::c... | #include <algorithm>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define REP(i, n) for (LL i = 0, i##_len = (n); i < i##_len; ++i)
int main() {
LL L, R;
std::c... | insert | 28 | 28 | 28 | 30 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <array>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define int64 long long
#define uint64 unsigned long long
using namespace std;
int main() {
int64 ll, rr, ans = 3000;
cin >> ll >> rr;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <array>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define int64 long long
#define uint64 unsigned long long
using namespace std;
int main() {
int64 ll, rr, ans = 3000;
cin >> ll >> rr;
... | replace | 19 | 21 | 19 | 21 | TLE | |
p02983 | C++ | Time Limit Exceeded | /* ****mittal**** */
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for ... | /* ****mittal**** */
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for ... | replace | 29 | 30 | 29 | 30 | TLE | |
p02983 | C++ | Time Limit Exceeded | // 前置き
#pragma region
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).... | // 前置き
#pragma region
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).... | insert | 56 | 56 | 56 | 61 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int l, r;
cin >> l >> r;
long long ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int l, r;
cin >> l >> r;
long long ans = 2019;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j... | insert | 22 | 22 | 22 | 24 | 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 p = 2019;
long long l, r;
cin >> l >> r;
if (r - l > p) {
cout << 0 << endl;
}
long long best = p - 1;
for (long long i = l; i <= r; ++i) {
for (long long j = i + 1; j <= r; ++j) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long p = 2019;
long long l, r;
cin >> l >> r;
if (r - l > p) {
cout << 0 << endl;
return 0;
}
long long best = p - 1;
for (long long i = l; i <= r; ++i) {
for (long long j = i + 1; j ... | insert | 12 | 12 | 12 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2018;
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j < r + 1; j++) {
ans = min(ans, (((i % 2019) * (j % 2019)) % 2019));
if (ans == 0)
break;
}
}
cout << ans << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
ll ans = 2018;
for (ll i = l; i < r; i++) {
if (ans == 0)
break;
for (ll j = l + 1; j < r + 1; j++) {
ans = min(ans, (((i % 2019) * (j % 2019)) % 2019));
if (ans == 0)
bre... | insert | 10 | 10 | 10 | 12 | TLE | |
p02983 | C++ | Time Limit Exceeded | /*
ID: computerbox --> Huseyn Hajiyev
LANG: C++
TASK: target_mode_on
*/
#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>
#include <functional>
#define ordered_set ... | /*
ID: computerbox --> Huseyn Hajiyev
LANG: C++
TASK: target_mode_on
*/
#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>
#include <functional>
#define ordered_set ... | insert | 124 | 124 | 124 | 128 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long l, r, mn = 2019;
cin >> l >> r;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
mn = min(mn, i * j % 2019);
}
}
cout << mn << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long l, r, mn = 2019;
cin >> l >> r;
for (long long i = l; i < r && i < l + 2019; i++) {
for (long long j = i + 1; j <= r && j <= l + 2019; j++) {
mn = min(mn, i * j % 2019);
}
}
cout << mn << endl;
return 0;
}
| replace | 7 | 9 | 7 | 9 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r, res = 2018;
cin >> l >> r;
for (ll i = l; i <= r - 1; i++) {
for (ll j = i + 1; j <= r; j++) {
ll p = (i * j) % 2019;
res = min(p, res);
}
}
cout << res;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l, r, res = 2018;
cin >> l >> r;
if (r - l >= 2019)
r = l + 2018;
for (ll i = l; i <= r - 1; i++) {
for (ll j = i + 1; j <= r; j++) {
ll p = (i * j) % 2019;
res = min(p, res);
}
}
cout << res;
}
| insert | 7 | 7 | 7 | 9 | 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 ll long long
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
int ans = 2018;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; i <= r; j++) {
int x = i * j % 2019;
ans = min(ans... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
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... | replace | 10 | 11 | 10 | 11 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int ans = 2020;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
int a = i % 2019;
int b = j % 2019;
ans = min(ans, a * b % 2019);
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int ans = 2020;
if (r - l >= 2019) {
cout << 0;
return 0;
}
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
int a = i % 2019;
int b = j % 2019;
ans = min(ans, a * b % 2019);
... | insert | 6 | 6 | 6 | 10 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int ans = 1 << 30;
for (int i = L; i < min(R, i + 2019); ++i) {
for (int j = i + 1; j <= min(R, j + 2019); ++j) {
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
}
cout <<... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int ans = 1 << 30;
for (int i = L; i < min(R, L + 2019); ++i) {
for (int j = i + 1; j <= min(R, L + 2019); ++j) {
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
}
cout <<... | replace | 10 | 12 | 10 | 12 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int i, j;
int tmp = 2018;
for (int k = l; k < min(r, k + 2019); k++) {
for (int m = k + 1; m <= min(r, k + 2019); m++) {
if (((k % 2019) * (m % 2019)) % 2019 < tmp) {
tmp = ((k % 2019) * (m % 2019)) % 2019;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int i, j;
int tmp = 2018;
for (int k = l; k < min(r, l + 2019); k++) {
for (int m = k + 1; m <= min(r, k + 2019); m++) {
if (((k % 2019) * (m % 2019)) % 2019 < tmp) {
tmp = ((k % 2019) * (m % 2019)) % 2019;
... | replace | 8 | 9 | 8 | 9 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x % y) : x; }
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2019;
for (l... | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x % y) : x; }
int main() {
ll L, R;
cin >> L >> R;
ll ans = 2019;
if (R ... | replace | 12 | 15 | 12 | 20 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
// r = min(r, l+4038);
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... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
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(... | replace | 9 | 10 | 9 | 10 | TLE | |
p02983 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define all(in) in.begin(), in.end()
#define FIO \
ios::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define all(in) in.begin(), in.end()
#define FIO \
ios::sync_with_stdio(false); \
cin.tie(0); ... | insert | 17 | 17 | 17 | 18 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#def... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#def... | insert | 101 | 101 | 101 | 103 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1e9 + 7;
#define vec vector<int>
#define vecll vector<ll>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define rep(i, n) for (int i = (int)0; i < (int)n; i++)
#define REP(i, m, n) for (int i = (int)m; i < (int)n;... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1e9 + 7;
#define vec vector<int>
#define vecll vector<ll>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define rep(i, n) for (int i = (int)0; i < (int)n; i++)
#define REP(i, m, n) for (int i = (int)m; i < (int)n;... | replace | 26 | 27 | 26 | 27 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
ll L, R;
cin >> L >> R;
ll mod = 2019;
ll rest = INFINI... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
ll L, R;
cin >> L >> R;
ll mod = 2019;
ll rest = INFINI... | insert | 14 | 14 | 14 | 18 | 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()
#define PB push_back
#define MP make_pairSS
int main() {
#define int long long
int r, l;
cin >> r >> l;
int ans = 2019;
for (int i = r... | #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()
#define PB push_back
#define MP make_pairSS
int main() {
#define int long long
int r, l;
cin >> r >> l;
for (int i = r; i < l; i++) {
... | insert | 11 | 11 | 11 | 20 | TLE | |
p02983 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned long L, R;
cin >> L >> R;
vector<unsigned long> v(R - L + 1);
unsigned long i, j;
for (i = L, j = 0; i <= R; i++, j++) {
v.at(j) =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned long L, R;
cin >> L >> R;
if (R - L >= 2018) {
cout << 0 << endl;
return 0;
}
vector<unsigned long> v(R - L + 1);
unsigned ... | insert | 14 | 14 | 14 | 19 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long l, r, result = 2019;
cin >> l >> r;
if (l - r >= 2018) {
result = 0;
} else {
for (long i = l; i <= r; i++) {
for (long j = i + 1; j <= r; j++) {
long x = i * j;
result = min(result, x % 2019);
}
}
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
long l, r, result = 2019;
cin >> l >> r;
if (r - l >= 2018) {
result = 0;
} else {
for (long i = l; i <= r; i++) {
for (long j = i + 1; j <= r; j++) {
long x = i * j;
result = min(result, x % 2019);
}
}
}
cou... | replace | 6 | 7 | 6 | 7 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
long long L, R;
cin >> L >> R;
if (L - R <= 2019) {
long long ans = 2018;
for (long long i = L; i < R; i++) {
long long a = i % 2019;
for (long long j = i + 1; j <= R; j++) {
long long b = j % 2019;
long long c = (a * b)... | #include <iostream>
using namespace std;
int main(void) {
long long L, R;
cin >> L >> R;
if (R - L <= 2019) {
long long ans = 2018;
for (long long i = L; i < R; i++) {
long long a = i % 2019;
for (long long j = i + 1; j <= R; j++) {
long long b = j % 2019;
long long c = (a * b)... | replace | 5 | 6 | 5 | 6 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main() {
long long l, r;
cin >> l >> r;
const long long mod = 2019;
long long ans = 2e9 + 1;
long long res = 0;
for (long long i = l; i <= r; i++) {
for (long long j = i + 1; j <= r; j++) {
res = ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main() {
long long l, r;
cin >> l >> r;
const long long mod = 2019;
long long ans = 2e9 + 1;
long long res = 0;
for (long long i = l; i <= r; i++) {
for (long long j = i + 1; j <= r; j++) {
res = ... | insert | 22 | 22 | 22 | 24 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC... | replace | 78 | 79 | 78 | 79 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
long long L, R, ans, a;
double an;
cin >> L >> R;
ans = 2019;
if (L - R > 2019) {
cout << 0 << endl;
return 0;
} else {
a = R - L;
L %= 2019;
R = L + a;
for (int i = L; i < R; i++) {
for (int j = i + ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
long long L, R, ans, a;
double an;
cin >> L >> R;
ans = 2019;
if (R - L > 2019) {
cout << 0 << endl;
return 0;
} else {
a = R - L;
L %= 2019;
R = L + a;
for (int i = L; i < R; i++) {
for (int j = i + ... | replace | 9 | 10 | 9 | 10 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int INF = 2147483647; // int max
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >> r;
ll res = 4000;
for (ll i = l; i < r; i++) {
for (ll j = i + 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int INF = 2147483647; // int max
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >> r;
ll res = 4000;
for (ll i = l; i < r; i++) {
for (ll j = i + 1... | insert | 18 | 18 | 18 | 20 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
// 入力
int l, r;
cin >> l >> r;
int ans = 2019;
for (int i = l % 2019; i < r - l + (l % 2019); i++) {
for (int j = i + 1; j < r - l + (l % 2019) + 1; j++) {
ans = min(ans, (i * j) % 2019);
}
}
// 表示
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// 入力
int l, r;
cin >> l >> r;
int ans = 2019;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
} else {
for (int i = l % 2019; i < r - l + (l % 2019); i++) {
for (int j = i + 1; j < r - l + (l % 2019) + 1; j++) {
ans ... | replace | 11 | 14 | 11 | 19 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define MP make_pair
#define test cout << "test" << endl;
#define fi first
#define se second
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
// const ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define MP make_pair
#define test cout << "test" << endl;
#define fi first
#define se second
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
// const ... | replace | 76 | 77 | 76 | 77 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll L, R;
ll saisyou = 2019;
int flag1 = 0;
int flag2 = 0;
int main() {
cin >> L >> R;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
saisyou = min(saisyou, (i * j) % 2019);
if (saisyou == 0)
break;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll L, R;
ll saisyou = 2019;
int flag1 = 0;
int flag2 = 0;
int main() {
cin >> L >> R;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
saisyou = min(saisyou, (i * j) % 2019);
if (saisyou == 0)
break;
... | insert | 19 | 19 | 19 | 21 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
signed main() {
int l, r;
cin >> l >> r;
if ((l - 1) / 2019 != r / 2019) {
cout << 0;
return 0;
}
int ans = 2018;
l %= 2019;
r %= 2019;
for (int i = l; i <= r; i++)
for (int j = i + 1; i <= r... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
signed main() {
int l, r;
cin >> l >> r;
if ((l - 1) / 2019 != r / 2019) {
cout << 0;
return 0;
}
int ans = 2018;
l %= 2019;
r %= 2019;
for (int i = l; i <= r; i++)
for (int j = i + 1; j <= r... | replace | 16 | 17 | 16 | 17 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long l, r;
cin >> l >> r;
int min = 2019;
for (long i = l; i <= r - 1; i++) {
for (long j = i + 1; j <= r && (j - i) <= 2019; j++) {
if ((i * j) % 2019 < min) {
min = (i * j) % 2019;
}
}
}
cout << min;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long l, r;
cin >> l >> r;
int min = 2019;
for (long i = l; i <= r - 1 && i <= l + 2019; i++) {
for (long j = i + 1; j <= r && j <= i + 2019; j++) {
if ((i * j) % 2019 < min) {
min = (i * j) % 2019;
}
}
}
cout << min;
... | replace | 8 | 10 | 8 | 10 | TLE | |
p02983 | C++ | Time Limit Exceeded | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= ... | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= ... | replace | 183 | 184 | 183 | 184 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <limits>
using namespace std;
using ull = unsigned long long;
int main() {
ull l, r;
cin >> l >> r;
ull x = numeric_limits<ull>::max();
for (ull i = l; i < r; ++i) {
for (ull j = l + 1; j <= r; ++j) {
x = min(x, (i * j) % 2019);
}
}
std::cout... | #include <algorithm>
#include <iostream>
#include <limits>
using namespace std;
using ull = unsigned long long;
int main() {
ull l, r;
cin >> l >> r;
ull x = numeric_limits<ull>::max();
for (ull i = l; i < r; ++i) {
for (ull j = l + 1; j <= r; ++j) {
if ((i * j) % 2019 == 0) {
cout << 0 << e... | insert | 13 | 13 | 13 | 17 | 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 mini = 2018;
if (L - R > 2019) {
cout << 0 << endl;
return 0;
}
for (long long int i = L; i <= R - 1; i++) {
for (long long int j = i + 1; j <= R; j++) {
// cout<<i<<j<<endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
long long int mini = 2018;
if (R - L > 2019) {
cout << 0 << endl;
return 0;
}
for (long long int i = L; i <= R - 1; i++) {
for (long long int j = i + 1; j <= R; j++) {
// cout<<i<<j<<endl;
... | replace | 7 | 8 | 7 | 8 | TLE | |
p02983 | C++ | Time Limit Exceeded | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#in... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#in... | replace | 172 | 173 | 172 | 173 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define F first
#define S second
#define endl '\n'
#define lcm(a, b) ((a) / __gcd(a, b) * (b))
#define MP make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> i_P;
typedef pair<LL, LL> L_... | #include <bits/stdc++.h>
#define F first
#define S second
#define endl '\n'
#define lcm(a, b) ((a) / __gcd(a, b) * (b))
#define MP make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> i_P;
typedef pair<LL, LL> L_... | replace | 29 | 30 | 29 | 30 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define p_b push_back
#define all(c) c.begin(), c.end()
using namespace std;
typedef long long ll; // printf("%lld ", ll); to out put long
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double eps ... | #include <bits/stdc++.h>
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define p_b push_back
#define all(c) c.begin(), c.end()
using namespace std;
typedef long long ll; // printf("%lld ", ll); to out put long
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double eps ... | replace | 38 | 40 | 38 | 42 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k, i, n) for (ll i = k; i < n; ++i)
const ll mod = 2019;
int main(void) {
// Your code here!
ll l, r;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
}
ll ans = 3000;
rep(l, i, r + 1) { rep(i + 1, j, r + 1) ans = min... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k, i, n) for (ll i = k; i < n; ++i)
const ll mod = 2019;
int main(void) {
// Your code here!
ll l, r;
cin >> l >> r;
if (r - l > 2019) {
cout << 0 << endl;
return 0;
}
ll ans = 3000;
rep(l, i, r + 1) { rep(i + 1, j, r ... | insert | 11 | 11 | 11 | 12 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k, i, n) for (ll i = k; i < n; ++i)
int main(void) {
// Your code here!
ll l, r, ans = 2019;
cin >> l >> r;
rep(l, i, r + 1) { rep(i + 1, j, r + 1) ans = min(ans, i * j % 2019); }
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k, i, n) for (ll i = k; i < n; ++i)
int main(void) {
// Your code here!
ll l, r, ans = 2019;
cin >> l >> r;
if (r - l > 2019) {
cout << 0;
return 0;
}
rep(l, i, r + 1) { rep(i + 1, j, r + 1) ans = min(ans, i * j % 2019);... | insert | 8 | 8 | 8 | 12 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k, i, n) for (ll i = k; i < n; ++i)
int main(void) {
// Your code here!
const ll mod = 2019;
ll L, R;
cin >> L >> R;
if (L - R > mod) {
cout << 0 << endl;
return 0;
}
ll ans = 1e12;
rep(L, i, R + 1) {
rep(i + 1, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k, i, n) for (ll i = k; i < n; ++i)
int main(void) {
// Your code here!
const ll mod = 2019;
ll L, R;
cin >> L >> R;
if (R - L > mod) {
cout << 0 << endl;
return 0;
}
ll ans = 1e12;
rep(L, i, R + 1) {
rep(i + 1, ... | replace | 9 | 10 | 9 | 10 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
typedef long long llong;
llong minq(llong minv, llong target) { return (minv > target) ? target : minv; }
int main() {
llong L, R;
cin >> L >> R;
int minv = 2020;
for (llong i = L; i < R; i++) {
for (llong j = i + 1; j <= R; j++) {
minv = mi... | #include <cmath>
#include <iostream>
using namespace std;
typedef long long llong;
llong minq(llong minv, llong target) { return (minv > target) ? target : minv; }
int main() {
llong L, R;
cin >> L >> R;
int minv = 2020;
for (llong i = L; i < R; i++) {
for (llong j = i + 1; j <= R; j++) {
minv = mi... | insert | 18 | 18 | 18 | 20 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int ans = 2019;
for (long long i = l; i < r && i <= l + 2019; ++i) {
for (long long j = i + 1; j <= r && j <= r + 2019; ++j) {
int x = i * j % 2019;
ans = min(x, ans);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
int ans = 2019;
for (long long i = l; i < r && i <= l + 2019; ++i) {
for (long long j = i + 1; j <= r && j <= i + 1 + 2019; ++j) {
int x = i * j % 2019;
ans = min(x, ans);
}
}
cout << ans << endl;
}
| replace | 9 | 10 | 9 | 10 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#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++)
int INF = 1e9 + 7;
int main() {
int L, R;
cin >> L >> R;
int ans = 2018;
if (L - R >= 2018)
ans = 0;
e... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#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++)
int INF = 1e9 + 7;
int main() {
int L, R;
cin >> L >> R;
int ans = 2018;
if (R - L >= 2018)
ans = 0;
e... | replace | 13 | 14 | 13 | 14 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | insert | 61 | 61 | 61 | 62 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll INF = 1e12;
int main() {
ll L, R;
cin >> L >> R;
ll min = INF;
for (ll i = L; i <= R - 1; ++i) {
for (ll j = i + 1; j <= R; ... | #include <iostream>
using namespace std;
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll INF = 1e12;
int main() {
ll L, R;
cin >> L >> R;
ll min = INF;
for (ll i = L; i < L + 2019 && i <= R - 1; ++i) {
for (ll j =... | replace | 18 | 20 | 18 | 20 | 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 a, b, minimum = 9999999999999999;
for (long long int i = L; i < R; i++) {
for (long long int j = i + 1; j <= R; j++) {
long long int kake = i * j;
minimum = min(kake % 2019, minimum);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
long long int a, b, minimum = 9999999999999999;
for (long long int i = L; i < R; i++) {
for (long long int j = i + 1; j <= R; j++) {
long long int kake = i * j;
minimum = min(kake % 2019, minimum);
... | insert | 10 | 10 | 10 | 14 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int l, r, ans = 999999999;
cin >> l >> r;
for (int i = l; i <= r && i <= i + 2500; i++)
for (int j = i + 1; j <= r && j <= j + 2500; j++)
ans = min(ans, ((i % 2019) * (j % 2019) % 2019));
cout << ans << endl;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int l, r, ans = 999999999;
cin >> l >> r;
for (int i = l; i <= r && i <= l + 2500; i++)
for (int j = i + 1; j <= r && j <= l + 2500; j++)
ans = min(ans, ((i % 2019) * (j % 2019) % 2019));
cout << ans << endl;
} | replace | 6 | 8 | 6 | 8 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void ABC133C() {
int L, R;
cin >> L >> R;
int dx = R - L;
if (dx >= 2019) {
cout << 0 << endl;
}
int minX = 2018;
for (int i = L; i < R; ++i) {
int ii = i % 2019;
for (int j = i + 1; j <= R; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void ABC133C() {
int L, R;
cin >> L >> R;
int dx = R - L;
if (dx >= 2019) {
cout << 0 << endl;
return;
}
int minX = 2018;
for (int i = L; i < R; ++i) {
int ii = i % 2019;
for (int j = i +... | insert | 12 | 12 | 12 | 13 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("... | replace | 78 | 79 | 78 | 79 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.