Cod sursa(job #776845)
| Utilizator | Data | 10 august 2012 15:30:11 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream.h>
#include <stdio.h>
#include <math.h>
using namespace std;
int main()
{
ifstream fin;
ofstream fout;
fin.open("ciur.in");
fout.open("ciur.out");
bool a[10000];
int nr=0 , n , i , j;
fin>>n;
for(i=2; i<=n ; i++) a[i]=1;
for(i=2; i<=sqrt(n); i++)
if(a[i])
for(j=i ; j<=n/i ; j++)
a[i*j]=0;
for(i=2; i<=n ; i++)
if (a[i]) nr++;
fout<<nr;
fout.close();
}
