Cod sursa(job #179758)
Utilizator | Patru Ovidiu Roflmao | Data | 16 aprilie 2008 12:23:11 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream.h>
#include<iostream.h>
#include<math.h>
int main()
{
fstream f,g;
long int n,i,j,count=0;
long int x[10000]={0};
f.open("Ciur.in",ios::in);
f>>n;
f.close();
for(i=2;i<=sqrt(n)+1;i++)
if(x[i]==0)
for(j=2*i;j<=n;j+=i)
x[j]=1;
g.open("Ciur.out",ios::out);
for(i=2;i<=n;i++)
if(x[i]==0)
count++;
g<<count;
g.close();
return 0;
}