From 2bab203d543ea99ecf23858e5a8380890a28135e Mon Sep 17 00:00:00 2001 From: Luthics Date: Sun, 6 Nov 2022 14:49:04 +0800 Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=E7=AC=AC=E5=9B=9B=E6=AC=A1?= =?UTF-8?q?=E5=AE=9E=E9=AA=8C?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- test/4/1.py | 11 +++++++++++ test/4/2.py | 31 +++++++++++++++++++++++++++++++ test/4/3.py | 24 ++++++++++++++++++++++++ test/4/4.py | 37 +++++++++++++++++++++++++++++++++++++ test/4/5.py | 13 +++++++++++++ 5 files changed, 116 insertions(+) create mode 100644 test/4/1.py create mode 100644 test/4/2.py create mode 100644 test/4/3.py create mode 100644 test/4/4.py create mode 100644 test/4/5.py diff --git a/test/4/1.py b/test/4/1.py new file mode 100644 index 0000000..5faa55d --- /dev/null +++ b/test/4/1.py @@ -0,0 +1,11 @@ +def input_list(): + return list(map(int, input().split())) + + +def output_list(alist): + for i in alist: + print(i, end=" ") + + +a = input_list() +output_list(a) \ No newline at end of file diff --git a/test/4/2.py b/test/4/2.py new file mode 100644 index 0000000..2dee167 --- /dev/null +++ b/test/4/2.py @@ -0,0 +1,31 @@ +def input_list(): + return list(map(float, input().split())) + + +def fmin(alist): + minn = alist[0] + for i in alist: + if (minn > i): + minn = i + return minn + + +def fmax(alist): + minn = alist[0] + for i in alist: + if (minn < i): + minn = i + return minn + + +def favg(alist): + s = 0 + for i in alist: + s = s + i + return s / len(alist) + + +a = input_list() +print("{:.1f}".format(favg(a))) +print("{:.1f}".format(fmax(a))) +print("{:.1f}".format(fmin(a))) \ No newline at end of file diff --git a/test/4/3.py b/test/4/3.py new file mode 100644 index 0000000..83070f3 --- /dev/null +++ b/test/4/3.py @@ -0,0 +1,24 @@ +def input_list(): + return list(map(int, input().split())) + + +def output_list(alist): + for i in range(len(alist)): + print(alist[i], end=" ") + + +def xzsort(alist): + blist = [] + for j in range(len(alist)): + minn = 0 + for i in range(len(alist)): + if (alist[minn] > alist[i]): + minn = i + blist.append(alist[minn]) + alist[minn] = 114514 + return blist + + +a = input_list() +b = xzsort(a) +output_list(b) \ No newline at end of file diff --git a/test/4/4.py b/test/4/4.py new file mode 100644 index 0000000..9df162d --- /dev/null +++ b/test/4/4.py @@ -0,0 +1,37 @@ +from math import * + + +def input_list(): + return list(map(int, input().split())) + + +def xzsort(alist): + blist = [] + for j in range(len(alist)): + minn = 0 + for i in range(len(alist)): + if (alist[minn] > alist[i]): + minn = i + blist.append(alist[minn]) + alist[minn] = 114514 + return blist + + +def binarySearch(arr, l, r, x): + if (r - l == 1): + if (arr[l] == x): + return l + elif (arr[r] == x): + return r + else: + return -1 + mid = floor((l + r) / 2) + if (arr[mid] >= x): + return binarySearch(arr, l, mid, x) + else: + return binarySearch(arr, mid, r, x) + + +a = input_list() +x = int(input()) +print(binarySearch(xzsort(a), 0, len(a) - 1, x)) diff --git a/test/4/5.py b/test/4/5.py new file mode 100644 index 0000000..1a67c4c --- /dev/null +++ b/test/4/5.py @@ -0,0 +1,13 @@ +def input_list(): + return list(map(int, input().split())) + + +def gcd(s1, s2): + if (s1 % s2 == 0): + return s2 + else: + return gcd(s2, s1 % s2) + + +a = input_list() +print(gcd(a[0], a[1]))