POJ 2596

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cmath>
 4 #include <cstring>
 5 #include <algorithm>
 6 #include <queue>
 7 #include <stack>
 8 #include <vector>
 9 using namespace std;
10 int main(int argc, char *argv[])
11 {
12     int s,d;
13     while(scanf("%d%d",&s,&d)!=EOF)
14     {
15         int t,m;
16          t=1;
17          if(s>4*d)
18          {
19              printf("Deficit\n");
20              continue;
21          }
22          m=-d;
23         for(int i=1;i<5;i++)
24         {
25             m+=s;
26             while(m>=0&&i<5)
27             {
28                 m-=d;
29                 t++;
30                 i++;
31             }        
32         }
33         t=t*2;
34          int sum=0;
35          if(t!=8)
36         sum+=(12-t)*s-t*d;
37         else
38         sum=3*s-9*d;
39         if(sum>=0)
40         printf("%d\n",sum);
41         else
42         printf("Deficit\n");
43     }
44     return 0;
45 }

猜你喜欢

转载自www.cnblogs.com/huluxin/p/9721248.html
POJ