From 297a5129f50934a4b66c79c764ab3cefe149804d Mon Sep 17 00:00:00 2001 From: Reoyl Date: Wed, 20 Apr 2022 22:05:57 +0900 Subject: [PATCH 1/6] =?UTF-8?q?17910=20JointAttack=20=EC=A0=95=EC=9E=AC?= =?UTF-8?q?=ED=99=8D=20-=20=EC=96=B4=EB=94=94=EA=B0=80=20=ED=8B=80?= =?UTF-8?q?=EB=A6=B0=20=EA=B1=B8=EA=B9=8C=EC=9A=94=E3=85=9C=E3=85=9C?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- week1/17910jointAttack/solution.py | 10 ++++++++++ 1 file changed, 10 insertions(+) diff --git a/week1/17910jointAttack/solution.py b/week1/17910jointAttack/solution.py index e69de29..5b0a18e 100644 --- a/week1/17910jointAttack/solution.py +++ b/week1/17910jointAttack/solution.py @@ -0,0 +1,10 @@ +def jointAttack(array): + if (len(array)<=1): + return array.pop() + + return array.pop(0) + 1 / (jointAttack(array)) + +N = int(input()) +array = [int(_) for _ in input().split()] + +print(jointAttack(array)) \ No newline at end of file From 0ef2b38959840e38911e3a437de817655d35f386 Mon Sep 17 00:00:00 2001 From: Reoyl Date: Thu, 21 Apr 2022 09:30:49 +0900 Subject: [PATCH 2/6] 1934 Least Common Multiplier Solved by using Greatest Common Divisor --- .../solution.py" | 12 ++++++++++++ 1 file changed, 12 insertions(+) diff --git "a/week1/1934\354\265\234\354\206\214\352\263\265\353\260\260\354\210\230/solution.py" "b/week1/1934\354\265\234\354\206\214\352\263\265\353\260\260\354\210\230/solution.py" index e69de29..c636517 100644 --- "a/week1/1934\354\265\234\354\206\214\352\263\265\353\260\260\354\210\230/solution.py" +++ "b/week1/1934\354\265\234\354\206\214\352\263\265\353\260\260\354\210\230/solution.py" @@ -0,0 +1,12 @@ +def gcd(arr): + while arr[1]>0: + arr[0], arr[1] = arr[1], arr[0]%arr[1] + return arr[0] + +def lcm(arr): + return arr[0]*arr[1] // gcd(arr) + +test_case = [list(map(int, input().split())) for _ in range(int(input()))] + +for case in test_case: + print(lcm(case)) \ No newline at end of file From 9745b208a3583414466168011ae4cd2e07874ce3 Mon Sep 17 00:00:00 2001 From: Reoyl Date: Thu, 21 Apr 2022 09:34:56 +0900 Subject: [PATCH 3/6] nothing on master --- week1/17910jointAttack/solution.py | 10 ---------- .../solution.py" | 12 ------------ 2 files changed, 22 deletions(-) diff --git a/week1/17910jointAttack/solution.py b/week1/17910jointAttack/solution.py index 5b0a18e..e69de29 100644 --- a/week1/17910jointAttack/solution.py +++ b/week1/17910jointAttack/solution.py @@ -1,10 +0,0 @@ -def jointAttack(array): - if (len(array)<=1): - return array.pop() - - return array.pop(0) + 1 / (jointAttack(array)) - -N = int(input()) -array = [int(_) for _ in input().split()] - -print(jointAttack(array)) \ No newline at end of file diff --git "a/week1/1934\354\265\234\354\206\214\352\263\265\353\260\260\354\210\230/solution.py" "b/week1/1934\354\265\234\354\206\214\352\263\265\353\260\260\354\210\230/solution.py" index c636517..e69de29 100644 --- "a/week1/1934\354\265\234\354\206\214\352\263\265\353\260\260\354\210\230/solution.py" +++ "b/week1/1934\354\265\234\354\206\214\352\263\265\353\260\260\354\210\230/solution.py" @@ -1,12 +0,0 @@ -def gcd(arr): - while arr[1]>0: - arr[0], arr[1] = arr[1], arr[0]%arr[1] - return arr[0] - -def lcm(arr): - return arr[0]*arr[1] // gcd(arr) - -test_case = [list(map(int, input().split())) for _ in range(int(input()))] - -for case in test_case: - print(lcm(case)) \ No newline at end of file From 55cb4aac61d1696c4328b0e15ff5c7e7707b6a8c Mon Sep 17 00:00:00 2001 From: CHOCO Date: Sun, 8 May 2022 21:19:58 +0900 Subject: [PATCH 4/6] =?UTF-8?q?=EC=98=AC=EB=A6=BC=ED=94=BD=20Solved?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../solution.py" | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) diff --git "a/week2/8979\354\230\254\353\246\274\355\224\275/solution.py" "b/week2/8979\354\230\254\353\246\274\355\224\275/solution.py" index e69de29..61d001c 100644 --- "a/week2/8979\354\230\254\353\246\274\355\224\275/solution.py" +++ "b/week2/8979\354\230\254\353\246\274\355\224\275/solution.py" @@ -0,0 +1,17 @@ +def main(): + N, k = map(int, input().split()) + lines = [list(map(int, input.split())) for _ in range(N)] + rank = 1 + k_line = [line for line in lines if line[0]==k].pop() + gold_list = [line for line in lines if line[1]>k_line[1]] + silver_list = [line for line in lines if line[1]==k_line[1] and line[2]>k_line[2]] + bronze_list = [line for line in lines if line[1]==k_line[1] and line[2]==k_line[2] and line[3]>k_line[3]] + + rank += len(gold_list) + rank += len(silver_list) + rank += len(bronze_list) + + print(rank) + +if __name__=='__main__': + main() \ No newline at end of file From f6cd0086b1286bc9f223565af8621a60cd993f09 Mon Sep 17 00:00:00 2001 From: CHOCO Date: Sun, 8 May 2022 21:24:33 +0900 Subject: [PATCH 5/6] master --- .../solution.py" | 17 ----------------- 1 file changed, 17 deletions(-) diff --git "a/week2/8979\354\230\254\353\246\274\355\224\275/solution.py" "b/week2/8979\354\230\254\353\246\274\355\224\275/solution.py" index 61d001c..e69de29 100644 --- "a/week2/8979\354\230\254\353\246\274\355\224\275/solution.py" +++ "b/week2/8979\354\230\254\353\246\274\355\224\275/solution.py" @@ -1,17 +0,0 @@ -def main(): - N, k = map(int, input().split()) - lines = [list(map(int, input.split())) for _ in range(N)] - rank = 1 - k_line = [line for line in lines if line[0]==k].pop() - gold_list = [line for line in lines if line[1]>k_line[1]] - silver_list = [line for line in lines if line[1]==k_line[1] and line[2]>k_line[2]] - bronze_list = [line for line in lines if line[1]==k_line[1] and line[2]==k_line[2] and line[3]>k_line[3]] - - rank += len(gold_list) - rank += len(silver_list) - rank += len(bronze_list) - - print(rank) - -if __name__=='__main__': - main() \ No newline at end of file From 3037057578059459e7b7813ea484be75589f0ada Mon Sep 17 00:00:00 2001 From: CHOCO Date: Thu, 19 May 2022 07:36:23 +0900 Subject: [PATCH 6/6] ATM Solved --- week2/11399ATM/solution.py | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) diff --git a/week2/11399ATM/solution.py b/week2/11399ATM/solution.py index e69de29..471d1ac 100644 --- a/week2/11399ATM/solution.py +++ b/week2/11399ATM/solution.py @@ -0,0 +1,19 @@ +def main(): + N = int(input()) + times = list(map(int, input().split())) + times.sort() + + waitings = [0] * len(times) + + for i, time in enumerate(times): + if i==0: + waitings[i] += time + continue + waitings[i] += (waitings[i-1] + time) + + print(sum(waitings)) + + + +if __name__=='__main__': + main() \ No newline at end of file