補充內容 (2012-4-13 09:58 AM):
Suddenly I cannot type Chinese with my laptop, so I'm finishing it up in English.
So you can write an int test-prime, returning 1 when true and 0 for false.
Then run over all cases below and including作者: huiken2005 時間: 2012-4-13 09:59 AM
n, to see if they are prime. If test-prime == 1, print it out, else move on
補充內容 (2012-4-13 10:02 AM):
I may carry on answering these questions if you still need them later...
I don't wanna type English in here... some people dislike reading them...作者: lovehh1006 時間: 2012-4-14 11:38 AM
huiken2005 發表於 2012-4-13 09:59 AM
n, to see if they are prime. If test-prime == 1, print it out, else move on