Codeforces Round #530 (Div. 2) Solution

A. Snowball

签。

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 
 4 int w, h, u[2], d[2];
 5 
 6 int main()
 7 {
 8     while (scanf("%d%d", &w, &h) != EOF)
 9     {    
10         for (int i = 0; i < 2; ++i) scanf("%d%d", u + i, d + i);
11         for (int i = h; i >= 0; --i)
12         {
13             w += i;
14             for (int j = 0; j < 2; ++j) if (i == d[j])
15             {
16                 w -= u[j];
17                 w = max(w, 0);
18             }
19         }
20         printf("%d\n", w);
21     }
22     return 0;
23 }

View Code