Var a,b,ta,tb,r,ucln,bcnn:integer;

Begin

Write('a = ');readln(a);

Write('b = ');readln(b);

ta:=a;

tb:=b;

Repeat

r:=ta mod tb;

ta:=tb;

tb:=r;

Until r = 0;

ucln:=ta;

bcnn:=a*b div ucln;

Writeln('UCLN(',a,' ',b,') la ',ucln);

Write('BCNN(',a,' ',b,' la ',bcnn);

Readln

End.

làm ơi cíuuuu

Tham Khảo:

#include <bits/stdc++.h>

using namespace std;

long long n,m,x,i;

//chuongtrinhcon

long long ucln(long long a,long long b)

{

if (b==0) return(a);

else return(ucln(b,a%b));

}

//chuongtrinhchinh

int main()

{

cin>>m>>n;

x=ucln(m,n);

for (i=1; i<=x; i++) if (x%i==0) cout<<i<<" ";

cout<<endl;

cout<<"Uoc chung lon nhat="<<x<<endl;

cout<<"Boi chung nho nhat="<<(m*n)/x<<endl;

return 0;

}

uses crt;

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

i,n,t,j,tam:integer;

begin

clrscr;

readln(n,k);

for i:=1 to n do readln(a[i]);

for i:=1 to n-1 do

for j:=i+1 to n do

if a[i]>a[j] then begin tam:=a[i]; a[i]:=a[j]; a[j]:=tam; end;

write(a[k]);

readln;

end.

program sonho;

var

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

     k, n, i, min: integer;

begin

     write('Nhap n: ');

      readln(n);

     write('Nhap cac phan tu cua day: ');

     for i := 1 to n do

     begin

          readln(arr[i]);

     end;

     write('Nhap k: ');

     readln(k);

     min := arr[1];

     for i := 2 to k do

     begin

          if (arr[i] < min) then

               min := arr[i];

     end;

     writeln('So nho thu ', k, ' trong day la: ', min);

end.

Program Hinh_Tamgiac_Program;
Uses crt;
Var a,b,c,s,p : real;
Begin
Clrscr;
Writeln(‘HINH TAM GIAC:’);
Write(‘nhap a =’);readln(a);
Write (‘nhap b =’);readln(b); Write(‘nhap c =’);readln(c);
If ((a+b)>c)and((b+c)>a)and((a+c)>b) then
Begin
p:=(a+b+c)/2;
s:=sqrt(p*(p-a)*(p-b)*(p-c)); Writeln(‘Chu vi tam giac:’,2*p:4:2) ; Writeln(‘Dien tich tam giac:’,s:4:2);
End
Else
Writeln(a,’, ‘, b,’, ‘, c, ‘ khong phai la ba canh cua tam giac’) ;
Readln;
End.

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

       i,n,x : byte;

      min:integer;

begin 

 write('Dãy có số phần tử là : '); readln(N);

for i:=1 to n do begin

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

                        readln(A[i]);

                        end;

Min : = A[1];

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

                                                    min:= A[i];

                                                    x:=i;

                                                    end;

write('Phần tử bé nhất trong dãy là : A[',x,']');

readln

end.

uses crt;

var t,s:real;

begin

clrscr;

readln(t,s);

writeln('a=',(t+s)/2);

writeln('b=',(t-s)/2);

readln;

end.

program tim_chu_so;

uses crt;

var i,n,csln:longint;

k:integer;

a:array[1..1000]of longint;

st:string;

begin

clrscr;

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

str(n,st);

val(st,a[i]);

csln:=a[1];

for i:=1 to length(st) do

if csln<a[i] then csln:=a[i];

writeln('chu so lon nhat cua so ',n,' la:',csln);

readln;

end.

Câu 1: 

uses crt;

var n,i,d,x,y,max:integer;

st:string;

begin

clrscr;

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

str(n,st);

d:=length(st);

max:=0;

for i:=1 to d do 

  begin

val(st[i],x,y);

if max<x then max:=x;

end;

writeln('Chu so lon nhat la: ',max);

readln;

end. 

Câu 2: 

uses crt;

var a,b,i,bcnn:longint;

begin

clrscr;

write('Nhap a='); readln(a);

write('Nhap b='); readln(b);

bcnn:=a*b;

for i:=a*b-1 downto 1 do 

  if (i mod a=0) and (i mod b=0) then 

begin

if bcnn<i then bcnn:=i;

end;

writeln('Boi chung nho nhat la: ',bcnn);

readln;

end.

program XoaPhanTuAm;

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

     n, i, j: integer;

     write('Nhap so phan tu: ');

     readln(n); 

     for i := 1 to n do

     begin

          write('Nhap phan tu thu ', i, ': ');

          readln(arr[i]);

     end;  

     j := 0;

     for i := 1 to n do

     begin

          if arr[i] >= 0 then

          begin

               j := j + 1;

               arr[j] := arr[i];

          end;

     end;

     n := j;

     writeln('Mang sau khi xoa phan tu am:');

     for i := 1 to n do

     begin

          write(arr[i], ' ');

     end;

     readln;

end.