close

標題:

C++ Program pf seiving numbers

發問:

Hey everyone, i need a program that uses the seive of Eratosthenes(don't know how to speel, sorry!) to find all the prime numbers from 1-300. Can it be as simple as possible and pls be quick! 10000x thx! =) (pls don't include iostream.h, thx!)

最佳解答:

Here's the program. As usual, if you need details, see http://mathmate.brinkster.net/ and look under programming. #include #include #include int main(int argc, char *argv[]) { int a[301],i,j; for(i=0;i

此文章來自奇摩知識+如有不便請留言告知

其他解答:7638E7481407D16B

arrow
arrow
    文章標籤
    C++
    全站熱搜
    創作者介紹
    創作者 omckyyo 的頭像
    omckyyo

    omckyyo的部落格

    omckyyo 發表在 痞客邦 留言(0) 人氣()

    E-mail轉寄