Cod sursa(job #2452009)
| Utilizator | Data | 29 august 2019 05:40:43 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int prim(int x)
{
if(x==2) return 1;
if(x<2) return 0;
if(x%2==0) return 0;
for(int i=3; i<x/i; i++)
if(x%i==0)
return 0;
return 1;
}
int N;
int main()
{
int n;
n=2;
fin>>N;
for(int i=2; i<sqrt(N); i++)
if(prim(i))
for(int j=i*i; j<N; j=j+i)
n++;
fout<<N-n;
fin.close();
fout.close();
return 0;
}
