Решение задачи Array 135

#include <stdio.h>
 
int main(void)
{
    float a[10][2], b[10][2];
    int n1,n2;
 
    printf("N1: ");
    scanf("%i",&n1);
 
    printf("N2: ");
    scanf("%i",&n2);
 
    int i;
    for (i=0; i<n1; ++i){
        printf("a[%i]:\n",i+1);
        printf("  x : ");
        scanf("%f",&a[i][0]);
        printf("  y : ");
        scanf("%f",&a[i][1]);
    }
 
    for (i=0; i<n2; ++i){
        printf("b[%i]:\n",i+1);
        printf("  x : ");
        scanf("%f",&b[i][0]);
        printf("  y : ");
        scanf("%f",&b[i][1]);
    }
 
    int amin=0, bmin=0,i2;
    float r,rmin=sqrt(pow(a[0][0]-b[0][0],2)+pow(a[0][1]-b[0][1],2));
 
    for (i=0; i<n1; ++i){
        for (i2=0; i2<n2; ++i2){
            r= sqrt(pow(a[i][0]-b[i2][0],2)+pow(a[i][1]-b[i2][1],2));
            if (r < rmin) {
                rmin=r;
                amin=i;
                bmin=i2;
            }
        }
    }
 
    printf("R: %f\n",rmin);
    printf("A  %i :\n x: %f\n y: %f\n",amin+1,a[amin][0],a[amin][1]);
    printf("B  %i :\n x: %f\n y: %f\n",bmin+1,b[bmin][0],b[bmin][1]);
 
    return 0;
}

program Array135;
var
 A,B: array [1..10,1..2] of real;
 R,Rmin:real;
 N1,N2,i,i2,Point1,Point2: integer;
 
begin
 Write('N1: ');
 Readln(N1);
 
 Writeln('A: ');
 for i:=1 to N1 do
  begin
   write(i,'.x :');
   readln(a[i,1]);
   write(i,'.y :');
   readln(a[i,2]);
  end;
 
 Write('N2: ');
 Readln(N2);
 
 Writeln('B: ');
 for i:=1 to N1 do
  begin
   write(i,'.x :');
   readln(b[i,1]);
   write(i,'.y :');
   readln(b[i,2]);
  end;
 
 
 Rmin:=sqrt(sqr(A[1,1]-B[1,1])+sqr(A[1,2]-B[1,2]));
 Point1:=1;
 Point2:=1;
 
 
 for i:=1 to N1 do
  for i2:=1 to N2 do
   begin
    R:=sqrt(sqr(A[i,1]-B[i2,1])+sqr(A[i,2]-B[i2,2]));
    if (R < Rmin) then
     begin
      Rmin:=R;
      Point1:=i;
      Point2:=i2;
     end;
   end;
 
  Writeln ('R:',Rmin,' (',A[Point1,1],':',A[Point1,2],') (',B[Point2,1],':',B[Point2,2],')');
end.