acm 简单题2.docVIP

acm 简单题2 Climbing Worm Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 15 Accepted Submission(s) : 19 Problem Description An inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minute before climbing again. During the rest, it slips down d inches. The process of climbing and resting then repeats. How long before the worm climbs out of the well? Well always count a portion of a minute as a whole minute and if the worm just reaches the top of the well at the end of its climbing, well assume the worm makes it out. Input There will be multiple problem instances. Each line will contain 3 positive integers n, u and d. These give the values mentioned in the paragraph above. Furthermore, you may assume d u and n 100. A value of n = 0 indicates end of output. Output Each input instance should generate a single integer on a line, indicating the number of minutes it takes for the worm to climb out of the well. Sample Input 10 2 120 3 10 0 0 Sample Output 1719 Source East Central North America 2002 111111111111 #include stdio.h int main() { int n, u, d, v, t, r; while (scanf(%d %d %d, n, u, d)==3 (u||n||d)){ v = u-d; t = n-u; if (t % v == 0) r = t/v*2+1; else r = (t/v+1)*2+1; printf(%d\n, r); } return 0; } 1111111111111111 由于输入数据规模不大，用简单模拟即可 代码如下： #includestdio.h int main() { int d,u,n,x,time; while(scanf(%d %d %d,n,u,d),n) { x=0;time=0; while(1) { x+=u;time++;if(x=n) break; x-=d;time++; } printf(%d\n,time); } return 0; } 用到了while（1）语句。 杭电ACM hdu--Number Sequence 浏览：22 | 发布于：2009.09.06 | 分类：杭电ACM 总结： 找循环节点， 使用一个二维数组visited[i][j]来存放前两个数为i，j时的这个数出现的位置。 算出周期，再用一定的公式就可以解出。 代码如下： #includestdio.h int main() { int a,b,n,f1,f2,f3,i,j,t,num; while(scanf(%d %d %d,a,b,n),a||b||n) { f1=1;f2=1;int visite