RT,灵异事件x2
1
二是同样的这份代码在同样的一道题里面一发 AC 一发 WA:
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n, k, m, ans; int d;
int main() {
scanf("%lld%lld%lld%d", &n, &k, &m, &d);
for(int i = 1; i <= d; ++i) {
ll p = 1ll * n / (k * (i - 1) + 1);
if(!p) break;
ans = max(ans, 1ll * min(p, m) * i);
}
printf("%lld\n", ans);
return 0;
}
AC & WA