fork download
  1. def di(a,b):
  2. return (a+b+1)//b
  3.  
  4. c,x,y,z,m,s,f,e,t = map(int,input().split())
  5. if c-x>0:
  6. ans1=di(c+y*di(c-x,z),s)*m
  7. else:
  8. ans1=di(c,s)*m
  9. ans2 = (di((f*(e+1)),s) * m + t)
  10. print(min(ans1, ans2))
Success #stdin #stdout 0.03s 9232KB
stdin
2700 1000 150 1000 3 1000 100 7 3
stdout
6