Cod sursa(job #2564578)
| Utilizator | Data | 1 martie 2020 23:24:57 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.24 kb |
#include<stdio.h>
int n,c;
bool p[2000010];
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(int i=2;i<=n;i++){
if(!p[i]){
c++;
for(int j=i+i;j<=n;j+=i) p[j]=1;
}
}
printf("%d",c);
}
