Cod sursa(job #3220684)
Utilizator | Data | 4 aprilie 2024 17:21:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,nr,i,j,ciur[2000002];
int main()
{
ciur[0]=1;
ciur[1]=1;
for(i=2; i<=2000000; i++)
{
if(ciur[i]==0)
{
for(j=i; j<=2000000/i; j++)
{
ciur[i*j]=1;
}
}
}
fin>>N;
nr=0;
for(i=1; i<=N; i++)
{
if(ciur[i]==0)
{
nr++;
}
}
fout<< nr;
return 0;
}