Cod sursa(job #2384354)
Utilizator | Data | 20 martie 2019 17:36:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
long long int n, nr;
char a[2000001];
int main()
{
fin>>n;
a[1]=1;
a[0]=1;
int i=2;
while(i*i<=n)
{
if(a[i]==0)
{
int j=2;
while(i*j<=n)
{
a[i*j]=1;
j++;
}
}
i++;
}
for(int i=1; i<=n; i++)
{
if(a[i]==0)nr++;
}
fout<<nr;
return 0;
}