Cod sursa(job #1007681)
Utilizator | Data | 9 octombrie 2013 16:18:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, ok[2000000], nr;
int main()
{
fin>>n;
if (n>=2)
nr=1;
for(int i=3; i<=n; i+=2)
if(ok[i]==0)
{
nr++;
for(int j=i; j<=n; j+=i)
ok[j]=1;
}
fout<<nr;
return 0;
}