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