Cod sursa(job #2377144)
| Utilizator | Data | 8 martie 2019 22:22:03 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | pregatire_cls9_ojiii | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout("ciur.out");
int prim(int n)
{
if( n < 2)
return false;
if(n = 2)
return true;
for(int d = 2; d*d <= n; d++)
if(n % d == 0)
return false;
return true;
}
int main()
{
int n, cnt = 0;
fin >> n;
for( int i = 2; i*i <= n; i++)
if(prim(i))
cnt+=2;
fout << cnt;
return 0;
}
