The program design---The Snail

A snail is at the bottom of a 6-foot well and wants to climb to the top.The snail can climb 3 feet while the sun is up,but slides down 1 foot at night while sleeping.The snail has a fatigue factor of 10%,which means that on each successive day the snail climbs 10%*3=0.3 feet less than it did the previous day.(The distance lost to fatigue is always 10% of the first day's climbing distance.)On what day does the snail leave the well,i.e.,what is the first day during which the snail's height exceeds 6 feet?(A day consists of a period of sunlight followed by period of darkness.)As you can see from the following table,the snail leaves the well during which the third day. Input: The input file contains one or more test cases,each on a line by itselt. Each line contains four integers H,U,D,and F,separated by a single space. If H=0 it signals the end of the input;otherwise,all four numbers will be between 1 and 100,inclusive.H is the height of the well in feet,U is the distance in feet that the snail can climb during the day,D is the distance in feet that the snail slides down during the night,and F is the fatigue factor expressed as a percentage.The snail never climbs a negative distance. If the fatigue factor drops the snail's climbing distance below zero,the snail does not climb at all that day.Regardless of how far the snail climbed,it always slides D feet at night. Output: For each test case,output a line indicating whether the snail succeeded(left the well)or failed(slid back to the bottom) and on what day.Format the output exactly as shown in the example. My program: #include #include char *str; int first=1; //the first time output //the distance that snail climb during this day float snail(int day,float H,float U,float D,float F) { float temp; float result; if(day==1) { result=U; } else { temp=snail(day-1,H,U,D,F); if(temp>H) { str="success"; result=0; } else if(temp-D<0) { str="failure"; result=0; } else { result=temp-D+U-(day-1)*U*F/100; } } return result; } //clear file void clearfile() { FILE *pt; pt=fopen("output.txt","w"); fclose(pt); } //output void mywrite(int day) { FILE *pt; pt=fopen("output.txt","a"); if(!first) { fprintf(pt,"/n"); } fprintf(pt,"%s %d",str,day); fclose(pt); } void main() { clearfile(); int H,U,D,F; FILE *pt; int day; if(NULL==(pt=fopen("input.txt","r"))) { } else { fscanf(pt,"%d",&H); fscanf(pt,"%d",&U); fscanf(pt,"%d",&D); fscanf(pt,"%d",&F); while(H!=0) { day=1; while(snail(day,H,U,D,F)!=0) { day++; } day--; mywrite(day); first=0; fscanf(pt,"%d",&H); fscanf(pt,"%d",&U); fscanf(pt,"%d",&D); fscanf(pt,"%d",&F); } fclose(pt); } } Input: 6 3 1 10 10 2 1 50 50 5 3 14 50 6 4 1 50 6 3 1 1 1 1 1 0 0 0 0 Output: success 3 failure 4 failure 7 failure 68 success 20 failure 2
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值