crossed[0] = crossed[1] = false; for (int i=2; i<=n; ++i) if (crossed[i]) { primes.push_back(i); if (i * i <= n) for (int j=i*i; j<=n; j+=i) crossed[j] = false; }
"assignmentexpert.com" is professional group of people in Math subjects! They did assignments in very high level of mathematical modelling in the best quality. Thanks a lot
Comments