Cod sursa(job #2298842)
Utilizator | Data | 8 decembrie 2018 16:02:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("ciur.in");
ofstream out ("ciur.out");
bool a[2000001];
int main()
{
int n,k=0,j,i;
in>>n;
a[1]=1;
for(i=2; i<=n; i++)
{
if(a[i]==0)
{
for(j=2; j*i<=n; j++)
a[j*i]=1;
}
}
for(i=1; i<=n; i++)
if(a[i]==0)
k++;
out<<k;
return 0;
}