From 2f674dc80f0382f1c3178f435714960734dc9d3c Mon Sep 17 00:00:00 2001 From: Nguyễn Gia Phong Date: Sat, 6 Jun 2020 21:33:13 +0700 Subject: Reorganize stuff from secondary school --- 12/TP-HN-2008/R1/BL1.PAS | 26 -------------------- 12/TP-HN-2008/R1/BL2.PAS | 57 ------------------------------------------- 12/TP-HN-2008/R1/BL3.PAS | 45 ---------------------------------- 12/TP-HN-2008/R1/BL4.pas | 62 ----------------------------------------------- 12/TP-HN-2008/R1/CLB.IN | 4 --- 12/TP-HN-2008/R1/CLB.OU | 0 12/TP-HN-2008/R1/R1.DOC | Bin 79872 -> 0 bytes 7 files changed, 194 deletions(-) delete mode 100644 12/TP-HN-2008/R1/BL1.PAS delete mode 100644 12/TP-HN-2008/R1/BL2.PAS delete mode 100644 12/TP-HN-2008/R1/BL3.PAS delete mode 100644 12/TP-HN-2008/R1/BL4.pas delete mode 100644 12/TP-HN-2008/R1/CLB.IN delete mode 100644 12/TP-HN-2008/R1/CLB.OU delete mode 100644 12/TP-HN-2008/R1/R1.DOC (limited to '12/TP-HN-2008/R1') diff --git a/12/TP-HN-2008/R1/BL1.PAS b/12/TP-HN-2008/R1/BL1.PAS deleted file mode 100644 index 6931b1b..0000000 --- a/12/TP-HN-2008/R1/BL1.PAS +++ /dev/null @@ -1,26 +0,0 @@ -uses math; - -var - f : text; - m, n, i : byte; - a, b : double; -j -begin - assign(f, 'LT.IN'); - reset(f); - read(f, n, m); - close(f); - a := 1; - for i := 1 to n do - a := a * 2; - b := 1; - for i := 1 to m do - b := b * 3; - a := a + b; - for i := 1 to trunc(log10(a)) do - a := a / 10; - assign(f, 'LT.OU'); - rewrite(f); - writeln(f, trunc(a)); - close(f) -end. diff --git a/12/TP-HN-2008/R1/BL2.PAS b/12/TP-HN-2008/R1/BL2.PAS deleted file mode 100644 index e228240..0000000 --- a/12/TP-HN-2008/R1/BL2.PAS +++ /dev/null @@ -1,57 +0,0 @@ -type - rect = record - a : longint; - b : longint - end; - arec = array of rect; - -var - f : text; - c, d, e : rect; - -function join(g, h : rect) : arec; - var n : byte = 0; - procedure j01n(p, q : longint); - begin - inc(n); - setlength(join, n); - join[n - 1].a := p; - join[n - 1].b := q - end; - begin - if g.a = h.a then j01n(g.a, g.b + h.b); - if g.a = h.b then j01n(g.a, g.b + h.a); - if g.b = h.a then j01n(g.b, g.a + h.b); - if g.b = h.b then j01n(g.b, g.a + h.a); - end; - -procedure out(m : longint); - begin - assign(f, 'GH.OU'); - rewrite(f); - writeln(f, m); - close(f); - halt - end; - -procedure libl2(x, y, z : rect); - var i, j : rect; - begin - for i in join(x, y) do - for j in join(z, i) do - if (j.a = j.b) and (j.a <> 0) then - out(j.a) - end; - -begin - assign(f, 'GH.IN'); - reset(f); - readln(f, c.a, c.b); - readln(f, d.a, d.b); - readln(f, e.a, e.b); - close(f); - libl2(c, d, e); - libl2(d, e, c); - libl2(e, c, d); - out(0) -end. diff --git a/12/TP-HN-2008/R1/BL3.PAS b/12/TP-HN-2008/R1/BL3.PAS deleted file mode 100644 index a49b4d6..0000000 --- a/12/TP-HN-2008/R1/BL3.PAS +++ /dev/null @@ -1,45 +0,0 @@ -type ar = array[0..3] of longint; - -var - f : text; - m, n, i, j : shortint; - a : array[1..101, -1..102] of longint; - tmp, max : longint; - -function next(x, y : shortint) : ar; - begin - next[0] := a[x + 1, y - 2]; - next[1] := a[x + 1, y + 2]; - next[2] := a[x + 2, y - 1]; - next[3] := a[x + 2, y + 1] - end; - -begin - for i := 1 to 101 do - for j := -1 to 102 do - a[i, j] := 0; - assign(f, 'QM.IN'); - reset(f); - readln(f, m, n); - for i := 1 to m do - for j := 1 to n do - read(f, a[i, j]); - close(f); - for i := m - 1 downto 1 do - for j := 1 to n do - begin - max := 0; - for tmp in next(i, j) do - if tmp > max then - max := tmp; - a[i, j] := a[i, j] + max; - end; - assign(f, 'QM.OU'); - rewrite(f); - max := 0; - for i := 1 to n do - if a[1, i] > max then - max := a[1, i]; - writeln(f, max); - close(f); -end. diff --git a/12/TP-HN-2008/R1/BL4.pas b/12/TP-HN-2008/R1/BL4.pas deleted file mode 100644 index c552b0d..0000000 --- a/12/TP-HN-2008/R1/BL4.pas +++ /dev/null @@ -1,62 +0,0 @@ -var - f: text; - n, i: int16; - a, b: array of int32; - - -procedure swp(var x, y: int32); - var - tmp: int32; - - begin - tmp := x; - x := y; - y := tmp - end; - - -procedure qsort(l, h: int16); - var - i, j: int16; - tmp: int32; - - begin - i := l; - j := h; - tmp := a[(l + h) div 2]; - - repeat - while a[i] < tmp do - inc(i); - while a[j] > tmp do - dec(j); - - if i <= j then - begin - swp(a[i], a[j]); - swp(b[i], b[j]); - inc(i); - dec(j) - end; - until i > j; - - if l < j then - qsort(l, j); - if i < h then - qsort(i, h) - end; - - -begin - assign(f, 'CLB.IN'); - reset(f); - readln(f, n); - setlength(a, n); - setlength(b, n); - for i := 0 to n - 1 do - readln(f, a[i], b[i]); - close(f); - qsort(0, n - 1); - for i := 0 to n - 1 do - writeln(a[i], ' ', b[i]) -end. diff --git a/12/TP-HN-2008/R1/CLB.IN b/12/TP-HN-2008/R1/CLB.IN deleted file mode 100644 index 662c775..0000000 --- a/12/TP-HN-2008/R1/CLB.IN +++ /dev/null @@ -1,4 +0,0 @@ -3 -7 9 -3 8 -10 20 diff --git a/12/TP-HN-2008/R1/CLB.OU b/12/TP-HN-2008/R1/CLB.OU deleted file mode 100644 index e69de29..0000000 diff --git a/12/TP-HN-2008/R1/R1.DOC b/12/TP-HN-2008/R1/R1.DOC deleted file mode 100644 index 5e29da2..0000000 Binary files a/12/TP-HN-2008/R1/R1.DOC and /dev/null differ -- cgit 1.4.1