Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- program laba_2_4;
- uses
- System.SysUtils;
- type
- Arr = array of Integer;
- function Enter(Temp, Max, Min : Integer): Boolean;
- var
- Iscorrect : Boolean;
- begin
- if (Temp > Max) or (Temp < Min) then
- begin
- WriteLn('This is a mistake. Please enter again!');
- IsCorrect := False;
- end
- else
- begin
- IsCorrect := True;
- end;
- enter := IsCorrect;
- end;
- procedure Openfile();
- var
- Line : String;
- IsCorrect : Boolean;
- Filein : TextFile;
- begin
- repeat
- WriteLn('Enter file location');
- ReadLn(Line);
- try
- AssignFile(Filein, 'D:\input.txt');
- Reset(Filein);
- if FileExists(Line) then
- IsCorrect := True
- else
- begin
- WriteLn('Can not open this file. Please enter the name
- again');
- IsCorrect := False;
- end;
- except
- WriteLn('Can not open this file');
- end;
- until(IsCorrect);
- end;
- function Enterarray(N, Numb : Integer) : Arr;
- var
- Filein : TextFile;
- I, J, Temp : Integer;
- IsCorrect : Boolean;
- Arra : Arr;
- begin
- AssignFile(Filein, 'D:\input.txt');
- Reset(Filein);
- for I := 0 to Numb do
- Readln(Filein);
- Temp := 0;
- SetLength(Arra, N);
- for I := 0 to N do
- begin
- WriteLn;
- repeat
- WriteLn('Enter the ', (I + 1), ' member of sequence', (Numb + 1), 'they
- mast not be the same');
- Read(Filein,Arra[I]);
- Write(Arra[I]);
- IsCorrect := Enter(Arra[I],200000,-200000);
- for J := 0 to I do
- if (Arra[J] = Arra[I]) then
- Temp := Temp + 1;
- if (Temp <> 1) then
- begin
- IsCorrect := False;
- WriteLn('This is a mistake members are same! Please enter again!');
- end
- else
- IsCorrect := True;
- Temp := 0;
- until(IsCorrect);
- end;
- enterarray := Arra;
- end;
- procedure Main();
- var
- Filein, Fileout : TextFile;
- IsCorrect : Boolean;
- I, N, J, Temp : Integer;
- Sequence1 : Arr;
- Sequence2 : Arr;
- begin
- Openfile;
- AssignFile(Filein, 'D:\input.txt');
- Reset(Filein);
- Temp := 0;
- repeat
- WriteLn('Enter the number of sequence members');
- Read(Filein,N);
- WriteLn(N);
- IsCorrect := enter(N,10,1);
- until(IsCorrect);
- SetLength(Sequence1,N);
- SetLength(Sequence2,N);
- N := N - 1;
- Sequence1 := Enterarray(N,0);
- Sequence2 := Enterarray(N,1);
- CloseFile(Filein);
- AssignFile(Fileout, 'D:\output.txt');
- Rewrite(Fileout);
- WriteLn('All members of sequence 2 not in sequence 1');
- for I := 0 to N do
- begin
- for J := 0 to N do
- if (Sequence2[I] = Sequence1[J]) then
- Temp := Temp + 1;
- if (Temp = 0) then
- begin
- Write(Fileout,Sequence2[I], ' ');
- Write(Sequence2[I], ' ');
- end;
- Temp := 0;
- end;
- CloseFile(Fileout);
- ReadLn;
- end;
- begin
- WriteLn('This programm founds all members of sequence 2 not in sequence
- 1');
- Main();
- end.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement