Cod sursa(job #2777587)
Utilizator | Data | 23 septembrie 2021 18:56:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
char p[2000005];
int n,k;
int main()
{
int i,j;
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;
}