Cod sursa(job #1448103)
Utilizator | Data | 6 iunie 2015 11:32:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr;
char m[2001001];
int main()
{
f>>n;
nr=1; long long i,j;
for(i=3;i<=n;i+=2)
if(!m[i])
{
nr++;
for(j=i*i;j<=n;j+=(i<<1)) m[j]=1;
}
g<<nr;
g.close();
return 0;
}