Cod sursa(job #2324604)
Utilizator | Daniel Bernea daniel.bernea | Data | 21 ianuarie 2019 08:29:19 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream>
using namespace std;
int main()
{
long long int n,j,k,cont=0,i;
long long int v[2000000];
cin>>n;
for(i=2;i<=n;i++)
{ v[i]=i;
}
i=2;k=2;
while(i*i<=n)
{ for(j=2*k;j<=n;j=j+k)
{
if(v[j]!=0)
{
v[j]=0;
cont++;}}
if(v[i]!=0)
k=v[i];
i++;
}
for(i=2;i<=n;i++)
if(v[i]!=0)
cout<<v[i]<<" ";
cout<<" nr de numere prime este "<<n-cont;
return 0;
}