Cod sursa(job #1354372)
| Utilizator | Data | 21 februarie 2015 19:48:54 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,v[2000000],nr=1;
int main()
{
fin>>n;
v[2]=1;
for(int i=3; i<=n; i=i+2)
{
if(v[i]==0)
{
for(int j=3; j<=sqrt(i); j=j+2)
{
if(i%j==0)
{
v[i]=1;
for(int k=i; k<=n; k=k*i)
v[k]=1;
break;
}
}
if(v[i]==0)
nr++;
}
}
fout<<nr;
fin.close();
fout.close();
return 0;
}
