Cod sursa(job #229851)

Utilizator ooctavTuchila Octavian ooctav Data 11 decembrie 2008 22:13:31
Problema Divizori Primi Scor 55
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.57 kb
#include <stdio.h>
# define N 1000004
int e[N];

int main()
{
	int t,n,k;
	int j,i;
	bool b=false;
	FILE *f1,*f2;
	f1=fopen("divprim.in","r");
	f2=fopen("divprim.out","w");
	fscanf(f1,"%d ",&t);
	for(i=1;i<=N-1;i++)
	{
		e[i]=0;
	}
	for(i=2;i<=N-1;i++)
	{
		if(e[i]==0)	for(j=i;j<=N-1;j=j+i)	e[j]++;
	}
	for(i=1;i<=t;i++)
	{
		b=false;
		fscanf(f1,"%d %d",&n,&k);
		for(j=n;j>=1;j--)
		{
			if(e[j]==k)
			{
				fprintf(f2,"%d\n",j);
				b=true;
				break;
			}
		}
		if(b==false)	fprintf(f2,"%d\n",0);
	}
	fclose(f1);
	fclose(f2);
	return 0;
}