Cod sursa(job #1668060)
Utilizator | Data | 29 martie 2016 15:28:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
long long int n,i,j,k=1;
char v[20000005];
int main(){
fi>>n;
for(i=3;i<=n;i+=2)
v[i]=1;
for(i=3;i<=n;i+=2){
if(v[i]){
k++;
for(j=i*i;j<=n;j=j+i)
v[j]=0;
}
}
fo<<k<<" ";
fi.close();
fo.close();
return 0;
}