Cod sursa(job #2862005)
Utilizator | Data | 4 martie 2022 19:38:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
using namespace std;
int main()
{
int n,d=2,i,uc,ciur[10000]={0},k=0;
cin>>n;
while(d*d<=n)
{
for(i=2; i*d<=n; i++)
ciur[d*i]=1;
d++;
while(ciur[d]==1)
d++;
}
for(i=2; i<=n; i++)
if(ciur[i]==0)
k++;
cout<<k;
return 0;
}