text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios::sync_with_stdio(0);cin.tie(0);
int t1, t2, a1, a2, b1, b2;
cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;
int da = t1*a1+t2*a2, db = t1*b1+t2*b2, da1 = t1*a1, db1 = t1*b1;
if(da == db)
return !(cout << "infinity");
if((da < db) == (da1 < db1))
return !(cout << 0);
int x = abs(da1-db1), y = abs(da-db);
cout << ((x+y-1)/y)*2-1+(x % y == 0);
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
struct edge {int to,costa,costb;};
signed main() {
int t1,t2,a1,a2,b1,b2,ans;
cin>>t1>>t2>>a1>>a2>>b1>>b2;
if(a1<b1){
a1*=-1;
b1*=-1;
a2*=-1;
b2*=-1;
}
if((a1-b1)*t1+(a2-b2)*t2>0){
cout<<0;
return 0;
}
if((a1-b1)*t1+(a2-b2)*t2==0){
cout<<"infinity";
return 0;
}
int x=(a1-b1)*t1,y=(a1-b1)*t1+(a2-b2)*t2;y*=-1;
ans=2*(x/y);
if(x%y==0){
cout<<ans;
}else {
//cerr<<(abs(a1-b1)*t1)%abs(abs(a1-b1)*t1-abs(a2-b2)*t2)<<endl;
cout<<1+ans;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long T1,T2,A1,A2,B1,B2;
cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;
long long d1 = (A1-B1)*T1,d2 = (A2-B2)*T2;
if(d1 > 0) {
d1 *= -1;
d2 *= -1;
}
if(d1+d2 < 0) cout << 0 << endl;
else if(d1+d2 == 0) cout << "infinity" << endl;
else {
long long n = -d1 / (d1+d2);
long long r = -d1 % (d1+d2);
if(r == 0) cout << n*2 << endl;
else cout << n*2+1 << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int INF=1e9;
const ll LINF=1e18;
int main(){
ll s,t;
cin>>s>>t;
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll x=s*(a-c);
ll y=t*(b-d);
if(x+y==0){
cout<<"infinity"<<endl;
return 0;
}
if(x+y<0){
x=-x;
y=-y;
}
if(x>0){
cout<<0<<endl;
return 0;
}
ll u=(-x)/(x+y)+1;
ll ans=((-x)/(x+y)+1)*2-1;
if((x+y)*(u-1)+x==0){
ans-=1;
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <cstdint>
using Int = std::int64_t;
int main() {
Int t1, t2, a1, a2, b1, b2;
std::cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;
Int x = t1 * (b1 - a1) + t2 * (b2 - a2);
Int h = t1 * (a1 - b1);
if (x == 0) {
std::cout << "infinity" << std::endl;
return 0;
}
if ((x > 0) != (h > 0))
std::cout << 0 << std::endl;
else
std::cout << 1 + h / x * 2 - (h % x == 0 ? 1 : 0) << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main (){
ll t1,t2,a1,a2,b1,b2;
scanf ("%lld%lld%lld%lld%lld%lld",&t1,&t2,&a1,&a2,&b1,&b2);
if (a1>b1) swap(a1,b1),swap(a2,b2);
if (a2<b2) {puts("0");return 0;}
ll l1=a1*t1+a2*t2,l2=b1*t1+b2*t2;
if (l1<l2) {puts("0");return 0;}
if (l1==l2) {puts("infinity");return 0;}
ll d1=t1*b1-t1*a1,d2=t2*a2-t2*b2,dt=l1-l2;
printf ("%lld",d1/dt*2+(d1%dt!=0));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<ll> t(2), a(2), b(2), d(2);
cin >> t[0] >> t[1] >> a[0] >> a[1] >> b[0] >> b[1];
for (int i = 0; i < 2; i++) d[i] = t[i] * a[i] - t[i] * b[i];
for (int i = 0; i + 1 < 2; i++) d[i + 1] += d[i];
if (d[1] == 0) {
cout << "infinity" << endl;
return 0;
} else if (d[1] < 0) {
for (int i = 0; i < 2; i++) d[i] = -d[i];
}
if (d[0] > 0) {
cout << 0 << endl;
} else {
cout << -d[0] / d[1] * 2 + int(-d[0] % d[1] != 0) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll T1, T2, A1, A2, B1, B2;
cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;
ll c1 = A1 - B1;
ll c2 = A2 - B2;
ll d = c1 * T1 + c2 * T2;
if ( d == 0 ) return -1;
if ( d < 0 ) {
d = -d, c1 = -c1, c2 = -c2;
}
if ( c1 > 0 ) return 0;
ll f = -c1 * T1;
ll r = f / d;
ll ans = 1 + 2*r;
if ( r * d == f ) ans--;
return ans;
}
int main() {
auto ans = solve();
if ( ans < 0 ) cout << "infinity" << "\n";
else cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l,r;
cin >> l >> r;
r = min(r,l+2019);
int ans = 2018;
for(long long i = l;i <= r;i++){
for(long long j = i+1;j <= r;j++){
int x = (i*j)%2019;
ans = min(ans,x);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll l, r, ans=2019;
int main() {
cin >> l >> r;
for (ll i = l; i <= min(r, l+2018); i++) {
for (ll j = i+1; j <= min(r, i+2019); j++) {
ans = min(ans, (i*j)%2019);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define M 25
int main(){//3 673
int L,R;
cin>>L>>R;
if(R-L+1>=673)puts("0");
else{
LL ans=1e9;
for(int i=L;i<=R;i++)
for(int j=i+1;j<=R;j++)
ans=min(ans,1LL*i*j%2019);
cout<<ans;
}
return 0;
}
|
//JSD
#include<iostream>
#define ll long long
using namespace std;
int main(){
ll l,r;
cin>>l>>r;
if(r-l+1>=2019){
cout<<"0";
}
else{
ll ans=2020;
for(ll i=l;i<r;i++){
for(ll j=i+1;j<=r;j++){
ll p=(i*j)%2019;
ans=min(ans,p);
}
}
cout<<ans;
}
cout<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r; cin >> l >> r;
r = min(r, l + 2019);
long long ans = 1e18;
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 << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
int main()
{
ll l,r,ans=2018;
cin>>l>>r;
r=min(r,l+4038);
for(ll i=l;i<=r;i++){
for(ll j=i+1;j<=r;j++){
ans=min(ans,i*j%2019);
}
}
cout<<ans;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
const int MOD = 2019;
int main() {
int L, R, m{MOD};
cin >> L >> R;
R = min(R - L, MOD);
L %= MOD;
for (int i = 0; i < R; ++i)
for (int j = i; j < R; ++j) m = min(m, (L + i) * (L + j + 1) % MOD);
cout << m << endl;
}
|
#include <bits/stdc++.h>
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+1;++i) {
for(ll j=i+1;j<r+1;++j) {
int x=i*j%2019;
ans=min(ans,x);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll l , r;
cin >> l >> r;
if(r-l>2019)
cout << 0;
else
{
ll ans = 2019*2019 ;
for(ll i = l ; i <= r ; i++)
for(ll j = i+1 ; j <= r ; j++)
ans = min(ans,((i%2019)*(j%2019))%2019);
cout << ans;
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int L,R;
int main(){
cin >> L >> R;
if(R-L>=2019) puts("0");
else {
ll ans=0x3f3f3f3f;
for(int i=L;i<=R;i++)
for(int j=i+1;j<=R;j++)
ans=min(ans,1ll*i*j%2019);
cout<<ans;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int l,r;
scanf("%d%d",&l,&r);
if(l%2019==0||(r/2019)-(l/2019)){printf("0");return 0;}
r%=2019,l%=2019;int ans=2019;
for(int i=l;i<=r;i++)for(int j=i+1;j<=r;j++)ans=min(ans,i*j%2019);
printf("%d",ans);
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll l , r;
cin >> l >> r;
if(r-l>2020)
cout << 0;
else
{
ll ans = 2019*2019 ;
for(ll i = l ; i <= r ; i++)
for(ll j = i+1 ; j <= r ; j++)
ans = min(ans,((i%2019)*(j%2019))%2019);
cout << ans;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long ans;
int main(){
long long l,r;
scanf("%lld%lld",&l,&r);
r=min(r,l+2019*2);
ans=1e9;
for (long long i=l; i<=r; i++){
for (long long j=i+1; j<=r; j++){
ans=min(ans,i*j%2019);
}
}
printf("%lld",ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b;
cin>>a>>b;
int mn = 2019;
if(b-a+1>=2019) cout<<0;
else{
for(int i=a; i<=b; i++){
for(int j=i+1; j<=b; j++){
mn = min(mn,( (i%2019)*(j%2019) )%2019);
}
}
cout<<mn;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long L,R;
cin>>L>>R;
long ans=1234567890;
for(long i=L;i<R;i++){
for(long j=i+1;j<=R;j++){
ans=min((i*j)%2019,ans);
if(ans==0){
cout<<0<<endl;
return 0;
}
}
}
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
int main() {
long long l,r;cin>>l>>r;
if(r-l>=2019){
cout<<0<<endl;
return 0;
}
long long ans=2019;
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;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l,r;
cin >> l >> r;
int m = 2018;
r = min(r, l+4038);
for (ll i=l; i<r; i++){
for (ll j=i+1;j<=r;j++){
int x = i*j%2019;
m = min(m, x);
}
}
cout << m << endl;
}
|
#include<iostream>
using namespace std;
long long L,R,y;
int main(){
int l,r,x=2100;
cin>>L>>R;
l=L%2019;
r=R%2019;
y=R-L;
if(r<=l || 2019<=y){
cout<<0;
}else{
for(int i=l;i<r;i++){
for(int j=i+1;j<r+1;j++){
x=min(x,(i*j)%2019);
}
}
cout<<x;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll l, r;
cin >> l >> r;
r = min(r, l + 4038);
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;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
long long l, r, ans = 3000; cin >> l >> r;
for (long long i = l; i <= min(r, l + 2019); ++i)
for (long long j = i + 1; j <= min(r, l + 2019); ++j)
ans = min(ans, (i * j) % 2019);
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int l,r;
long long ans=1e9;;
scanf("%d%d",&l,&r);
int mx=min(r,l+2019);
for(int i=l;i<=mx;++i)
for(int j=i+1;j<=mx;++j)ans=min(ans,1ll*i*j%2019);
cout<<ans;
}
|
#include <iostream>
using namespace std;
int main(){
long long a,b,min1(999999999);
cin>>a>>b;
for(long long i=a;i<b;i++){
for(long long j=i+1;j<=b;j++){
if((i*j)%2019<min1) min1=(i*j)%2019;
if(!min1) break;
}
if(!min1) break;
}
cout<<min1;
}
|
#include<bits/stdc++.h>
using namespace std;
int arr[2019];
int main(){
int l,r;
cin>>l>>r;
if(r-l>=2018||r%2019<l%2019){
cout<<0<<endl;
return 0;
}
l%=2019,r%=2019;
int ans=3000;
for(int i=l;i<=r-1;i++)
for(int j=i+1;j<=r;j++)
ans=min(ans,i*j%2019);
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll L,R,ans=2e9;
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(i*j%2019==0){
cout<<"0"<<endl;
return 0;
}
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main () {
long L, R;
cin >> L >> R;
long ans = 2020;
for(long i = L; i <= L + 2018 && i <= R; i++){
for(long j = i + 1; j <= L + 2018 && j <= R; j++){
ans = min(ans,(i * j) % 2019);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int N,M,L=3000;
cin >>N>>M;
for(long long int i=N;i<M;i++){
if(L==0)break;
for(long long int j=N+1;j<M+1;j++){
L=min(L,(i*j)%2019);
if(L==0)break;
}
}
cout <<L;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t l,r;cin>>l>>r;
int64_t ans=2020;
if(r-l>2023){
cout <<0<<endl;
return 0;
}
else{
for(int64_t i=l;i<=r-1;i++){
for(int64_t j=i+1;j<=r;j++){
ans=min(ans,(i*j)%2019);
}
}
}
cout <<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll l,r;
cin>>l>>r;
if(r-l>=2019){
cout<<0<<endl;
return 0;
}
else{
ll ans=5000;
for(ll i=l;i<=r;i++){
for(ll j=i+1;j<=r;j++){
ans=min(ans,(i%2019*j%2019)%2019);
}
}
cout<<ans<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll ans=1e9;
ll a,b;
cin>>a>>b;
b=min(b,a+4038);
for(ll i=a;i<=b;i++){
for(ll j=i+1;j<=b;j++){
ans=min(ans,i*j%2019);
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
int main() {
ll l,r;
cin>>l>>r;
ll ans = 1e18;
if ((l-1)/2019!=(r/2019)) {cout<<0;return 0;}
for (ll i = l;i<=r;i++)
for (ll j = i + 1;j<=r;j++)
ans = min(ans,(i*j)%2019);
cout<<ans;return 0;}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long def,l,r,t,ans=2019;cin>>l>>r;
def=(r-l)%2020;l%=2019;r=l+def;
for(long long i=l;i<=r-1;i++){
for(long long j=i+1;j<=r;j++){
ans=min(ans,(i*j)%2019);
}
}
cout<<ans;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int l, r; cin>>l>>r;
if(r - l > 1e4){
cout<<0<<endl;
return 0;
}
int ans = 2019;
for(int i = l; i < r; i++){
for(int j = i + 1; j <= r; j++){
ans = min(ans, i * j % 2019);
}
}
cout<<ans<<endl;
}
|
#include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
long L, R, ans = 0;
cin >> L >> R;
if (673 > R - L) {
ans = LONG_MAX;
for (long i = L; i < R; ++i) {
for (long j = 1 + L; j <= R; ++j) ans = min(ans, i * j % 2019);
}
}
cout << ans;
}
|
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int a,b;
LL Ans=1e9;
int main() {
scanf("%d%d",&a,&b);
for(int i=a; i<=min(b,a+5000); i++) {
for(int j=i+1; j<=min(b,a+5000); j++)
Ans=min(1LL*i*j%2019,Ans);
}
printf("%lld",Ans);
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,L,R,ans = 2020;
cin >> L >> R;
N = R-L;
for(int i=L; i < L+min(2019,N); i++){
for(int j=i+1; j <= min(R,i+2019); j++){
ans = min(((i%2019)*(j%2019)) % 2019,ans);
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int l,r;
int main()
{
scanf("%d%d",&l,&r);
if(r-l+1>=2020)
printf("0");
else
{
int ans=100000;
for(int i=l;i<=r;i++)
for(int j=l;j<i;j++)
ans=min(ans,int(1ll*i*j%2019));
printf("%d",ans);
}
}
|
#include<bits/stdc++.h>
using namespace std;
long long l,r;
int main()
{
cin>>l>>r;
if((r/2019-l/2019)>0)
cout<<0<<endl;
else
{
long long ans=2020;
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;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
scanf("%d%d", &l, &r);
int ans = 2019;
int start = l%2019, end = start+min(2019*2, r-l+1);
for (int i = start; i < end; ++i) {
for (int j = i+1; j < end; ++j) {
ans = min(i*j%2019, ans);
}
}
printf("%d\n", ans);
}
|
#include<bits/stdc++.h>
using namespace std;
int l,r;
int main(){
scanf("%d%d",&l,&r);
if(r-l+1>=2019){
puts("0");
return 0;
}
long long ans=1e10;
for(int i=l;i<=r;i++)
for(int j=i+1;j<=r;j++){
long long k=i*1ll*j;
ans=min(ans,k%2019);
}
printf("%d\n",ans);
}
|
#include <iostream>
#define int long long
using namespace std;
int32_t main()
{
int a,b; cin>>a>>b;
if( abs(a/2019 - b/2019) > 0) cout<<0;
else{
int ans = 99999;
for(int i = a; i <= b; i++)
for(int j = i + 1; j <= b; j++)
ans = min(ans,(i*j) % 2019);
cout<<ans;
}
}
|
#include<iostream>
using namespace std;
int main() {
int64_t L, R,ans = 2020;
cin>>L>>R;
for (long l=L;l<L+2020;l++) {
for (long r=R;r>R-2020;r--) {
if(l<r)ans=min(ans,l%2019*r%2019);
}
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long L, R, Min=2019, i, j;
cin >> L >> R;
R = min(R, L + 2019);
for(i=L;i<=R;i++){
for(j=i+1;j<=R;j++){
long long i_=i%2019, j_=j%2019;
Min = min(Min, (i_*j_)%2019);
}
}
cout << Min << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int l,r;cin>>l>>r;
r=min(r,l+2019);
int mn=2019;
for (int i=l;i<r;i++)
for (int j=i+1;j<=r;j++)
mn=min(mn,i%2019*(j%2019)%2019);
cout<<mn<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int l,r,c,i,m=2019,j;
cin>>l>>r;
if(r>l+2019)
r=l+2019;
for(j=l;j<r;j++)
{
for(i=l+1;i<=r;i++)
{
c=((j*i)%2019);
if(c<m)
m=c;
}
}
cout<<m<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long int l,r; cin >> l >> r;
long int ans=2019;
for(long int i=l;i<r && i<l+2019;i++){
for(long int j=i+1; j<=r && j<l+2019; j++){
if(ans > (i*j)%2019){
ans = (i*j)%2019;
}
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll i,j,cnt=0;
int L,R;
cin>>L>>R;
if(L+2018<=R){
cout<<0;
return 0;
}
ll mi=INT_MAX;
for(i=L;i<=R;i++){
for(j=i+1;j<=R;j++){
mi=min(mi,i*j%2019);
}
}
cout<<mi<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(){
LL n, m, up, ans = 3000;
cin >> n >> m;
up = min(m, n + 2019);
for(LL i = n; i < up; i++)
for(LL j = i + 1; j <= up; j++)
ans = min(ans, (i % 2019 * j % 2019) % 2019);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int l,r,a=5000000,c,x,y;
int main(){
cin>>l>>r;
x=l%2019,y=r%2019;
if(r-l>=2018){
cout<<0<<endl;
return 0;
}
if(x>=y)y+=2019;
for(int i=x;i<y;i++){
for(int j=i+1;j<=y;j++){
c=i*j;
c%=2019;
a=min(a,c);
}
}
cout<<a<<endl;
}
|
///見ました
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l,r;
cin >> l >> r;
r = min(r,l+4038);
int ans=2018;
for(long long i=l; i<r; i++){
for(long long j=l+1; j<=r; j++){
int x = i*j%2019;
ans = min(ans,x);
}
}
cout << ans << endl;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
long long L,R;
cin>>L>>R;
long long Min=2018;
if(R-L<2019){
for(long long i=L; i<R; i++){
for (long long j=i+1; j<=R; j++){
Min=min(Min,(i*j)%2019);
}}
printf("%lld",Min);
}
else{
cout<<0<<endl;}
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int a,b,i,j,m=3000,x,y;
cin>>a>>b;
if(b-a+1>=2019)puts("0");
else {
for(i=a; i<b; i++)for(j=i+1; j<=b; j++)x=i%2019,y=j%2019,m=min(m,(x*y)%2019);
cout<<m;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ll i,j,k,n,m;
cin>>n>>m;
if(m-n+1>=2019) cout<<"0\n";
else {
ll ans=2020;
for(i=n;i<=m;i++)
{
for(j=i+1;j<=m;j++) ans=min(ans,(i*j)%2019);
}
cout<<ans<<"\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
long long ans = 2036;
for(long long i = L; i <= min(L + 4036, R); i++){
for(long long j = i + 1; j <= min(L + 4036, R); j++){
ans = min(ans, (i * j) % 2019);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int l,r;
int ans=2019;
int main()
{
cin>>l>>r;
if(r-l>=2019)
ans=0;
else
for(long long int i=l;i<=r;i++)
for(long long int j=l;j<i;j++)
{
int z=(i*j)%2019;
if(z<ans)
ans=z;
}
cout<<ans;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b;
c=2019;
for(int i=a;i<min(b,a+2019);i++){
for(int j=i+1;j<min(b+1,a+2019+1);j++){
c=min(c,i%2019*(j%2019)%2019);
}
}
cout<<c<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long L,R,result=2018;
cin >> L >> R;
if(R-L>=2019){
result = 0;
}else{
for(long long i=L;i<R;i++){
for(long long j=i+1;j<=R;j++){
result = min(result,(i*j)%2019);
}
}
}
cout << result << endl;
}
|
#include <iostream>
using namespace std;
int main()
{
long long L, R;
cin >> L >> R;
R = min(R, L + 2019);
long long a = 2018;
for (auto i = L; i <= R; i++) {
for (auto j = i + 1; j <= R; j++) {
long long x = i * j % 2019;
a = min(a, x);
}
}
cout << a;
}
|
#include<bits/stdc++.h>
using namespace std;
long long l,r;
int main(){
scanf("%lld%lld",&l,&r);
if(r-l+1>=2019)cout<<0<<endl;
else{
long long ans=2019;
for(long long i=l;i<r;i++){
for(long long j=i+1;j<=r;j++){
ans=min(i*j%2019,ans);
}
}
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
int main()
{
lint L, R;
cin >> L >> R;
lint m = 2019;
for (lint i = L; i < R and 0 < m; ++i)
{
for (lint j = i + 1; j <= R and 0 < m; ++j)
{
m = min((i * j) % 2019, m);
}
}
cout << m << "\n";
}
|
#include<bits/stdc++.h>
using namespace std;
int l,r;
long long ans=1e18;
int main(){
scanf("%d%d",&l,&r);
if(l/2019!=r/2019)ans=0;
else {
for(int i=l;i<=r;i++){
for(int j=i+1;j<=r;j++){
ans=min(ans,1LL*i*j%2019);
}
}
}
printf("%lld\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l,r;
cin>>l>>r;
ll ans=2020;
for(ll i=l;(i<r) && (i<l+2020);i++){
for(ll j=i+1;(j<=r) && (j<i+2021);j++){
ans=min(ans, i*j%2019);
}
}
cout<<ans<<endl;
}
|
#include<iostream>
using namespace std;
int main()
{
int l,r,min1=1<<30;
cin>>l>>r;
if(r-l>=2018)
{
cout<<0;
return 0;
}
for(int i=l;i<=r-1;i++)
for(int j=i+1;j<=r;j++)
{
int a=i%2019,b=j%2019;
min1=min(min1,a*b%2019);
}
cout<<min1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l,r;
cin>>l>>r;
r=min(r,l+2018);
int ans=2018*2018;
for(int i=l;i<=r;i++){
for(int j=i+1;j<=r;j++){
int x=i%2019;
int y=j%2019;
ans=min(ans,(x*y)%2019);
}
}
cout<<ans<<endl;
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
int L, R, m = 2019;
int main() {
scanf("%d %d", &L, &R);
for(int i = L; i < R && m > 0; i++) {
for(int j = i+1; j <= R && m > 0; j++) {
m = min(m, (i%2019)*(j%2019)%2019);
}
}
printf("%d", m);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll L,R;
cin >>L >>R;
if(R-L>=2019)
cout<<"0";
else {
ll ans=0x3f3f3f3f;
for(int i=L;i<=R;i++)
for(int j=i+1;j<=R;j++)
ans=min(ans,1ll*i*j%2019);
cout<<ans;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int mod=2019;
int main()
{
int ans=mod,l,r;
scanf("%d%d",&l,&r);
if(r-l>=mod) {
printf("0");
return 0;
}
l%=mod,r%=mod;
for(int i=l;i<=r;++i)
for(int j=i+1;j<=r;++j) {
ans=min(ans,i*j%mod);
}
cout<<ans;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int l,r;cin>>l>>r;
if(r-l>=2019)cout<<0<<endl,exit(0);
l%=2019;r%=2019;if(l>r)r+=2019;
int ans=2019;
for(int i=l;i<=r;i++)for(int j=i+1;j<=r;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;
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;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t l,r;
cin>>l>>r;
int64_t ans=10000000000;
if(r-l>=2019){
cout<<0<<endl;
}
else{
for(int64_t i=l;i<r;i++){
for(int64_t j=l+1;j<=r;j++){
ans=min(ans,(i*j)%2019);
}
}
cout<<ans<<endl;
}
}
|
#include<iostream>
using namespace std;
long L,R,ans=2020;
int main() {
cin >> L >> R;
for(long l=L; l<L+2020; l++) {
for(long r=R; r>R-2020; r--) {
if (l<r) {
ans = min(ans, l%2019*r%2019);
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int L,R;
cin>>L>>R;
if((L-1)/2019!=R/2019)
cout<<0<<endl;
else{
L%=2019;
R%=2019;
int k=2019;
for(int i=L;i<R;i++)
for(int j=i+1;j<=R;j++)
k=min(k,i*j%2019);
cout<<k<<endl;
}
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define LL long long
int l,r,ans=2020;
int main()
{
scanf("%d%d",&l,&r);
if(r-l+1>=2019)
{
printf("0");
return 0;
}
for(int i=l;i<r;i++)
for(int j=i+1;j<=r;j++)
ans=min(ans,int(1LL*i*j%2019));
printf("%d",ans);
}
|
#include<bits/stdc++.h>
using namespace std;
using Int = int_fast64_t;
int main(){
Int l,r;
cin >> l >> r;
Int ans = 1e9;
if(l+2018 <= r){
ans = 0;
}else{
for(Int i=l; i<r; ++i)
for(Int j=i+1; j<=r; ++j)
ans = min(ans, i*j%2019);
}
cout << ans << "\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int L, R;
cin >> L >> R;
int ans = 2019;
for (int i = L; i <= min(R, L + 2020); ++i)
for (int j = L; j < i; ++j)
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
cout << ans << '\n';
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long l,r;
cin>>l>>r;
int ans=30000;
r=min(r,l+4038);
for(long long i=l;i<=r;i++){
for(long long j=i+1;j<=r;j++){
int x=i*j%2019;
ans=min(ans,x);
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int l, r, ans = 2019;
cin >> l >> r;
r = min(r, l + 2019);
for (int i = l; i < r; i++)
for (int j = i + 1; j <= r; j++)
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int L,R;
cin >>L>>R;
int ans = 2019;
for(int i=L;i<min(R,L+2019);i++){
for(int j=R;j>max(L,R-2019);j--){
ans=min(ans,(i%2019)*(j%2019)%2019);
}
}
cout <<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,L,R;
int ans=2020;
cin>>L>>R;
n=R-L;
for(int i=L;i<L+min(2019,n);i++){
for(int j=i+1;j<=min(R,i+2019);j++){
ans=min(((i%2019)*(j%2019))%2019,ans);
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r; cin >> l >> r;
r = min(r, l + 4038);
long long ans = 1e18;
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 << '\n';
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
long long L,R;cin>>L>>R;
if(R-L>3000)cout<<0<<endl;
else{
long long res=2018;
for(long long i=L;i<R;i++){
for(long long j=i+1;j<=R;j++){
res=min(res,(i*j)%2019);}
}
cout<<res<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int l,r;
cin>> l >> r;
int ans=2019;
if (r-l+1 >= 2019) ans=0;
else {
for (int i=l; i<r; i++){
for (int j=i+1; j<=r; j++){
ans=min((i%2019)*(j%2019)%2019,ans);
}
}
}
cout<< ans <<endl;
}
|
#include<iostream>
using namespace std;
int main() {
int L, R;
cin >> L >> R;
int m = 2019;
if (L/2019 != R/2019) {
m = 0;
} else {
for (int i = L % 2019; i <= R % 2019; i++) {
for (int j = i + 1; j <= R % 2019; j++) {
m = min(m, (i * j) % 2019);
}
}
}
cout << m << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l,r;
cin >> l >> r;
r = min(r,l+4038);
int ans = 2018;
for(long long i = l;i <= r;i++){
for(long long j = i+1;j <= r;j++){
int x = (i*j)%2019;
ans = min(ans,x);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long l,r,i,j,ans=3000;
cin>>l>>r;
if(r/2019!=l/2019)
{
cout<<0<<endl;
return 0;
}
l%=2019;
r%=2019;
for(i=l;i<=r;i++)
{
for(j=i+1;j<=r;j++)
{
ans=min(ans,(i*j)%2019);
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long l,r,i,j,ans=2018,mod=2019;
cin >> l >> r;
r=min(r,l+2019);
for(i=l; i<r; i++){
for(j=i+1; j<=r; j++){
ans=min(ans,(i*j)%mod);
}
}
cout << ans;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll ans=1e9;
ll a,b;
cin>>a>>b;
if(a/2019!=b/2019){
cout<<0<<endl;
return 0;
}
for(ll i=a;i<=b;i++){
for(ll j=i+1;j<=b;j++){
ans=min(ans,i*j%2019);
}
}
cout<<ans<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
long L,R;
cin>>L>>R;
int ans=2018;
if(R-L+1 > 2019)ans = 0;
else{
for(long i=L;i<R;++i){
for(long j=i+1;j<=R;++j){
if(ans>(i*j)%2019)ans = (i*j)%2019;
}
}
}
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
int main(){
long long int l,r,d;
cin>>l>>r;
if(r-l>2019)
d=0;
else{
d=(l*(l+1))%2019;
for(int i=l;i<=r;i++){
for(int m=i+1;m<=r;m++){
if(((i%2019)*(m%2019))%2019<d)
d=((i%2019)*(m%2019))%2019;
}
}
}
cout<<d<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, ans = 2018;
cin >> l >> r;
r = min(l + 2019, r);
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;
}
|
#include<iostream>
#include<math.h>
using namespace std;
int n,m,ans=2019*2019;
int main()
{
cin>>n>>m;
if(m-n>=2019)
cout<<0<<endl;
else
{
for(int i=n;i<m;i++)
for(int o=i+1;o<=m;o++)
ans=min(ans,((i%2019)*(o%2019)%2019));
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int L,R;
cin >> L >> R;
R=min(R,L+4038);
int ans =2018;
for(long long int i=L;i<=R;i++){
for(long long int j=i+1;j<=R;j++){
int x=i*j%2019;
ans=min(x,ans);
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
long long a, b, mn = 1e9;
int main() {
long long i, j;
cin>>a>>b;
for(i=a; i<=min(a+2019, b); i++) for(j=i+1; j<=min(a+2019, b); j++) {
mn = min(mn, i * j % 2019);
}
cout<<mn;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.