Cod sursa(job #2564575)
| Utilizator | Data | 1 martie 2020 23:22:38 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.23 kb |
#include<stdio.h>
int n,p[2000010],c;
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);
}
