Cod sursa(job #851687)
Utilizator | Data | 10 ianuarie 2013 12:29:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
bool prim[2000010];
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int N,k=1,i,j;
f>>N;
for(i=3;i<=N;i+=2) {
if(!prim[i]) {k++;for(j=i;j<=N;j+=i) prim[j]=1;}
}
g<<k;
}