Cod sursa(job #1166058)
| Utilizator | Data | 3 aprilie 2014 10:36:26 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,nr;
bool v[2000001];
int main()
{
fin>>n;
for(i=2;i<=n;++i)
if(v[i]==0)
for(j=i*2;j<=n;j+=i)
v[j]=1;
for(i=2;i<=n;++i)
if(v[i]==0)
nr++;
fout<<nr;
return 0;
}
