Cod sursa(job #2082498)
Utilizator | Data | 6 decembrie 2017 12:52:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int c[2000005];
int main()
{
int n,contor,aux;
fin>>n;
contor=0;
for (int i=2;i<=n;i++)
{
for (int j=i+i;j<=n;j=j+i)
c[j]=1;
}
for (int i=2;i<=n;i++)
if (c[i]==0)
contor++;
fout<<contor;
fin.close();
fout.close();
return 0;
}