Cod sursa(job #275348)
| Utilizator | Data | 10 martie 2009 13:26:42 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 30 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
var n,d,t,i,j:longint;
k:byte;
v:array[1..1000000]of longint;
begin
assign(input,'divprim.in');reset(input);
assign(output,'divprim.out');rewrite(output);
readln(t);
for i:=2 to 1000000 div 2 do
if v[i]=0 then
for d:=2 to 1000000 div i do inc(v[i*d]);
for i:=1 to t do begin
readln(n,k);
j:=n;
while v[j]<>k do
j:=j-1;
if j=0 then writeln('0')
else writeln(j);
end;
close(input);close(output);
end.
