Cod sursa(job #3182231)
Utilizator | Data | 8 decembrie 2023 18:47:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
ifstream fin("ciur.in");
ofstream fout("ciur.out");
using namespace std;
bool v[ 2000000];
int main()
{
v[0]=v[1]=1;
int n,i,j,cnt=0;
fin>>n;
for(i=4;i<=n;i+=2)
{
v[i]=1;
}
for(i=3;i*i<=n;i+=2)
{
if(v[i]==0)
{
for(j=i*i;j<=n;j+=i)
v[j]=1;
}
}
for(i=2;i<=n;i++)
{
if(v[i]==0)
cnt++;
}
fout<<cnt;
return 0;
}