Cod sursa(job #1888407)
Utilizator | Data | 22 februarie 2017 09:07:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,val;
char c[2000002];
void ciur()
{
long long i,j;
for(i=4;i<=n;i=i+2)
c[i]=1;
for(i=3;i<=n;i=i+2)
if(c[i]==0)
{
val++;
for(j=i*i;j<=n;j=j+i)
c[j]=1;
}
}
int main()
{
fin>>n;
if(n==2){
fout<<1;
return 0;
}
val++;
ciur();
fout<<val;
return 0;
}