Cod sursa(job #1593083)
Utilizator | Data | 8 februarie 2016 11:52:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <stdlib.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,*a,k=0;
void read(){
in>>n;
a = (int*)(calloc(n+1,sizeof(int)));
}
void ciur(){
for(int i=2;i<=n;i++){
if(a[i]==0){
k++;
}
a[i]=1;
for(int j=i+i;j<=n;j+=i){
a[j]=1;
}
}
}
int main(){
read();
ciur();
out<<k;
free(a);
return 0;
}