Cod sursa(job #499519)
Utilizator | Data | 10 noiembrie 2010 08:33:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream.h>
#include<fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int ciur[200000],n,i,j,nr;
int main ()
{
f>>n;
for ( i=2; i<n; i++ )
ciur[i]=1;
for ( i=2; i*i<=n; i++)
if (ciur[i])
for ( j=2; j*i<n; j++ )
ciur[i*j]=0;
for ( i=2; i<n; i++ )
if ( ciur[i])
nr++;
g<<nr;
}