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 << minn;
return 0;
}
| #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;
}
// cout<<i*j<<" "<<i*j%2019<<endl;
}
}
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 + 1; j <= r; ++j) {
ll current = ((i % waru) * (j % waru)) % waru;
if (current < minValue)
minValue = current;
}
}
cout << minValue;
return 0;
}
| #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 + 1; j <= r; ++j) {
ll current = ((i % waru) * (j % waru)) % waru;
if (minValue == 0) {
cout << minValue;
return 0;
}
if (current < minValue)
minValue = current;
}
}
cout << minValue;
return 0;
}
| 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;
cin >> l >> r;
long long ans = INT_MAX;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
} | #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;
cin >> l >> r;
r = min(r, l + 2019 * 2);
long long ans = INT_MAX;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
} | 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)
if min_mod == 0:
break
print(min_mod)
if __name__ == "__main__":
main()
| 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
ans = 2019
for i in range(L, R):
for j in range(i + 1, R + 1):
ans = min(ans, (i % 2019) * (j % 2019) % 2019)
print(ans)
if __name__ == "__main__":
main()
| #!/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
for i in range(L, R):
for j in range(i + 1, R + 1):
ans = min(ans, (i % 2019) * (j % 2019) % 2019)
print(ans)
if __name__ == "__main__":
main()
| 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;
}
}
}
printf("%d\n", result);
return 0;
} | #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;
if (result == 0)
break;
}
}
}
printf("%d\n", result);
return 0;
} | 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
print(ans)
if __name__ == "__main__":
main()
| 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)
return mod_list
def main():
L, R = map(int, input().split())
mod_list = make_list(L, R)
print(min(mod_list))
return
if __name__ == "__main__":
main()
| 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) % 2019)
return mod_list
def main():
L, R = map(int, input().split())
mod_list = make_list(L, R)
print(min(mod_list))
return
if __name__ == "__main__":
main()
| 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(len(candidate)):
if i == j:
continue
else:
ans.append((candidate[i] * candidate[j]) % 2019)
ans.sort()
print(ans[0])
| 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(candidate) - 1):
continue
for j in range(i + 1, len(candidate)):
if i == j:
continue
else:
ans.append((candidate[i] * candidate[j]) % 2019)
ans.sort()
print(ans[0])
| 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 __name__ == "__main__":
slove()
| 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:
break
print(mmod)
if __name__ == "__main__":
slove()
| 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(ans)
| 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() {
LL l, r;
cin >> l >> r;
/*l=l%2019;
r=r%2019;
if(r<=l){r=r+2019;}*/
// while(r>l+2019){r=r-2019;}
LL min = 2019;
for (LL i = l; i < r; i++) {
for (LL j = i + 1; j <= r; j++) {
if (((i * j) % 2019) < min) {
min = ((i * j) % 2019);
}
}
}
cout << min << endl;
return 0;
} | #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() {
LL l, r;
cin >> l >> r;
/*l=l%2019;
r=r%2019;
if(r<=l){r=r+2019;}*/
// while(r>l+2019){r=r-2019;}
LL min = 2019;
for (LL i = l; i < r; i++) {
for (LL j = i + 1; j <= r; j++) {
if (((i * j) % 2019) < min) {
min = ((i * j) % 2019);
}
if (min == 0) {
break;
}
}
if (min == 0) {
break;
}
}
cout << min << endl;
return 0;
} | 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 1000000007
#define BOUND 27182818284
typedef long long ll;
typedef long long int lli;
// typedef pair<ll,ll> P;
#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)
template <class T> bool umax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool umin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// gcd
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int findGCD(int arr[], int n) {
int result = arr[0];
for (int i = 1; i < n; i++)
result = gcd(arr[i], result);
return result;
}
template <typename T> T lcm(T m, T n) {
// 引数に0がある場合は0を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
int dx[5] = {1, 0, -1, 0};
int dy[5] = {0, 1, 0, -1};
// v.front() = -BOUND;
// v.back() = BOUND;
// struct edge{
// int cost, to;
//
// edge(int in_cost, int in_to){
// cost=in_cost;
// to=in_to;
// }
// bool operator<(const edge &a) const
// {
// return cost > a.cost;
// }
// };
vector<int> G[10010];
vector<int> c(10010, 0);
int num[10010];
bool used[10010];
int now_c = 0;
int dfs(int s) {
if (used[s]) {
return 0;
} else {
used[s] = true;
}
num[s] = c[now_c];
now_c++;
for (int i = 0; i < G[s].size(); i++) {
dfs(G[s][i]);
}
return 0;
}
int main() {
lli L, R;
cin >> L >> R;
if (L - R + 1LL < 2019) {
lli ans = 2019;
for (lli i = L; i < R; i++) {
for (lli j = i + 1; j <= R; j++) {
ans = min(i * j % 2019, ans);
}
}
cout << ans << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #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 1000000007
#define BOUND 27182818284
typedef long long ll;
typedef long long int lli;
// typedef pair<ll,ll> P;
#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)
template <class T> bool umax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool umin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// gcd
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int findGCD(int arr[], int n) {
int result = arr[0];
for (int i = 1; i < n; i++)
result = gcd(arr[i], result);
return result;
}
template <typename T> T lcm(T m, T n) {
// 引数に0がある場合は0を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
int dx[5] = {1, 0, -1, 0};
int dy[5] = {0, 1, 0, -1};
// v.front() = -BOUND;
// v.back() = BOUND;
// struct edge{
// int cost, to;
//
// edge(int in_cost, int in_to){
// cost=in_cost;
// to=in_to;
// }
// bool operator<(const edge &a) const
// {
// return cost > a.cost;
// }
// };
vector<int> G[10010];
vector<int> c(10010, 0);
int num[10010];
bool used[10010];
int now_c = 0;
int dfs(int s) {
if (used[s]) {
return 0;
} else {
used[s] = true;
}
num[s] = c[now_c];
now_c++;
for (int i = 0; i < G[s].size(); i++) {
dfs(G[s][i]);
}
return 0;
}
int main() {
lli L, R;
cin >> L >> R;
if (R - L + 1LL < 2019) {
lli ans = 2019;
for (lli i = L; i < R; i++) {
for (lli j = i + 1; j <= R; j++) {
ans = min(i * j % 2019, ans);
}
}
cout << ans << endl;
} else {
cout << 0 << endl;
}
return 0;
} | 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 "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int l, r;
cin >> l >> r;
int ans = 2018 * 2018;
for (int i = l; i <= r; ++i) {
for (int j = i + 1; j <= r; ++j) {
int p = i % 2019;
int q = j % 2019;
int r = p * q;
r = r % 2019;
ans = min(ans, r);
}
}
cout << ans << endl;
return 0;
} | #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 "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int l, r;
cin >> l >> r;
if (r - l + 1 >= 2019) {
cout << 0 << endl;
return 0;
}
int ans = 2018 * 2018;
for (int i = l; i <= r; ++i) {
for (int j = i + 1; j <= r; ++j) {
int p = i % 2019;
int q = j % 2019;
int r = p * q;
r = r % 2019;
ans = min(ans, r);
}
}
cout << ans << endl;
return 0;
} | 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 = ((unsigned long)si * (unsigned long)sj) % 2019;
// cout << ijmod << endl;
if (ijmod < mn)
mn = ijmod;
cj++;
if (cj == 2019)
break;
}
ci++;
if (ci == 2019)
break;
}
cout << mn << endl;
return 0;
}
| #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 ijmod = ((unsigned long)si * (unsigned long)sj) % 2019;
// cout << ijmod << endl;
if (ijmod < mn)
mn = ijmod;
cj++;
if (cj == 2019)
break;
}
ci++;
if (ci == 2019)
break;
}
cout << mn << endl;
return 0;
}
| 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 int mi = 2019 * 2019;
for (unsigned long long int i = L; i <= R; i++) {
for (unsigned long long int j = i + 1; j <= R; j++) {
mi = std::min(mi, i * j % 2019);
}
}
std::cout << mi << std::endl;
return 0;
} | #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) {
std::cout << 0 << std::endl;
return 0;
}
unsigned long long int mi = 2019 * 2019;
for (unsigned long long int i = L; i <= R; i++) {
for (unsigned long long int j = i + 1; j <= R; j++) {
mi = std::min(mi, i * j % 2019);
}
}
std::cout << mi << std::endl;
return 0;
} | 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);
return len;
}
ll GCD(ll a, ll b) {
ll r, tmp;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
ll LCM(ll a, ll b) {
ll r, x, tmp;
ll i, j;
ll lcm;
i = a;
j = b;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
lcm = (i / b) * j;
return lcm;
}
ll checkTen(ll a) {
ll ans = 0;
while (true) {
ans++;
if ((a / 10) % 10 != 0) {
break;
}
a = a / 10;
}
return ans;
}
ll checkFive(ll a) {
ll ans = 0;
while (true) {
ans++;
if ((a / 5) % 5 != 0) {
break;
}
a = a / 5;
}
return ans;
}
ll checkTwo(ll a) {
ll ans = 0;
while (true) {
ans++;
if ((a / 2) % 2 != 0) {
break;
}
a = a / 2;
}
return ans;
}
ll checkf(ll a) {
ll ans = 0;
while (true) {
ans++;
if ((a / 10) % 10 != 0) {
break;
}
a = a / 10;
}
return a;
}
int main() {
ll L, R;
ll Min = 2019;
cin >> L >> R;
for (ll i = L; i < R; i++) {
for (ll j = L + 1; j <= R; j++) {
Min = min(Min, (i * j) % 2019);
if (Min == 0) {
cout << Min << endl;
}
}
}
cout << Min << endl;
}
| #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);
return len;
}
ll GCD(ll a, ll b) {
ll r, tmp;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
ll LCM(ll a, ll b) {
ll r, x, tmp;
ll i, j;
ll lcm;
i = a;
j = b;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
lcm = (i / b) * j;
return lcm;
}
ll checkTen(ll a) {
ll ans = 0;
while (true) {
ans++;
if ((a / 10) % 10 != 0) {
break;
}
a = a / 10;
}
return ans;
}
ll checkFive(ll a) {
ll ans = 0;
while (true) {
ans++;
if ((a / 5) % 5 != 0) {
break;
}
a = a / 5;
}
return ans;
}
ll checkTwo(ll a) {
ll ans = 0;
while (true) {
ans++;
if ((a / 2) % 2 != 0) {
break;
}
a = a / 2;
}
return ans;
}
ll checkf(ll a) {
ll ans = 0;
while (true) {
ans++;
if ((a / 10) % 10 != 0) {
break;
}
a = a / 10;
}
return a;
}
int main() {
ll L, R;
ll Min = 2019;
cin >> L >> R;
for (ll i = L; i < R; i++) {
for (ll j = L + 1; j <= R; j++) {
Min = min(Min, (i * j) % 2019);
if (Min == 0) {
cout << Min << endl;
return 0;
}
}
}
cout << Min << endl;
}
| 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;
}
}
cout << min << endl;
return 0;
} | #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) % 2019;
if (min > num)
min = num;
}
}
cout << min << endl;
return 0;
} | 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;
// cout<<"limit:"<<limit<<endl;
for (ll i = L; i <= limit + L; ++i) {
arr[i - L] = i % (ll)2019;
}
/*
for(ll i=0;i<limit;++i){
cout<<i<<":"<<arr[i]<<" ";
}
cout<<endl;
*/
// cout<<"abc"<<endl;
ll ans = 2019;
for (ll i = 0; i < limit - 1; ++i) {
for (ll j = i + 1; j < limit; ++j) {
ll tmp = (arr[i] * arr[j]) % 2019;
ans = ans <= tmp ? ans : tmp;
}
}
cout << ans << endl;
} | #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;
// cout<<"limit:"<<limit<<endl;
for (ll i = L; i < limit + L; ++i) {
arr[i - L] = i % (ll)2019;
}
/*
for(ll i=0;i<limit;++i){
cout<<i<<":"<<arr[i]<<" ";
}
cout<<endl;
*/
// cout<<"abc"<<endl;
ll ans = 2019;
for (ll i = 0; i < limit - 1; ++i) {
for (ll j = i + 1; j < limit; ++j) {
ll tmp = (arr[i] * arr[j]) % 2019;
ans = ans <= tmp ? ans : tmp;
}
}
cout << ans << endl;
}
| 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; ++i) {
for (j = i + 1; j <= j + 2018 && j <= R; ++j) {
if (((i * j) % 2019) < ans) {
// cout << i << "," << j << "," << (i * j) % 2019 << endl;
ans = (i * j) % 2019;
}
}
}
cout << ans << endl;
return 0;
} | #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; ++i) {
for (j = i + 1; j <= j + 2018 && j <= R; ++j) {
if (((i * j) % 2019) < ans) {
// cout << i << "," << j << "," << (i * j) % 2019 << endl;
ans = (i * j) % 2019;
}
if (ans == 0) {
cout << ans << endl;
return 0;
}
}
}
cout << ans << endl;
return 0;
} | 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>::type>;
};
template <typename T> struct vector_helper<T, 0> {
using type = T;
};
template <typename T, size_t Depth>
using vector_t = typename vector_helper<T, Depth>::type;
template <typename T> using vec = vector_t<T, 1>;
template <typename T> using vvec = vector_t<T, 2>;
template <typename T> using vvvec = vector_t<T, 3>;
constexpr int64_t mpow(int64_t a, int64_t b, int64_t mod = 1000000007) {
if (b <= 0)
return 1;
if (b == 1)
return a % mod;
if (b == 2)
return (a * a) % mod;
return (max(a * (b & 1), (int64_t)1) * mpow(mpow(a, b / 2, mod), 2, mod)) %
mod;
}
constexpr int64_t mdiv(int64_t a, int64_t b, int64_t mod = 1000000007) {
return (a * mpow(b, mod - 2, mod)) % mod;
}
} // namespace atcoder
int main() {
int l, r;
cin >> l >> r;
int ans = INT_MAX;
for (int i = l % 2019; i < (r - l + 1) + l % 2019; ++i) {
for (int j = i + 1; j < (r - l + 1) + l % 2019; ++j) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
| #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>::type>;
};
template <typename T> struct vector_helper<T, 0> {
using type = T;
};
template <typename T, size_t Depth>
using vector_t = typename vector_helper<T, Depth>::type;
template <typename T> using vec = vector_t<T, 1>;
template <typename T> using vvec = vector_t<T, 2>;
template <typename T> using vvvec = vector_t<T, 3>;
constexpr int64_t mpow(int64_t a, int64_t b, int64_t mod = 1000000007) {
if (b <= 0)
return 1;
if (b == 1)
return a % mod;
if (b == 2)
return (a * a) % mod;
return (max(a * (b & 1), (int64_t)1) * mpow(mpow(a, b / 2, mod), 2, mod)) %
mod;
}
constexpr int64_t mdiv(int64_t a, int64_t b, int64_t mod = 1000000007) {
return (a * mpow(b, mod - 2, mod)) % mod;
}
} // namespace atcoder
int main() {
int l, r;
cin >> l >> r;
int ans = INT_MAX;
for (int i = l % 2019; i < min(r - l + 1, 2019) + l % 2019; ++i) {
for (int j = i + 1; j < min(r - l + 1, 2019) + l % 2019; ++j) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
}
| 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 = (i * j) % 2019;
}
}
cout << a << endl;
}
| #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 < a)
a = (i * j) % 2019;
}
}
cout << a << endl;
}
| 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 ll;
using namespace std;
int main() {
const int mod = 2019;
ll l, r;
cin >> l >> r;
r = min(r, l + 2019);
ll ans = INF;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; i++) {
ll temp = (i * j) % mod;
ans = min(ans, temp);
}
}
cout << ans << endl;
}
| #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 ll;
using namespace std;
int main() {
const int mod = 2019;
ll l, r;
cin >> l >> r;
r = min(r, l + 2019);
ll ans = INF;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ll temp = (i * j) % mod;
ans = min(ans, temp);
}
}
cout << ans << endl;
}
| 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 long long int ll;
#define C cout <<
#define E << endl
#define CE cout << endl
ll n, m, a, b, c, x, y, z, aa[200010], ab[200010], ac[1010];
bool r, ra, rb, rc[200010];
string s, sa, sb, sc;
char ca, cb, cc, cd[1010][1010];
vector<ll> va, vb, vc, vd, ve, vaa, vbb;
set<int> st;
template <typename MAIN>
ostream &operator<<(ostream &osys, const vector<MAIN> target) {
for (MAIN it : target)
osys << it << " ";
return osys;
}
int main() {
cin >> a >> b;
m = 2018;
for (ll i = a; i <= b; i++) {
for (ll j = i + 1; j <= b; j++) {
m = min(m, i * j % 2019);
}
}
C m E;
} | #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 long long int ll;
#define C cout <<
#define E << endl
#define CE cout << endl
ll n, m, a, b, c, x, y, z, aa[200010], ab[200010], ac[1010];
bool r, ra, rb, rc[200010];
string s, sa, sb, sc;
char ca, cb, cc, cd[1010][1010];
vector<ll> va, vb, vc, vd, ve, vaa, vbb;
set<int> st;
template <typename MAIN>
ostream &operator<<(ostream &osys, const vector<MAIN> target) {
for (MAIN it : target)
osys << it << " ";
return osys;
}
int main() {
cin >> a >> b;
m = 2018;
for (ll i = a; i <= b and i <= a + 2019; i++) {
for (ll j = i + 1; j <= b and j <= a + 2019; j++) {
m = min(m, i * j % 2019);
}
}
C m E;
} | 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);
}
}
cout << iminimum << endl;
return 0;
}
| #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 (iminimum == 0) {
cout << 0 << endl;
return 0;
}
}
}
cout << iminimum << endl;
return 0;
}
| 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 main() {
ll L, R;
cin >> L >> R;
ll tmp_minimum = 9999;
for (ll i = L; i <= min(R - 1, L + 2018); i++) {
for (ll j = i + 1; j <= min(R, j + 2018); j++) {
tmp_minimum = min((i * j) % 2019, tmp_minimum);
}
}
cout << tmp_minimum;
return 0;
}
| #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 main() {
ll L, R;
cin >> L >> R;
ll tmp_minimum = 9999;
for (ll i = L; i <= min(R - 1, L + 2018); i++) {
for (ll j = i + 1; j <= min(R, i + 1 + 2018); j++) {
tmp_minimum = min((i * j) % 2019, tmp_minimum);
}
}
cout << tmp_minimum;
return 0;
}
| 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;
for (int i = l; i < r; i++) {
for (int j = i + 1; j < r + 1; j++) {
ans = min(ans, int((long(i) * long(j)) % 2019));
if (ans == 0)
break;
}
}
cout << ans << endl;
}
| #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;
int distance = r - l;
for (int i = l; i < l + min(2019, distance); i++) {
for (int j = max(i + 1, int(r - 2019)); j < r + 1; j++) {
ans = min(ans, int((long(i) * long(j)) % 2019));
if (ans == 0)
break;
}
}
cout << ans << endl;
}
| 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 = vector<vector<long long int>>;
// 二つの値の最小値を求める関数
Int Min(const Int a, const Int b) {
if (a <= b) {
return a;
} else {
return b;
}
}
int main(void) {
Int l, r;
cin >> l >> r;
Int result = 2019;
for (Int i = l; i <= r; ++i) {
for (Int j = i + 1; j <= r; ++j) {
result = Min(result, (i * j) % 2019);
}
}
cout << result << endl;
return 0;
}
| #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 = vector<vector<long long int>>;
// 二つの値の最小値を求める関数
Int Min(const Int a, const Int b) {
if (a <= b) {
return a;
} else {
return b;
}
}
int main(void) {
Int l, r;
cin >> l >> r;
r = Min(r, l + 2019);
Int result = 2019;
for (Int i = l; i <= r; ++i) {
for (Int j = i + 1; j <= r; ++j) {
result = Min(result, (i * j) % 2019);
}
}
cout << result << endl;
return 0;
}
| 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 = vector<vector<long long int>>;
// 二つの値の最小値を求める関数
Int Min(const Int a, const Int b) {
if (a <= b) {
return a;
} else {
return b;
}
}
int main(void) {
Int l, r;
cin >> l >> r;
/*
l = (l % 2019);
r = (r % 2019);
if (l >= r) {
r += 2019;
}
*/
Int result = 2019;
for (Int i = l; i <= r; ++i) {
for (Int j = i + 1; j <= r; ++j) {
result = Min(result, (i * j) % 2019);
if (result == 0) {
break;
}
}
}
cout << result << endl;
return 0;
}
| #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 = vector<vector<long long int>>;
// 二つの値の最小値を求める関数
Int Min(const Int a, const Int b) {
if (a <= b) {
return a;
} else {
return b;
}
}
int main(void) {
Int l, r;
cin >> l >> r;
/*
l = (l % 2019);
r = (r % 2019);
if (l >= r) {
r += 2019;
}
*/
Int result = 2019;
for (Int i = l; i <= r; ++i) {
for (Int j = i + 1; j <= r; ++j) {
result = Min(result, (i * j) % 2019);
if (result == 0) {
cout << 0 << endl;
return 0;
}
}
}
cout << result << endl;
return 0;
}
| 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());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll l, r;
cin >> l >> r;
ll mod = 2019;
if (l - r >= 2018)
cout << 0 << endl;
else {
ll res = 10000;
for (ll x = l; x <= r; x++) {
for (ll y = x; y <= r; y++) {
if (y <= x)
continue;
ll tmp = (x * y) % mod;
res = min(res, tmp);
}
}
cout << res << endl;
}
return 0;
} | #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());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll l, r;
cin >> l >> r;
ll mod = 2019;
if (r - l >= 2018)
cout << 0 << endl;
else {
ll res = 10000;
for (ll x = l; x <= r; x++) {
for (ll y = x; y <= r; y++) {
if (y <= x)
continue;
ll tmp = (x * y) % mod;
res = min(res, tmp);
}
}
cout << res << endl;
}
return 0;
} | 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 namespace std;
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
if (l - r >= 673) {
cout << 0 << endl;
return 0;
}
int min = 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i; j <= r; j++) {
if (i != j && ((i * j) % 2019) < min) {
min = (i * j) % 2019;
}
}
}
cout << min << endl;
} | #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 namespace std;
using ll = long long;
int main() {
ll l, r;
cin >> l >> r;
if (l - r >= 673) {
cout << 0 << endl;
return 0;
}
int min = 2019;
for (ll i = l; i <= r; i++) {
for (ll j = i; j <= r; j++) {
if (i != j && ((i * j) % 2019) < min) {
min = (i * j) % 2019;
}
if (i * j % 2019 == 0) {
cout << 0 << endl;
return 0;
}
}
}
cout << min << endl;
} | 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; i++)
for (long j = i + 1; j < size; j++) {
long mod = (rem[i] * rem[j]) % 2019L;
min = (mod < min) ? mod : min;
}
std::cout << min << std::endl;
return 0;
} | 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 FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rmsame(a) sort(all(a)), a.erase(unique(all(a)), a.end())
#define rmvector(a, b) \
rep(i, a.size()) rep(j, b.size()) if (a[i] == b[j]) { \
a.erase(a.begin() + i); \
i--; \
break; \
}
#define first_more_idx(ve, num) \
upper_bound(all(ve), num) - ve.begin() // idx = first_more_idx(ve,num); if(idx
// = ve.size()) , then not exist
#define first_lessequal_idx(ve, num) lower_bound(all(ve), num) - ve.begin()
#define pq_pair_tB \
priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>
#define pq_pair_ts priority_queue<pair<ll, ll>> // only sort first param
template <typename X> bool exist(vector<X> vec, X item) {
return find(all(vec), item) != vec.end();
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll power(ll x, ll n) {
if (n == 0)
return 1;
return (n % 2) ? x * power(x, n - 1) % MOD : power(x * x % MOD, n / 2);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
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);
}
}
cout << ans << endl;
// cout << fixed << setprecision(16) << ans << endl;
return 0;
}
| #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 FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rmsame(a) sort(all(a)), a.erase(unique(all(a)), a.end())
#define rmvector(a, b) \
rep(i, a.size()) rep(j, b.size()) if (a[i] == b[j]) { \
a.erase(a.begin() + i); \
i--; \
break; \
}
#define first_more_idx(ve, num) \
upper_bound(all(ve), num) - ve.begin() // idx = first_more_idx(ve,num); if(idx
// = ve.size()) , then not exist
#define first_lessequal_idx(ve, num) lower_bound(all(ve), num) - ve.begin()
#define pq_pair_tB \
priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>
#define pq_pair_ts priority_queue<pair<ll, ll>> // only sort first param
template <typename X> bool exist(vector<X> vec, X item) {
return find(all(vec), item) != vec.end();
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll power(ll x, ll n) {
if (n == 0)
return 1;
return (n % 2) ? x * power(x, n - 1) % MOD : power(x * x % MOD, n / 2);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll L, R;
cin >> L >> R;
ll ans = 2019;
for (ll i = L; i <= min(L + 2020, R); i++) {
for (ll j = i + 1; j <= min(L + 2020, R); j++) {
ans = min(ans, i * j % 2019);
}
}
cout << ans << endl;
// cout << fixed << setprecision(16) << ans << endl;
return 0;
}
| 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 < (int)(n); i++)
#define for1(i, n) for (int i = 1; i <= (int)(n); i++)
#define debug(x) cout << '>' << #x << ':' << x << endl;
const int MOD = 1e9 + 7;
int mpow(int a, int b, int p = MOD) {
a = a % p;
int res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % p;
a = (a * a) % p;
b = b >> 1;
}
return res % p;
}
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const int N = 1e6 + 3;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
// freopen("output.txt","w",stdout);
#endif
int l, r;
cin >> l >> r;
r = min(r, l + 2 * (2019));
vector<int> a;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
a.pb((i * j) % 2019);
}
}
sort(all(a));
cout << a[0];
}
// k*2019-l=i*j;
//
// I never lose. I either win or I learn | #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 < (int)(n); i++)
#define for1(i, n) for (int i = 1; i <= (int)(n); i++)
#define debug(x) cout << '>' << #x << ':' << x << endl;
const int MOD = 1e9 + 7;
int mpow(int a, int b, int p = MOD) {
a = a % p;
int res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % p;
a = (a * a) % p;
b = b >> 1;
}
return res % p;
}
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const int N = 1e6 + 3;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int l, r;
cin >> l >> r;
r = min(r, l + 2 * (2019));
vector<int> a;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
a.pb((i * j) % 2019);
}
}
sort(all(a));
cout << a[0];
}
// k*2019-l=i*j;
//
// I never lose. I either win or I learn | 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) for (int i = (beg); i < (end); i++)
#define all(cont) begin(cont), end(cont)
#define INFMAX LLONG_MAX
#define INFMIN LLONG_MIN
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef list<ll> li;
typedef pair<ll, ll> pii;
typedef pair<ll, string> pis;
typedef pair<string, ll> psi;
string gets(bool skipnewline);
vi get_n_array(int n);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int l, r;
cin >> l >> r;
ll mods[2019] = {};
rep2(i, l, r + 1) { mods[i % 2019]++; }
ll minv = INFMAX;
rep2(i, 0, 2019) {
if (mods[i] == 0)
continue;
mods[i]--;
rep2(j, i, 2019) {
if (mods[j] == 0)
continue;
minv = min((i * j) % 2019LL, minv);
}
}
cout << minv << endl;
return 0;
}
string gets(bool skipToNextline) {
if (skipToNextline)
gets(false);
const int BUFF_MAX = 1024;
char buf[BUFF_MAX];
cin.getline(buf, sizeof(buf));
return buf;
}
vi get_n_array(int n) {
vi v;
while (n-- > 0) {
int x;
cin >> x;
v.push_back(x);
}
return v;
} | #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) for (int i = (beg); i < (end); i++)
#define all(cont) begin(cont), end(cont)
#define INFMAX LLONG_MAX
#define INFMIN LLONG_MIN
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef list<ll> li;
typedef pair<ll, ll> pii;
typedef pair<ll, string> pis;
typedef pair<string, ll> psi;
string gets(bool skipnewline);
vi get_n_array(int n);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
ll mods[2019] = {};
rep2(i, l, r + 1) { mods[i % 2019]++; }
ll minv = INFMAX;
rep2(i, 0, 2019) {
if (mods[i] == 0)
continue;
mods[i]--;
rep2(j, i, 2019) {
if (mods[j] == 0)
continue;
minv = min((i * j) % 2019LL, minv);
}
}
cout << minv << endl;
return 0;
}
string gets(bool skipToNextline) {
if (skipToNextline)
gets(false);
const int BUFF_MAX = 1024;
char buf[BUFF_MAX];
cin.getline(buf, sizeof(buf));
return buf;
}
vi get_n_array(int n) {
vi v;
while (n-- > 0) {
int x;
cin >> x;
v.push_back(x);
}
return v;
} | 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);
}
}
cout << ans << endl;
} | #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;
return 0;
}
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
} | 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 = n; i < m; i++) {
for (int j = i + 1; j <= m; j++)
ans = min(ans, int(1ll * i * j % 2019));
}
cout << ans << endl;
} | #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 = n; i < m; i++) {
for (int j = i + 1; j <= m; j++)
ans = min(ans, int(1ll * i * j % 2019));
}
cout << ans << endl;
} | 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 << min_ << endl;
return 0;
}
| #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_);
}
}
cout << min_ << endl;
return 0;
}
| 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; \
x -= y; \
}
#define LSOne(S) ((S) & (-S))
#define EPS 1e-6
#define MOD 1000000007
#define fi first
#define se second
#define pb push_back
#define ende '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mset(x, y) memset(&x, (y), sizeof(x))
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll l, r;
cin >> l >> r;
ll mn = 2019;
for (ll i = l; i < r; i++)
for (ll j = i + 1; j <= r; j++) {
mn = min(mn, (i * j) % 2019);
if (!mn)
break;
}
cout << mn << ende;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define sswap(x, y) \
{ \
x += y; \
y = x - y; \
x -= y; \
}
#define LSOne(S) ((S) & (-S))
#define EPS 1e-6
#define MOD 1000000007
#define fi first
#define se second
#define pb push_back
#define ende '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mset(x, y) memset(&x, (y), sizeof(x))
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll l, r;
cin >> l >> r;
ll mn = 2019;
for (ll i = l; i < r; i++)
for (ll j = i + 1; j <= r; j++) {
mn = min(mn, (i * j) % 2019);
if (!mn)
j = i = r + 1;
}
cout << mn << ende;
return 0;
}
| 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 vector<string> vs;
typedef vector<vs> table;
const ll e5 = 1 << 20;
const ll mod = 1000000007;
const ll e3 = 1 << 13;
const ll INF = 1ll << 50;
ll l, r;
ll ans = INF;
int main() {
cin >> l >> r;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
if (ans == 0)
break;
}
}
cout << ans << endl;
}
| #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 vector<string> vs;
typedef vector<vs> table;
const ll e5 = 1 << 20;
const ll mod = 1000000007;
const ll e3 = 1 << 13;
const ll INF = 1ll << 50;
ll l, r;
ll ans = INF;
int main() {
cin >> l >> r;
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min(ans, (i * j) % 2019);
if (ans == 0)
break;
}
if (ans == 0)
break;
}
cout << ans << endl;
}
| 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::cin >> L >> R;
LL ans = 2018;
for (LL i = L; i < R; i++) {
for (LL j = i + 1; j <= R; j++) {
LL mod = (i * j) % 2019;
if (mod < ans)
ans = mod;
if (ans == 0)
break;
}
}
std::cout << ans << std::endl;
return 0;
}
| #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::cin >> L >> R;
LL ans = 2018;
for (LL i = L; i < R; i++) {
for (LL j = i + 1; j <= R; j++) {
LL mod = (i * j) % 2019;
if (mod < ans)
ans = mod;
if (ans == 0)
break;
}
if (ans == 0)
break;
}
std::cout << ans << std::endl;
return 0;
}
| 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;
for (int64 ii = ll; ii < rr; ii++) {
for (int64 jj = ii + 1; jj <= rr; jj++) {
if (ans > (ii * jj) % 2019) {
ans = (ii * jj) % 2019;
}
}
}
cout << ans << endl;
return 0;
} | #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;
for (int64 ii = ll; ii < rr && ii <= ll + 2020; ii++) {
for (int64 jj = ii + 1; jj <= rr && jj <= ii + 2020; jj++) {
if (ans > (ii * jj) % 2019) {
ans = (ii * jj) % 2019;
}
}
}
cout << ans << endl;
return 0;
} | 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 (ll int i = a; i < b; i++)
#define repr(i, a, b) for (ll int i = a; i >= b; i--)
#define lbnd lower_bound
#define ubnd upper_bound
#define mp make_pair
using namespace std;
#define N 100005
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS = 1;
// cin>>TESTS;
while (TESTS--) {
ll l, r;
cin >> l >> r;
if (l - r + 1 >= 2019)
cout << 0;
else {
ll ans = hell;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ll p = i % 2019;
ll q = j % 2019;
ans = min(ans, (p * q) % 2019);
}
}
cout << ans;
}
}
return 0;
} | /* ****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 (ll int i = a; i < b; i++)
#define repr(i, a, b) for (ll int i = a; i >= b; i--)
#define lbnd lower_bound
#define ubnd upper_bound
#define mp make_pair
using namespace std;
#define N 100005
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS = 1;
// cin>>TESTS;
while (TESTS--) {
ll l, r;
cin >> l >> r;
if (r - l + 1 >= 2019)
cout << 0;
else {
ll ans = hell;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ll p = i % 2019;
ll q = j % 2019;
ans = min(ans, (p * q) % 2019);
}
}
cout << ans;
}
}
return 0;
} | 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).end()
#define FOR(i, a, n) for (ll i = (ll)(a); i < (ll)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SORT(a) sort(all(a))
#define REVERSE(a) reverse(all(a))
#define PRINT(str) printf(#str "\n")
#define yOUT PRINT(Yes)
#define nOUT PRINT(No)
#define YOUT PRINT(YES)
#define NOUT PRINT(NO)
#pragma endregion
// 関数定義
#pragma region
// 偶数 -> true :: 奇数 -> false
bool EVEN(ll a) { return a % 2 - 1; }
// 最大公約数
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
// 最小公倍数
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
#pragma endregion
int main() {
ll l, r;
cin >> l >> r;
int ans = 2019;
FOR(i, l, r) {
for (ll j = r; j > l; j--) {
int ij = (i * j) % 2019;
ans = min(ans, ij);
}
}
cout << ans << endl;
}
| // 前置き
#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).end()
#define FOR(i, a, n) for (ll i = (ll)(a); i < (ll)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SORT(a) sort(all(a))
#define REVERSE(a) reverse(all(a))
#define PRINT(str) printf(#str "\n")
#define yOUT PRINT(Yes)
#define nOUT PRINT(No)
#define YOUT PRINT(YES)
#define NOUT PRINT(NO)
#pragma endregion
// 関数定義
#pragma region
// 偶数 -> true :: 奇数 -> false
bool EVEN(ll a) { return a % 2 - 1; }
// 最大公約数
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
// 最小公倍数
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
#pragma endregion
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2018) {
cout << 0 << endl;
return 0;
}
int ans = 2019;
FOR(i, l, r) {
for (ll j = r; j > l; j--) {
int ij = (i * j) % 2019;
ans = min(ans, ij);
}
}
cout << ans << endl;
}
| 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++) {
ans = min(ans, (long long)i * j % 2019);
if (ans == 0)
break;
}
}
cout << ans << endl;
} | #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++) {
ans = min(ans, (long long)i * j % 2019);
if (ans == 0)
break;
}
if (ans == 0)
break;
}
cout << ans << endl;
} | 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) {
best = min(best, (i * j) % p);
}
}
cout << best << endl;
return 0;
}
| #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 <= r; ++j) {
best = min(best, (i * j) % p);
}
}
cout << best << endl;
return 0;
}
| 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 << endl;
return 0;
}
| #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)
break;
}
}
cout << ans << endl;
return 0;
}
| 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 \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #define _CRT_SECURE_NO_WARNINGS
// #include <boost/multiprecision/cpp_int.hpp>
// using boost::multiprecision::cpp_int;
#define FAST_READ ios_base::sync_with_stdio(0);
#define in freopen("input.txt", "r", stdin);
#define out freopen("output.txt", "w", stdout);
#define ll long long
#define debt(x, y) \
cout << "#x = " << (x) << " and " \
<< "#y = " << (y) << endl;
#define deb(x) cout << "#x = " << (x) << endl;
#define COUT(n, a) cout << fixed << setprecision(a) << n << endl
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define flsh '\n' << flush
#define arr(a, n) \
for (ll i = 1; i <= n; i++) \
cout << a[i] << " "; \
cout << "\n";
#define vecc(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
cout << "\n";
#define CURTIME() cerr << clock() * 1.0 / CLOCKS_PER_SEC << endl
#define DTIME(ccc) \
__begin = clock(); \
ccc; \
cerr << "Time of work = " << (clock() - __begin) / CLOCKS_PER_SEC << endl;
#define MAX3 2010
#define MAX4 20010
#define MAX5 200010
#define MAX6 2000010
#define MOD1 1000000007
#define MOD2 998244353
// cin.ignore (7777, '\n');
using namespace std;
using namespace __gnu_pbds;
#define debug(args...) (Debugger()), args
class Debugger {
public:
Debugger(const std::string &_separator = ", ")
: first(true), separator(_separator) {}
template <typename ObjectType> Debugger &operator,(const ObjectType &v) {
if (!first)
cerr << separator;
cerr << v;
first = false;
return *this;
}
~Debugger() { cerr << endl; }
private:
bool first;
string separator;
};
template <typename T1, typename T2>
inline ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
bool first = true;
os << "[";
for (unsigned ll i = 0; i < v.size(); i++) {
if (!first)
os << ", ";
os << v[i];
first = false;
}
return os << "]";
}
template <typename T> inline ostream &operator<<(ostream &os, const set<T> &v) {
bool first = true;
os << "[";
for (typename set<T>::const_iterator ii = v.begin(); ii != v.end(); ++ii) {
if (!first)
os << ", ";
os << *ii;
first = false;
}
return os << "]";
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &os, const map<T1, T2> &v) {
bool first = true;
os << "[";
for (typename map<T1, T2>::const_iterator ii = v.begin(); ii != v.end();
++ii) {
if (!first)
os << ", ";
os << *ii;
first = false;
}
return os << "]";
}
ll minn = LLONG_MAX;
ll l, r;
int main() {
FAST_READ;
cin >> l >> r;
for (ll i = l; i <= r; i++) {
for (ll j = l; j <= r; j++) {
if (i == j)
continue;
minn = min(minn, (i * j) % 2019);
if (minn == 0)
break;
}
}
cout << minn << endl;
return 0;
}
| /*
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 \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #define _CRT_SECURE_NO_WARNINGS
// #include <boost/multiprecision/cpp_int.hpp>
// using boost::multiprecision::cpp_int;
#define FAST_READ ios_base::sync_with_stdio(0);
#define in freopen("input.txt", "r", stdin);
#define out freopen("output.txt", "w", stdout);
#define ll long long
#define debt(x, y) \
cout << "#x = " << (x) << " and " \
<< "#y = " << (y) << endl;
#define deb(x) cout << "#x = " << (x) << endl;
#define COUT(n, a) cout << fixed << setprecision(a) << n << endl
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define flsh '\n' << flush
#define arr(a, n) \
for (ll i = 1; i <= n; i++) \
cout << a[i] << " "; \
cout << "\n";
#define vecc(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
cout << "\n";
#define CURTIME() cerr << clock() * 1.0 / CLOCKS_PER_SEC << endl
#define DTIME(ccc) \
__begin = clock(); \
ccc; \
cerr << "Time of work = " << (clock() - __begin) / CLOCKS_PER_SEC << endl;
#define MAX3 2010
#define MAX4 20010
#define MAX5 200010
#define MAX6 2000010
#define MOD1 1000000007
#define MOD2 998244353
// cin.ignore (7777, '\n');
using namespace std;
using namespace __gnu_pbds;
#define debug(args...) (Debugger()), args
class Debugger {
public:
Debugger(const std::string &_separator = ", ")
: first(true), separator(_separator) {}
template <typename ObjectType> Debugger &operator,(const ObjectType &v) {
if (!first)
cerr << separator;
cerr << v;
first = false;
return *this;
}
~Debugger() { cerr << endl; }
private:
bool first;
string separator;
};
template <typename T1, typename T2>
inline ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
bool first = true;
os << "[";
for (unsigned ll i = 0; i < v.size(); i++) {
if (!first)
os << ", ";
os << v[i];
first = false;
}
return os << "]";
}
template <typename T> inline ostream &operator<<(ostream &os, const set<T> &v) {
bool first = true;
os << "[";
for (typename set<T>::const_iterator ii = v.begin(); ii != v.end(); ++ii) {
if (!first)
os << ", ";
os << *ii;
first = false;
}
return os << "]";
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &os, const map<T1, T2> &v) {
bool first = true;
os << "[";
for (typename map<T1, T2>::const_iterator ii = v.begin(); ii != v.end();
++ii) {
if (!first)
os << ", ";
os << *ii;
first = false;
}
return os << "]";
}
ll minn = LLONG_MAX;
ll l, r;
int main() {
FAST_READ;
cin >> l >> r;
if (r - l + 1 > 2019) {
cout << 0 << endl;
return 0;
}
for (ll i = l; i <= r; i++) {
for (ll j = l; j <= r; j++) {
if (i == j)
continue;
minn = min(minn, (i * j) % 2019);
if (minn == 0)
break;
}
}
cout << minn << endl;
return 0;
}
| 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, x);
}
}
cout << ans << endl;
return 0;
} | #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, x);
}
}
cout << ans << endl;
return 0;
} | 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);
}
}
cout << ans;
}
| 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 << ans << endl;
return 0;
} | #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 << ans << endl;
return 0;
} | 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;
i = k;
j = m;
}
}
}
cout << tmp << endl;
return 0;
} | #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;
i = k;
j = m;
}
}
}
cout << tmp << endl;
return 0;
} | 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 (ll i = L; i < R; ++i) {
for (ll j = i + 1; j <= R; ++j) {
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
return 0;
}
| #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 - L + 1 > 2019) {
cout << 0 << endl;
return 0;
} else {
for (ll i = L; i < R; ++i) {
for (ll j = i + 1; j <= R; ++j) {
ans = min(ans, (i * j) % 2019);
}
}
}
cout << ans << endl;
return 0;
} | 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(ans, x);
}
}
cout << ans << endl;
} | #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(ans, x);
}
}
cout << ans << endl;
} | 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); \
cout.tie(0);
typedef pair<int, int> PII;
int main() {
FIO;
ll l, r;
cin >> l >> r;
vector<ll> v;
if (r - l >= 2019) {
cout << 0 << endl;
}
for (ll i = l; i <= r; i++) {
v.push_back(i);
}
ll n = v.size();
ll ans = INT_MAX;
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j < n; j++) {
ll x = v[i] * v[j];
x %= 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
return 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); \
cout.tie(0);
typedef pair<int, int> PII;
int main() {
FIO;
ll l, r;
cin >> l >> r;
vector<ll> v;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
}
for (ll i = l; i <= r; i++) {
v.push_back(i);
}
ll n = v.size();
ll ans = INT_MAX;
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j < n; j++) {
ll x = v[i] * v[j];
x %= 2019;
ans = min(ans, x);
}
}
cout << ans << endl;
return 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;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = 1 << 29;
typedef long long int ll;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int &n, int b) { n |= two(b); }
inline void unset_bit(int &n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
int res = 0;
while (n && ++res)
n -= n & (-n);
return res;
}
template <class T> void chmax(T &a, const T &b) { a = max(a, b); }
template <class T> void chmin(T &a, const T &b) { a = min(a, b); }
const int MOD = 1000000007;
bool isPowerOfTwo(ll x) { return x && (!(x & (x - 1))); }
bool isPrime(int n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
int highestPowerof2(unsigned int n) {
// Invalid input
if (n < 1)
return 0;
int res = 1;
for (int i = 0; i < 8 * sizeof(unsigned int); i++) {
int curr = 1 << i;
if (curr > n)
break;
res = curr;
}
return res;
}
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
////////////////////////////////////////////////////////////////////
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
while (t--) {
ll l, r;
cin >> l >> r;
bool flag = false;
ll mn = INT64_MAX;
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j <= r; j++) {
ll c = ((i % 2019) * (j % 2019)) % 2019;
if (c == 0) {
flag = true;
break;
}
mn = min(mn, c);
}
}
if (flag)
cout << 0;
else
cout << mn;
}
return 0;
} | #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;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = 1 << 29;
typedef long long int ll;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int &n, int b) { n |= two(b); }
inline void unset_bit(int &n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
int res = 0;
while (n && ++res)
n -= n & (-n);
return res;
}
template <class T> void chmax(T &a, const T &b) { a = max(a, b); }
template <class T> void chmin(T &a, const T &b) { a = min(a, b); }
const int MOD = 1000000007;
bool isPowerOfTwo(ll x) { return x && (!(x & (x - 1))); }
bool isPrime(int n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
int highestPowerof2(unsigned int n) {
// Invalid input
if (n < 1)
return 0;
int res = 1;
for (int i = 0; i < 8 * sizeof(unsigned int); i++) {
int curr = 1 << i;
if (curr > n)
break;
res = curr;
}
return res;
}
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
////////////////////////////////////////////////////////////////////
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
while (t--) {
ll l, r;
cin >> l >> r;
bool flag = false;
ll mn = INT64_MAX;
for (ll i = l; i < r; i++) {
for (ll j = l + 1; j <= r; j++) {
ll c = ((i % 2019) * (j % 2019)) % 2019;
if (c == 0) {
flag = true;
break;
}
mn = min(mn, c);
}
if (flag)
break;
}
if (flag)
cout << 0;
else
cout << mn;
}
return 0;
} | 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; i++)
#define arr(var, n) \
vec var(n); \
rep(i, n) { cin >> var[i]; }
#define all(var) (var).begin(), (var).end()
#define sortall(var) sort(all(var))
#define prt(var) cout << var << endl
#define prtd(n, var) cout << fixed << setprecision(n) << var << endl
#define prt2(var1, var2) cout << var1 << " " << var2 << endl
//----------------------------------------------------------------
int main(void) {
ll l, r;
cin >> l >> r;
if (l - r + 1 > 2018) {
prt(0);
return 0;
}
ll ans = 2020;
REP(i, l, r) {
REP(j, i + 1, r + 1) {
ll tmp = ((i % 2019) * (j % 2019)) % 2019;
if (ans > tmp) {
ans = tmp;
}
}
}
prt(ans);
}
| #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; i++)
#define arr(var, n) \
vec var(n); \
rep(i, n) { cin >> var[i]; }
#define all(var) (var).begin(), (var).end()
#define sortall(var) sort(all(var))
#define prt(var) cout << var << endl
#define prtd(n, var) cout << fixed << setprecision(n) << var << endl
#define prt2(var1, var2) cout << var1 << " " << var2 << endl
//----------------------------------------------------------------
int main(void) {
ll l, r;
cin >> l >> r;
if (r - l + 1 > 2018) {
prt(0);
return 0;
}
ll ans = 2020;
REP(i, l, r) {
REP(j, i + 1, r + 1) {
ll tmp = ((i % 2019) * (j % 2019)) % 2019;
if (ans > tmp) {
ans = tmp;
}
}
}
prt(ans);
}
| 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 = INFINITY;
for (ll i = L; i <= R - 1; i++) {
for (ll j = i + 1; j <= R; j++) {
rest = min(rest, (i * j) % mod);
}
}
cout << rest << endl;
return 0;
} | #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 = INFINITY;
if ((R - L) > mod) {
R = L + mod;
}
for (ll i = L; i <= R - 1; i++) {
for (ll j = i + 1; j <= R; j++) {
rest = min(rest, (i * j) % mod);
}
}
cout << rest << endl;
return 0;
} | 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; i < l + 1; i++) {
for (int j = i + 1; j < l + 1; j++) {
int ss = (i * j) % 2019;
ans = min(ans, ss);
}
}
cout << ans << endl;
}
| #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++) {
if (i % 2019 == 0) {
cout << 0 << endl;
return 0;
}
}
r = r % 2019;
l = l % 2019;
int ans = 2019;
for (int i = r; i < l + 1; i++) {
for (int j = i + 1; j < l + 1; j++) {
int ss = (i * j) % 2019;
ans = min(ans, ss);
}
}
cout << ans << endl;
}
| 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) = i % 2019;
if (v.at(j) == 0) {
cout << 0 << endl;
return 0;
}
}
unsigned long mn = 2019;
for (i = 0; i < v.size() - 1; i++) {
for (j = i + 1; j < v.size(); j++) {
mn = min(mn, (v.at(i) * v.at(j)) % 2019);
}
}
cout << mn << endl;
return 0;
}
| #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 long i, j;
for (i = L, j = 0; i <= R; i++, j++) {
v.at(j) = i % 2019;
if (v.at(j) == 0) {
cout << 0 << endl;
return 0;
}
}
unsigned long mn = 2019;
for (i = 0; i < v.size() - 1; i++) {
for (j = i + 1; j < v.size(); j++) {
mn = min(mn, (v.at(i) * v.at(j)) % 2019);
}
}
cout << mn << endl;
return 0;
}
| 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);
}
}
}
cout << result << endl;
} | #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);
}
}
}
cout << result << endl;
} | 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) % 2019;
ans = min(c, ans);
}
}
cout << ans << endl;
} else {
cout << 0 << endl;
}
} | #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) % 2019;
ans = min(c, ans);
}
}
cout << ans << endl;
} else {
cout << 0 << endl;
}
}
| 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 = i % mod;
res *= j;
res %= mod;
ans = min(ans, res);
if (ans == 0)
break;
}
}
cout << ans << endl;
// int s = l % mod;
// vector<int> a;
// a.push_back(l%mod);
// int cnt = 0;
// for(int i = l + 1; i <= r; i++){
// if(i%mod == s) {
// cnt ++;
// if(cnt >= 3) break;
// }
// a.push_back(i%mod);
// }
// sort(a.begin(), a.end());
// // for(int i = 0; i < a.size(); i++) cout << a[i] << endl;
// cout << a[0] * a[1] % mod << endl;
return 0;
} | #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 = i % mod;
res *= j;
res %= mod;
ans = min(ans, res);
if (ans == 0)
break;
}
if (ans == 0)
break;
}
cout << ans << endl;
// int s = l % mod;
// vector<int> a;
// a.push_back(l%mod);
// int cnt = 0;
// for(int i = l + 1; i <= r; i++){
// if(i%mod == s) {
// cnt ++;
// if(cnt >= 3) break;
// }
// a.push_back(i%mod);
// }
// sort(a.begin(), a.end());
// // for(int i = 0; i < a.size(); i++) cout << a[i] << endl;
// cout << a[0] * a[1] % mod << endl;
return 0;
} | 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 optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define STI(s) atoi(s.c_str())
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
int main(void) {
ll l, r;
cin >> l >> r;
if (l - r > 2019) {
fin(0);
return 0;
}
ll ans = LLINF;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
chmin(ans, i * j % 2019);
}
}
fin(ans);
} | #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 optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define STI(s) atoi(s.c_str())
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
int main(void) {
ll l, r;
cin >> l >> r;
if (r - l > 2019) {
fin(0);
return 0;
}
ll ans = LLINF;
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
chmin(ans, i * j % 2019);
}
}
fin(ans);
} | 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 + 1; j < R + 1; j++) {
a = i * j;
ans = min(a % 2019, ans);
}
}
cout << ans << endl;
return 0;
}
} | #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 + 1; j < R + 1; j++) {
a = i * j;
ans = min(a % 2019, ans);
}
}
cout << ans << endl;
return 0;
}
} | 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; j <= r; j++) {
res = min(res, i * j % 2019);
if (res == 0)
break;
}
}
cout << res << endl;
return 0;
}
/*
やっほい！
やほほい！
+ *
∧∧ . ∧∞∧ *
* ヽ(=´ω｀)人(´ω｀*)ﾉ
.～（ O x.） （ O)～ +
。* ∪ ∪
*/ | #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; j <= r; j++) {
res = min(res, i * j % 2019);
if (res == 0)
break;
}
if (res == 0)
break;
}
cout << res << endl;
return 0;
}
/*
やっほい！
やほほい！
+ *
∧∧ . ∧∞∧ *
* ヽ(=´ω｀)人(´ω｀*)ﾉ
.～（ O x.） （ O)～ +
。* ∪ ∪
*/ | 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 = min(ans, (i * j) % 2019);
}
}
}
// 表示
cout << ans << endl;
} | 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 ll MOD = 998244353;
const ll INF = 1e18;
const ll zero = 0;
using P = pair<ll, ll>;
void chmin(ll &a, ll b) {
if (a > b)
a = b;
}
void chmax(ll &a, ll b) {
if (a < b)
a = b;
}
void pmod(ll &a, ll b) { a = (a + b) % MOD; }
void pmod(ll &a, ll b, ll c) { a = (b + c) % MOD; }
void qmod(ll &a, ll b) { a = (a * b) % MOD; }
void qmod(ll &a, ll b, ll c) { a = (b * c) % MOD; }
void ans1(bool x) {
if (x)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ans2(bool x) {
if (x)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void ans3(bool x) {
if (x)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
void ans(bool x, ll y, ll z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
void ans(bool x, string y, string z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
ll gcd(ll x, ll y) {
ll r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
int main() {
ll i, j, o;
ll res = 0, res1 = INF, res2 = -INF, buf = 0, buf1 = 0, buf2 = 0, buf3 = 0,
buf4 = 0, sum = 0;
bool judge = true;
ll l, r;
cin >> l >> r;
for (i = l; i <= r && i <= l + 2019; i++) {
for (j = i + 1; j <= r && j <= r + 2019; j++) {
chmin(res1, (i * j) % 2019);
}
}
cout << res1 << endl;
return 0;
} | #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 ll MOD = 998244353;
const ll INF = 1e18;
const ll zero = 0;
using P = pair<ll, ll>;
void chmin(ll &a, ll b) {
if (a > b)
a = b;
}
void chmax(ll &a, ll b) {
if (a < b)
a = b;
}
void pmod(ll &a, ll b) { a = (a + b) % MOD; }
void pmod(ll &a, ll b, ll c) { a = (b + c) % MOD; }
void qmod(ll &a, ll b) { a = (a * b) % MOD; }
void qmod(ll &a, ll b, ll c) { a = (b * c) % MOD; }
void ans1(bool x) {
if (x)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ans2(bool x) {
if (x)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void ans3(bool x) {
if (x)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
void ans(bool x, ll y, ll z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
void ans(bool x, string y, string z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
ll gcd(ll x, ll y) {
ll r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
int main() {
ll i, j, o;
ll res = 0, res1 = INF, res2 = -INF, buf = 0, buf1 = 0, buf2 = 0, buf3 = 0,
buf4 = 0, sum = 0;
bool judge = true;
ll l, r;
cin >> l >> r;
for (i = l; i <= r && i <= l + 2019; i++) {
for (j = i + 1; j <= r && j <= l + 2019; j++) {
chmin(res1, (i * j) % 2019);
}
}
cout << res1 << endl;
return 0;
} | 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;
}
}
if (saisyou == 0)
cout << 0 << endl;
else
cout << saisyou << endl;
} | #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;
}
if (saisyou == 0)
break;
}
if (saisyou == 0)
cout << 0 << endl;
else
cout << saisyou << endl;
} | 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; j++)
ans = min(ans, (i * j) % 2019);
cout << ans;
}
| #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; j++)
ans = min(ans, (i * j) % 2019);
cout << ans;
}
| 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;
return 0;
} | 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 >= 0; --i)
#define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i)
#define range(i, a, b, c) for (int i = a; c > 0 ? i < b : i > b; i += c)
#define chmax(a, b) (a = (a) < (b) ? (b) : (a))
#define chmin(a, b) (a = (a) > (b) ? (b) : (a))
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define ifnot(a) if (not(a))
#define int long long
#ifdef LOCAL_ENV
#if TEST_MODE == true
const bool test = true;
#define dump(x) cerr << #x << " : " << (x) << " "
#define dumpl(x) dump(x) << endl
#else
const bool test = false;
#define dump(x)
#define dumpl(x)
#endif
#else
const bool test = false;
#define dump(x)
#define dumpl(x)
#endif
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const int inf = (int)1 << 60;
const int undefined = inf;
const ll INFL = (ll)1 << 60;
ll mod_n = (int)1e9 + 7;
const double eps = 1e-10;
typedef long double Real;
// return -1, 0, 1
int sgn(const Real &r) { return (r > eps) - (r < -eps); }
int sgn(const Real &a, const Real &b) { return sgn(a - b); }
//.....................
const int MAX = (int)2e5 + 5;
vector<string> split(const string &str, char sep) {
vector<string> v;
stringstream ss(str);
string buffer;
while (getline(ss, buffer, sep)) {
v.push_back(buffer);
}
return v;
}
string join(const vector<string> &v, const string delim = 0) {
string s;
if (!v.empty()) {
s += v[0];
for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
if (delim != "")
s += delim;
s += v[i];
}
}
return s;
}
string operator*(const string &s, const int &n) {
string res = "";
rep(i, n) res += s;
return res;
}
template <class InputIterator> int sum(InputIterator begin, InputIterator end) {
return accumulate(begin, end, 0ll);
}
template <typename T> T gcd(T a, T b) {
if (a == inf)
return b;
if (b == inf)
return a;
T c;
while (a != 0) {
c = a;
a = b % a;
b = c;
}
return b;
}
template <typename T> T lcm(T m, T n) { return ((m / gcd(m, n)) * n); }
template <typename T> T bit_count(T N) {
T cnt = 0;
while (N) {
if (N & 1)
cnt++;
N >>= 1;
}
return cnt;
}
template <typename T> void print_vec(ostream &ostream, vector<T> a) {
rep(i, a.size() - 1) ostream << a[i] << " ";
ostream << a.back() << endl;
}
ll pow_n(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x;
x = x * x;
n >>= 1;
}
return res;
}
template <class T, class U> T mod_pow(T x, U n) {
T res = 1;
while (n > 0) {
if (n & 1)
res = res * x;
x = x * x;
x %= mod_n;
n >>= 1;
res %= mod_n;
}
return res;
}
template <class T> T mod_rev(T a) {
T res = 1;
return mod_pow(a, mod_n - 2);
}
int H, W;
bool grid_ng(int y, int x) { return y < 0 || y >= H || x < 0 || x >= W; }
struct Point {
int x, y;
Point(int y_, int x_) : y(y_), x(x_) {}
bool operator<(const Point &r) const {
if (y != r.y)
return y < r.y;
return x < r.x;
}
};
struct Vertex {
int id, dist;
bool operator>(const Vertex &r) const { return dist > r.dist; }
};
struct Edge {
int to, weight;
Edge(int to, int weight) : to(to), weight(weight) {}
};
using Graph = vector<vector<Edge>>;
Graph g;
class Solver {
public:
int l, r;
void solve() {
cin >> l >> r;
int res = inf;
rep(loop, (int)1e8) {
int diff = r - l + 1;
int i = l + rand() % diff; // dumpl(i);
int j = l + rand() % diff; // dumpl(j);
if (i == j)
continue;
if (i > j)
swap(i, j);
chmin(res, i * j % 2019);
}
cout << res << endl;
}
};
signed main() {
srand((unsigned int)time(NULL));
cout << fixed << setprecision(20);
cerr << fixed << setprecision(20);
auto ptr = new Solver();
ptr->solve();
delete ptr;
// while(true) {
// auto ptr = new Solver();
// ptr->solve();
// delete ptr;
// }
// while (true) {
// if (cin.eof() == true) break;
// auto ptr = new Solver();
// ptr->solve();
// delete ptr;
// }
return 0;
}
| #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 >= 0; --i)
#define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i)
#define range(i, a, b, c) for (int i = a; c > 0 ? i < b : i > b; i += c)
#define chmax(a, b) (a = (a) < (b) ? (b) : (a))
#define chmin(a, b) (a = (a) > (b) ? (b) : (a))
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define ifnot(a) if (not(a))
#define int long long
#ifdef LOCAL_ENV
#if TEST_MODE == true
const bool test = true;
#define dump(x) cerr << #x << " : " << (x) << " "
#define dumpl(x) dump(x) << endl
#else
const bool test = false;
#define dump(x)
#define dumpl(x)
#endif
#else
const bool test = false;
#define dump(x)
#define dumpl(x)
#endif
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const int inf = (int)1 << 60;
const int undefined = inf;
const ll INFL = (ll)1 << 60;
ll mod_n = (int)1e9 + 7;
const double eps = 1e-10;
typedef long double Real;
// return -1, 0, 1
int sgn(const Real &r) { return (r > eps) - (r < -eps); }
int sgn(const Real &a, const Real &b) { return sgn(a - b); }
//.....................
const int MAX = (int)2e5 + 5;
vector<string> split(const string &str, char sep) {
vector<string> v;
stringstream ss(str);
string buffer;
while (getline(ss, buffer, sep)) {
v.push_back(buffer);
}
return v;
}
string join(const vector<string> &v, const string delim = 0) {
string s;
if (!v.empty()) {
s += v[0];
for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
if (delim != "")
s += delim;
s += v[i];
}
}
return s;
}
string operator*(const string &s, const int &n) {
string res = "";
rep(i, n) res += s;
return res;
}
template <class InputIterator> int sum(InputIterator begin, InputIterator end) {
return accumulate(begin, end, 0ll);
}
template <typename T> T gcd(T a, T b) {
if (a == inf)
return b;
if (b == inf)
return a;
T c;
while (a != 0) {
c = a;
a = b % a;
b = c;
}
return b;
}
template <typename T> T lcm(T m, T n) { return ((m / gcd(m, n)) * n); }
template <typename T> T bit_count(T N) {
T cnt = 0;
while (N) {
if (N & 1)
cnt++;
N >>= 1;
}
return cnt;
}
template <typename T> void print_vec(ostream &ostream, vector<T> a) {
rep(i, a.size() - 1) ostream << a[i] << " ";
ostream << a.back() << endl;
}
ll pow_n(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x;
x = x * x;
n >>= 1;
}
return res;
}
template <class T, class U> T mod_pow(T x, U n) {
T res = 1;
while (n > 0) {
if (n & 1)
res = res * x;
x = x * x;
x %= mod_n;
n >>= 1;
res %= mod_n;
}
return res;
}
template <class T> T mod_rev(T a) {
T res = 1;
return mod_pow(a, mod_n - 2);
}
int H, W;
bool grid_ng(int y, int x) { return y < 0 || y >= H || x < 0 || x >= W; }
struct Point {
int x, y;
Point(int y_, int x_) : y(y_), x(x_) {}
bool operator<(const Point &r) const {
if (y != r.y)
return y < r.y;
return x < r.x;
}
};
struct Vertex {
int id, dist;
bool operator>(const Vertex &r) const { return dist > r.dist; }
};
struct Edge {
int to, weight;
Edge(int to, int weight) : to(to), weight(weight) {}
};
using Graph = vector<vector<Edge>>;
Graph g;
class Solver {
public:
int l, r;
void solve() {
cin >> l >> r;
int res = inf;
rep(loop, (int)1e7) {
int diff = r - l + 1;
int i = l + rand() % diff; // dumpl(i);
int j = l + rand() % diff; // dumpl(j);
if (i == j)
continue;
if (i > j)
swap(i, j);
chmin(res, i * j % 2019);
}
cout << res << endl;
}
};
signed main() {
srand((unsigned int)time(NULL));
cout << fixed << setprecision(20);
cerr << fixed << setprecision(20);
auto ptr = new Solver();
ptr->solve();
delete ptr;
// while(true) {
// auto ptr = new Solver();
// ptr->solve();
// delete ptr;
// }
// while (true) {
// if (cin.eof() == true) break;
// auto ptr = new Solver();
// ptr->solve();
// delete ptr;
// }
return 0;
}
| 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 << x << std::endl;
return 0;
} | #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 << endl;
return 0;
}
x = min(x, (i * j) % 2019);
}
}
std::cout << x << std::endl;
return 0;
} | 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;
mini = min((i * j) % 2019, mini);
}
}
cout << mini << 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;
mini = min((i * j) % 2019, mini);
}
}
cout << mini << 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>
#include <iomanip>
#include <iostream>
#include <list>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<VB> VVB;
typedef vector<VS> VVS;
typedef vector<VLL> VVLL;
typedef vector<VVI> VVVI;
typedef vector<VVLL> VVVLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, string> PIS;
typedef pair<string, int> PSI;
typedef pair<string, string> PSS;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<VPII> VVPII;
typedef vector<VPLL> VVPLL;
typedef vector<VS> VVS;
typedef map<int, int> MII;
typedef map<LL, LL> MLL;
typedef map<string, int> MSI;
typedef map<int, string> MIS;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define EACH(i, arr) \
for (typeof((arr).begin()) i = (arr).begin(); i != (arr).end(); ++i)
#define EXIST(str, e) ((str).find(e) != (str).end())
#define COUNT(arr, v) count((arr).begin(), (arr).end(), v)
#define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define ROTATE_LEFT(arr, c) \
rotate((arr).begin(), (arr).begin() + (c), (arr).end())
#define ROTATE_RIGHT(arr, c) \
rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend())
#define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0)
#define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.)
#define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL)
#define MULD(arr) \
accumulate((arr).begin(), (arr).end(), 1., multiplies<double>())
#define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n)
#define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n)
#define PB push_back
#define MP make_pair
#define ft first
#define sd second
// input output
//------------------------------------------
#define GL(s) getline(cin, (s))
#define INIT() \
std::ios::sync_with_stdio(false); \
std::cin.tie(0)
#define OUT(d) std::cout << (d)
#define OUT_L(d) std::cout << (d) << endl
#define FOUT(n, data) std::cout << std::fixed << std::setprecision(n) << (data)
#define FOUT_L(n, data) \
std::cout << std::fixed << std::setprecision(n) << (data) << "\n"
#define EL() printf("\n")
#define SHOW_VECTOR(v) \
{ \
std::cerr << #v << "\t:"; \
for (const auto &xxx : v) { \
std::cerr << xxx << " "; \
} \
std::cerr << "\n"; \
}
#define SHOW_MAP(v) \
{ \
std::cerr << #v << endl; \
for (const auto &xxx : v) { \
std::cerr << xxx.first << " " << xxx.second << "\n"; \
} \
}
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yay() printf("Yay!\n")
#define Nnn() printf(":(\n")
#define CE(x, y) ((x + y - 1) / (y))
template <typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
in >> p.first >> p.second;
return in;
}
template <typename T> istream &operator>>(istream &in, vector<T> &v) {
for (auto &x : v)
in >> x;
return in;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
out << "[" << p.first << ", " << p.second << "]"
<< "\n";
return out;
}
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FORLL(i, a, b) for (LL i = LL(a); i < LL(b); ++i)
#define RFORLL(i, a, b) for (LL i = LL(b) - 1; i >= LL(a); --i)
#define REPLL(i, n) for (LL i = 0; i < LL(n); ++i)
#define RREPLL(i, n) for (LL i = LL(n) - 1; i >= 0; --i)
#define FOREACH(x, arr) for (auto &(x) : (arr))
//------------------------------------------
//------------------------------------------
constexpr LL MA = 2022;
int main() {
LL L, R;
cin >> L >> R;
LL ans = 1e18;
for (LL i = L; i <= R; i++) {
for (LL j = 1; j <= MA; j++) {
LL to = i + j;
if (to <= R) {
ans = min(ans, i * to % 2019);
}
}
}
cout << ans << endl;
}
| // 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>
#include <iomanip>
#include <iostream>
#include <list>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<VB> VVB;
typedef vector<VS> VVS;
typedef vector<VLL> VVLL;
typedef vector<VVI> VVVI;
typedef vector<VVLL> VVVLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, string> PIS;
typedef pair<string, int> PSI;
typedef pair<string, string> PSS;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<VPII> VVPII;
typedef vector<VPLL> VVPLL;
typedef vector<VS> VVS;
typedef map<int, int> MII;
typedef map<LL, LL> MLL;
typedef map<string, int> MSI;
typedef map<int, string> MIS;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define EACH(i, arr) \
for (typeof((arr).begin()) i = (arr).begin(); i != (arr).end(); ++i)
#define EXIST(str, e) ((str).find(e) != (str).end())
#define COUNT(arr, v) count((arr).begin(), (arr).end(), v)
#define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define ROTATE_LEFT(arr, c) \
rotate((arr).begin(), (arr).begin() + (c), (arr).end())
#define ROTATE_RIGHT(arr, c) \
rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend())
#define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0)
#define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.)
#define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL)
#define MULD(arr) \
accumulate((arr).begin(), (arr).end(), 1., multiplies<double>())
#define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n)
#define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n)
#define PB push_back
#define MP make_pair
#define ft first
#define sd second
// input output
//------------------------------------------
#define GL(s) getline(cin, (s))
#define INIT() \
std::ios::sync_with_stdio(false); \
std::cin.tie(0)
#define OUT(d) std::cout << (d)
#define OUT_L(d) std::cout << (d) << endl
#define FOUT(n, data) std::cout << std::fixed << std::setprecision(n) << (data)
#define FOUT_L(n, data) \
std::cout << std::fixed << std::setprecision(n) << (data) << "\n"
#define EL() printf("\n")
#define SHOW_VECTOR(v) \
{ \
std::cerr << #v << "\t:"; \
for (const auto &xxx : v) { \
std::cerr << xxx << " "; \
} \
std::cerr << "\n"; \
}
#define SHOW_MAP(v) \
{ \
std::cerr << #v << endl; \
for (const auto &xxx : v) { \
std::cerr << xxx.first << " " << xxx.second << "\n"; \
} \
}
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yay() printf("Yay!\n")
#define Nnn() printf(":(\n")
#define CE(x, y) ((x + y - 1) / (y))
template <typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
in >> p.first >> p.second;
return in;
}
template <typename T> istream &operator>>(istream &in, vector<T> &v) {
for (auto &x : v)
in >> x;
return in;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
out << "[" << p.first << ", " << p.second << "]"
<< "\n";
return out;
}
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FORLL(i, a, b) for (LL i = LL(a); i < LL(b); ++i)
#define RFORLL(i, a, b) for (LL i = LL(b) - 1; i >= LL(a); --i)
#define REPLL(i, n) for (LL i = 0; i < LL(n); ++i)
#define RREPLL(i, n) for (LL i = LL(n) - 1; i >= 0; --i)
#define FOREACH(x, arr) for (auto &(x) : (arr))
//------------------------------------------
//------------------------------------------
constexpr LL MA = 2022;
int main() {
LL L, R;
cin >> L >> R;
LL ans = 1e18;
for (LL i = L; i <= min(L + MA, R); i++) {
for (LL j = 1; j <= MA; j++) {
LL to = i + j;
if (to <= R) {
ans = min(ans, i * to % 2019);
}
}
}
cout << ans << endl;
}
| 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_P;
const int INF = INT_MAX;
const int MIN = INT_MIN;
const LL LINF = LLONG_MAX;
const int MOD = 1000000000 + 7;
const int SIZE = 100005;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL l, r;
cin >> l >> r;
LL res = INF;
if (l - r >= 2018)
cout << 0 << endl;
else {
for (LL i = l; i <= r; ++i) {
for (LL j = i + 1; j <= r; ++j) {
res = min(res, i * j % 2019);
}
}
cout << res << endl;
}
return 0;
}
| #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_P;
const int INF = INT_MAX;
const int MIN = INT_MIN;
const LL LINF = LLONG_MAX;
const int MOD = 1000000000 + 7;
const int SIZE = 100005;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL l, r;
cin >> l >> r;
LL res = INF;
if (r - l >= 2018)
cout << 0 << endl;
else {
for (LL i = l; i <= r; ++i) {
for (LL j = i + 1; j <= r; ++j) {
res = min(res, i * j % 2019);
}
}
cout << res << endl;
}
return 0;
}
| 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 = 1e-6;
const int MAXN = 1e6 + 5;
const ll MOD = 1e9 + 7;
bool ODD(ll O) { return (O % 2 != 0); }
ll gcd(ll a, ll b) { return __gcd(a, b); }
int dx[] = {1, 0, -1, 0, -1, 0};
int dy[] = {0, 1, 0, -1, -1, 0};
ll power(ll x, ll y) {
if (y == 0)
return 1;
if (ODD(y))
return x * power(x, y / 2) * power(x, y / 2);
return power(x, y / 2) * power(x, y / 2);
}
/*------ never give up --------*/
int main() {
int t = 1;
// cin >> t;
while (t--) {
int a, b;
cin >> a >> b;
int ans = 1e9 + 5;
for (int i = a; i <= b; i++) {
for (int j = i + 1; j <= b; j++) {
int x = i % 2019;
int y = j % 2019;
ans = min(ans, (x * y) % 2019);
if (ans == 0)
break;
}
}
cout << ans;
}
return 0;
}
| #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 = 1e-6;
const int MAXN = 1e6 + 5;
const ll MOD = 1e9 + 7;
bool ODD(ll O) { return (O % 2 != 0); }
ll gcd(ll a, ll b) { return __gcd(a, b); }
int dx[] = {1, 0, -1, 0, -1, 0};
int dy[] = {0, 1, 0, -1, -1, 0};
ll power(ll x, ll y) {
if (y == 0)
return 1;
if (ODD(y))
return x * power(x, y / 2) * power(x, y / 2);
return power(x, y / 2) * power(x, y / 2);
}
/*------ never give up --------*/
int main() {
int t = 1;
// cin >> t;
while (t--) {
int a, b;
cin >> a >> b;
int ans = 1e9 + 5;
for (int i = a; i <= b; i++) {
for (int j = i + 1; j <= b; j++) {
int x = i % 2019;
int y = j % 2019;
ans = min(ans, (x * y) % 2019);
if (ans == 0) {
cout << ans;
return 0;
}
}
}
cout << ans;
}
return 0;
}
| 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(i * j % mod, ans); }
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)
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 + 1) ans = min(i * j % mod, ans); }
cout << ans;
}
| 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); }
cout << ans;
}
| 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, j, R + 1) {
ans = min(ans, (i * j) % mod);
if (ans == 0)
break;
}
}
cout << ans << endl;
}
| #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, j, R + 1) {
ans = min(ans, (i * j) % mod);
if (ans == 0)
break;
}
}
cout << ans << endl;
} | 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 = minq(minv, (i * j) % 2019);
if (minv == 0)
break;
}
}
cout << minv;
}
| #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 = minq(minv, (i * j) % 2019);
if (minv == 0)
break;
}
if (minv == 0)
break;
}
cout << minv;
}
| 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;
else {
int q = L / 2019;
L -= q * 2019;
R -= q * 2019;
rep2(i, L, R) { rep2(j, i + 1, R + 1) ans = min(ans, i * j % 2019); }
}
cout << ans << endl;
}
| #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;
else {
int q = L / 2019;
L -= q * 2019;
R -= q * 2019;
rep2(i, L, R) { rep2(j, i + 1, R + 1) ans = min(ans, i * j % 2019); }
}
cout << ans << endl;
}
| 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 MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define SCD(n) scanf("%d", &n)
#define SCD2(m, n) scanf("%d%d", &m, &n)
#define SCD3(m, n, k) scanf("%d%d%d", &m, &n, &k)
#define SCLLD(n) scanf("%lld", &n)
#define SCLLD2(m, n) scanf("%lld%lld", &m, &n)
#define SCLLD3(m, n, k) scanf("%lld%lld%lld", &m, &n, &k)
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
const ll MOD = 1e9 + 7;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
///////////////////////////////////////////////
/*⁽⁽(ી₍₍⁽⁽(ી( ˆεˆ )ʃ)₎₎⁾⁾ʃ)₎₎*/
int main() {
ll L, R;
ll L2, R2;
cin >> L >> R;
L2 = (L - 1) / 2019;
R2 = R / 2019;
if (L2 != R2) {
cout << 0 << endl;
}
ll ans = 1e16;
FORq(i, L, R) {
FORq(j, L, R) {
if (i == j)
continue;
chmin(ans, ((ll)i * (ll)j) % 2019);
}
}
cout << ans << "\n";
return 0;
}
| #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 MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define SCD(n) scanf("%d", &n)
#define SCD2(m, n) scanf("%d%d", &m, &n)
#define SCD3(m, n, k) scanf("%d%d%d", &m, &n, &k)
#define SCLLD(n) scanf("%lld", &n)
#define SCLLD2(m, n) scanf("%lld%lld", &m, &n)
#define SCLLD3(m, n, k) scanf("%lld%lld%lld", &m, &n, &k)
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
const ll MOD = 1e9 + 7;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
///////////////////////////////////////////////
/*⁽⁽(ી₍₍⁽⁽(ી( ˆεˆ )ʃ)₎₎⁾⁾ʃ)₎₎*/
int main() {
ll L, R;
ll L2, R2;
cin >> L >> R;
L2 = (L - 1) / 2019;
R2 = R / 2019;
if (L2 != R2) {
cout << 0 << endl;
return 0;
}
ll ans = 1e16;
FORq(i, L, R) {
FORq(j, L, R) {
if (i == j)
continue;
chmin(ans, ((ll)i * (ll)j) % 2019);
}
}
cout << ans << "\n";
return 0;
}
| 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; ++j) {
chmin(min, (i * j) % 2019);
if (min == 0) {
break;
}
}
}
cout << min << endl;
return 0;
}
/*
int main() {
ll L, R;
cin >> L >> R;
if((R - L) / 2019 > 0) {
cout << 0 << endl;
return 0;
}
ll l = L % 2019;
ll r = R % 2019;
if(l > r) {
cout << 0 << endl;
} else {
cout << l * (l + 1) << endl;
}
return 0;
}
*/ | #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 = i + 1; j < i + 1 + 2019 && j <= R; ++j) {
chmin(min, (i * j) % 2019);
if (min == 0) {
break;
}
}
}
cout << min << endl;
return 0;
}
/*
int main() {
ll L, R;
cin >> L >> R;
if((R - L) / 2019 > 0) {
cout << 0 << endl;
return 0;
}
ll l = L % 2019;
ll r = R % 2019;
if(l > r) {
cout << 0 << endl;
} else {
cout << l * (l + 1) << endl;
}
return 0;
}
*/ | 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);
}
}
cout << minimum;
return 0;
}
| #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);
if (minimum == 0) {
cout << minimum;
return 0;
}
}
}
cout << minimum;
return 0;
}
| 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; ++j) {
int jj = j % 2019;
int k = (ii * jj) % 2019;
minX = min(k, minX);
}
}
cout << minX << endl;
}
int main() {
ABC133C();
return 0;
} | #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 + 1; j <= R; ++j) {
int jj = j % 2019;
int k = (ii * jj) % 2019;
minX = min(k, minX);
}
}
cout << minX << endl;
}
int main() {
ABC133C();
return 0;
} | 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("%d", &test); \
while (test--)
#define yn(ans) cout << (ans ? "Yes" : "No") << endl
#define YN(ans) cout << (ans ? "YES" : "NO") << endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
// 入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
// 出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
// デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
int main() {
int l, r, a, ans;
in(l, r);
a = l - r + 1;
if (a >= 2019) {
out(0);
} else {
ans = 2019 * 2019;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
}
out(ans);
}
} | #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("%d", &test); \
while (test--)
#define yn(ans) cout << (ans ? "Yes" : "No") << endl
#define YN(ans) cout << (ans ? "YES" : "NO") << endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
// 入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
// 出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
// デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
int main() {
int l, r, a, ans;
in(l, r);
a = r - l + 1;
if (a >= 2019) {
out(0);
} else {
ans = 2019 * 2019;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
}
out(ans);
}
} | 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.