0 like 0 dislike
17.8k views
蝸牛爬牆問題

有一隻蝸牛,爬在一個高度為h公尺的牆上面,白天往上爬n公尺,晚上下降m公尺,目前蝸牛位於牆上i公尺的地方,蝸牛從白天開始爬,請問幾天後蝸牛會爬到牆頂。

 

請寫一個程式,輸入h,n,m,i四個變數,計算出蝸牛幾天後會爬到牆頂。

如果蝸牛不可能爬到牆頂,請輸出 this is impossible!。

 

輸入說明

依序輸入四個正整數代表h,n,m,i。

 

輸出說明

輸出一個數代表蝸牛幾天會爬到牆頂。

 

範例輸入1

50 5 2 3

 

範例輸出1

15

範例輸入2

100 10 15 0

範例輸出2

this is impossible!
[Exercise] Coding (C) - asked in 2016-1 程式設計(一)AC by (18k points)
ID: 20993 - Available when: Unlimited - Due to: Unlimited

reshown by | 17.8k views

144 Answers

0 like 0 dislike
Hidden content!
* * ** * ****
* ***** ***



main()



{





int ** ***
* * * **** ***** * ******** * * ** * ** * *** **


* *
* ** *
*** **** ** * * *** * * ***
*** ** * *** *
* * * is an ** * ** *****



return 0;









return 0;





}
answered by (54 points)
0 like 0 dislike
Hidden content!
** *** * * * *** *****
* **** ****** * **



main()



{





int *** * *
** *** * * ** * * ***** *** * *** ** ** **** * *** * *** *


* * * * ***
** *
* * *** ** * * * * **** ** *** *
* * ** *** ***
** ** * ** *** is an ** * * * ** *********



return 0;









return 0;





}
answered by (54 points)
0 like 0 dislike
Hidden content!
#include<stdio.h>

#include<stdlib.h>

int main()

{
* ** ** * **** * * * ** * ********* * * ** * ******* *** * *** * * * ** * *** * * **** * * ** ** * * * *** *** ** *** **** ** * ** **
**** ****** ** * ** *** ** a;
* * * * * * **
**** ** *** * *** ** * * * * * **
* *** ** ** ******* * *** ** * * * * ** *
* * * * * ** *** ** * * * ** ** **
* ***** * * * * ** * * * * *** * * ** * **

    
** ********** *** *



}
answered by (-103 points)
0 like 0 dislike
Hidden content!
* **** ****
**** ** *** * * *



int main()

{
* **** ** ******* h, n, m, i, day, num, num1, num2, num3, num4;
* ** * ** * * * * * ** * ** * * * &h, &n, &m, *******
*** * *** **** *** * = h - i - n;
* ** **** *** = n - m;
* * *** **** * * = num / num1;
** * *** *** = num2 + 1;
* ** ***** * *** * = num3 + 1;

 
* * ** * ** * ** * <= * * ***** * ** < 0))
* * ** ******* * ** this is ** * * ** *
* ** * ** *** * *** ** if(num2 = 0)
*** ** * * * *
** ** * ** * ** * * * * * * ** ** *** *** ** * ** num3);
*** * ** *** ***

 
*** * ** ** **** if(num=0)
* ***** ** * *
* * * * * *** ** ** ** **** *** * * * *** **
*** * * ** ** ***


** * ** ** *** * ** *
** ******** ** *
* * * * **** * ** * * * *** *** *** * ** * *** * * num4);
* * * * **** ** *








** * * * * * * * ** * *** * *** ***** * * 0;

}
answered by (-98 points)
0 like 0 dislike
Hidden content!
#include<stdio.h>



int main(){
**** ** *** * * ****** h, n, m, i, d;
*** * ** ** * * * * * ** * * * &h, &n, &m, &i);
* ** * *** **** * ** * ** * ** * h, n, m, i);




** * *** ** ** ** * * **** * <= 0)
***** * *** * * * * * *** * ** * *** ** * ** is impossible!");
**** * * * ** * *** * * = 0; d < 4096; d++){
****** ** ** ** * **** ** ** **** + n >= h){
* * * *** * *** ***** *** * * *** * ********* * * *** * *** * ** ** * d + 1);
** ** ** * ** ** * *** * *** *** * * * ** * * ** * ** *** 0;
** * ** * ** ***** ** ********* ** * *** ** *
* * *** ** * * *** ** ***** * ***** *
*** **** **** *** ** *** ** * * * *** ** * ** * * = i + n - m;
*** ** *** ***





return 0;
answered by (-105 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

#include <stdlib.h>

main(void)

{
***** * ****** * * * * ** h, n, m, i;
** *** *** ** * * days=1;
*** *** ** * * * ***** * * ** ** * * ** &h);
** * ** ** * * **** * ******* * &n);
* * * * * *** ** * * ** ***** **** &m);
* * ** ** * *** **** *** *** * &i);


** * * ** ** *** * * ** * ** * *

    {
* * ** * * ****** **** ******** * **** * ** *
* *** ** * * * * * * ** **** *** * ** * **
** * * * **** * ** * ** **** * * ***** * ** *** * * = i+n-m;
***** ** * ***** **** *** * * ** ** **
* * * ** * *** ** ** ** * * ** ** ** **** ***
** * * *** *** **** * * * * * * * * ** *** * ******** ** ******** ** * ** * * is impossible!");
**** * * *** * *** ****


** * ***** ** * ** ** **** * * * *** days);



}
answered by (-64 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

#include <string.h>

#include <ctype.h>

#include <math.h>

#include <stdlib.h>

#include <assert.h>



int main(){
******* * ** * ** *** ** * h,n,m,i;
*** * * *** * * * * * * ** day = 0;
* ** ** * * **** ** *** * tmp;
****** ** **** * * ****** j;
** * * * * ***** *** * ** *** ** ** *** * ** *** * ***
** * *** *** ** * * ** ** *** ** * ** * * ** **** ** * *
* * * * * ** ** * * * * * ** * * * * * *** * * * * * *** ** **
* * * * * * ** ** * ** ** * * * ** if((n-m)>0){
* ******* ********* * * * ** **** ** ***** * * ******** = h-(i+n);
* **** * ** ***** ** ** * *** ** * * * * * * * ** ** ** *** * * * = tmp/(n-m);
* * * * * * *** *** * * * * ** * **** * * *** *** *** * * * * * * * *
** * * ****** ** ** * * ** * **** ***
*** *** **** ** ** **** * **** **** *** * ***** if((n-m)<=0){
* * ** ** * * * * * * * * ** ****** ** * *** * * * * * * ** *** * *** ***** is impossible!");
*** ***** * * * * * * *** * * * * ** ** * **
* * * * 0;

}
answered by (-216 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>





int main()

{  int h,n,m,i;
* ****** *** * * **** * ** *** * * * **** ** **** *** *****
** * ** * * * ** * d,day;
* *** * *** ** *** = h-i ;


* * ** * * ** ** * **** * * *
* * * * ** *** * * ** ** *** * ** *** * = d-(n-m) ;
* ** * ****** * ***** * *** ** * * ** *
* **** ** * *
** ** ** * ******* ** ****
* **** * *** **** ** * ***** is ** *** * *  
****** * **** ***
** ** * * * * ** * 0;

}
answered by (-88 points)
0 like 0 dislike
Hidden content!
** *** *
****** *** ** *
* ***** *
****** * **** ** **



int main()

{



int * * **




**** ***** * ** * * *
* * * ** * ** * **
** * * * * *
** * * ** ** * *



x = (h-i) / (n - m);
** * **


** * *** * * x);

else
*** * * *** * * ** *** * ** * ** ***** is *** *** *

return 0;







}
answered by (-120 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

#include <stdlib.h>

main()

{
* * *** **** ** *** * ** h,n,m,i,d;
**** * * * * * * ** ** * ** *** ***** *** *** * * * ** *** * ***
**** * * * * * ****
*** * * * * *** * * * ** * * * *****
* * ***** ** ** ** **** ****** * = (h-i)/(n-m);
***** *** * ** * **** ** * * * *** ** * * **** ** ** * * ** d);
****** ****** *** ** ** ***** * * **
* * * **** * * **** *
* * ***** * ** * ** ** ** * * ** * * ** * **** * is impossible!!!");



}
answered by (-42 points)
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.70.80.196
©2016-2025

Related questions

0 like 0 dislike
3 answers
[Exercise] Essay (Open question) - asked Jan 5, 2017 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
ID: 20995 - Available when: Unlimited - Due to: Unlimited
| 1.2k views
0 like 0 dislike
28 answers
[Exercise] Coding (C) - asked Jan 5, 2017 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
ID: 20984 - Available when: Unlimited - Due to: Unlimited
| 4.6k views
0 like 0 dislike
43 answers
[Exercise] Coding (C) - asked Jan 5, 2017 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
ID: 20980 - Available when: Unlimited - Due to: Unlimited
| 6.5k views
0 like 0 dislike
39 answers
[Exercise] Coding (C) - asked Jan 5, 2017 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
ID: 20978 - Available when: Unlimited - Due to: Unlimited
| 5.7k views
0 like 0 dislike
16 answers
[Exercise] Essay (Open question) - asked Jan 5, 2017 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
ID: 20974 - Available when: Unlimited - Due to: Unlimited
| 3.4k views
12,783 questions
183,442 answers
172,219 comments
4,824 users