Educational Codeforces Round 15 D. Road to Post Office（数学）

题目链接

#include<bits/stdc++.h>
using namespace std;
typedef long long ll; 
int main()
{
	ll d,k,a,b,t,ans;
	scanf("%lld %lld %lld %lld %lld",&d,&k,&a,&b,&t);
	if(d<=k){
		printf("%lld\n",a*d);return 0;
	}
	ans=a*k;
	ans+=min(t+(d%k)*a,(d%k)*b);
	d/=k;
	d--;
	ans+=min(d*a*k+d*t,d*b*k);
	printf("%lld\n",ans);
}