Cod sursa(job #1489484)
Utilizator | Data | 21 septembrie 2015 10:56:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,contor;
bool v[2000007];
int main()
{
fin>>n;
for (i = 2; i <= n; i++)
v[i] = 1;
for (i = 2; i <= n; i++)
if (v[i])
{
contor++;
for (j = i+i; j <= n; j += i)
v[j] = 0;
}
fout<<contor<<'\n';
return 0;
}