Pascal: SOLUTIONS BÀI TẬP 5

Program mang_1;

uses crt;

var n, i: integer;

    M: array[1..100] of real;

Begin

    write('Nhap so n: ');readln(n);

    for i:=1 to n do

    Begin

        write('M[',i,']='); readln(M[i]);

    end;

    for i:= n downto 1 do write(m[i],’ ,’);

    readln

end.

Program Mang_Tong_Le;

uses crt;

var i,n:byte;

    M:array[1..100] of integer;

    tong:longint;

begin

    write('Nhap so phan tu cua day: ');readln(n);

    for i:=1 to n do

    begin

         write('M[',i,']'); readln(M[i]);

    end;

    tong:=0;

    for i:=1 to n do if M[i] mod 2 =1 then     

    tong:=tong+M[i];

    write('Tong cac so le trong day la: ',tong);

    readln

end.

Program Xoa_mang;

uses crt;

var m:array[1..100] of integer;

    n,i,k:byte;

begin

     Write('So phan tu cua day: ');readln(n);

     for i:=1 to n do

     Begin

          write('M[',i,']=');

          readln(M[i]);

     end;

     write('Nhap phan tu can xoa: ');readln(k);

     for i:=k to n-1 do m[i]:=m[i+1];

     for i:=1 to n-1 do write(m[i],', ');

     readln

end.

Program Mang_chen;

uses crt;

var M: array[1..100] of integer;

    i,n,k:integer;

begin

     clrscr;

     write('Nhap : ');readln(n);

     for i:=1 to n do

     begin

         write('M[',i,']='); readln(M[i]);

     end;

     write('Vi tri chen: ');readln(k);

     for i:=n+1 downto k+1 do M[i]:=M[i-1];

     write('Nhap so can chen: '); readln(M[k]);

     for i:=1 to n+1 do write(M[i],', ');

     readln

end.

Program TIM_NHO_NHAT;

uses crt;

var n,i,nhonhat:integer;

    m: array[1..100] of real;

    min:real;

begin

     write('Nhap n: '); readln(n);

     for i:=1 to n do

     begin

          write('M[',i,']='); readln(m[i]);

     end;

     min:=m[1];

     nhonhat:=1;

     for i:=2 to n do if m[i]  < min then

     begin

          min:=m[i]; nhonhat:=i;

     end;

     writeln('phan tu nho nhat la phan tu thu',nhonhat);

     readln

end.

Program Sap_xep_mang;

Var M: array[1..10] of integer;

    i,j,n: byte;

    tam: integer;

Begin

    Write('Nhap so phan tu n:');Readln(n);

    For i:=1 to n do

    Begin Write('M[',i,']='); Readln(M[i]); End;

    For i:=1 to n-1 do

    For j:=i+1 to n do if M[j] <=M[i] then

    Begin Tam:= M[i]; M[i]:=M[j]; M[j]:=tam; End;

    Write('Sau khi sap xep: ');

    For i:=1 to n do Write(M[i],';');

    Readln;

End.

Program Fibonacy_mang;

uses crt;

var i,n: integer;

    m:array[1..100] of longint;

begin

     write('Nhap so phan tu can in:'); readln(n);

     m[1]:=1;

     m[2]:=1;

     for i:=3 to n do m[i]:=m[i-1]+m[i-2];

     for i:=1 to n do write(m[i],' ,');

     readln

end.

Program Tam_giac_Pascal_mot_chieu;

Var n,i,j: integer;

    M: array[1..10] of integer;

Begin

    Write('Nhap n: '); Readln(n);

    For i:= 1 to n do M[i]:=0;

    M[1]:=1;

    For i:=1 to n do

    Begin

        For j:=i+ 1 downto 2 do M[j]:=M[j]+M[j-1];

        For j:=1 to i+ 1 do Write(M[j]:3);

        Writeln;

    End;

    Readln

End.