Cod sursa(job #1851370)
Utilizator | Data | 19 ianuarie 2017 17:42:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <iostream>
#define nmax 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,a[nmax];
int main()
{
int i,ct=0,j;
fin>>n;
fin.close();
a[2]=1;
for(i=3; i<=n; i=i+2) a[i]=1;
for(i=1; i*i<=n; i++)
if(a[i]==1)
for(j=3*i; j<=n; j=j+2*i)
a[j]=0;
for(i=2; i<=n; i++)
if(a[i]==1) ct++;
fout<<ct;
fout<<"\n";
fout.close();
return 0;
}