Cod sursa(job #271565)
Utilizator | Data | 5 martie 2009 15:43:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
int i,j,n,k,s;
int ciur[10000];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
//cout<<"Introduceti limita multimii: ";
//cin>>n;
f>>n;
for(i=2;i<=(n/2);i++)
for(j=2;(j*i)<=n;j++)
ciur[j*i]=1;
for(i=2;i<n;i++)
if(ciur[i]==0)
s=s+1;
g<<s<<'\n';
return 0;
}