BZOJ3856: Monster

题目：http://www.lydsy.com/JudgeOnline/problem.php?id=3856

题解：怎么乱搞一下都可以把

代码：

 #include<cstdio>

 #include<cstdlib>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 #include<iostream>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<string>

 #define inf 1000000000

 #define maxn 200000+5

 #define maxm 200000+5

 #define eps 1e-10

 #define ll long long

 #define pa pair<int,int>

 #define for0(i,n) for(int i=0;i<=(n);i++)

 #define for1(i,n) for(int i=1;i<=(n);i++)

 #define for2(i,x,y) for(int i=(x);i<=(y);i++)

 #define for3(i,x,y) for(int i=(x);i>=(y);i--)

 #define for4(i,x) for(int i=head[x],y=e[i].go;i;i=e[i].next,y=e[i].go)

 #define for5(n,m) for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)

 #define mod 1000000007

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=*x+ch-'';ch=getchar();}

     return x*f;

 }

 int main()

 {

     freopen("input.txt","r",stdin);

     freopen("output.txt","w",stdout);
     ll a,b,h,k,cs=;

     while(scanf("%lld%lld%lld%lld",&h,&a,&b,&k)!=EOF)
     {
         if(!h&&!a&&!b&&!k)break;
         bool flag=;
         if((a-b)*(k-)+a>*b)flag=;
         else if(a>=h)flag=;
         else if((a-b)*(k-)+a>=h)flag=;
         else flag=;
         printf("Case #%lld: %s\n",++cs,flag?"YES":"NO");
     }

     return ;

 }