Cod sursa(job #1262689)
Utilizator | Data | 13 noiembrie 2014 14:28:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
using namespace std;
long long int a[2000004];
ifstream in ("ciur.in");
ofstream out("ciur.out");
int main ()
{ int n,i,j,k;
in>>n;k=1;
for (i=3;i<=n;i=i+2)
{ if (a[i]==0)
{ k++;
for (j=i*i;j<=n;j=j+2*i)
a[j]=1;
}
}
out<<k;
return 0;
}