※ 引述《buoyance (buoyance)》之銘言：
: design an algorithm for finding all the factors of a positive integer
factors( int num )
{
printf("%d factors are ",num);
for( int i = 1; i <= num; i++ )
if( num%i )
printf( "%d, ",i );
}
就檢查1~自己本身的數能不能整除就好啦～應該不難
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.113.126.59