【BZOJ】【3856】Monster

 1 /**************************************************************
 2     Problem: 3856
 3     User: ProgrammingApe
 4     Language: C++
 5     Result: Accepted
 6     Time:4 ms
 7     Memory:1272 kb
 8 ****************************************************************/
 9  
10 //BZOJ 3856
11 #include<cstdio>
12 #include<cstring>
13 #include<cstdlib>
14 #include<iostream>
15 #include<algorithm>
16 #define rep(i,n) for(int i=0;i<n;++i)
17 #define F(i,j,n) for(int i=j;i<=n;++i)
18 #define D(i,j,n) for(int i=j;i>=n;--i)
19 using namespace std;
20  
21 int main(){
22 //  freopen("input.txt","r",stdin);
23     int time=0;
24     long long h,a,b,k;
25     while(scanf("%lld%lld%lld%lld",&h,&a,&b,&k)!=EOF){
26         if (h+a+b+k==0) break;
27         bool sign=0;
28         printf("Case #%d: ",++time);
29         if (h-a<1) sign=1;
30         else if (a*k-b*(k+1)>0) sign=1;
31         else if (h-a*k+b*(k-1)<1) sign=1;
32         if (sign) printf("YES\n");
33         else printf("NO\n");
34     }
35     return 0;
36 }