Please help me to solve the problem?

Question

Pascal

The task is as follows: without storage, find two minimal numbers whose sum of squares is >500. snippet of my pascal program:

for i:=1 to n do begin 
 readln (f, a);
 if (a<min1) then begin min2:=min1; min1:=a; end;
 if (a>min1) and (a<min2) then min2:=a;
 end;

how can i check for squares? I can't figure it out myself. it is desirable to describe the algorithm in Pascal or simply explain the essence in words. thanks in advance.

Answer 1

begin
    writeln(16, 16);
end.

Answer 2

start with 1 and increase with each step by 1.
As soon as you get the amount> 500 - interrupt the loop.