Cod sursa(job #1698985)
Utilizator | Data | 5 mai 2016 19:41:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool a[2000000];
int main()
{
int N,x,k=0,i,j;
fin>>N;
for(j=2; j<=N; j++)
if(a[i]==0)
for(i=2*j; i<=N; i=i+j)
if((i%j==0)&&(i!=j))
a[i]=1;
for(i=2; i<=N; i++)
if(a[i]==0)
k++;
fout<<k;
return 0;
}