贪心 Codeforces Round #236 (Div. 2) A. Nuts

题目传送门

 /*
     贪心：每一次选取最多的线段，最大能放置nuts，直到放完为止，很贪婪!
     题目读不懂多读几遍:)
 */
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <cmath>
 using namespace std;

 const int MAXN = 1e3 + ;
 const int INF = 0x3f3f3f3f;

 int main(void)        //Codeforces Round #236 (Div. 2) A. Nuts
 {
 //    freopen ("A.in", "r", stdin);

     int k, a, b, v;
     while (scanf ("%d%d%d%d", &k, &a, &b, &v) == )
     {
         int ans = ;
         while ()
         {
             int sec = ;
             if (b >= k - )    {b -= (k - );    sec = k;}
             else if (b == )    sec = ;
             else    {sec = b + ;    b = ;}
             ans++;
             if (v * sec >= a)    break;
             else    a -= v * sec;
         }

         printf ("%d\n", ans);
     }

     return ;
 }