Cod sursa(job #1221889)
Utilizator | Data | 21 august 2014 17:23:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#define nmax 2000001
using namespace std;
int n,i,j,nr;
bool w[nmax];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
if (w[i]==false)
{
nr++;
for(j=i+i;j<=n;j=j+i)
w[j]=true;
}
g<<nr;
f.close();
g.close();
return 0;
}