Please help me with a solution?

the task is: without storage to find the two minimum numbers, sum of whose squares >500. a fragment of my program in Pascal :
for i:=1 to n do begin 
 phony (f, a);
 if (a<min1) then begin min2:=min1; min1:=a; end;
 if (a>min1) and (a<min2) then min2:=a;

how to check the squares? she can not figure out. it is desirable to describe the algorithm in Pascal, or simply to explain the words. thank you in advance.
March 19th 20 at 08:50
2 answers
March 19th 20 at 08:52
 writeln(16, 16);
0^2 + 0^2 = 0 + 0 = 0 > 500?
Originally you argue! - Kara commented on March 19th 20 at 08:55
the sum of the squares of which >500.

Yes... there is "more" is. - Kara commented on March 19th 20 at 08:58
@Kara, OK - Mallie.Nikolaus50 commented on March 19th 20 at 09:01
@Mallie.Nikolaus50Shorter again complaint to your response flew... In attempts to be clever, you forget about people who really have a problem. - Kara commented on March 19th 20 at 09:04
March 19th 20 at 08:54
start with 1-Tsy and increase each step by 1.
As soon as you get the sum of > 500 - interrupt cycle.

Find more questions by tags Pascal