Cod sursa(job #2135646)
Utilizator | Data | 18 februarie 2018 23:38:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n,k,c=0,i,j;
long long ciur[2000010];
int main()
{
fin>>n;
ciur[i]=1;
for(i=2;i<=2*n;i++){
if(ciur[i]==0){
for(j=i*2;j<=2*n;j+=i){
ciur[j]=1;
}
}
}
for(i = 2; i <= n; i++){
if(ciur[i]==0){
c++;
}
}
fout<<c;
return 0;
}