Cod sursa(job #32283)

Utilizator kyrkDragos Dumitrescu kyrk Data 17 martie 2007 17:48:53
Problema Divizori Primi Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.79 kb
#include<stdio.h>
#include<string.h>
long long a[1000005],b[1000005][50];
main()
{
long long i,j,k,n,m,l,x,s,sp,t,valid,zero=0;
freopen("divprim.in","r",stdin);
freopen("divprim.out","w",stdout);

memset(a,0,sizeof(a));
a[0]=1;a[1]=1;
i=2;
do{
   if(a[i]==0)
     { k=0;
       do{
	   a[i+k]++;
	   k+=i;
	  }while(a[i+k]<=100000);
     }
   i++;
   }while(i<=50000);

for(i=1;i<=50;i++)
 {b[1][i]=0;b[2][i]=0;}
b[2][1]=2;
n=1;i=3;
do{
   for(j=1;j<=50;j++)
    b[i][j]=b[i-1][j];
   b[i][ a[i]]=i;
   i++;
   }while(i<=100000);

fscanf(stdin,"%lld",&t);
s=50;
for(i=1;i<=t;i++)
 { fscanf(stdin,"%lld%lld",&k,&l);
   if(b[k][l]>50)fprintf(stdout,"%lld\n",zero);
   else fprintf(stdout,"%lld\n",b[k][l]);
 }







fclose(stdin);
fclose(stdout);
return 0;
}