Cod sursa(job #1734037)
Utilizator | Data | 26 iulie 2016 13:13:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool v[2000001];
int main()
{
int n,i,j,nr=0;
in>>n;
for (i=2;i<=n;i++)
if (v[i]==0)
for (j=2;j*i<=n;j++)
v[i*j]=1;
for (i=2;i<=n;i++)
if (v[i]==0)
nr++;
out<<nr;
return 0;
}