Cod sursa(job #251615)

Utilizator mathboyDragos-Alin Rotaru mathboy Data 2 februarie 2009 23:20:26
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.35 kb
Raporteaza aceasta sursa 
#include <fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
long unsigned a[10000],b[10000],i,j=1,n,k,p=0;
f>>n;
for(i=2;i<=n;i++)
	a[i]=i;
for(i=2;i<=n;i++) if(a[i]!=0)
		{ b[j]=a[i];
		for(k=i+1;k<=n;k++)
		 { if(a[k]%a[i]==0)
			{ a[k]=0;
			j++;
			} } }
 for(i=1;i<=n;i++) {if(a[i]!=0) p++;}
 g<<p;
 return 0;
}