[問題] 程設兩題
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的部分勉強看得懂
程式儘量不要太深奧好嗎
感恩^^
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 134.208.32.218
推
05/18 11:27, , 1F
05/18 11:27, 1F
→
05/18 16:38, , 2F
05/18 16:38, 2F
→
05/18 16:41, , 3F
05/18 16:41, 3F
→
05/18 16:43, , 4F
05/18 16:43, 4F
→
05/18 16:45, , 5F
05/18 16:45, 5F
→
05/18 16:49, , 6F
05/18 16:49, 6F
推
05/19 00:06, , 7F
05/19 00:06, 7F
討論串 (同標題文章)