mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
33 lines
680 B
C
33 lines
680 B
C
|
#include <stdio.h>
|
||
|
int main()
|
||
|
{
|
||
|
int plan[12];
|
||
|
int month,saved,now;
|
||
|
for(month=0,saved=0,now=0;month<12;month++)
|
||
|
{
|
||
|
scanf("%d",&plan[month]);
|
||
|
}
|
||
|
for(month=0;month<12;month++)
|
||
|
{
|
||
|
now+=300;
|
||
|
if(now-plan[month]>=100)
|
||
|
{
|
||
|
saved=saved+((now-plan[month])/100)*100;
|
||
|
now=now-((now-plan[month])/100)*100;
|
||
|
now=now-plan[month];
|
||
|
continue;
|
||
|
}
|
||
|
else if(now-plan[month]<0)
|
||
|
{
|
||
|
printf("%c%d\n",'-',month+1);
|
||
|
return 0;
|
||
|
}
|
||
|
else
|
||
|
{
|
||
|
now=now-plan[month];
|
||
|
}
|
||
|
}
|
||
|
printf("%d\n",now+(saved*6)/5);
|
||
|
return 0;
|
||
|
}
|