BỒI DƯỠNG TIN HỌC TRẺ NĂM HỌC 2022 - 2023 by Thúy Nguyễn Thị

nguyenthithuys28 — 2022-07-27 14:44:12 UTC

2022-07-28 01:39:04 UTC

2022-07-28 02:50:57 UTC

2022-08-01 02:06:16 UTC

nguyenthithuys28 — 2022-08-02 00:19:35 UTC

2022-08-04 01:27:39 UTC

2022-08-04 15:15:19 UTC

nguyenthithuys28 — 2022-08-05 01:56:35 UTC

nguyenthithuys28 — 2022-08-05 02:44:02 UTC

2022-08-13 01:36:45 UTC

2022-08-13 02:31:45 UTC

2022-08-13 02:52:08 UTC

nguyenthithuys28 — 2022-08-16 01:44:44 UTC

2022-08-16 02:56:06 UTC

2022-08-16 02:56:23 UTC

2022-08-16 02:56:36 UTC

2022-08-16 02:56:51 UTC

2022-08-19 02:13:43 UTC

nguyenthithuys28 — 2022-08-19 02:18:54 UTC

nguyenthithuys28 — 2022-08-30 00:59:41 UTC

nguyenthithuys28 — 2022-08-30 01:44:01 UTC

2022-08-30 02:31:23 UTC

2022-08-31 02:39:24 UTC

Bài tập pascal ngày 8/9

nguyenthithuys28 — 2022-09-08 03:06:36 UTC

2022-10-14 09:23:16 UTC

nguyenthithuys28 — 2022-11-27 00:50:12 UTC

ĐỀ Ngày 27/11

nguyenthithuys28 — 2022-11-27 01:41:38 UTC

Phần tử XH nhiều nhất

2022-11-27 02:16:57 UTC

nguyenthithuys28 — 2022-11-27 02:26:21 UTC

Bài 3. Ptu x.hien nhiều nhất

nguyenthithuys28 — 2022-11-27 03:14:23 UTC

nguyenthithuys28 — 2022-11-27 06:57:58 UTC

2022-11-28 14:17:55 UTC

nguyenthithuys28 — 2022-11-30 01:20:23 UTC

nguyenthithuys28 — 2023-01-16 00:48:45 UTC

nguyenthithuys28 — 2023-02-25 07:12:00 UTC

nguyenthithuys28 — 2023-03-11 07:47:26 UTC

nguyenthithuys28 — 2023-03-11 07:48:16 UTC

nguyenthithuys28 — 2023-03-11 07:48:49 UTC

nhanhtri

2023-03-11 09:26:15 UTC

var x,y:string;
f,g:text;
a,b:int64;
begin
assign(f,'nhanhtri.inp');
reset(f);
assign(g,'nhanhtri.out');
rewrite(g);
readln(f,a,b);
str(a,x); str(b,y);
while x[length(x)]='0' do delete(x,length(x),1);
while y[length(y)]='0' do delete(y,length(y),1);
if length(x)>length(y) then writeln(g,a);
if length(x)if length(x)=length(y) then begin
while x[length(x)]=y[length(y)] do begin
delete(x,length(x),1); delete(y,length(y),1); end;
if x[length(x)]>y[length(y)] then writeln(g,a) else writeln(g,b); end;
close(f); close(g);
end.

khieuvu

2023-03-11 09:26:55 UTC

var f,g:text;
k:int64;
n,i,d,j:longint;
a:array [1..1000000] of int64;
begin
assign(f,'khieuvu.inp');
reset(f);
assign(g,'khieuvu.out');
rewrite(g);
readln(f,n,k);
for i:=1 to n do read(f,a[i]);
d:=0;
for i:=1 to n-1 do
for j:=i+1 to n do
if abs(a[i]-a[j])=k then d:=d+1;
write(g,d);
close(f); close(g);
end.

nguyenthithuys28 — 2023-03-27 06:56:24 UTC

nguyenthithuys28 — 2023-03-27 06:56:41 UTC

nguyenthithuys28 — 2023-03-27 06:56:56 UTC

nguyenthithuys28 — 2023-03-27 06:57:37 UTC