1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 | #include <iostream> #include <vector> #include <cmath> using namespace std; int main() { const int SIZE = 1000000; vector<int> intList(SIZE); vector<int> primeList(1,1); for(int i = 0; i < SIZE; i++) intList[i] = i; for(int index = 2; index <= sqrt(static_cast<double>(SIZE)); index++) if (intList[index] != 0) for(int index2 = index*index; index2 < SIZE; index2++) if(intList[index2] % index == 0) intList[index2] = 0; for(int index = 1; index < intList.size(); index ++) if(intList[index] != 0) primeList.push_back(intList[index]); cout << "The number of primes less than " << SIZE << " is " << primeList.size() - 1 << "(which includes 1)" << endl; /* for(int index = 1; index < primeList.size(); index ++) cout << index << '\t' << primeList[index] << endl; */ return(-1); } |
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8Y21hdGg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKQp7Cgljb25zdCBpbnQgU0laRSA9IDEwMDAwMDA7Cgl2ZWN0b3I8aW50PiBpbnRMaXN0KFNJWkUpOwoJdmVjdG9yPGludD4gcHJpbWVMaXN0KDEsMSk7CgoJZm9yKGludCBpID0gMDsgaSA8IFNJWkU7IGkrKykKCQlpbnRMaXN0W2ldID0gaTsKCglmb3IoaW50IGluZGV4ID0gMjsgaW5kZXggPD0gc3FydChzdGF0aWNfY2FzdDxkb3VibGU+KFNJWkUpKTsgaW5kZXgrKykKCQlpZiAoaW50TGlzdFtpbmRleF0gIT0gMCkKCQkJZm9yKGludCBpbmRleDIgPSBpbmRleCppbmRleDsgaW5kZXgyIDwgU0laRTsgaW5kZXgyKyspCgkJCQlpZihpbnRMaXN0W2luZGV4Ml0gJSBpbmRleCA9PSAwKQoJCQkJCWludExpc3RbaW5kZXgyXSA9IDA7CgoJZm9yKGludCBpbmRleCAgPSAxOyBpbmRleCA8IGludExpc3Quc2l6ZSgpOyBpbmRleCArKykKCQlpZihpbnRMaXN0W2luZGV4XSAhPSAwKQoJCQlwcmltZUxpc3QucHVzaF9iYWNrKGludExpc3RbaW5kZXhdKTsKCgljb3V0IDw8ICJUaGUgbnVtYmVyIG9mIHByaW1lcyBsZXNzIHRoYW4gIiA8PCBTSVpFIDw8ICIgaXMgIiA8PCBwcmltZUxpc3Quc2l6ZSgpIC0gMSA8PCAiKHdoaWNoIGluY2x1ZGVzIDEpIiA8PCBlbmRsOwovKglmb3IoaW50IGluZGV4ID0gMTsgaW5kZXggPCBwcmltZUxpc3Quc2l6ZSgpOyBpbmRleCArKykKCQljb3V0IDw8IGluZGV4IDw8ICdcdCcgPDwgcHJpbWVMaXN0W2luZGV4XSA8PCBlbmRsOyAqLwoJCXJldHVybigtMSk7Cn0=
prog.cpp: In function ‘int main()’: prog.cpp:22: warning: comparison between signed and unsigned integer expressions
-
upload with new input
-
result: Success time: 1.73s memory: 2856 kB returned value: 255
The number of primes less than 1000000 is 78499(which includes 1)


