Cod sursa(job #2246608)
Utilizator | Data | 27 septembrie 2018 11:40:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
using namespace std;
long long ciur[10000];
int main()
{
int n,i,j,c=0;
cin>>n;
for(i=3;i<=10000;i+=2)
if(ciur[i]==0)
for(j=i*i;j<=10000;j+=2*i)
ciur[j]=1;
for(i=4;i<=10000;i+=2)
ciur[i]=1;
ciur[1]=1;
for(i=1;i<=n;i++)
if(ciur[i]==0)
c++;
cout<<c;
}