回复：挑战所有程序员

for(int i = 2; i < n + 1; i++) if ( n%i == 0 ) return true; else if ( i == n ) return false;

所有跟帖： 

• Not bad -botong- ♂ (0 bytes) () 07/24/2009 postreply 08:20:20

• The problem is: -botong- ♂ (72 bytes) () 07/24/2009 postreply 10:24:43