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.
a)
uses crt;
var a:array[1..100]of integer;
i,n,max:integer;
begin
clrscr;
write('Nhap n='); readln(n);
for i:=1 to n do
begin
write('A[',i,']='); readln(a[i]);
end;
max:=a[1];
for i:=1 to n do
if max<a[i] then max:=a[i];
writeln(max);
readln;
end.
b)
uses crt;
var a:array[1..100]of integer;
i,n,min:integer;
begin
clrscr;
write('Nhap n='); readln(n);
for i:=1 to n do
begin
write('A[',i,']='); readln(a[i]);
end;
min:=a[1];
for i:=1 to n do
if min>a[i] then min:=a[i];
writeln(min);
readln;
end.
Program HOC24;
var a: array[1..32000] of integer;
i,max,,n: integer;
begin
write('Nhap so phan tu N: '); readln(N);
for i:=1 to n do
begin
write('a[',i,']='); readln(a[i]);
end;
max:=a[1];
for i:=1 to n do
if a[i]<max then max:=a[i];
write('So lon nhat la: ',max);
readln
end.
uses crt;
var a:array[1..1000000] of longint;
n,i,max:longint;
begin
clrscr;
write('Nhap so luong phan tu: '); readln(n);
max:=a[1];
for i:=1 to n do
begin
write('Nhap phan tu thu ',i,': '); readln(a[i]);
if a[i]>max then max:=a[i];
end;
writeln('GTLN: ',max);
readln;
end.
Program HOC24;
var a: array[1..32000] of integer;
i,max,min,n: integer;
begin
write('Nhap so phan tu N: '); readln(N);
for i:=1 to n do
begin
write('a[',i,']='); readln(a[i]);
end;
max:=a[1]; min:=a[1];
for i:=1 to n do
begin
if a[i]>max then max:=a[i];
if a[i]<min then min:=a[i];
end;
writeln('So nho nhat la :',max);
write('So lon nhat la: ',min);
readln
end.
uses crt;
var a:array[1..100]of integer;
i,n,max,min:integer;
begin
clrscr;
write('Nhap n='); readln(n);
for i:=1 to n do
begin
write('A[',i,']='); readln(a[i]);
end;
max:=a[1];
min:=a[1];
for i:=1 to n do
begin
if max<a[i] then max:=a[i];
if min>a[i] then min:=a[i];
end;
writeln('So lon nhat la: ',max);
writeln('So nho nhat la: ',min);
readln;
end.
#include <bits/stdc++.h>
using namespace std;
long long x,n,i,ln,t;
int main()
{
cin>>n;
ln=LLONG_MIN;
t=0;
for (i=1; i<=n; i++)
{
cin>>x;
ln=max(ln,x);
t+=x;
}
cout<<"So lon nhat la: "<<ln<<endl;
cout<<"Tong la: "<<t;
return 0;
}
1. uses crt;
var a,vt:array[1..100]of integer;
n,i,t,dem:integer;
begin
clrscr;
write('Nhap n='); readln(n);
for i:=1 to n do
begin
repeat
write('A[',i,']='); readln(a[i]);
until a[i]>=0;
end;
t:=0;
for i:=1 to n do
begin
if t<100 then
begin
t:=t+a[i];
dem:=dem+1;
vt[dem]:=i;
end;
end;
writeln(vt[dem]);
readln;
end.
Câu 2:
uses crt;
var a:array[1..30]of integer;
i,n,kt:integer;
begin
clrscr;
write('Nhap n='); readln(n);
for i:=1 to n do
begin
write('A[',i,']='); readln(a[i]);
end;
kt:=0;
for i:=1 to n-1 do
if a[i]>=a[j] then kt:=1;
if kt=0 then writeln('Day la day so khong giam')
else writeln('Day khong la day so khong giam');
readln;
end.
Câu 2:
#include <bits/stdc++.h>
using namespace std;
long long n;
int main()
{
cin>>n;
if (n>0 && n%5==0) cout<<"Phai";
else cout<<"Khong phai";
}
uses crt;
var n,i,d,x,j,tam:longint;
a:array[1..11]of integer;
st:string;
begin
clrscr;
repeat
write('Nhap n='); readln(n);
until n>0;
str(n,st);
d:=length(st);
for i:=1 to d do
begin
val(st[i],a[i],x);
end;
for i:=1 to d-1 do
for j:=i+1 to d do
if a[i]<a[j] then
begin
tam:=a[i];
a[i]:=a[j];
a[j]:=tam;
end;
for i:=1 to d do
write(a[i]);
readln;
end.
uses crt;
var a:array[1..100] of integer;
i,n,ln:integer;
begin
clrscr;
readln(n);
for i:=1 to n do
readln(a[i]);
ln:=0;
for i:=1 to n do
if trunc(sqrt(A[i]))=sqrt(a[i]) then
begin
write(a[i]:4);
if ln<A[i] then ln:=A[i];
end;
writeln;
writeln('So chinh phuong lon nhat la: ',ln);
readln;
end.
#include <bits/stdc++.h>
using namespace std;
long long a,b;
int main()
{
cin>>a>>b;
cout<<max(a,b);
return 0;
}
program TimMax;
uses crt;
var a:array[1..100] of byte;
i,Max: byte;
begin
clrscr;
for i:=1 to 10 do
begin
writeln('Nhap a[',i,']='); readln(a[i]);
end;
for i:=1 to 10 do write(a[i]:5);
Max:=a[1];
for i:=1 to 10 do
if Max < a[i] then Max:=a[i];
writeln('So lon nhat cua day so la:', Max);
readln
end.
Var a
so,max,i:integer;
Begin
max:=so;
For i:=1 to 10 do
Begin
Write('Nhap so thu ',i,' = ');readln(so);
If so > max then max:=so;
End;
Write('So lon nhat la ',max);
Readln
End.