K
Khách

Hãy nhập câu hỏi của bạn vào đây, nếu là tài khoản VIP, bạn sẽ được ưu tiên trả lời.

1:

procedure nhap(var a,b,c:real);

begin

Repeat

write('Nhap canh thu nhat:'); readln(a);

write('Nhap canh thu hai:'); readln(b);

write('Nhap canh thu ba:'); readln(c);

Until (a>0) and (b>0) and (c>0) and (a+b>c) and (a+c>b) and (b+c>a);

end;

2:

function max(var x,y:real):real;

begin

max:=x;

if max<y then max:=y;

end;

1:

function dt(r:real):real;

begin

dt:=sqr(r)*pi;

end;

2:

function dt(a,b:real):real;

begin

dt:=1/2*a*b;

end;

Mình viết chương trình chính thôi, bạn tự viết chương trình con nhé

uses crt;

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

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

begin

clrscr;

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

for i:=1 to n do

 begin

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

end;

t:=0;

for i:=1 to n do 

  t:=t+a[i];

writeln('Tong diem cua ',n,' ban la: ',t);

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;

for i:=1 to n do 

  write(a[i]:4);

readln;

end.

19 tháng 5 2021

<bits/stdc++.h>
using namespace std;
int DTT(int a, int b, int c)

   int m = sqrt(2*b*b+2*c*c-a*a)/2;
    return m;

int main()
int a, b, c, m;
    cout << "Nhap ba canh tam giac" << endl;
    cin >> a >> b >> c;
    m = DTT(a,b,c);
    cout << m;
    return 0;

end.
 

uses crt;

var a,b,c:real;

{-----------------chuong-trinh-con--------------------}

function ttuyen(x,y,z:real):integer;

begin

ttuyen:=(2*(sqr(ab)+sqr(ac))-sqr(bc));

end;

{---------------chuong-trinh-chinh-----------------------}

begin

clrscr;

repeat

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

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

write('c='); readln(c);

until (a>0) and (b>0) and (c>0) and (a+b>c) and (a+c>b) and (b+c>a);

writeln(sqrt(ttuyen(a,b,c))/4:4:2);

readln;

end.

uses crt;

var a,b,c,p,s,am,bn,cp:real;

begin

clrscr;

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

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

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

if (a>0) and (b>0) and (c>0) and (a+b>c) and (a+c>b) and (b+c>a) then

begin

writeln('Day la ba canh trong mot tam giac vuong');

p:=(a+b+c)/2;

s:=sqrt(p*(p-a)*(p-b)*(p-c));

writeln('Dien tich tam giac la: ',s:4:2);

am:=sqrt(2*(sqr(b)+sqr(c))-sqr(a))/4;

bn:=sqrt(2*(sqr(a)+sqr(c))-sqr(b))/4;

cp:=sqrt(2*(sqr(a)+sqr(b))-sqr(c))/4;

writeln('Do dai duong trung tuyen ung voi canh a la: ',am:4:2);

writeln('Do dai duong trung tuyen ung voi canh b la: ',bn:4:2);

writeln('Do dai duong trung tuyen ung voi canh c la: ',cp:4:2);

end

else writeln('Day khong la ba canh trong mot tam giac');

readln;

end.

uses crt;
var i,n,tcd,t,t1,dem,dem1,dem2,dem3,dem4,dem5:longint;
a,b,c:array[1..100]of longint;
min,max:int64;
tbc,tbcd,tbca:real;
begin
clrscr;
write('nhap n='); readln(n);
for i:=1 to n do
begin
write('a[',i,']='); readln(a[i]);
end;
{---------------------------cau-1----------------------}
tcd:=0;
for i:=1 to n do
tcd:=tcd+a[i];
writeln('tong cac phan tu trong day la: ',tcd);
{-------------------------cau-2----------------------}
dem:=0;
t:=0;
for i:=1 to n do
if a[i]>0 then
begin
inc(dem);
t:=t+a[i];
end;
writeln('so luong cac so hang duong la: ',dem);
writeln('tong cac so hang duong la: ',t);
{-----------------------cau-3-----------------------}
dem1:=0;
t1:=0;
for i:=1 to n do
if a[i]<0 then
begin
inc(dem1);
t1:=t1+a[i];
end;
writeln('so luong cac so hang am la: ',dem1);
writeln('tong cac so hang am la: ',t1);
{---------------------cau-4---------------------------}
tbc:=tcd/n;
tbcd:=t/dem;
tbca:=t1/dem1;
writeln('trung binh cong cua ca day la: ',tbc:4:2);
writeln('trung binh cong cua cac so duong la: ',tbcd:4:2);
writeln('trung binh cong cua cac so am la: ',tbca:4:2);
{--------------------cau-5--------------------------------}
max:=0;
for i:=1 to n do
if max<a[i] then max:=a[i];
writeln('so lon nhat cua day la: ',max);
writeln('chi so cua no la: ');
dem2:=0;
for i:=1 to n do
if max=a[i] then
begin
inc(dem2);
b[dem2]:=i;
end;
for i:=1 to dem2 do
write(b[i]:4);
{---------------------cau-6-----------------------------}
writeln;
min:=maxint;
for i:=1 to n do
if min>a[i] then min:=a[i];
writeln('so nho nhat cua day la: ',min);
writeln('chi so cua no la: ');
dem3:=0;
for i:=1 to n do
if min=a[i] then
begin
inc(dem3);
c[dem3]:=i;
end;
for i:=1 to dem3 do
write(c[i]:4);
{-------------------------cau-7------------------------}
writeln;
dem4:=0;
dem5:=0;
for i:=1 to n do
begin
if a[i] mod 2=0 then inc(dem4);
if a[i] mod 2=1 then inc(dem5);
end;
writeln('so luong so chan cua day la: ',dem4);
writeln('so luong so le cua day la: ',dem5);
readln;
end.

10 tháng 5 2023

Program HOC24;

var t: longint;

a,b: integer;

function gt(x: integer): longint;

var i: integer; tich: longint;

begin

tich:=1;

for i:=1 to n tich:=tich*i;

gt:=tich;

end;

begin

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

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

t:=gt(a)+gt(b)+gt(a-b);

write('T = ',t);

readln

end.

10 tháng 5 2023

Program HOC24;

var i,n: integer;

t: longint;

a: array[1..300] of integer;

begin

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

for i:=1 to n do

begin

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

end;

t:=0;

for i:=1 to n do if a[i] mod 2<>0 then t:=t+a[i];

write('Ket qua la: ',t);

readln

end.

uses crt;

const fi='kiemtra.txt';

var f1:text;

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

min,n,i:integer;

{----------------chuong-trinh-con-------------------}

function nn(x,y:integer):integer;

begin

if x<y then nn:=x

else nn:=y;

end;

{-----------------chuong-trinh-chinh-----------------}

begin

clrscr;

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

for i:=1 to n do 

  begin

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

end;

min:=nn(a[1],a[2]);

for i:=3 to n do 

  if min>a[i] then min:=a[i];

writeln(min);

readln;

end.

Mình xin sửa lại một chút:

uses crt;

const fi='kiemtra.txt';

var f1:text;

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

min,n,i:integer;

{----------------chuong-trinh-con-------------------}

function nn(x,y:integer):integer;

begin

if x<y then nn:=x

else nn:=y;

end;

{-----------------chuong-trinh-chinh-----------------}

begin

clrscr;

assign(f1,fi); reset(f1);

readln(f1,n);

for i:=1 to n do 

  read(f1,a[i]);

min:=nn(a[1],a[2]);

for i:=3 to n do 

  if min>a[i] then min:=a[i];

writeln(min);

readln;

end.