Cod sursa(job #277058)

Utilizator andreiiandrei andreii Data 11 martie 2009 14:49:00
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include<fstream.h>
#include<math.h>
fstream f("ciur.in",ios::in)
fstream g("ciur.out",ios::out);
int prim(int n)
{
	int i,ok=1;
	for(i=2;i<=sqrt(n);i++)
		if(n%i==0) ok=0;
	return ok;
}

int main()
{
	int i,n,v[100],j,k,s=0,sum=0;
	f>>n;
	for(i=1;i<=n;i++)
		v[i]=i;
	for(i=2;i<=n;i++)
		if(prim(v[i]))
			for(j=n;j>i;j--)
				if(v[j]%v[i]==0)
				{
					for(k=j;k<=n;k++)
						v[k]=v[k+1];
					n--;
				}
	for(i=2;i<=n;i++)
		sum++;
                g<<sum;
	return 0;
}