Cod sursa(job #1750372)
| Utilizator | Data | 29 august 2016 23:15:50 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream> //Numerele prime mai mici decat n
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n;
f>>n;
bool viz[2000001] = {0};
for(int i = 2; i < sqrt(n); i++)
{
if(!viz[i])
{
for(int j = i*i; j < n; j = j + i)
viz[j] = true;
}
}
int nr = 0;
for(int i=2; i<n; i++)
if(!viz[i]) nr++;
g<<nr;
}
