Cod sursa(job #2298832)
Utilizator | Data | 8 decembrie 2018 15:53:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
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(j=2; j<=n; j++)
{
if(a[j]==0)
{
for(i=2; j*i<=n; i++)
a[j*i]==1;
}
}
for(j=1; j<=n; j++)
{if(a[j]==0) k++;}
out<<k;
return 0;
}