Re: [問題] 程設兩題
看板KS96-310作者trashprince (Contigo ergo "XOR"!!)時間16年前 (2009/05/19 00:14)推噓12(12推 0噓 4→)留言16則, 7人參與討論串2/2 (看更多)
※ 引述《austinting (神經細胞)》之銘言：
: The gcd of x and y is defined recursively as follows: IF y is equal to 0,
: then gcd( x, y ) is x; otherwise gcd( x, y ) is gcd( y, x%y ) where % is the
: remainder operator. Write a recursive function gcd that returns the greatest
: common divisor of x and y.
: Write a program that runs 1000 games of craps ( without human intervention )
: 我用的是dev-C
: 現在讀到Pointer這章，Arrays的部分勉強看得懂
: 程式儘量不要太深奧好嗎
: 感恩^^
雖然我現在趕時間
不過答應毛哥的事一定要做到
遞迴最難的是algorithm
不過題目既然給了
很快就寫完啦~
int gcd(int x int y){
if(y==0)
return x;
return gcd(y, x%y);
}
main(){printf("%d",gcd(37,74));}
--
████
██████
████████
██████████ ╭───────────╮
█████≡≡█████ │極品、天然、不豪洨 │
██████████████ │ 啜史不領死 │
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 219.85.7.104
推
05/19 12:31, , 1F
05/19 12:31, 1F
推
05/19 13:17, , 2F
05/19 13:17, 2F
推
05/20 00:34, , 3F
05/20 00:34, 3F
推
05/20 23:49, , 4F
05/20 23:49, 4F
推
05/21 00:12, , 5F
05/21 00:12, 5F
推
05/21 14:43, , 6F
05/21 14:43, 6F
推
05/21 22:07, , 7F
05/21 22:07, 7F
→
05/21 22:17, , 8F
05/21 22:17, 8F
推
05/22 01:52, , 9F
05/22 01:52, 9F
推
05/22 11:20, , 10F
05/22 11:20, 10F
→
05/22 11:20, , 11F
05/22 11:20, 11F
→
05/22 11:50, , 12F
05/22 11:50, 12F
推
05/22 18:23, , 13F
05/22 18:23, 13F
推
05/22 23:00, , 14F
05/22 23:00, 14F
推
05/23 20:25, , 15F
05/23 20:25, 15F
→
05/25 13:53, , 16F
05/25 13:53, 16F
討論串 (同標題文章)