Cod sursa(job #1248483)

Utilizator tabbyMaria Vasiliu tabby Data 25 octombrie 2014 12:20:09
Problema Divizori Primi Scor 25
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.5 kb
//#include "stdafx.h"
#include <iostream>
#include <fstream>
#define NM 1000001
FILE *in=fopen("divprim.in","r");
FILE *out=fopen("divprim.out","w");
char p[NM];
void sieve(char (&p)[NM])
{
	int i,j;
	for(i=2;i*i<NM;i++)
		if(!p[i])
			for(j=i+i;j<NM;j=j+i)
				 p[j]++;
}
int main()
{
	int t,n,k,i;
	sieve(p);
	fscanf(in,"%d",&t);
	for(i=1;i<=t;i++)
	{
		fscanf(in,"%d%d",&n,&k);
		while(p[n]!=k&&n)
			n--;
		fprintf(out,"%d\n",n);
	}
	fclose(in); fclose(out);
	return 0;
}