Advertisement
nikitaxe132

lab2.4

Feb 10th, 2020
178
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Delphi 3.15 KB | None | 0 0
  1. program laba_2_4;
  2. uses
  3.    System.SysUtils;
  4. type
  5.    Arr = array of Integer;
  6. function Enter(Temp, Max, Min : Integer): Boolean;
  7. var
  8.    Iscorrect : Boolean;
  9. begin
  10.    if (Temp > Max) or (Temp < Min) then
  11.    begin
  12.       WriteLn('This is a mistake. Please enter again!');
  13.       IsCorrect := False;
  14.    end
  15.    else
  16.    begin
  17.       IsCorrect := True;
  18.    end;
  19.    enter := IsCorrect;
  20. end;
  21. procedure Openfile();
  22. var
  23.    Line : String;
  24.    IsCorrect : Boolean;
  25.    Filein : TextFile;
  26. begin
  27.    repeat
  28.       WriteLn('Enter file location');
  29.       ReadLn(Line);
  30.          try
  31.             AssignFile(Filein, 'D:\input.txt');
  32.             Reset(Filein);
  33.             if FileExists(Line) then
  34.                IsCorrect := True
  35.             else
  36.             begin
  37.                WriteLn('Can not open this file. Please enter the name
  38.                                                         again');
  39.                IsCorrect := False;
  40.             end;
  41.             except
  42.                WriteLn('Can not open this file');
  43.          end;
  44.    until(IsCorrect);
  45. end;
  46. function Enterarray(N, Numb : Integer) : Arr;
  47. var
  48.    Filein : TextFile;
  49.    I, J, Temp : Integer;
  50.    IsCorrect : Boolean;
  51.    Arra : Arr;
  52. begin
  53.    AssignFile(Filein, 'D:\input.txt');
  54.    Reset(Filein);
  55.    for I := 0 to Numb do
  56.    Readln(Filein);
  57.    Temp := 0;
  58.    SetLength(Arra, N);
  59.    for I := 0 to N do
  60.    begin
  61.       WriteLn;
  62.       repeat
  63.       WriteLn('Enter the ', (I + 1), ' member of sequence', (Numb + 1), 'they
  64.                                  mast not be the same');
  65.       Read(Filein,Arra[I]);
  66.       Write(Arra[I]);
  67.       IsCorrect := Enter(Arra[I],200000,-200000);
  68.       for J := 0 to I do
  69.          if (Arra[J] = Arra[I]) then
  70.             Temp := Temp + 1;
  71.       if (Temp <> 1) then
  72.       begin
  73.          IsCorrect := False;
  74.          WriteLn('This is a mistake members are same! Please enter again!');
  75.       end
  76.       else
  77.          IsCorrect := True;
  78.       Temp := 0;
  79.       until(IsCorrect);
  80.    end;
  81.    enterarray := Arra;
  82. end;
  83.  
  84. procedure Main();
  85. var
  86.    Filein, Fileout : TextFile;
  87.    IsCorrect : Boolean;
  88.    I, N, J, Temp : Integer;
  89.    Sequence1 : Arr;
  90.    Sequence2 : Arr;
  91. begin
  92.    Openfile;
  93.    AssignFile(Filein, 'D:\input.txt');
  94.    Reset(Filein);
  95.    Temp := 0;
  96.    repeat
  97.       WriteLn('Enter the number of sequence members');
  98.       Read(Filein,N);
  99.       WriteLn(N);
  100.       IsCorrect := enter(N,10,1);
  101.    until(IsCorrect);
  102.    SetLength(Sequence1,N);
  103.    SetLength(Sequence2,N);
  104.    N := N - 1;
  105.    Sequence1 := Enterarray(N,0);
  106.    Sequence2 := Enterarray(N,1);
  107.    CloseFile(Filein);
  108.    AssignFile(Fileout, 'D:\output.txt');
  109.    Rewrite(Fileout);
  110.    WriteLn('All members of sequence 2 not in sequence 1');
  111.    for I := 0 to N do
  112.    begin
  113.       for J := 0 to N do
  114.          if (Sequence2[I] = Sequence1[J]) then
  115.             Temp := Temp + 1;
  116.       if (Temp = 0) then
  117.       begin
  118.          Write(Fileout,Sequence2[I], '  ');
  119.          Write(Sequence2[I], '  ');
  120.       end;
  121.       Temp := 0;
  122.    end;
  123.    CloseFile(Fileout);
  124.    ReadLn;
  125. end;
  126.  
  127. begin
  128.    WriteLn('This programm founds all members of sequence 2 not in sequence
  129.                           1');
  130.    Main();
  131. end.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement