HSG Tin 8 NH 2022 2023 by P A

Ngày 21/01/2022-Bài tập 1 -thầy Đạt

laidinhdatvnpascal — 2022-01-21 08:34:16 UTC

{Bai 1. Nhap day n phan tu, xuat cac phan tu nguyen to cua day va tong cua chung}

program Bai1;
Uses crt;
Const Max=100;

Type M1C=Array[1..100] of Integer;

Var A:M1C;
n:Integer;

Function NT(a:Integer):Boolean;
var i,t:Integer;
begin
if a<2 then exit(false);
if (a=2) or (a=3) then exit(true);

t:=trunc(sqrt(a));
for i:=2 to t do
if a mod i = 0 then exit(false);

exit(true);
end;

Procedure Nhap;
var i:Integer;
begin
clrscr;
write('Nhap so phan tu cua day: '); readln(n);
writeln('Nhap day: ');
for i:=1 to n do
begin
write('A[',i,']='); readln(A[i]);
end;
end;

Procedure Xuli;
var i,tong:Integer;
begin
tong:=0;
for i:=1 to n do
if nt(A[i]) then
begin
write(A[i],' ');
tong:=tong+A[i];
end;
writeln;
writeln;
writeln(tong);
readln;
end;

Begin
Nhap;
Xuli;
End.

Bài tập 2

laidinhdatvnpascal — 2022-01-21 08:56:40 UTC

Lời giải Bài 2 - thầy Đạt

laidinhdatvnpascal — 2022-01-21 09:15:44 UTC

{Bai 2}
Program Bai2;
Uses crt;
var s:string; n,i,k,max, tong:Longint;
begin
clrscr;
write('Nhap so nguyen: '); readln(s);

{a. Dem so chu so cua so nguyen}
writeln('a. So chu so cua so nguyen la: ', length(s));

{b. Tinh tong cac chu so cua n}
tong:=0;
for i:=1 to length(s) do
begin
val(s[i],k);
tong:=tong+k;
end;
Writeln('b. Tong cua cac chu so la: ',tong);

{c. Tim so lon nhat }
val(s[1],max);
for i:=2 to length(s) do
begin
val(s[i],k);
if k>max then max:=k;
end;
writeln('c. So lon nhat la: ', max);

Readln;
End.

Câu hỏi

2022-01-21 12:59:27 UTC

thầy ơi cho em hỏi lại val dùng để làm gì vậy thầy

ĐỀ của thầy sỉ đề 1 Bài 1(ĐInh Quốc Ý)

2022-01-21 15:14:31 UTC

{Viet chuong trinh cho phep nhap vao 1 phan so va rut gon phan so do}
program Bai1;
uses crt;
var m,n,a,b,k,t:real;
begin
clrscr;
writeln('Nhap phan so: ');
readln(m); a:=m;
writeln('-');
readln(n); b:=n;
while n<>m do
if m < n then
n:=n-m else
m:=m-n;
writeln('Phan so rut gon la: ');
k:=a/m;
t:=b/m;
writeln(k:1:0);
writeln('-');
writeln(t:1:0);
readln;
end.

{Bài 1. Viết chương trình nhập vào họ tên. In ra màn hình tên của người đó.}

2022-01-22 09:12:18 UTC

{Bài 1. Viết chương trình nhập vào họ tên. In ra màn hình tên của người đó.}

uses crt;
var st,stt:string;
i:integer;
begin
clrscr;
stt:='';
write('Nhap ho va ten: '); readln(st);
for i:= length(st) downto 1 do
if st[i] In[' '] then break;
writeln;
writeln('Ten la: ');
writeln;
for i:=i+1 to length(st) do
stt:=stt+st[i];
Textcolor(i);
write(stt);
readln;
end.

ĐỀ THẦY ĐẠT BÀI TẬP HAI(TUẤN)

2022-02-07 08:25:57 UTC

uses crt;

var n,d,i,t,max,x:longint;

y:integer;

st:string;

begin

clrscr;

repeat

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

until n>0;

str(n,st);

d:=length(st);

writeln('So chu so cua ',n,' la: ',d);

t:=0;

max:=0;

for i:=1 to d do

begin

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

t:=t+x;

if max

end;

writeln('Tong cac chu so cua ',n,' la: ',t);

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

readln;

end.

Ngày 11/2/2022 - Đề thi - Thầy Đạt

laidinhdatvnpascal — 2022-02-11 07:16:39 UTC

Hướng dẫn bài Phân số

laidinhdatvnpascal — 2022-02-11 08:53:12 UTC

program Phanso;
uses crt;
var a,b,c,d:Longint;

function UCLN(x,y:Longint):Longint;
begin
x:=abs(x);
y:=abs(y);
while x<>y do
if x>y then x:=x-y
else y:=y-x;
UCLN:=x;
end;

begin
writeln('Phan so thu nhat: ');
write('Tu: '); readln(a);
repeat
write('Mau: '); readln(b);
if b=0 then writeln('Du lieu nhap vao khong dung. Nhap lai!!!"');
until b<>0;
writeln('Phan so thu hai: ');
write('Tu: '); readln(c);
repeat
write('Mau: '); readln(d);
if d=0 then writeln('Du lieu nhap vao khong dung. Nhap lai!!!"');
until d<>0;

writeln('Phan so da nhap: ', a div UCLN(a,b),'/',b div UCLN(a,b),'; ',c div UCLN(c,d),'/', d div UCLN(c,d));

readln;
end.

Phân số - Hoàn chỉnh

laidinhdatvnpascal — 2022-02-11 09:26:46 UTC

program Phanso;
uses crt;
var a,b,c,d,uc,bc:Longint;

function UCLN(x,y:Longint):Longint;
begin
x:=abs(x);
y:=abs(y);
while x<>y do
if x>y then x:=x-y
else y:=y-x;
UCLN:=x;
end;

function BCNN(x,y:Longint):Longint;
begin
BCNN:=x*y div UCLN(x,y);
end;

begin
writeln('Phan so thu nhat: ');
write('Tu: '); readln(a);
repeat
write('Mau: '); readln(b);
if b=0 then writeln('Du lieu nhap vao khong dung. Nhap lai!!!"');
until b<>0;
writeln('Phan so thu hai: ');
write('Tu: '); readln(c);
repeat
write('Mau: '); readln(d);
if d=0 then writeln('Du lieu nhap vao khong dung. Nhap lai!!!"');
until d<>0;

uc:=UCLN(a,b);
a:= a div uc;
b:=b div uc;

uc:=UCLN(c,d);
c:=c div uc;
d:=d div uc;

writeln('Phan so da nhap: ', a,'/',b ,'; ',c ,'/', d );

bc:=bcnn(b,d);
a:=(bc div b) * a;
c:=(bc div d) * c;
b:=bc;
d:=bc;

writeln('Phan so sau khi quy dong: ', a,'/',b,'; ',c,'/',d);

a:=a+c;
uc:=UCLN(a,b);
a:= a div uc;
b:= b div uc;

writeln('Tong cua hai phan so: ',a,'/',b);

readln;
end.

2022-02-12 10:06:12 UTC

program UCLN_Mang;
uses crt;
var M:Array[1..100] of Integer;
i,n,j,MIN:Integer;
kt:Boolean;
begin
clrscr;
write('nhap so phan tu:');readln(n);
for i:=1 to n do
begin
write('M[',i,']=');
readln(M[i]);
end;
MIN:=M[1];
for i:=2 to n do
if M[i] for i:=MIN downto 1 do
begin
kt:=true;
for j:=1 to n do
if M[j] mod i <>0 then kt:=false;
if kt=true then break;
end;
write('UCLN la:',i);
readln;
end.

BCNN XÓA MÃN

2022-02-12 10:33:34 UTC

Ngày 18/02/2022 - thầy Đạt - Đề HSG Tin 8 tham khảo

laidinhdatvnpascal — 2022-02-18 07:07:42 UTC

bài 1 mới phiá bên <---

2022-02-18 07:57:30 UTC

uses crt;
var i,a,b,c:integer;
begin
clrscr;
writeln('Nhap ba canh cua tam giac');
write('nhap canh a:');readln(a);
write('nhap canh b:');readln(b);
write('nhap canh c:');readln(c);
if (a+b write('khong phai ba canh cua mot tam giac')

else
{tam giac deu}
if (a=b) and (b=c) then
write('abc la tam giac deu')

else
{tam giac vuong can}
if (a=b) or (b=c) or (a=c) then
if (a*a=b*b+c*c) or (b*b=c*c+a*a) or (c*c=a*a+b*b) then
write('abc la tam giac vong can')
else
write('la tam giac can')

else
{tam giac vuong}
if (a*a=b*b+c*c) or (b*b=c*c+a*a) or (c*c=a*a+b*b) then
write('abc la tam giac vong ')

else
{tam giac thuong}
writeln('tam giac thuong');
readln;
end.

bài 2 mới phía bên <---

2022-02-18 09:19:54 UTC

uses crt;
var n,i,s:integer;
begin
clrscr;
write('nhap so n:');readln(n);
s:=0;

for i:=1 to n-1 do
if n mod i=0 then
s:=s+i;
if s=n then

begin
write(n,' la so hoan chinh vi: ', n,'=');
write(1);
for i:=2 to n-1 do
if n mod i = 0 then write('+',i);

end

else
writeln(n,':khong phai la so hoan chinh');
readln
end.
uses crt;
var n,i,s:integer;
begin
clrscr;
write('nhap so n:');readln(n);
s:=0;

for i:=1 to n-1 do
if n mod i=0 then
s:=s+i;
if s=n then

begin
write(n,' la so hoan chinh vi: ', n,'=');
write(1);
for i:=2 to n-1 do
if n mod i = 0 then write('+',i);

end

else
writeln(n,':khong phai la so hoan chinh');
readln
end.

bài tập 4

2022-02-24 01:01:59 UTC

uses crt;

var j, d,dem,n,k,i:integer;

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

begin

clrscr;

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

for i:=1 to n do

begin

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

readln(a[i]);

end;

writeln('cac so duong trong day la: ');

for i:=1 to n do

if a[i] > 0 then

writeln(a[i]:5)

else

write('khong co so nguyen duong trong day');

writeln('nhap k: ');readln(k);

for i:=1 to n do

if a[i]=k then

writeln(i:5);

for i:=1 to n do

begin

d:=0;

for j:=1 to a[i] do

if a[i] mod j=0 then

d:=d+1;

if d=2 then

dem:=dem+1;

end;

write('so luong phan tu la nguyen to trong mang la:',dem);

readln

end.

bangnhan tệp

2022-02-25 07:44:29 UTC

vd 2

2022-02-25 09:08:39 UTC

const fi='nto.inp';
fo='nto.out';
var n:longint;
f,g:text;

function nto(a:longint):boolean;
var i,t:longint;
begin
if a<2 then exit(false);
if (a=2) or(a=3) then exit(true);
t:=trunc(sqrt(a));
for i:=2 to t do
if a mod i = 0 then exit(false);
exit(true);
end;

begin
assign(f,fi); assign(g,fo);
reset(f);
rewrite(g);
readln(f,n);

if nto(n) then write(g,'1')
else write(g,0);

close(g);
close(f);
end.

vd3

2022-02-25 09:54:35 UTC

const fi='Mang.inp';
fo='Mang.outp';
var f,g:text;
a:array[1..100] of longint;
i,j,n,tam:longint;
begin
assign(f,fi); assign(g,fo);
reset(f); rewrite(g);
readln(f,n);
for i:=1 to n do
read(f,a[i]);
for i:=1 to n-1 do
for j:=i+1 to n do
if a[j] begin
tam:= a[j];
a[j]:= a[i];
a[i]:=tam;
end;
for i:=1 to n do write(g,a[i],' ');
writeln(g);
write(g,a[n]);
close(f); close(g);
end.

ĐỀ THI TIN 8

2022-03-03 00:52:11 UTC

Palindrom

2022-03-03 01:25:14 UTC

Bài 2 Đề thi tin 8

2022-03-03 01:38:43 UTC

uses crt;
var a:array[1..100] of string;
i,n:integer;

function palin(st:string):boolean;
var stt:string;
i:integer;
begin
stt:='';
for i:=length(st) downto 1 do
stt:=stt+st[i];
if st = stt then palin := true else palin:=false;
end;
begin
clrscr;
write('Nhap n: '); readln(n);
while ( n<5) or(n >20) do
begin
writeln ('Yeu cau 5<=n<=20');
write('Nhap lai n: ');
readln(n);
end;
for i:=1 to n do
begin
write('A[',i,']=');
readln(A[i]);
while (length(a[i]) > 4) or (length(a[i]) <2) do
begin
writeln('Yeu cau cac phan tu phai co 2 den 4 chu so . Yeu cau nhap lai: ');
write('A[',i,']=');
readln(a[i]);
end;
end;
for i:=1 to n do
if palin(A[i])=true then write(a[i],' ');
readln;
end.

MẢNG 2 CHIỀU BÀI 1

laidinhdatvnpascal — 2022-03-17 02:05:00 UTC

program B1Mang2Chieu;
uses crt;
var A:array[1..100, 1..100] of Integer;
m,n,i,j:integer;
begin
clrscr;
writeln('CHUONG TRINH NHAP MANG 2 CHIEU M DONG N COT');
writeln('===========================================');
write('Nhap so dong m ='); readln(m);
write('Nhap so cot n = '); readln(n);
writeln('NHAP CAC PHAN TU CUA MANG: ');
for i:=1 to m do
for j:=1 to n do
begin
write('A[',i,',',j,']=');
readln(A[i,j]);
end;
writeln('MANG 2 CHIEU ',m, ' DONG ',n, ' COT VUA NHAP LA: ');
for i:=1 to m do
begin
for j:=1 to n do
write(A[i,j]:5);
writeln;
writeln;
end;
readln;
end.

MẢNG 2 CHIỀU BÀI 2

laidinhdatvnpascal — 2022-03-17 02:05:32 UTC

MẢNG 2 CHIỀU BÀI 3

laidinhdatvnpascal — 2022-03-17 02:06:13 UTC

program B3Mang2Chieu;
uses crt;
const fi='B3M2C.inp';
fo='B3M2C.out';
var m,n,i,j,k,tam:Longint;
A:array[1..100,1..100] of Integer;
f,g:text;
begin
clrscr;
//Lenh gan ten tep, mo tep
assign(f,fi); reset(f);
assign(g,fo); rewrite(g);
readln(f,m,n);
for i:=1 to m do
begin
for j:=1 to n do
read(f,A[i,j]);
readln(f);
end;

//Thuat toan sap xep tang dan
for k:=1 to m do
for i:=1 to n-1 do
for j:=i+1 to n do
if A[k,j] begin
tam:=A[k,i];
A[k,i]:=A[k,j];
A[k,j]:=tam;
end;

writeln(g,m, ' ', n);
for i:=1 to m do
begin
for j:=1 to n do
write(g,A[i,j]:4);
writeln(g);
writeln(g);
end;

close(f); close(g);
readln;
End.

MẢNG 2 CHIỀU BÀI 2 - CÁC SỐ XUẤT 1 LẦN

laidinhdatvnpascal — 2022-03-17 03:04:38 UTC

program B2Mang2Chieu;
uses crt;
var A:array[1..100, 1..100] of Integer;
m,n,i,j,k:integer;
B:array[1..10000] of Integer;
kt:Boolean;
function NT(a:longint):Boolean;
var i,t:Longint;
begin
if a<2 then exit(false);
if (a=2) or (a=3) then exit(true);
t:=trunc(sqrt(a));
for i:=2 to t do
if a mod i = 0 then exit(false);
exit(true);
end;
begin
clrscr;
writeln('CHUONG TRINH NHAP MANG 2 CHIEU M DONG N COT');
writeln('===========================================');
write('Nhap so dong m ='); readln(m);
write('Nhap so cot n = '); readln(n);
writeln('NHAP CAC PHAN TU CUA MANG: ');
for i:=1 to m do
for j:=1 to n do
begin
write('A[',i,',',j,']=');
readln(A[i,j]);
end;
writeln('MANG 2 CHIEU ',m, ' DONG ',n, ' COT VUA NHAP LA: ');
for i:=1 to m do
begin
for j:=1 to n do
write(A[i,j]:5);
writeln;
writeln;
end;
writeln('CAC PHAN TU CUA MANG LA SO NGUYEN TO LA: ');
k:=0;
for i:=1 to m do
for j:=1 to n do
if nt(A[i,j]) then
begin
k:=k+1;
B[k]:=A[i,j];
end;
write(B[1],' ');
for i:=2 to k do
begin
kt:=true;
for j:=i-1 downto 1 do
if B[i]=B[j] then kt:=false;
if kt then write(B[i],' ');
end;

readln;
end.

ĐỀ THI HSG TIN 8 HUYỆN PHÙ MỸ 14 15

laidinhdatvnpascal — 2022-03-24 00:07:17 UTC

XÂU ĐẢO NGƯỢC

laidinhdatvnpascal — 2022-03-24 02:32:23 UTC

{De thi hoc sinh gioi tin hoc 8 huyen Phu My
nam hoc 2014 2015
Bai 1}
program Xaudoixung;
uses crt;
var s,x:string; i,d:integer;
begin
clrscr;
write('- Nhap xau: '); readln(s);
write('- x='); readln(x);
d:=0;
for i:=1 to length(s) do
if s[i]=x then inc(d);
writeln('- So lan xuat hien cua ',x,' la: ',d);
x:='';
for i:=length(s) downto 1 do
x:=x+s[i];
if s=x then writeln('- Xau da nhap doi xung.')
else writeln('- Xau da nhap khong doi xung.');
writeln('- Xau dao nguoc: ',x);
readln;
end.

SỐ LỚN NHẤT

laidinhdatvnpascal — 2022-03-24 02:32:54 UTC

{De thi hoc sinh gioi tin hoc 8 huyen Phu My
nam hoc 2014 2015
Bai 2}
program Timsolonnhat;
uses crt;
var s,x,kq,max:string; i,d:integer;
begin
clrscr;
write('- Nhap xau: '); readln(s);
x:='';
for i:=1 to length(s) do
if s[i] in ['1'..'9'] then x:=x+s[i];
kq:='';
max:='0';
for i:=1 to length(x)-3 do
if x[i]>max then
begin
max:=x[i];
d:=i;
end;
kq:=max;

max:='0';
for i:=d+1 to length(x)-2 do
if x[i]>max then
begin
max:=x[i];
d:=i;
end;
kq:=kq+max;

max:='0';
for i:=d+1 to length(x)-1 do
if x[i]>max then
begin
max:=x[i];
d:=i;
end;
kq:=kq+max;

max:='0';
for i:=d+1 to length(x) do
if x[i]>max then
begin
max:=x[i];
d:=i;
end;
kq:=kq+max;
writeln(kq);
readln;
end.

SỐ HOÀN HẢO

laidinhdatvnpascal — 2022-03-24 02:33:22 UTC

{De thi hoc sinh gioi tin hoc 8 huyen Phu My
nam hoc 2014 2015
Bai 3}
program Timsohoanhao;
uses crt;
var i,j,n,tu,k:Longint;
s,x:string;
begin
clrscr;
write('Nhap N='); readln(n);

for i:=2 to n do
begin
tu:=0;
str(i,x);

s:=x+'=';

k:=i div 2 +1;

for j:=1 to k do
if i mod j=0 then
begin
tu:=tu+j;
str(j,x);
s:=s+x+'+';
end;
delete(s,length(s),1);
if tu=i then
writeln(s);

{ Chay lau hon
if tu=i then
begin
write(i,'=1');
for j:=2 to k do
if i mod j=0 then
write('+',j);
writeln;
end;
}
end;

readln;
end.

2022-04-21 02:54:20 UTC

Uses crt;
var a:array [1..100] of integer;
n,i,max,j,c:integer;
begin
clrscr;
write('Nhap so luong phan tu : '); readln(n);
for i:=1 to n do
begin
write('A[',i,']=');
readln(a[i]);
end;
for i:=1 to n do
if a[i]> 0 then
for j:=i to n do
begin
a[i]:=a[i+1];
c:=n-1;
end;
max:=a[1];
for i:=1 to c do
if max < a[i] then max:=a[i];
write(max);
readln
end.

2022-04-21 02:54:44 UTC

uses crt;
var n,i,j,d,t:longint;
Begin
clrscr;
write('Nhap so : '); readln(n);
d:=0;
j:=1;
for i:=2 to 100000 do
begin
repeat
j:=j+1;
until i mod j =0;
if j= n then d:=d+1;
j:=1;
end;
writeln(d);
readln
end.

2022-05-15 02:23:50 UTC

Program Bai5;
Const fi='DAYCON.INP';
fo='DAYCON.OUt';
Var tong,dem1,dem2,n,i,t:longint;
A:array[1..100] of longint;
f,g:text;
Begin
Assign(f,fi); Assign(g,fo);
Reset(f); Rewrite(g);
Readln(f,n,t); Readln(f);
For i:=1 to n do
Read(f,a[i]);
i:=1; dem1:=0; dem2:=0; tong:=0;
While i<= n do
Begin
inc(dem1);

tong:=tong+a[i];
If tong = t then
Begin
inc(dem2);
dem1:=0;
tong:=0;
end;

If (tong > t) and (A[i+1]>0) then
Begin
i:=i-dem1+1;
tong:=0;
dem1:=0;
end;
inc(i);
End;
Write(g,dem2);
Close(f); Close(g);
End.

bai3

2022-05-16 01:36:20 UTC

uses crt;
const fi='dayso.inp';
fo='dayso.out';
var i,j,tam,n,tong:integer;
a:array[1..100] of integer;
f,g:text;
dem:integer;
begin
assign(f,fi);assign(g,fo);
reset(f);rewrite(g);

readln(f,n);
readln(f);
tong:=0; i:=1; dem:=1;

for i:=1 to n do
read(f,a[i]);
for i:=1 to n do
tong:=tong+a[i];
write(g,tong); writeln(g);

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;
i:=1;
while i<= n do
begin
dem:=1;
while a[i]=a[i+1] do
begin
inc(dem);
inc(i);
end;
writeln(g,a[i],':',dem);
inc(i);
end;
close(f);
close(g);
end.

SOS (nhập ngày tháng năm in ra thứ)

duongnguyenngoctuan19072008 — 2022-05-16 12:42:05 UTC

Program Thu_trong_tuan;
Uses Crt;
Var
thu,ngay,thang:Byte;
Nam,luu:Integer;
Begin
Clrscr;
Writeln('NGAY THU MAY TRONG TUAN');
Writeln('-----------------------');
Write('-Ngay: ');
Readln(ngay);
Write('-Thang: ');
Readln(thang);
Write('-Nam: ');
Readln(nam);
luu:=nam;
nam:=1900 + (nam Mod 1900);
If thang < 3 Then
Begin
thang:=thang + 12;
nam:=nam - 1;
End;
thu:=ABS(ngay+2*thang+3*(thang+1) Div 5+nam+nam Div 4) Mod 7;
Case thu Of
0 : Begin
Writeln('+Ngay:',ngay:3,',thang:',thang:3,',nam:',luu:5);
Writeln(' +La ngay Chu Nhat');
End;
1 : Begin
Writeln('+Ngay:',ngay:3,',thang:',thang:3,',nam:',luu:5);
Writeln('+La ngay Thu Hai');
End;
2 : Begin
Writeln('+Ngay:',ngay:3,',thang:',thang:3,',nam:',luu:5);
Writeln(' +La ngay Thu Ba');
End;
3 : Begin
Writeln('+Ngay:',ngay:3,',thang:',thang:3,',nam:',luu:5);
Writeln(' +La ngay Thu Tu');
End;
4 : Begin
Writeln('+Ngay:',ngay:3,',thang:',thang:3,',nam:',luu:5);
Writeln(' +La ngay Thu Nam');
End;
5 : Begin
Writeln('+Ngay:',ngay:3,',thang:',thang:3,',nam:',luu:5);
Writeln(' +La ngay Thu Sau');
End;
6 : Begin
Writeln('+Ngay:',ngay:3,',thang:',thang:3,',nam:',luu:5);
Writeln(' +La ngay Thu Bay');
End;
End;
Writeln;
Writeln(' Bam phim de ket thuc');
Readln;
End.

2022-05-17 02:41:15 UTC

2022-05-18 03:00:23 UTC

Program Bai5;
Const fi='DAYCON.INP';
fo='DAYCON.OUT';
Var tong,dem1,dem2,n,i,t:longint;
A:array[1..100] of longint;
f,g:text;
Begin
Assign(f,fi); Assign(g,fo);
Reset(f); Rewrite(g);
Readln(f,n,t); Readln(f);
For i:=1 to n do
Read(f,a[i]);
i:=1; dem1:=0; dem2:=0; tong:=0;
While i<= n do
Begin
If a[i]=t then
begin
inc(dem2);
inc(i);
end else
Begin
inc(dem1);

tong:=tong+a[i];
If tong = t then
Begin
inc(dem2);
dem1:=0;
tong:=0;
end;

If (tong > t) and (a[i+1] >0) then
Begin
i:=i-dem1+1;
tong:=0;
dem1:=0;
end;
inc(i);
End;
End;
Write(g,dem2);
Close(f); Close(g);
End.

2022-05-24 03:14:31 UTC

2022-05-24 03:14:52 UTC

bài 5 hay sao á

duongnguyenngoctuan19072008 — 2022-06-09 08:09:33 UTC

các hàm nguyên tố

duongnguyenngoctuan19072008 — 2022-06-11 02:39:12 UTC

1://
function NTo(a:longint):boolean;
var i , t:integer;
begin
if (a<2) then exit(false);
if (a=2) or (a=3) then exit(true);
t:=trunc(sqrt(a));
for i:=2 to t do
if n mod i = 0 then exit(false);
exit(true);
end;

2://
function NTo(a:longint):boolean;
var ok:boolean;
j:integer;
begin
ok:=true;
if n<2 then ok:=false else
For j:=2 to a-1 do
If n mod j = 0 then ok:=false;
NTo:=ok;
end;

3://
function snt(n: word): boolean;
var i: word;
d: byte;
begin
d:= 0;
for i:= 1 to n do if n mod i = 0 then inc(d);
if d=2 then snt:= true else snt:= false;
end;

4://
Function Kt(n:Longint):Boolean;

Var i:Longint;

d:Longint2;

Begin

d:=0;

Kt:=True;

For i:=2 to Round(Sqrt(n)) do

Begin

If (n mod i)=0 then d:=d+1;

If d>0 then

Begin

Kt:=False;

Break;

End;

End;

4://

Function nt(q,p:longint):boolean;
begin
while p*q <> 0 do
if p>q then p:=p mod q;
else q:=q mod p;
nt:=(p+q+1);
end;

phân tích 1 số thành thừa số nguyên tố

2022-06-18 09:34:18 UTC

uses crt;
var n:longint;

Function NT(a:longint):boolean;
var i,t:integer;
Begin
if (a<2) then exit(false);
if (a=2)or(a=3) then exit(true);
t:=trunc(sqrt(a));
for i:=2 to t do
if a mod i = 0 then exit(false);
exit(true);
End;

Function ptichthuasoNT(a:longint):string;
var i:longint;
kq,tam:string;
Begin
kq:='';
i:=2;
while (i<=a) do
begin
if nt(i) and (a mod i = 0 ) then
begin str(i,tam);
kq:=kq+'*'+tam;
a:=a div i;
end
else
inc(i);
end;
delete(kq,1,1);
ptichthuasoNT:=kq;
end;

Begin
clrscr;
write('Nhap so nguyen N:');
readln(n);
if nt(n) then writeln(n,' la so nguyen to')
else
writeln(n,' khong la so nguyen to');
writeln;
writeln;
Writeln('so ',n,' = ',ptichthuasoNT(n));
readln;
end.

bài 2 Huyện Phụng hiệp

duongnguyenngoctuan19072008 — 2022-06-20 01:21:14 UTC

uses crt;
var i,n,j,x,code :integer;
s,st:string;
ok:boolean;
Begin
clrscr;
Write('nhap SDT: ');readln(s);
ok:=false;
st:='';
if length(S) = 11 then
Begin
for i:=1 to 4 do
st:=st+s[i];
val(st,x,code);
for i:=1 to length(st) do
for j:=0162 to 0169 do
begin
if x = j then
ok:=true;
end;
if ok = true then
write(s,' la SDT cua nha mang Viettel')
else
write(s,' k pk SDT cua nha mang Viettel');
End

else

if length(s) = 10 then
Begin
For i:=1 to 3 do
st:=st+s[i];
val(st,x,code);
for i:=1 to length(st) do
for j:=096 to 098 do
begin
if x = j then
ok:=true;
end;
if ok = true then
write(s,' la SDT cua nha mang Viettel')
else
write(s,' k pk SDT cua nha mang Viettel');
End

else

if (length(s) < 10) or (length(s) >11) then
write('khog pk SDT');
Readln;
End.

2022-06-23 02:36:49 UTC

Program Bai2;
Uses Crt;
Var s:string;
a:array[1..100,1..100] of char;
i,n,j,k,max,nho,tong:longint;
Begin
Clrscr;
Write('Nhap chuoi: ');
Readln(s);
n:=trunc(sqrt(length(s)));
For i:=1 to n do {hang}
Begin
k:=i;
For j:=1 to n do {cot}
Begin
a[i,j]:=s[k];
k:=k+n;
end;
end;

//Xuat
Max:=0;

for i:=1 to n do
begin
for j:=1 to n do
tong:=tong+ord(a[i,j]);
If max < tong then
Begin
max:=tong;
nho:=i;
tong:=0;
end;
end;
For j:=1 to n do
Write(a[nho,j],' ');
writeln;
Write(max);
readln;
end.

BÀI 2

duongnguyenngoctuan19072008 — 2022-06-27 12:32:59 UTC

uses crt;
var a:array[1..100] of longint;
c:string;
i,j,n:byte;
max:word;
begin
clrscr;
write(' Nhap chuoi: '); readln(c);
n:= trunc(sqrt(length(c)));
writeln(' Bang la: ');
for i:= 1 to n do
begin
for j:= 1 to n do
begin
write(' ',c[n*(j-1)+i]);
a[i]:= a[i]+ ord(c[n*(j-1)+i]);
end;
writeln;
end;

max:= a[1]; j:= i;
f or i:= 2 to n do
if a[i]>max then max:= a[i];
writeln(' Ket qua: ');
writeln(' a/');
for i:= 1 to n do
if a[i]=max then
begin
for j:= 1 to n do write(' ',c[n*(j-1)+i]);
writeln
end;
writeln;
writeln(' b/ Tong ma ASCII cua cac ki tu: ',max);
readln
end.

bài 1

duongnguyenngoctuan19072008 — 2022-06-27 13:08:37 UTC

uses crt;
var n,i: word;
function snt(n:integer): boolean;
var i:word;
d:byte;
begin
d:= 0;
for i:= 1 to n do if n mod i = 0 then inc(d);
if d=2 then snt:= true else snt:= false;
end;
//HAM TONG CAC SO CUA CHU SO;
function tcs(n: word): byte;
var s,t: word;
begin
s:= n; t:= 0;
repeat
t:= t+(s mod 10);
s:= s div 10;
until s=0;
tcs:= t;
end;
//CT CHINH
Begin
clrscr;
//CAU A
write('Nhap vao mot so: '); readln(n);
if snt(n) and snt(tcs(n)) then writeln('a)',n,' la so song to.')
else writeln('a)',n,' khong phai la so song to.');
//CAU B
writeln('b) Cac so song to ko lon hon ',n,': ');
for i:= 1 to n do
if snt(i) and snt(tcs(i)) then write(i:5);
writeln;
//CAU C
writeln('Cac cap so nguyen to sinh doi khong lon hon ',n,': ');
for i:= 3 to n-2 do
if snt(i) and snt(i+2) then
writeln('(',i,';',i+2,');');
readln
end.

BÀI 3

duongnguyenngoctuan19072008 — 2022-06-27 13:12:09 UTC

uses Crt;
const fi='robot.inp';
fo='robot.out';
var s:string;
k,l,nl:integer;
f,g:text;
begin
assign(f,fi);
reset(f); assign(g,fo);
rewrite(g);
While not EOF(f) do
begin
readln(f,k);
l:=k;
nl:=0;
s:='';
while l>2 do
begin
if l mod 2 = 0 then
begin
s:='N2 '+s;
l:=l div 2;
nl:=nl+4;
end
else
begin
s:='C1 '+ s;
l:=l-1;
nl:=nl+2;
end;
end;
S:='C1 '+S;
nl:=nl+2;
writeln(g,nl);
write(g,s);
end;
close(f); close(g);
end.

Bài 4 Bình Định

2022-06-30 12:46:07 UTC

program TamGiacLonNhat;
uses crt;
const fi='tamgiac.inp';
var aa, b,c,p,s,sMax:real;
n,i,j,k,ca,cb,cc:longint;
f,g:text;
A:array[1..256,1..2] of longint;
begin
clrscr;
//Gan ten cho tep
assign(f,fi); reset(f);
assign(g,fo); rewrite(g);
readln(f,n);
for i:=1 to n do
readln(f,A[i,1], A[i,2]);
//Xuat mang kiem tra:
for i:=1 to n do
writeln(A[i,1],' ',A[i,2]);
sMax:=0;
//Duyet mang toa do va tinh dien tich tam giac
for i:=1 to n-2 do
for j:=i+1 to n-1 do
for k:=j+1 to n do
begin
aa:=sqrt( sqr(A[j,1]-A[i,1])+sqr(A[j,2]-A[i,2]));
b:=sqrt( sqr(A[j,1]-A[k,1])+sqr(A[j,2]-A[k,2]));
c:=sqrt( sqr(A[k,1]-A[i,1])+sqr(A[k,2]-A[i,2]));
p:=(aa+b+c)/2;
s:=sqrt(p*(p-aa)*(p-b)*(p-c));
if s>sMax then
begin
sMax:=s;
ca:=i;
cb:=j;
cc:=k;
end;
end;
writeln(ca,' ',cb, ' ', cc);
writeln(sMax:0:0);
close(f);
readln;
end.

Bài 1 Bình Định

2022-06-30 12:47:07 UTC

Uses crt;
Var n,k,i:integer;s:string;
Begin
clrscr;
write('nhap so nguyen: ');readln(n);
k:=n;
s:=' ';
For i:=1 to (n div 1000) do
Begin
s:=s+'M';
n:=n mod 1000;
if n >=900 then
begin
s:=s+'CM';
n:=n-900;
end
Else
if n >= 500 then
begin
s:=s+'D';
n:=n-500;
end
Else
if n >= 400 then
begin
s:=s+'CD';
n:=n-400;
end;
end;
for i:=1 to (n div 100) do
s:=s+'C';
n:=n mod 100;
if n >= 90 then
begin
s:=s+'XC';
n:=n-90;
end;
if n>= 50 then
begin
s:=s+'L';
n:=n-50;
end;
if n>= 40 then
begin
s:=s+'XL';
n:=n-40;
end;
For i:=1 to (n div 10) do
s:=s+'X';
n:=n mod 10;
if n = 9 then
begin
s:=s+'IX';
n:=n-9;
end;
if n = 8 then
begin
s:=s+'VIII';
n:=n-8;
end;
if n = 7 then
begin
s:=s+'VII';
n:=n-7;
end;
if n = 6 then
begin
s:=s+'VI';
n:=n-6;
end;
if n=5 then
begin
s:=s+'V';
n:=n-5;
end;
if n=4 then
begin
s:=s+'IV';
n:=n-4;
end;
if n=3 then
begin
s:=s+'III';
n:=n-3;
end;
if n=2 then
begin
s:=s+'II';
n:=n-2;
end;
if n=1 then
begin
s:=s+'I';
end;
writeln;
writeln('So Vua Nhap la: ',k);
writeln('SAU KHI BIEN DOI');
write('So LA MA la: ',S,'');
readln;
end.

Bài 2 phụng hiệp

2022-07-04 07:45:43 UTC

uses crt;
var i,n,code,j,x,tu,mau:integer;
tg,s:string;
d,uc,b,v:longint;
function UCLN(x,y:longint):longint;
begin
x:=abs(x);
y:=abs(y);
while x<>y do
if x>y then x:=x-y
else y:=y-x;
UCLN:=x;
end;
begin
clrscr;
highvideo;
write('nhap so thuc: ');readln(s);
tg:='1';
d:=0;
for i:=1 to length(s) do
while (s[i]='.') do
begin
delete(s,i,1);
for j:=i to length(s) do
begin
d:=d+1;
end;
end;
val(s,x,code);
for i:=1 to length(s) do
begin
tg:=tg+'0';
end;
for i:=1 to length(tg) do
delete(tg,d+2,1);
val(tg,b,v);
tu:=x;
mau:=b;
uc:=UCLN(tu,mau);
tu:=tu div uc;
mau:=mau div uc;
writeln('KET QUA LA:',tu,'/',mau);
readln;
end.

Sổ Sức Khỏe

duongnguyenngoctuan19072008 — 2022-07-12 01:20:20 UTC

uses crt;
const fi='suckhoe.inp';
fo='suckhoe.out';
var i,n,dem,j:integer;
a:array[1..100] of longint;
test:boolean;
f,g:text;
Begin
Assign(f,fi); Assign(g,fo);
reset(f); rewrite(g);
readln(f,n);
for i:=1 to n do
begin
readln(f,a[i]);
end;
dem:=1;
for i:=2 to n do
begin
test:=true;
for j:=1 to i-1 do
if a[j]=a[i] then test:=false;
if test=true then dem:=dem+1;
end;
writeln(g,dem);
close(f);close(g);

end.

Từ Dài Nhất

duongnguyenngoctuan19072008 — 2022-07-12 01:44:52 UTC

uses crt;
const fi='tudainhat.inp';
fo='tudainhat.out';
var st,kq:string;
vt,dai,max,d,i,j:integer;
a:array[1..100] of string;
f,g:text;
begin
assign(f,fi); assign(g,fo);
reset(f); rewrite(g);

readln(f,st);
max:=0;
st:=st+' ';
d:=0;
//tim va xoa ki tu '' trong xau
while length(st) <> 0 do
begin
vt:=pos(' ',st);
dai:=vt-1;
kq:=copy(st,1,dai);
inc(d);
a[d]:=kq;
delete(st, 1, vt);
end;
//tim ki tu co do dai lon nhat trong xau
for i:=1 to d do
if length(a[i])>max then
begin
max:=length(a[i]);
j:=1;
end
else
if length(a[i])=max then
inc(j);
writeln(g,max);
close(f); close(g);
end.

3

2022-07-14 00:08:23 UTC

Program Bai3;
Const fi='CD.inp';
fo='CD.out';
Var i,j,n,m:longint;
ok:boolean;
f,g:text;
Begin
Assign(f,fi); reset(f);
Assign(g,fo); Rewrite(g);
Read(f,n,m); ok:=false;
For i:=1 to n do
If (i*2+(n-i)*4)=m then
Begin
ok:=true;
Break;
end;
If ok then write(g,i,' ',n-i) else write(g,-1);
Close(f); Close(g);
End.

2022-07-14 01:40:24 UTC

hình chữ nhật

duongnguyenngoctuan19072008 — 2022-07-17 02:30:29 UTC

const fi='chunhat.inp';
fo='chunhat.out';
var a,b:integer;
i,x,y:integer;
min,max,dt:real;
f,g:text;
begin
assign(f,fi);reset(f);
assign(g,fo);rewrite(g);
repeat
readln(f,a,b);
until (a>=1) and (a<=100) and (b>=1) and (b<=100);
max:=(a*b)/2;
min:=max;

//thuat toan tim dien tich cs gia tri lon nhat
for i:=0 to b do
begin
begin
dt:=abs(a*b-(a*i/2)-((b-i)*i/2)-((a-i)*b/2));
end;

//tim MIN
if dt begin
x:=i;
min:=dt;
end
else
//tim MAX
begin
y:=i;
max:=dt;
end;
end;

writeln(g,max:5:1);
writeln(g,y:2);
writeln(g,min:5:1);
writeln(g,x:2);
close(f);close(g);
end.

hình vuông

duongnguyenngoctuan19072008 — 2022-07-17 02:31:14 UTC

const f1='kichthuoc.inp';
f2='ngang.inp';
f3='doc.inp';
ff='hinhvuong.out';
Var i,n,m,k,t:longint;
dem:longint;
f,g,o,v:text;
ngang:array[1..100,1..100] of integer;
doc:array[1..100] of longint;
Begin
Assign(f,f1);reset(f);
Assign(g,f2);reset(g);
Assign(o,f3);reset(o);
Assign(v,ff);rewrite(v);

readln(f,n,m);

k:=1;
dem:=0;
t:=m-1;

for i:=1 to n-1 do
read(g,ngang[2,i]);
While t > 0 do
Begin
For i:=1 to n do
read(g,ngang[k,i]);
read(o,doc[1]);

For i:=2 to n do
Begin
read(o,doc[i]);
if (doc[i]=1) and (ngang[k,i-1]=1) and (ngang[3-k,i-1]=1) and (doc[i-1]=1) then
begin
dem:=dem+1;
end;
End;

k:=3-k;
t:=t-1;
End;
Write(v,dem);
close(f); close(g); close(v); Close(o);
End.

2022-07-21 01:49:51 UTC

Const fi='Matran.inp';
fo='Matran.out';
Var f,g:text;
A:array[1..100,1..100] of Longint;
b:array[1..100] of longint;
i,j,m,n,tong,min,d,tam,nho:longint;
Begin
Assign(f,fi); Reset(f);
Assign(g,fo); Rewrite(g);
Readln(f,m,n);
For i:=1 to m do
Begin
For j:=1 to n do
read(f,a[i,j]);
Readln(f);
end;
For i:=1 to m do
Begin
tong:=0;
For j:=1 to n do
Tong:=tong+a[i,j];
inc(d);
b[d]:=tong;
end;
For i:=1 to d-1 do
for j:=i+1 to d do
If b[i]>b[j] then
Begin
Tam:=b[i];
b[i]:=b[j];
b[j]:=tam;
end;
i:=1;
While b[i] = b[i+1] do
inc(i);
min:=b[i+1];
For i:=1 to m do
Begin
tong:=0;
For j:=1 to n do
Tong:=tong+a[i,j];
If min =tong then nho:=i;
end;
If min<>0 then
begin
writeln(g,min);
writeln(g,nho);
end
else writeln(g,'Khong co!');

Close(f); Close(g);
end.

Các Số Liên Tiếp

duongnguyenngoctuan19072008 — 2022-07-27 07:46:39 UTC

uses crt;
const so: set of char=['0','1','2','3','4','5','6','7','8','9'];
var a:array[1..100] of integer;
st,b:string;
c,l,i,n,j:integer;
s: integer;

begin
    clrscr;
    write('Nhap xau:');readln(st);
        l:=length(st); i:=1; n:=0;
    repeat
        if (st[i] in so) then
            begin
                b:='';
                repeat
                    b:=b+st[i];
                    inc(i);
                until (not(st[i] in so)) or (i>l);
                inc(n);
                val(b,a[n],c);
            end;
        inc(i);
    until i>l;
    
    
    S := 0;
    for i:=1 to n do
        S := S + a[i] ;
    writeln;
    writeln('tong cac chu so trong xau la: ',s);
    readln;
end.

di xe dap

duongnguyenngoctuan19072008 — 2022-07-27 08:01:07 UTC

uses crt;
var s:string;
x,y,z,t:byte;
begin
write('Nhap vao mot xau: ');
readln(s);
z:=length(s);
for y:=length(s) downto 1 do
begin
if ((s[y]=' ')or(y=1)) then begin for t:=y to z do write(s[t]);z:=y end;
write(' ');
end;
readln;
end.

Bai1_VinhPhuc

2022-07-28 02:35:35 UTC

uses crt;
var s:string;
n,i,j,dem,son:longint;

function tich(n:longint):longint;
var i,j,t:longint;st:string;
begin
t:=1;
str(n,st);
for i:=1 to length(st) do
begin
val(st[i],j);
t:=t*j;
end;
tich:=t;
end;

begin
clrscr;
write('n='); readln(n);
son:=n;
str(son,s);
i:=length(s);
while i>1 do
begin
dem:=dem+1;
son:=tich(son);
str(son,s);
i:=length(s);
end;
writeln(dem);
readln;
end.

Đà Nẵng 4

duongnguyenngoctuan19072008 — 2022-08-05 01:38:04 UTC

Uses crt;
Var f,g:text;
n:integer;
t,i,d,j,dem:integer;
ok:boolean;
Fibo,vitri:array[1..1000] of integer;

Begin
Assign(f, 'fibo.inp'); Reset(f);
Assign(g, 'fibo.out'); Rewrite(g);
read(f, n);
Fibo[1]:= 1;
Fibo[2]:= 1;
t:= 1;
d:= 2;
ok:= true;
While t < n do
begin
inc(d);
Fibo[d]:= Fibo[d-1]+ Fibo[d-2];
t:= Fibo[d];
end;
t:= n;
j:= 0;
For i:= d downto 1 do
begin
If Fibo[i] <= t then
begin
inc(j);
Vitri[j]:= i;
t:= t - Fibo[i];
end;
end;
dem:=0;
If t <> 0 then ok:= false;
If Ok = true then

for i:= 1 to j do
begin
If i <> j then
write(g, Fibo[vitri[i]], ' + ') else
write(g, Fibo[vitri[i]]);
inc(dem);
end
else write(g, 'Khong the bieu dien ') ;
Writeln(g);
Write(g,dem);
Close(f);
Close(g);
end.

cách tạo và ẩn ổ đĩa

duongnguyenngoctuan19072008 — 2022-08-05 02:08:40 UTC

select volume ổ đĩa {chọn}
remove letter ổ đĩa{ để ẩn}
Assign letter ổ đĩa {hiện lại}

baif 4

2022-08-11 02:11:20 UTC

Program bai4;
Const fi='fibo.inp';
fo='fibo.out';

Var f,g:text;
a:array[1..100] of longint;
i,dem,f1,f2,n,j,tong:longint;
Begin
assign(f,fi); reset(f);
assign(g,fo); rewrite(g);
readln(f,n);
f1:=1; f2:=1; a[1]:=1; a[2]:=1; j:=2; dem:=0;
for i:=1 to n do
If i=f1+f2 then
begin
j:=j+1;
a[j]:=i;
f1:=f2;
f2:=i;
end;
For i:=2 to j do
Tong:=tong + a[i];
i:=j;
while i>0 do
begin
while tong - a[i] >= n do
begin
tong:=tong-a[i];
i:=i-1;
dem:=dem+1;
end;
i:=i-1;
end;

j:=j-1;
write(g,j-dem);

close(f); Close(g);
end.

day fibonacy bai4 da nang

2022-08-11 02:16:18 UTC

Program bai4;
Const fi='fibo.inp';
fo='fibo.out';

Var f,g:text;
a:array[1..100] of longint;
i,dem,f1,f2,n,j,tong:longint;
Begin
assign(f,fi); reset(f);
assign(g,fo); rewrite(g);
readln(f,n);
//day fibonacy
f1:=1; f2:=1; a[1]:=1; a[2]:=1; j:=2; dem:=0;
for i:=1 to n do
If i=f1+f2 then
begin
j:=j+1;
a[j]:=i;
f1:=f2;
f2:=i;
end;
//tinh tong
For i:=2 to j do
Tong:=tong + a[i];
//tinh
i:=j;
while i>0 do
begin
while tong - a[i] >= n do
begin
tong:=tong-a[i];
i:=i-1;
dem:=dem+1;
end;
i:=i-1;
end;

j:=j-1;
//xuat
write(g,j-dem);

close(f); Close(g);
end.

duongnguyenngoctuan19072008 — 2022-08-16 03:10:14 UTC

Program bsname;
Uses crt;
Const fi='bsname.inp';
fo='bsname.out';
Var s:string;
B:array['a'..'z'] of longint;
i:char;
j:longint;
f,g:text;
Begin
Assign(f,fi);Reset(f);
Assign(g,fo);Rewrite(g);
Read(f,s);
For i:='a' to 'z' do
B[i]:=0;
For i:='a' to 'z' do
For j:=1 to length(s) do
If i=s[j] then
B[i]:=B[i]+1;
For i:='a' to 'z' do
Write(g,B[i],' ');
Close(f);Close(g);
Readln;
End.

Bài 2

duongnguyenngoctuan19072008 — 2022-08-18 12:30:46 UTC

var i,n,tam: longint;
a:array[1..1000] of longint;
f,g:text;
procedure tbc(l,r: longint);
var i, j, x, t: longint;
begin
i:=l; j:=r; x:=a[(l+r) div 2];
repeat
while a[i] > x do inc(i);
while a[j] < x do j:=j-1;
if i <= j then
begin
t:=a[i]; a[i]:=a[j]; a[j]:=t;
inc(i); j:=j-1;
end;
until i > j;
if i if lend;

begin
assign(f,'Test.inp');
assign(g,'Test.out');
reset(f);
rewrite(g);
readln(f,n);

for i:=1 to n do
read(f,a[i]);

tbc(1,n);
i:=2; tam:=a[1]+1;
while (i <= n) and (i <= tam) do
begin
if a[i] + i < tam then
tam:=a[i] + i;
inc(i);
end;

if tam > n then
writeln(g,n)
else
writeln(g,tam);
close(f);
close(g);
end.

BÀI CHÍNH:
Var i,j,n,dem :integer;
a :array[1..1000] of integer;
tbc :real;
f,g :text;
ok :boolean;
Begin
assign(f,'gach.inp');
assign(g,'gach.out');
reset(f);
rewrite(g);
readln(f,n);

//nhap mang va tbc
ok:=false;
tbc:=0;
dem:=0;
For i:=1 to n do
Begin
read(f,A[i]);
tbc:=tbc+a[i];
End;
tbc:=tbc / n;

//chong gach
For i:=1 to n do
If A[i]=tbc then
ok:=true
else
ok:=false;
For j:=n downto 1 do
If A[j]=tbc then
ok:=true
else
ok:=false;

If ok=false then
For i:=1 to n do
Begin
If A[i] Begin
A[i]:=A[i]+1;
inc(dem);
End

Else

Begin
A[i]:=A[i]-1;
inc(dem);
End;
End;

writeln(dem);
//xuat KQ
If ok=true then
Write(g,'Khong can duy chuyen lan nao')
else
Write(g,dem);

Close(f);
Close(g);
End.

bai2

2022-08-25 01:56:04 UTC

Program Bai2;
uses crt;
Var s,st,kq,tam:string;
i,n,max,j,k,d:longint;
a:array[1..255]Of longint;
f,g:text;
begin
clrscr;
assign(f,'nmax.inp'); reset(f);
assign(g,'nmax.out'); rewrite(g);
Readln(f,s);
st:='';
For i:=1 to length(s) do
If s[i]in['0'..'9'] then
begin
val(s[i],d);
inc(j);
a[j]:=d;
end;
n:=j;
For i:=1 to n do
write(a[i]);

For i:=1 to n-4 do
begin
If max begin
max:=a[i];
k:=i;
end;
end;

writeln;
str(max,tam);
kq:=kq+tam;
max:=0;
For i:=k+1 to n-3 do
begin
If max begin
max:=a[i];
k:=i;
end;
end;
str(max,tam);
kq:=kq+tam;
max:=0;
For i:=k+1 to n-2 do
begin
If max begin
max:=a[i];
k:=i;
end;
end;
str(max,tam);
kq:=kq+tam;
For i:=k+1 to n do
begin
str(a[i],tam);
kq:=kq+tam
end;
write(g,kq);
CLose(f); Close(g);
end.

bai4 Lai Vung Dong Thap

2022-08-27 02:03:52 UTC

Program bai4;
Var a:array[1..100] of longint;
i,n,k,j,tong,max:longint;
f,g:text;
begin
assign(f,'Bl4.inp'); reset(f);
assign(g,'Bl4.out'); rewrite(g);
Readln(f,n);
For i:=1 to n do
read(f,a[i]);
For i:=1 to n-1 do
For j:=i+1 to n do
begin
For k:=i to j do
tong:=tong+a[k];
If tong>max then max:=tong;
tong:=0;
end;
write(max);
close(f); close(g);
Readln
end.

zz

2022-09-09 09:44:03 UTC

Program Bai4;
Uses crt;
Var dem,d,i,n:longint;
Function dx(n:longint):boolean;
Var i:integer;
st,s:string;
ok:boolean;
Begin
st:='';
str(n,s);
For i:=length(s) downto 1 do
st:=st+s[i];
If st=s then dx:=true else dx:=false;
end;
Begin
Clrscr;
write('Nhap n: '); readln(n);
For i:=10000 to 99999 do
If (dx(i))and(i mod n = 0) then
begin
d:=d+1;
Dem:=dem+1;
write(i,' ');
If dem= 5 then
begin
writeln;
dem:=0;
end;
end;
write(d);
readln
end.

zz

2022-09-23 09:38:15 UTC

Program Bai2;
Const fi='Bai2.inp';
fo='Bai2.out';
var s,st,kq:string;
max:char;
f,g:text;
i,nho:longint;

Begin
Assign(f,fi); Assign(g,fo);
Reset(f); Rewrite(g);
Readln(f,st);
For i:=1 to length(st) do
If st[i]in['0'..'9'] then s:=s+st[i];
max:='0';
For i:=1 to length(s)-3 do
If s[i]>max then
begin
max:=s[i];
nho:=i;
end;
kq:=kq+max; max:='0';

For i:=nho+1 to length(s)-2 do
If s[i]>max then
begin
max:=s[i];
nho:=i;
end;
kq:=kq+max; max:='0';

For i:=nho+1 to length(s)-1 do
If s[i]>max then
begin
max:=s[i];
nho:=i;
end;
kq:=kq+max; max:='0';

If nho = length(s)-1 then kq:=kq+s[length(s)] else
begin
For i:=nho+1 to length(s) do
If s[i]>max then
begin
max:=s[i];
nho:=i;
end;
kq:=kq+max;
end;
write(g,kq);
Close(f); close(g);
end.

rut gon ps

2022-09-23 10:23:40 UTC

uses crt;
const fi='BAI1.inp';
fo='BAI1.out';
var a,b,c,d,tu,mau,t,m,mc:longint;
f,g:text;
function UC(x,y:longint):longint;
var a,b:longint;
begin
a:=abs(x);
b:=abs(y);
while a<>b do
begin
if a>b then
a:=a-b
else
b:=b-a;
end;
UC:=a;
end;
begin
clrscr;
assign(f,fi);assign(g,fo);
reset(f);rewrite(g);
readln(f,a,b);

read(f,c,d);

if b=d then
begin
m:=b;
t:=a+b;
end
else
begin

{if (b>0)and(d>0) then m:=b*d;
if (b<0)and(d<0) then m:=b*d;}
mc:=b*d;

t:=(a*d)+(c*b);
m:=mc;
end;
t:=t div UC(t,m);
m:=m div UC(t,m);
if m=1 then write(t) else write(g,abs(t),' ',abs(m));
close(f);close(g);
end.

M2c

2022-10-01 03:55:03 UTC

const fi='bangst.inp';
fo='bangst.out';
var f,g:text;
A: array[1..20,1..20] of integer;
B: array[1..100] of integer;
m,n,i,j,d,tg: integer;
begin
assign(f,fi);assign(g,fo);
reset(f);rewrite(g);
readln(f,n,m);
d:=1;
for i:=1 to n do
for j:=1 to m do
begin
read(f,A[i,j]);
B[d]:= A[i,j];
d:=d+1;
end;
d:=d-1;
for i:=1 to d-1 do
for j:=i+1 to d do
if B[i] > B[j] then
begin
tg:=B[i];
B[i]:=B[j];
B[j]:=tg;
end;
d:=1;
for i:=1 to n do
for j:=1 to m do
begin
A[i,j] := B[d];
d:=d+1;
end;
for i:=1 to n do
begin
for j:=1 to m do write(g,a[i,j]:3);
writeln(g,'');
end;
readln;
end.

bai1

duongnguyenngoctuan19072008 — 2022-10-02 12:36:01 UTC

uses crt;
var n,i,kt,dem:longint;
x,y,m,b:longint;
st,st1,st2,st3:string;

function ktnt(var x:longint):longint;
var kt,i,kt1,j:longint;
begin
kt:=0;
for i:=2 to trunc(sqrt(x)) do
if x mod i=0 then begin
kt:=1;
break;
end;
if kt=0 then ktnt:=1
else ktnt:=0;
end;

{-------------------------------------------}
begin
clrscr;
repeat
clrscr;
write('Nhap n='); readln(n);
until (n<9) and (n>0);
st1[1]:='1';
for i:=2 to n do
st1[i]:='0';
st:='';

for i:=1 to n do
st:=st+st1[i];
val(st,x);

for i:=1 to n do
st2[i]:='9';
st3:='';

for i:=1 to n do
st3:=st3+st2[i];
val(st3,y);

dem:=0;
for m:=x to y do
{-----------------------------------------------}

begin
begin
b:=m;
repeat
kt:=ktnt(b);
if kt=0 then break
else b:=b div 10;
until b<10;

if (ktnt(b)=1) and (b>1) then
begin
write(m,' ');
inc(dem);
end;
end;
end;

writeln;
writeln('Co ',dem,' so sieu nguyen to co ',n,' chu so');
{-------------------------------------------------}

readln;
end.

2022-10-03 07:18:06 UTC

Var a,b,c:array[1..12] of real;
f,g:text;
th,i:integer;
tg,lx,tgtra,nho,ttl,tong:real;
Begin
Assign(f,fi); Reset(f);
Assign(g,fo); Rewrite(g);
Readln(f,tg);
Readln(f,lx);
Readln(f,th);
tgtra:=tg/th;
nho:=tg;
a[1]:=tg*lx/100/12;
For i:=2 to th do
begin
tg:=tg-tgtra;
a[i]:=tg*12/100/12;
end;
For i:=1 to th do
b[i]:=tgtra+a[i];
c[1]:=nho-b[1]+a[1];
for i:=2 to th do
c[i]:=c[i-1]-b[i]+a[i];
For i:=1 to th do
ttl:=ttl+b[i];
tong:=tgtra*6+ttl;
For i:=1 to th do
writeln(c[i]:1:0);

Writeln(g,'So tien vay (Vnd): ',nho:1:0);
Writeln(g,'Lai xuat (%/nam): ',lx:1:0);
Writeln(g,'Thoi han vay (thang): ',th);
Writeln(g,'Stt Lai Tra ngan hang Con lai');
For i:=1 to th do
Writeln(g,i:1,a[i]:10:0,b[i]:15:0,c[i]:15:0);
Writeln(g,'Tong so tien lai (Vnd): ',ttl:1:0);
Writeln(g,'Tong so tien ca goc lan lai: ',tong:1:0);
CLose(f); close(g);
end.

duongnguyenngoctuan19072008 — 2022-10-06 01:15:17 UTC

Uses crt;
Const fi='test.inp';
fo='a.out';
Var i,j,n:longint;
f,g:text;
A:array[1..100,1..100] of Integer;
Begin
Assign(f,fi);Assign(g,fo);
Reset(f); Rewrite(g);

Readln(f,n);

i:=1;
while not(eof(f)) do
begin
j:=1;
while not(EOLN(f)) do
begin
read(f,a[i,j]);
j:=j+1;
end;
readln(f);
i:=i+1;
end;

writeln(n);
for i:=1 to n do
begin
for j:=1 to n do
write(A[i,j]:4);
writeln;
end;
close(f); close(g);
readln;
End.

Bài Tập

duongnguyenngoctuan19072008 — 2022-10-11 06:22:25 UTC

de cuong tin 8

2022-10-29 08:19:28 UTC

ĐỀ ÔN TẬP HSG TIN 8 - ĐỀ SỐ 4

2023-02-12 07:05:28 UTC

BÀI GIẢNG DỮ LIỆU KIỂU TỆP

2023-02-12 07:30:54 UTC

2023-02-16 01:46:42 UTC

program DiemDanh;
uses crt;
var A:array[1..250] of string;
i,j,n:integer;
s,s1:string;

begin
clrscr;
write('Nhap hoc sinh: '); readln(s);
s:=upcase(s)+' ';
i:=1;
n:=1;
while i<=length(s) do
begin
s1:='';

while (s[i]<>' ') do
begin
s1:=s1+s[i];
i:=i+1;
end;
a[n]:=s1;
i:=i+1;
n:=n+1;
end;
for i:=1 to n do write(a[i],' ');

//Kiem tra loai bo ten trung
for i:=1 to n-1 do
for j:=i+1 to n do
if a[j]=a[i] then a[j]:='';
j:=0;
for i:=1 to n do
if a[i]<>'' then j:=j+1;
writeln;
writeln(j);
readln;
end.

ĐỀ ÔN TẬP HSG TIN 8 - ĐỀ SỐ 5

2023-02-16 02:02:39 UTC

ĐỀ ÔN TẬP HSG TIN 8 - ĐỀ SỐ 7

2023-02-16 02:11:48 UTC

ĐỀ ÔN TẬP HSG TIN 8 - ĐỀ SỐ 8 - FULL

2023-02-16 02:27:49 UTC

Bai 1 Sothanthiet

2023-02-16 02:36:47 UTC

Program sothanthiet;
Uses crt;
Const fi='sothanthiet.inp';
fo='sothanthiet.out';
Var a,b:longint;
f,g:text;
Function NT(x:longint):boolean;
Var t:longint;
Begin
If x<2 then exit(false);
For t:=2 to trunc(sqrt(x)) do
If x mod t = 0 then exit(false);
Exit(true);
End;
Function UNTLN(n:longint):longint;
Var i:longint;
Begin
For i:=n downto 1 do
If (n mod i = 0) and (NT(i)) then Break;
UNTLN:=i;
End;
Begin
Assign(f,fi);Reset(f);
Assign(g,fo);Rewrite(g);
Read(f,a,b);
Write(g,'UNTLN tuong ung :',UNTLN(a),',',UNTLN(b));
Writeln(g);
If UNTLN(a)=UNTLN(b) then Write(g,'La cap so than thiet')
Else Write(g,'Khong than thiet');
Close(f);Close(g);
Readln;
End.

ROBOT.PAS

2023-02-19 08:44:43 UTC

program robot;

const fi='ROBOT.INP';
fo='ROBOT.OUT';
var A,B:array[0..100,0..100] of Longint;
n:integer;
s,s1:string;

procedure Nhap;
var f:text;
i,j:integer;
begin
assign(f,fi); reset(f);
readln(f,n);
for i:=1 to n do
begin
for j:=1 to n do
read(f,a[i,j]);
readln(f);
end;
close(f);
end;
procedure Tinh;
var i,j:integer;
begin
b[1,1]:=a[1,1];
for j:=2 to n do b[1,j]:=a[1,j]+b[1,j-1];
for i:=2 to n do b[i,1]:=a[i,1]+b[i-1,1];
for i:=2 to n do
for j:=2 to n do
if b[i,j-1] b[i,j]:=b[i,j-1]+a[i,j]
else
b[i,j]:=b[i-1,j]+a[i,j];
//Gan gia tri ngoai bien
for i:=1 to n do
begin
b[i,0]:=10000;
b[i,n+1]:=10000;
end;
for j:=1 to n do
begin
b[0,j]:=10000;
b[n+1,j]:=10000;
end;
end;
procedure TimDuongDi;
var i,j:longint;
k,m:string;
begin
str(b[n,n],s1);
s1:='Tong so nhien lieu: '+s1;

str(n,k);
s:='['+k+','+k+']';
i:=n; j:=n;
while (i>0)and(j>0) do
begin
if (b[i,j-1] begin
str(i,k);
str(j-1,m);
j:=j-1;
end
else
begin
str(i-1,k);
str(j,m);
i:=i-1;
end ;
if (i>0) and (j>0) then s:='['+k+','+m+'] '+s;
end;
s:='Duong di: '+s;
end;

procedure Xuat;
var f:text;
i,j:integer;
begin
assign(f,fo); rewrite(f);
writeln(f,n);
for i:=1 to n do
begin
for j:=1 to n do
write(f,b[i,j]:4);
writeln(f);
end;
writeln(f);
writeln(f,s);
writeln(f,s1);
close(f);
end;
Begin
nhap;
tinh;
timduongdi;
xuat;
end.

duongdi

2023-02-23 02:59:06 UTC

program Duongditotnhat;
const fi='DUONGDI.INP';
fo='DUONGDI.OUT';
var A,B:array[1..100,1..100] of longint;
n:longint;
procedure Nhap;
var f:text;
i,j:integer;
begin
assign(f,fi); reset(f);
readln(f,n);
for i:=1 to n do
begin
for j:=1 to n do
if j<=i then read(f,a[i,j]);
readln(f);
end;
close(f);
end;
procedure Tinh;
var i,j:integer;
begin
b[1,1]:=a[1,1];
//Tinh cac phan tu tren duong cheo cua bang chi phi
for i:=2 to n do
for j:=2 to n do
if i=j then b[i,j]:=a[i,j]+b[i-1,j-1];
//Tinh cac phan tu tren cot dau tien cua bang chi phi
for i:=2 to n do
b[i,1]:=a[i,1]+b[i-1,1];
//Tinh cac phan tu con lai
for i:=3 to n do
for j:=2 to n do
if (i<>j) then
if (b[i-1,j-1]> b[i-1,j] ) then
b[i,j]:=a[i,j]+b[i-1,j-1]
else
b[i,j]:=a[i,j]+b[i-1,j];
end;

procedure Timduongdi;
var j,max,u,o,t:longint;
s,st:string;
begin
max:=b[n,1];s:='';o:=n;st:='';
for j:=2 to n do
If max for j:=2 to n do
If max=b[n,j] then
Begin
t:=a[n,j];
Val(t,s);
st:=st+s;
u:=j;
break;
End;
while (u>=3) and (o>=3) do
Begin
If b[o-1,u-1]>b[o-1,u] then
Begin
t:=a[o-1,u-1]
Val(t,st);
st:=st+s;
o:=o-1;
u:=u-1;
End
Else
Begin
t:=a[o-1,u]
Val(t,st);
st:=st+s;
o:=o-1;
End;
end;

procedure Xuat;
var f:text;
i,j:integer;
begin
assign(f,fo); rewrite(f);
writeln(f,n);
for i:=1 to n do
begin
for j:=1 to n do
if j<=i then write(f,a[i,j]:4);
writeln(f);
end;

writeln(f,'===============');
for i:=1 to n do
begin
for j:=1 to n do
if j<=i then write(f,b[i,j]:4);
writeln(f);
end;
Writeln(f,st);
close(f);
end;
begin
nhap;
tinh;
timduongdi;
xuat;
end.

de7

2023-03-05 08:29:06 UTC

bai1
Program bai1nuithanh;
Uses crt;
Var a,b:longint;
Function UCLN(x,y:longint):longint;
Var sodu:longint;
Begin
While y<>0 do
Begin
sodu:=x mod y;
x:=y;
y:=sodu;
End;
UCLN:=x;
End;
Begin
Clrscr;
Write('Nhap a : = ');Readln(a);
Write('Nhap b : = ');Readln(b);
Write('UCLN cua ',a,' va ',b,' la :',UCLN(a,b);
Readln;
End.

bai2
Program bai2nuithanh;
Uses crt;
Var a,b,c,d,j,e,u,n:longint;
i:longint;
Function UCLN(x,y:longint):longint;
Var sodu:longint;
Begin
While y<>0 do
Begin
sodu:=x mod y;
x:=y;
y:=sodu;
End;
UCLN:=x;
End;
Function BCNN(x,y:longint):longint;
Var k:longint;
Begin
For k:=x to x*y do
If (k mod x = 0) and (k mod y = 0) then Break;
BCNN:=k;
End;
Begin
Clrscr;
Write('a = ');Readln(a);
Write('b = ');Readln(b);
Write('c = ');Readln(c);
Write('d = ');Readln(d);
Write('Hai phan so vua nhap la : ',a,'/',b,' ; ',c,'/',d);
Writeln;
{ Write('Tong hai phan so la : ',a,'/',b,' + ',c,'/',d,' = '); }
i:=BCNN(b,d) div b;
j:=BCNN(b,d) div d;
a:=a*i;
c:=c*j;
e:=a+c;
u:=BCNN(b,d);
n:=UCLN(e,u);
e:=e div n;
u:=u div n;
Write(e,'/',u);
Readln;
End.

bai3
Program bai3nuithanh;
Uses crt;
Var A:array[1..100] of longint;
n,i,j,max:longint;
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:=2 to n do
If max Write('Phan tu lon nhat cua day la : ',max);
Writeln;
For i:=1 to n-1 do
For j:=i+1 to n do
If A[i]=A[j] then A[j]:=0;
For i:=1 to n do
If A[i]<>0 then Write(A[i],' ');

Readln;
End.

bai4
Program bai4nuithanh;
Uses crt;
Var A:array[1..100] of longint;
n,i,j,d,tam,o:longint;
Begin
Clrscr;
Write('Nhap N = ');Readln(n);
i:=1;o:=n
While n<>0 do
Begin
j:=n mod 10;
A[i]:=j;
Inc(i);
Inc(d);
n:=n div 10;
End;
For i:=1 to d-1 do
For j:=i+1 to d do
If A[j]>A[i] then
Begin
tam:=A[i];
A[i]:=A[j];
A[j]:=tam;
End;
Write('So anh lon cua ',o,' la : ');
For i:=1 to d do
Write(A[i]);
Readln;
End.

bai5
Program bai5nuithanh;
Uses crt;
Var A:array[1..100] of Real;
n,i,j,max,t,vt:longint;
Begin
Clrscr;
Write('Nhap n = ');Readln(n);
For i:=1 to n do
Begin
Write('A[',i,'] = ');
Readln(A[i]);
End;
max:= 1;
t:= 1;
vt:= 1;

For i:= 2 to n do
Begin
If A[i]>A[i-1] then
Begin
t:=t+1;
If t>max then
Begin
max:=t;
vt:=i-max+1;
End;
End
Else t:=1;
End;

Write('Cac gia tri lien tiep tang nhieu nhat la : ');
For j:=vt to vt+max-1 do
Write(A[j]:5:1);
If max>(n div 2) then Write('Kinh te phat trien')
Else Write('Kinh te chua phat trien');
Readln;
end.

SSNT.Pas - Đề ôn tập 9

2023-03-12 07:56:03 UTC

CHVB.pas - Đề ôn tập 9

2023-03-12 09:26:45 UTC

MATRAN.pas - Đề ôn tập 9

2023-03-12 09:56:30 UTC

ĐỀ ÔN TẬP 12 - TIN 9 BĐ 2023

vosibinhdinhthcs — 2023-03-19 09:21:52 UTC

2023-03-25 12:21:24 UTC

//Bai tap Hinh Chu Nhat de thi Tin 9 tinh Binh Dinh nam 2023
program HinhChuNhat;
const fi='D:\pas\De12\HinhChuNhat.Inp';
fo='D:\pas\De12\HinhChuNhat.Out';
var Dt, x, y,cd, cr, R:longint;
max:extended;
f:text;
begin
//Doc du lieu
assign(f,fi); reset(f);
readln(f,r); close(f);
//Tinh dien tich

max:=4*(sqr(r) div 2);
//Ghi ket qua
assign(f,fo); rewrite(f);
write(f,max:0:0); close(f);
end.

2023-03-26 01:02:40 UTC

2023-03-26 01:03:47 UTC

2023-03-26 01:09:43 UTC

program clan;

var
n, i, max_num, num: longint;
count: array[1..100000] of longint;

begin
assign(input, 'CLAN.INP'); // Mở file input
reset(input);
readln(n);
max_num := 0;
for i := 1 to n do
begin
read(num);
count[num] := count[num] + 1; // Đếm số lượng người trong từng bộ tộc
if num > max_num then
max_num := num;
end;
close(input); // Đóng file input

assign(output, 'CLAN.OUT'); // Mở file output
rewrite(output);
writeln(max_num); // Số lượng bộ tộc = số lượng phần tử lớn nhất trong mảng đếm
close(output); // Đóng file output
end.

2023-03-26 01:12:19 UTC

2023-03-26 02:20:00 UTC

2023-03-26 02:46:28 UTC

ĐỀ ÔN TẬP THỨ 13

vosibinhdinhthcs — 2023-03-31 10:05:43 UTC

Bai 3 De on tap 13

2023-03-31 11:17:21 UTC

BL3de13

2023-03-31 11:25:23 UTC

Program BL3;
Const fi='BL3.INP';
fo='BL3.OUT';
Var n,k,d,i,o,j:longint;
s,st:string;
f,g:text;
Begin
Assign(f,fi);Reset(f);
Assign(g,fo);Rewrite(g);
Readln(f,n,k);
Readln(f,s);
i:=1;d:=0;
While i<=k do
Begin
Readln(f,st);
For j:=n downto 2 do
If S[j]=St[length(st)] then
For o:=j-1 downto 1 do
If S[o]=St[1] then Inc(d);
Inc(i);
End;
Write(g,d);
Close(f);Close(g);
End.

BL4de13

nhanngo150929 — 2023-04-01 15:48:20 UTC

Program Bl4;
Uses crt;
Var A:array[1..100] of longint;
n,i,j,s,max,k:longint;
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
For j:=i+1 to n do
Begin
s:=0;
For k:=i to j do
s:=s+A[k];
If s>max then max:=s;
End;
Write(max);
Readln;
End.

2023-04-02 00:54:42 UTC

Function DN(x:longint):longint;
Var s,s1:string;
i,c:longint;
Begin
s1:='';
Str(x,s);
For i:=length(s) downto 1 do
s1:=s1+s[i];
Val(s1,c);
DN:=c;
End;

Bai1longan1415

2023-04-02 02:02:57 UTC

Program bai1;
Uses crt;
Var n,t,d:longint;
Function DN(x:longint):longint;
Var s,s1:string;
i,c:longint;
Begin
s1:='';
Str(x,s);
For i:=length(s) downto 1 do
s1:=s1+s[i];
Val(s1,c);
DN:=c;
End;
Begin
Clrscr;
Write('Nhap n = ');Readln(n);
d:=0;
While n<>DN(n) do
Begin
n:=n+DN(n);
Inc(d);
End;
Write('So doi xung : = ',n);
Writeln;
Write('So lan bien doi : = ',d);
Readln;
End.

Bai2longan1415

2023-04-02 02:03:33 UTC

Program bai2;
Uses crt;
Var s,st,u:string;
d,i,t,min,j:longint;
Begin
Clrscr;
Readln(s);
i:=2;d:=0;t:=1;st:='';
While i<=length(s) do
Begin
If S[i] in ['A'..'Z'] then
Begin
Inc(i);
t:=t*d;
d:=0;
End;
If S[i] in ['1'..'9'] then
Begin
Inc(d);
Inc(i);
End;
End;
Write(t);
i:=2;st:=st+s[1];Val(s[2],min);
While i<=length(s) do
Begin
If S[i] in ['A'..'Z'] then
Begin
Str(min,u);
st:=st+u;
st:=st+s[i];
Val(s[i+1],min);
Inc(i);
End;
If S[i] in ['1'..'9'] then
Begin
Val(s[i],j);
If min>j then min:=j;
Inc(i);
End;
End;
Writeln;
Write(st);
Readln;
End.

Bai3longan1415

2023-04-02 02:03:55 UTC

Program bai3;
Const fi='bai3.inp';
Var a,b,c,n,i,j,k,d:longint;
f:text;
Begin
Assign(f,fi);Reset(f);
Readln(f,a,b,c);
Read(f,n);
If (a*a=b*b+c*c) or (b*b=a*a+c*c) or (c*c=a*a+b*b) then
Write('Cau a : ',a,' ',b,' ',c,' la bo ba Pytago')
Else Write('Cau a : ',a,' ',b,' ',c,' khong la bo ba Pytago');
Writeln;
Write('Cau b : ');d:=0;
For i:=3 to n do
For j:=3 to n do
For k:=3 to n do
If (i*i=j*j+k*k) or (j*j=i*i+k*k) or (k*k=i*i+j*j) then Inc(d);
Write(d div 6);
Close(f);
Readln;
End.

2023-04-02 02:04:18 UTC

Bai1.pas

2023-04-02 02:05:05 UTC

program bai1;
uses crt;
var n,x,i,k,tong:longint;
t:longint = 1;
function daoso(n:longint):longint;
var
m,r:longint;
begin
m:=n;
r:=0;
while m>0 do
begin
r:=r*10+m mod 10;
m:=m div 10;
end;
daoso:=r;
end;
begin
clrscr;
write('nhap so N:'); readln(n);
k:=daoso(n);
repeat
tong:=n+k;
if tong=daoso(tong) then
begin
writeln('so doi xung la = ',tong);
writeln('so lan bien doi = ',t);
end;
n:=tong;
k:=daoso(n);
t:=t+1;
until tong=daoso(tong);
readln;
end.

2023-04-02 02:45:54 UTC

2023-04-02 02:46:23 UTC

hihihahhaha

2023-04-02 02:47:41 UTC

2023-04-02 02:47:59 UTC

2023-04-02 02:48:23 UTC

Bai2quangbinh1415

2023-04-02 03:37:47 UTC

Program bai2;
Uses crt;
Const fi='SOHH.INP';
fo='SOHH.OUT';
Var n,p,q,d,i:longint;
f,g:text;
Function TCU(x:longint):longint;
Var u,t:longint;
Begin
t:=0;
For u:=1 to x do
If x mod u = 0 then t:=t+u;
TCU:=t;
End;
Begin
Assign(f,fi);Reset(f);
Assign(g,fo);Rewrite(g);
Readln(f,p,q);
d:=0;
For i:=p to q do
If TCU(i)=i*2 then inc(d);
Write(g,d);
Writeln(g);
For i:=p to q do
If TCU(i)=i*2 then Write(g,i,' ');
Close(f);Close(g);
Readln;
End.

Bai1quangbinh1415

2023-04-02 03:38:11 UTC

Program bai1quangbinh1415;
Const fi='SAPXEP.INP';
fo='SAPXEP.OUT';
Var n,i,j:longint;
s,tam:string;
A:array[1..100] of string;
f,g:text;
Function DEM(x:string):longint;
Var d,i:longint;
Begin
d:=0;
For i:=1 to length(x) do
If x[i] in ['1'..'9'] then inc(d);
DEM:=d;
End;
Begin
Assign(f,fi);Reset(f);
Assign(g,fo);Rewrite(g);
Readln(f,n);
i:=1;
While i<=n do
Begin
Readln(f,s);
A[i]:=s;
Inc(i);
End;
For i:=1 to n-1 do
For j:=i+1 to n do
If DEM(A[i])>DEM(A[j]) then
Begin
tam:=A[i];
A[i]:=A[j];
A[j]:=tam;
End;
For i:=1 to n do
Writeln(g,A[i]);
Close(f);Close(g);
End.

Bai001_De bai

laidinhdatvnpascal — 2023-04-03 10:26:27 UTC

Bai001_De bai

Bai002_De bai

laidinhdatvnpascal — 2023-04-03 10:52:07 UTC

Bai003_De bai

laidinhdatvnpascal — 2023-04-03 11:07:11 UTC

Khôi Bài 001

2023-04-03 11:24:07 UTC

Bai001.pas

Bài 3 chưa nộp

2023-04-03 11:54:17 UTC

Program Bai003;
Uses crt;
Const fi='Bai003.INP';
fo='Bai003.OUT';
Var n,i,d,max,s:Longint;
f,g:Text;
Function DTSNT(x:Longint):Longint;
Var t,d:longint;
Begin
t:=2;d:=0;
While x>1 do
Begin
If x mod t = 0 then
Begin
Inc(d);
x:= x div t;
End
Else Inc(t);
End;
DTSNT:=d;
End;
Begin
Assign(f,fi);Reset(f);
Assign(g,fo);Rewrite(g);
Readln(f,n);
max:=0;
For i:=1 to n do
If DTSNT(i)>max then
Begin
max:=DTSNT(i);
s:=i;
End;
Write(g,s);
Close(f);Close(g);
End.

Bai002-Khôi

2023-04-03 11:54:51 UTC

Bai002.pas

Nhân Bai003

nhanngo150929 — 2023-04-03 13:31:20 UTC

Khôi Bai003

2023-04-05 13:51:17 UTC

Bai003

De on tap 15

laidinhdatvnpascal — 2023-04-14 07:46:32 UTC

Khôi đề 14

2023-04-14 09:30:02 UTC

Khôi nè de14

NHAN_DE14

2023-04-14 09:31:23 UTC

Nguyên đề 14

2023-04-14 09:31:26 UTC

PREC

2023-04-14 09:45:45 UTC

Program PREC;
Const fi='PREC.INP';
fo='PREC.OUT';
Var A:array[1..100,1..100] of longint;
m,n,i,j,d,k,l:longint;
f,g:text;
Function NT(x:longint):boolean;
Var t:longint;
Begin
If x<2 then exit(false);
For t:=2 to trunc(sqrt(x)) do
If x mod t = 0 then exit(false);
Exit(true);
End;
Begin
Assign(f,fi);Reset(f);
Assign(g,fo);Rewrite(g);
Readln(f,m,n);
For i:=1 to m do
Begin
For j:=1 to n do
Read(f,A[i,j]);
Readln(f);
End;
For i:=1 to m do
For j:=1 to n do
If NT(A[i,j]) then A[i,j]:=1
Else A[i,j]:=0;
d:=0;
For i:=1 to m-1 do
For j:=1 to n-1 do
For k:=i+1 to m do
For l:=j+1 to n do
If A[i,j]+A[k,j]+A[i,l]+A[k,l]>=3 then Inc(d);
Write(g,d);
Close(f);Close(g);
End.

De on tap 16

laidinhdatvnpascal — 2023-04-15 07:07:21 UTC

NHAN_DE17

2023-04-16 09:46:01 UTC

2023-04-17 03:29:29 UTC

De on tap 18

laidinhdatvnpascal — 2023-04-18 06:40:29 UTC

De on tap 19

laidinhdatvnpascal — 2023-04-18 06:54:18 UTC

De on tap 20

laidinhdatvnpascal — 2023-04-18 07:02:28 UTC

De on tap 21

laidinhdatvnpascal — 2023-04-18 07:06:54 UTC

NHAN_DE18

2023-04-18 08:42:18 UTC

bài 2 đề 19

nhatnguyennguyencao09 — 2023-04-18 13:39:33 UTC

uses crt;
var f,g:text;
i,m,n:longint;
s:string;
begin
clrscr;
assign(f,'cau2.inp');
reset(f);
readln(f,n);
close(f);
assign(g,'cau2.out');
rewrite(g);
repeat
inc(i);
str(i,s);
inc(m,length(s));
until m>=n;
writeln(g,s[abs(n-(m-length(s)))],' ',s);
close(g);
readln
end.

xâu đảo

nhatnguyennguyencao09 — 2023-04-19 13:53:43 UTC

Program xaudao
uses crt;
var s:string;
x,y,z,t:byte;
begin
write('Nhap vao mot xau: ');
readln(s);
z:=length(s);
for y:=length(s) downto 1 do
begin
if ((s[y]=' ')or(y=1)) then
begin
for t:=y to z do
write(s[t]);
z:=y
end;
write(' ');
end;
readln;
end.

2023-06-04 02:13:43 UTC

Program Similar;
Const fi='Similar.INP';
fo='Similar.OUT';
Var l,r,i,a,max,h:longint;
f,g:text;
Function TCS(x:longint):longint;
Var t,du:longint;
Begin
t:=0;
While x<>0 do
Begin
du:=x mod 10;
x:=x div 10;
t:=t+du;
End;
TCS:=t;
End;
Begin
Assign(f,fi);Reset(f);
Assign(g,fo);Rewrite(g);
Read(f,l,r);
a:=l;max:=0;
i:=r;
While i>=a do
Begin
If TCS(i)=TCS(a) then
Begin
h:=i-a;
If h>max then max:=h;
Inc(a);
i:=r;
End
Else i:=i-1;
End;
Write(g,max);
Close(f);Close(g);
End.

PHÂN RÃ NGUYÊN TỐ

laidinhdatvnpascal — 2023-06-10 00:13:04 UTC

BA ƯỚC

laidinhdatvnpascal — 2023-06-10 00:52:37 UTC

CODE PHÂN RÃ NGUYÊN TỐ

laidinhdatvnpascal — 2023-06-10 01:32:15 UTC

Phân Rã Nguyên Tố

2023-06-10 02:23:28 UTC

Program PRNGTO;
Const fi='PRNGTO.INP';
fo='PRNGTO.OUT';
Var n,i1,i2,i3,t:Int64;
f,g:Text;
Function NT(x:Int64):boolean;
Var t:Int64;
Begin
If x<2 then exit(false);
t:=2;
While t<=trunc(sqrt(x)) do
Begin
If x mod t = 0 then exit(false)
Else Inc(t);
End;
Exit(true);
End;
Begin
Assign(f,fi);Reset(f);
Assign(g,fo);Rewrite(g);
Read(f,n);
If NT(n) then Write(g,n);
t:=n-2;
i1:=0;i2:=0;i3:=0;
While Not(NT(t)) do t:=t-1;
i1:=t;
t:=n-i1;
If NT(t-1) and not(nt(t)) then t:=t-2;
While Not(NT(t)) do t:=t-1;
i2:=t;
t:=n-i1-i2;
If t>0 then i3:=t;
If i3=0 then Write(g,i1,' ',i2)
Else Write(g,i1,' ',i2,' ',i3);
Close(f);Close(g);
End.

Bài BA ƯỚC của Nhân

2023-06-18 00:26:15 UTC

BA ƯỚC .PAS

laidinhdatvnpascal — 2023-06-18 00:35:42 UTC

DUONGDI

2023-06-18 02:49:27 UTC

Program DUONGDI;
Const fi='DUONGDI.INP';
fo='DUONGDI.OUT';
Var A,B:array[1..10,1..10] of longint;
A:array[1..100] of longint;
m,n,i,j,min,i1 :longint;
f,g:text;
Begin
Assign(f,fi);Reset(f);
Assign(g,fo);Rewrite(g);
Read(f,m,n);
For i:=1 to m do
Begin
For j:=1 to n do
Read(f,A[i,j]);
Readln(f);
End;
For i:=1 to m do
B[i,1]:=A[i,1];
For j:=2 to n do
For i:=1 to m do
Begin
If i=1 then B[i,j]:=A[i,j]+B[i+1,j-1]
Else
If i=m then B[i,j]:=A[i,j]+B[i-1,j-1]
Else
If A[i+1,j-1]>A[i-1,j-1] then B[i,j]:=A[i,j]+B[i-1,j-1]
Else B[i,j]:=A[i,j]+B[i+1,j-1];
End;
min:=B[1,n];
For i:=2 to m do
If B[i,n] Write(g,min);
Writeln(g);
For i:=1 to m do
If B[i,n]=min then
Begin
A[1]:=i;
A[2]:=n;
Break;
End;
i1:=3;
While i1<=n+n do
Begin
For j:=n-1 downto 1 do
For i:=m downto 1 do

Close(f);Close(g);
End.
1

HCN

2023-08-29 09:42:10 UTC

Program HCN;
Const fi='HCN.INP';
fo='HCN.OUT';
Var A:array[1..100,1..100] of longint;
n,m,p,q,i,j,s,smax,k,t,u,o,e,h,s2:longint;
f,g:text;
Begin
Assign(f,fi);Reset(f);
Assign(g,fo);Rewrite(g);
Readln(f,n,m,p,q);
For i:=1 to n do
Begin
For j:=1 to m do
Read(f,A[i,j]);
Readln(f);
End;
s:=0;smax:=0;
For i:=1 to n-p+1 do
For h:=1 to m-q+1 do
Begin
s:=0;
For k:=i to i+p-1 do
For t:=h to h+q-1 do
s:=s+A[k,t];
For e:=1 to n-p+1 do
For j:=1 to m-q+1 do
Begin
s2:=0;
For u:=e to e+p-1 do
For o:=j to j+q-1 do
s2:=s2+A[u,o];
If s+s2>smax then smax:=s+s2;
End;

End;
Write(g,smax);
Close(f);Close(g);
End.

2023-08-29 09:43:19 UTC

program haihinhnhat;

var a,b:array[1..100,1..100] of longint;
n,m,q,p,i,j,tong1,tong2,k,l,max,x,y,z,w,toadoi, toadoj,toadox, toadoy,ii,jj:longint;
f,g:text;
begin
assign(f,'hcn.inp'); reset(f);
assign(g,'hcn.out'); rewrite(g);
readln(f,n,m,p,q);
//Nhap mang
for i:=1 to n do
begin
for j:=1 to m do
read(f,a[i,j]);
readln(f);
end;
max:=0;

//Xet hinh so 1
for i:=1 to n-p+1 do
for j:=1 to m-q+1 do
begin
//Tao bang phu,o dang xet =1, con cac o khac thi =0
for ii:=1 to n do
for jj:=1 to m do
b[ii,jj]:=0;
b[i,j]:=1;

tong1:=0;
//tinh tong cac o tren hinh so 1
for k:=i to i+p-1 do
for l:=j to j+q-1 do
tong1:=tong1+A[k,l];

//tinh tong cac o cua cac hinh chu nhat con lai
for x:=1 to n-p+1 do
for y:=1 to m-q+1 do
begin
tong2:=0;
if b[x,y]<>1 then
for z:=x to x+p-1 do
for w:=y to y+q-1 do
tong2:=tong2+a[z,w];

if tong1+tong2>max then
begin
max:=tong1+tong2;
toadoi:=i;
toadoj:=j;
toadox:=x;
toadoy:=y;
end;
end;

end;
writeln(g,max);
writeln(g,toadoi,toadoj,' ',toadox,toadoy);
close(f);
close(g);
end.

Đề 2

2023-09-14 06:37:45 UTC

Bai1de2

2023-09-14 09:38:04 UTC

Program pytago;
Uses crt;
Var x,a,b,c,m,n:Int64;
Begin
Clrscr;
Write('Nhap x : ');Readln(x);
c:=0;
a:=3;
m:=x div 2 +1;
While a Begin
b:=a+1;
n:=(x-a) div 2+1;
While b If sqr(a)+sqr(b)=sqr(x-a-b) then
Begin
Inc(c);
b:=n;
End
Else Inc(b);
If c=1 then a:=m
Else Inc(a);
End;
Write(c);
Readln;
End.

Bai2de2

2023-09-14 09:38:43 UTC

Program PROMATE;
Uses crt;
Var A,B:array[1..100] of Real;
n,i,vt,j:longint;
u,v,mina,minb,s,tam:Real;
Begin
Clrscr;
Readln(n,u,v);
For i:=1 to n do
Readln(A[i],B[i]);
mina:=A[1];
For i:=2 to n do
If A[i] Begin
vt:=i;
mina:=A[i];
End;
B[vt]:=0;
For i:=1 to n-1 do
For j:=i+1 to n do
If B[i]>B[j] then
Begin
tam:=B[i];
B[i]:=B[j];
B[j]:=tam;
End;
minb:=B[2];
s:=u/mina+v/minb;
Write('S = ',s:0:2);
Readln;
End.

Bai3de2

2023-09-14 09:39:10 UTC

Program WIGGLE;
Uses crt;
Var n,i,d,so1,so2,u,j:longint;
S,s1,s2:ansistring;
Begin
Clrscr;
Write('N = ');Readln(s);
s1:='';s2:='';
s1:=s1+s[1];
s2:=s2+s[2];
Val(s1,so1);
Val(s2,so2);
d:=2;
If so1>so2 then
Begin
For i:=3 to length(s) do
Begin
s1:='';s2:='';
s1:=s1+s[i-1];
s2:=s2+s[i];
Val(s1,j);
Val(s2,u);
If i mod 2 <> 0 then
If u>j then Inc(d)
Else break;
If i mod 2 = 0 then
If u Else break;
End;
End
Else
If so1 Begin
For i:=3 to length(s) do
Begin
s1:='';s2:='';
s1:=s1+s[i-1];
s2:=s2+s[i];
Val(s1,j);
Val(s2,u);
If i mod 2 <> 0 then
If u Else Break;
If i mod 2 = 0 then
If u>j then Inc(d)
Else break;
End;
End
Else
If so1=so2 then d:=1;
Write(d);
Readln;
End.

Bai4de2

2023-09-14 09:40:00 UTC

Program dv;
Uses crt;
Var A:array[1..1000] of longint;
n,i,j,s,tong:longint;
Begin
Clrscr;
Readln(n);
s:=0;
For i:=1 to n do
Begin
Readln(A[i]);
s:=s+A[i];
End;
For j:=n downto 1 do
Begin
tong:=0;
For i:=1 to n do
Begin
tong:=tong+A[i];
If tong= s div j then tong:=0;
End;
If tong=0 then break;
End;
Write('->',j);
Readln;
End.

2023-09-21 01:27:50 UTC

2023-09-21 01:28:18 UTC

2023-09-21 01:28:30 UTC

2023-09-21 01:29:11 UTC

2023-09-21 01:29:55 UTC

ĐỀ ÔN TẬP SỐ 1 - TIN 9 NĂM 2023

2023-09-25 03:34:57 UTC

2023-10-05 07:49:42 UTC

DDUONG.PAS

laidinhdatvnpascal — 2023-10-12 07:53:34 UTC

LANGHOA.PAS

laidinhdatvnpascal — 2023-10-12 07:54:07 UTC

VANNGHE.PAS

laidinhdatvnpascal — 2023-10-12 07:54:22 UTC

NHAN_DE HSG TIN CAP TRUONG_GIẢI NĂM LỚP 8

laidinhdatvnpascal — 2023-10-12 07:55:17 UTC

ĐỀ ÔN TẬP LỚP 8

laidinhdatvnpascal — 2023-10-12 08:01:42 UTC

ôn tập

2023-10-12 09:45:37 UTC

Program DAYTANG;
Const fi='DAYTANG.INP';
fo='DAYTANG.OUT';
Var A,B:array[1..10000] of longint;
i,j,n,k,max,vtmax,l,min:longint;
s,s1:ansistring;
f,g:text;
Begin
Assign(f,fi);Reset(f);
Assign(g,fo);Rewrite(g);
Readln(f,n);
For i:=1 to n do
Read(f,A[i]);
B[1]:=1;
If A[2] Else B[2]:=1;
For i:=3 to n do
Begin
max:=A[1];vtmax:=1;
For j:=2 to i-1 do
If A[j]>max then
Begin
max:=A[j];
vtmax:=j;
End;
If A[i]>max then B[i]:=1
Else
Begin
l:=B[1];
For j:=2 to i-1 do
If (A[j]<=max) and (A[j]>=A[i]) and (l<=B[j]) then l:=B[j];
B[i]:=l+1;
End;
End;
max:=B[1];vtmax:=1;
For i:=1 to n do
If B[i]>=max then
Begin
max:=B[i];
vtmax:=i;
End;
i:=max;
s:='';
While i>=1 do
Begin
s1:='';
For j:=1 to vtmax do
If B[j]=max then vtmax:=j;
min:=A[vtmax];
For j:=vtmax-1 downto 1 do
If B[j]=max then
If A[j]>=min then min:=A[j];
Str(min,s1);
s:=s+s1;
max:=max-1;
i:=i-1;
End;
For i:=length(s) downto 1 do
Write(g,s[i]);

Close(f);Close(g);
End.

HSG TIN 9 ĐẮK LẮK 2016-2017 - CÓ TEST VÀ ĐÁP ÁN

2023-10-16 00:49:13 UTC

ĐÁP ÁN ĐỀ THI HSG TIN 9 NĂM 22 - PHÙ MỸ

2023-10-16 01:05:19 UTC

ĐÁP ÁN HSG TIN 9 LAI VUNG 20142015

2023-10-16 03:26:50 UTC

ĐÁP ÁN HSG TIN 9 LAI VUNG 20142015 Số 2

2023-10-16 07:57:21 UTC

2023-10-16 22:46:36 UTC

Đề thi học sinh giỏi lớp 9 môn tin học thành phố Hà Nội 2022 - 2023

2023-10-17 06:41:23 UTC

ĐỀ TIN 12 QUỐC GIA - 2023

2023-10-17 07:05:10 UTC

ĐỀ HSG TIN 9 VŨNG TÀU 2022

2023-10-17 07:42:33 UTC

CODE ĐẢO LỚN NHẤT, CHIA QUÀ, PHẢN NGUYÊN TỐ,....

2023-10-17 22:51:24 UTC

GIÁO TRÌNH KTLT C++

2023-11-07 09:28:08 UTC

GIÁO TRÌNH PYTHON CƠ BẢN

laidinhdatvnpascal — 2023-11-12 01:05:03 UTC

BÀI TẬP PYTHON CƠ BẢN

laidinhdatvnpascal — 2023-11-12 01:05:41 UTC

Giáo trình python-Đang soạn

2023-11-18 09:06:46 UTC

Chương 1, 2 - lập trình Python

2023-11-19 01:10:17 UTC

acco

2024-01-08 03:23:23 UTC

program acco;
const fi='acco.inp';
      fo='acco.out';
var n,i,j:longint;
    b:array[1..10000] of longint;
    a:array[1..10000] of string;
    f,g:text;
begin
    assign(f,fi);reset(f);
    assign(g,fo);rewrite(g);
    readln(f,n);
    for i:=1 to n do 
         readln(f,a[i]);
    b[1]:=1;
    for i:=2 to n do 
        begin
           for j:=i downto 1 do
               if a[i]=a[j] then 
                 begin
                    b[i]:=b[j]+1;
                    break;
                 end;
        end;
    for i:=1 to n do 
          writeln(g,a[i],'',b[i]);
    close(f);close(g);
end.

crack camtasia

2024-02-19 03:19:10 UTC