Cod sursa(job #922310)
Utilizator | Data | 22 martie 2013 07:48:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main ()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,db=0;
f>>n;
bool X[n+1];
X[0]=X[1]=false;
fill(X,X+n+1,true);
for (i=2;i<n+1;i++)
{
if (X[i])
{
db++;
for (j=i;j<n+1;j+=i)
{
X[j]=false;
}
}
}
g<<db;
}