Cod sursa(job #599441)
Utilizator | Data | 28 iunie 2011 19:04:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <fstream.h>
#include <math.h>
unsigned int i,x,j,n,k;
main(void){
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2; i<=n; i++)
{
k=0;
for(j=2; j<=sqrt(i); j++)
if(i%j==0)
k++;
if(k==0)
x++;
}
g<<x;
}