Cod sursa(job #905464)
| Utilizator | Data | 5 martie 2013 20:59:58 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int ciur[2000000];
int main()
{
int i,j,n,nr=1;
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for (i=3;i<=n;i++)
ciur[i]=1;
for (i=2;i*i<=n;i++)
if (ciur[i])
for (j=2;j*i<=n;j++)
ciur[j*i]==0;
for (i=3;i*i<=n;i++)
if (ciur[i])
++nr;
out<<nr;
in.close();
out.close();
return 0;
}
