Cod sursa(job #561998)
Utilizator | Data | 22 martie 2011 09:13:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
using namespace std;
bool marcat[2000001];
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,j,i,nr=0;
in>>n;
for(i=2;i*i<=n;i++)
if(!marcat[i])
for(j=i*i;j<=n;j+=i)
marcat[j]=true;
for (i=2;i<=n;i++)
if(!marcat[i])
nr++;
out<<nr;
return 0;
}