Cod sursa(job #1417849)
Utilizator | Data | 11 aprilie 2015 11:29:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
//ciurul lui eratostene
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,nr;
bool u[2000002];
int main()
{
f>>n;
for(i=2;i<=n;i++)
if(!u[i]) for(j=i+i;j<=n;j=j+i) u[j]=1;
for(i=2;i<=n;i++) if(!u[i]) nr++;
g<<nr<<'\n';
f.close();
g.close();
return 0;
}