Cod sursa(job #2777584)
Utilizator | Data | 23 septembrie 2021 18:53:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int p[2000005];
int main()
{
int i,j,k=0,n;
cin>>n;
for(i=2;i<=n;i++)
p[i]=1;
for(i=2;i<=n;i++){
if(p[i]==1)
k++;
for(j=i+i;j<=n;j=j+i)
p[j]=0;
}
cout<<k;
return 0;
}