分5种情况讨论
y表示至少几次盈余才能一年后赚钱
x表示5个月最多盈余几次这5个月才亏钱
x从0到4讨论 ,找出每种情况下最多的盈余月数,与y比较,若大于等于y才、,则可以,否则不行
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<map>
#include<queue>
#include<math.h>
using namespace std;
#define LL long long
#define mp(a,b) make_pair((a),(b))
#define clr(x,a) memset(x,a,sizeof(x))
#define INF 0x3f3f3f3f
#define lb(x) ((x)&(-x))
const int N=1005,siz=1e9;
const int MOD=1e9+7;
int s,d;
int main()
{
//freopen("aaa.txt","r",stdin);
//freopen("bbb.txt","w",stdout);
int T;
while(~scanf("%d%d",&s,&d)){
int y=12*d/(s+d)+1;
int x=5*d/(s+d);
int num=0;
int i=1,j=12;
//cout<<x<<endl<<y<<endl;
bool ok;
LL tmp;
if(x==0) ok=0;
else if(x==1) {ok=(3>=y);tmp=3;}
else if(x==2) {ok=(6>=y);tmp=6;}
else if(x==3) {ok=(8>=y);tmp=8;}
else if(x==4) {ok=(10>=y);tmp=10;}
LL ans;
if(ok) ans=tmp*s-(12-tmp)*d;
if(ok) printf("%I64d\n",ans);
else puts("Deficit");
}
return 0;
}