Codeforces Round #476 (Div. 2) C. Greedy Arkady(二分)

C. Greedy Arkady
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

k
people want to split n

candies between them. Each candy should be given to exactly one of them or be thrown away.

The people are numbered from 1
to k, and Arkady is the first of them. To split the candies, Arkady will choose an integer x and then give the first x candies to himself, the next x candies to the second person, the next x candies to the third person and so on in a cycle. The leftover (the remainder that is not divisible by x

) will be thrown away.

Arkady can’t choose x
greater than M as it is considered greedy. Also, he can’t choose such a small x that some person will receive candies more than D

times, as it is considered a slow splitting.

Please find what is the maximum number of candies Arkady can receive by choosing some valid x

.
Input

The only line contains four integers n
, k, M and D (2≤n≤1018, 2≤k≤n, 1≤M≤n, 1≤D≤min(n,1000), M⋅D⋅k≥n

) — the number of candies, the number of people, the maximum number of candies given to a person at once, the maximum number of times a person can receive candies.
Output

Print a single integer — the maximum possible number of candies Arkady can give to himself.

Note that it is always possible to choose some valid x

.
Examples
Input
Copy

20 4 5 2

Output
Copy

8

Input
Copy

30 9 4 1

Output
Copy

4

Note

In the first example Arkady should choose x=4
. He will give 4 candies to himself, 4 candies to the second person, 4 candies to the third person, then 4 candies to the fourth person and then again 4 candies to himself. No person is given candies more than 2 times, and Arkady receives 8

candies in total.

Note that if Arkady chooses x=5
, he will receive only 5 candies, and if he chooses x=3, he will receive only 3+3=6 candies as well as the second person, the third and the fourth persons will receive 3 candies, and 2 candies will be thrown away. He can’t choose x=1 nor x=2 because in these cases he will receive candies more than 2

times.

In the second example Arkady has to choose x=4
, because any smaller value leads to him receiving candies more than 1

time.

解析:

#include<bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define rep1(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
const int N=110;
/*
    枚举次数
    最小为1,最大为m
    然后二分
    如果次数不够则减小x
    如果够了或多出则要增大x
*/
int main()
{
    ll n,k,m,d,res=0;
    cin>>n>>k>>m>>d;
    for(ll i=1;i<=d;i++)
    {
        ll tl=1,tr=m,ans=0;
        while(tl<=tr)
        {
            ll tm=(tl+tr)/2;
            if(((n/tm)+k-1)/k<i)
            {
                tr=tm-1;
            }
            else
            {
                tl=tm+1;
                if(((n/tm)+k-1)/k==i)
                    ans=tm;
            }
        }

        if(ans!=0&&((n/ans)+k-1)/k==i)
            res=max(res,((n/ans)+k-1)/k*ans);
    }
    cout<<res<<endl;
    return 0;
}