Cod sursa(job #2033088)
Utilizator | Data | 6 octombrie 2017 09:16:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int nr=0, n, i, j;
int a[500000];
f>>n;
for(i=2; i<=n; i++)
a[i]=1;
for(i=2; i<=n; i++)
if(a[i]!=0)
for(j=2; j<=n/i; j++)
a[i*j] = 0;
for(i=2; i<=n; i++)
if(a[i]!=0)
nr++;
g<<nr<<'\n';
return 0;
}