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.
Lời giải:
program hotrotinhoc;
var a,b : integer;
s: longint;
t: real;
begin
write('A='); readln(a);
write('B='); readln(b);
s:=a;
s:=s+b;
writeln(s);
s:=0;
s:=a;
s:=s-b;
writeln(s);
s:=0;
s:=a;
s:=s*b;
writeln(s);
t:=a;
t:=t/b;
write(t:1:2);
readln
end.
sqr(d) + b = 25 + 16 = 41
c*d + a = 40 + 31 = 71
41 >= 71 → D := FALSE
Bài làm của bạn @lê chí hiếu(bạn được 2,1 điểm)
bài 1
program PTYN;
uses crt;
var a:array[1..100,1..100]of integer;
i,j,m,n:integer;
f1,f2:text;
Max, Min:Integer;
Kt:boolean;
Procedure XuatMang;
begin
For i:=1 to n do
begin
for j:=1 to m do
Write(a[i,j]:4);
Writeln;
end;
end;
Procedure MaxCot(l:Integer);
var p:Integer;
begin
Max:=A[1,l];
For p:=2 to n do
if A[p,l]>Max then Max:=A[p,l];
end;
Procedure MinHang(k:Integer);
var o:integer;
begin
Min:=A[k,1];
For o:=2 to n do
if A[k,o]<Min then Min:=A[k,o];
end;
begin
clrscr;
assign(f1,'ptyn.inp');
assign(f2,'ptyn.out');
reset(f1);rewrite(f2);
while not EOF(f1) do
begin
kt:=false;
readln(f1,n,m);
for i:=1 to n do
begin
for j:=1 to m do
Read(f1,a[i,j]);
readln(f1);
end;
for i:=1 to n do
begin
for j:=1 to n do
begin
MaxCot(j);
MinHang(i);
if Max=Min then
begin
Writeln(f2,'(',i,',',j,')');
kt:=true;
end;
end;
end;
If kt=false then Writeln(f2,'Khong co ptu yen ngua.');
end;
Close(f1); Close(f2);
Readln
End.
Bài 4
const fi='tvh.inp';
fo='tvh.out';
var n,d,dem,sl,s2cs,s3cs,s4cs,s5cs,s6cs,s7cs,k,i,d1:longint;
st,st1,stk:string;
f1,f2:text;
begin
assign(f1,fi); reset(f1);
assign(f2,fo); rewrite(f2);
readln(f1,n,k);
str(n,st);
d:=length(st);
case d of
1: write(9);
2: begin
sl:=n-9;
dem:=9+sl*2;
end;
3: begin
s2cs:=(99-10)+1;
s3cs:=n-99;
dem:=9+s2cs*2+s3cs*3;
end;
4: begin
s2cs:=(99-10)+1;
s3cs:=(999-100)+1;
s4cs:=n-999;
dem:=9+s2cs*2+s3cs*3+s4cs*4;
end;
5: begin
s2cs:=(99-10)+1;
s3cs:=(999-100)+1;
s4cs:=(9999-1000)+1;
s5cs:=n-9999;
dem:=9+s2cs*2+s3cs*3+s4cs*4+s5cs*5;
end;
6: begin
s2cs:=(99-10)+1;
s3cs:=(999-100)+1;
s4cs:=(9999-1000)+1;
s5cs:=(99999-10000)+1;
s6cs:=n-99999;
dem:=9+s2cs*2+s3cs*3+s4cs*4+s5cs*5+s6cs*6;
end;
7: begin
s2cs:=(99-10)+1;
s3cs:=(999-100)+1;
s4cs:=(9999-1000)+1;
s5cs:=(99999-10000)+1;
s6cs:=(999999-1000000)+1;
s7cs:=n-999999;
dem:=9+s2cs*2+s3cs*3+s4cs*4+s5cs*5+s6cs*6+s7cs*7;
end;
end;
if k<=dem then
begin
i:=1;
d1:=0;
repeat
str(i,st1);
d1:=d1+length(st1);
i:=i+1;
until d1>=k;
stk:=st1[length(st1)-(d1-k)];
writeln(f2,stk);
end;
close(f1);
close(f2);
end.
Bài 5
PROGRAM robot;
VAR A:ARRAY[0..30,0..30] OF BYTE;
F:ARRAY[0..30,0..30] OF LONGINT;
m,n:INTEGER;
PROCEDURE Enter;
VAR i,j:INTEGER;
BEGIN
readln(m,n);
FOR i:=1 TO m DO
BEGIN
FOR j:=1 TO n DO read(A[i,j]);
readln;
END;
FOR i:=0 TO m DO A[i,0]:=-1;
FOR j:=0 TO n DO A[0,j]:=-1;
END;
FUNCTION Max(a,b:LONGINT):LONGINT;
BEGINIF (a>b) THEN Max:=a ELSE Max:=b;
END;
PROCEDURE Optimize;
VAR i,j:INTEGER;
BEGIN
FOR i:=0 TO m DO F[i,0]:=-1;
FOR j:=0 TO n DO F[0,j]:=-1;
F[0,1]:=0;
FOR i:=1 TO m DO
FOR j:=1 TO n DO
F[i,j]:=2*Max(F[i,j-1],F[i-1,j])+A[i,j];
END;
PROCEDURE Trace(i,j:INTEGER);
BEGINIF (i=1) AND (j=1) THEN
writeln(F[m,n])
ELSE
BEGIN
IF F[i,j-1]>F[i-1,j] THEN
Trace(i,j-1)
ELSE
Trace(i-1,j);
writeln(i,' ',j);
END;
END;
BEGIN
Assign(Input,'Robot.inp'); Reset(Input);
Assign(Output,'Robot.out');Rewrite(Output);
Enter;
Optimize;
Trace(m,n);
close(Input);
close(Output);
END.
Em hiểu,nhưng cách anh chỉ đến 8 chữ số là cùng.
Cách em thì chỉ cần lấy int64(em dùng luôn mấy biến real vì bự hơn) thì chấp 10^30
Program HOC24;
const fi='Data.txt';
fo='Result.txt';
var f: text;
a,b: integer;
dt,cv: longint;
dc: real;
procedure ip;
begin
assign(f,fi);
reset(f);
readln(f,a);
readln(f,b);
close(f);
end;
procedure out;
begin
assign(f,fo);
rewrite(f);
dt:=a*b;
cv:=(a+b)*2;
dc:=sqrt((a*a)+(b*b));
writeln(f,'Chu vi hinh chu nhat la : ',cv);
writeln(f,'Dien tich cua hinh chu nhat la : ',dt);
write(f,'Chieu dai cua duong cheo la : ',dc:1:2);
close(f);
end;
begin
ip;
out;
end.
Sqrt(A) + B div K = 7 + 1 = 8
A mod C + K = 1 + 4 = 5
8 >= 5 → B := TRUE
Câu 2:
Program HOC24;
var i,n,m: integer;
tb,tb1: longint;
a,b: array[1..32000] of integer;
begin
write('Nhap so N : '); readln(n);
tb:=0;
for i:=1 to n do
begin
write('Nhap so thu ',i,' : '); readln(a[i]);
tb:=tb+a[i];
end;
write('Nhap so M : '); readln(n);
tb1:=0;
for i:=1 to m do
begin
write('Nhap so thu ',i,' : '); readln(b[i]);
tb1:=tb1+b[i];
end;
if (tb/n)>(tb1/m) then write('Trung binh cong cua N so lon hon M so')
else write('Trung binh cong cua M so lon hon N so')
else (tb/n)=(tb1/m) then write('Trung binh cong cua M so bang hon N so');
readln
end.
Câu 1:
Program HOC24;
var s,st: string;
n,i,j: integer;
a: array[1..32000] of string;
function chuyen(x: string): string;
begin
x[1]:=upcase(x[1]);
chuyen:=x;
end;
begin
write('Nhap xau : '); readln(s);
while s[1]=#32 do delete(s,1,1);
while s[length(s)]=#32 do delete(s,length(s),1);
while pos(#32#32,s)<>0 do delete(s,pos(#32#32,s),1);
writeln('Xau sau khi xoa dau cach : ',s);
st:=s;
s:=s+' ';
while length(s)<>0 do
begin
st:=copy(s,1,pos(' ',s)-1);
n:=n+1;
a[n]:=st;
delete(s,1,pos(' ',s));
end;
write('Cac ki tu in hoa dau tien cua moi tu : ');
for i:=1 to n do write(chuyen(a[i]),' ');
writeln;
writeln('Vi tri cuoi cung cua ki tu cuoi cung so : ',length(st));
write('Sau khi xoa tu cuoi cung : ');
for i:=1 to n-1 do write(chuyen(a[i]),' ');
readln
end.
a. a+b = 10 + 15 = 25
b. a<b <=> 10<15 -> True
c. Sqrt(a+b) = \(\sqrt{10+15}=\sqrt{25}=5\)
d) sqr(b-a) = (15-10)2=52 = 25
e/ Sửa đề: sqr(a)+sqr(b)
= a2+b2=52+102=125
f. b mod a = 15 mod 10 = 5