Cod sursa(job #1893848)
Utilizator | Data | 26 februarie 2017 07:36:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
char x[2000001];
fstream f("ciur.in");ofstream g("ciur.out");
int i, j,n,nr=0;
int main()
{
f>>n;
x[0]=1;x[1]=1;
for (i = 2; i <= n; i++)
if (x[i]==0)
{
nr++;
for (j=i+i; j<= n;j+= i)
x[j]=1;
}
g<<nr<<'\n';
f.close();g.close();
return 0;
}