Cod sursa(job #2011821)
Utilizator | Data | 17 august 2017 12:24:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur[2000001], i, j;
long int nr, n;
int main()
{
fin>>n;
ciur[1]=1;
for (i=1;i<=n;i++)
if (ciur[i]==0)
{
nr++;
j=i;
while (j<=n)
{
ciur[j]=1;
j+=i;
}
}
fout<<nr;
return 0;
}