Submission

Status:

PPPPPPPP

Score: 100

User: Winzzwz

Problemset: ใส่กล่อง

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-05 16:26:20

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int w,l,m,n,mn = 1e9;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> w >> l >> m >> n;
    for (int i = m; i <= n; i++) {
        if (w%i == 0 || l%i == 0) {cout << 0; exit(0);}
        mn = min(mn,(w%i)*(l%i));
    }
    cout << mn;
    
    return 0;
}