#include<stdio.h>
int main(void)
{
int kil;
int flag=;
double sum;
while(scanf("%d",&kil)&&kil!=)
{
sum=;
flag=;
while(kil)
{
if(kil<=)
{
sum+=;
kil-=kil;
}
else if(kil<=)
{
sum+=(kil-)*+;
kil-=kil;
}
else if(kil<=)
{
flag=;
sum+=+(kil-)*2.4;
kil-=kil;
}
else
{
sum+=;
kil-=;
}
}
printf(flag==? "%.0lf\n":"%.1lf\n",sum);
}
return ;
}
相关文章
- ZOJ 3812 We Need Medicine(dp、背包、状态压缩、路径记录)
- matrix_2015_1 138 - ZOJ Monthly, January 2015
- ZOJ Problem Set - 1240 IBM Minus One
- ZOJ 1095 Humble Numbers
- ZOJ1100 Mondriaan's Dream
- zoj 2104 Let the Balloon Rise(map映照容器的应用)
- zoj 2966 Build The Electric System 最小生成树
- ACM/ICPC 之 拓扑排序+DFS(POJ1128(ZOJ1083)-POJ1270)
- zoj 3204 Connect them
- ZOJ 2314 Reactor Cooling(无源汇上下界网络流)