From d1aad3faeb64296ea1c45a064d22ffd45267b187 Mon Sep 17 00:00:00 2001 From: valentinmnaydenov <85516432+valentinmnaydenov@users.noreply.github.com> Date: Mon, 18 Oct 2021 00:31:20 +0300 Subject: [PATCH 1/2] Create 01_checkCircle.py --- .../06_Valentin_Naidenov/01_checkCircle.py | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 homeworks/06_Valentin_Naidenov/01_checkCircle.py diff --git a/homeworks/06_Valentin_Naidenov/01_checkCircle.py b/homeworks/06_Valentin_Naidenov/01_checkCircle.py new file mode 100644 index 0000000..b0dbf5b --- /dev/null +++ b/homeworks/06_Valentin_Naidenov/01_checkCircle.py @@ -0,0 +1,36 @@ +from math import sqrt + +def check_Circles(c1_center, c1_rad, c2_center, c2_rad): + if(c1_center == c2_center and c1_rad == c2_rad): + return "Matching" + c1_x, c1_y = c1_center + c2_x, c2_y = c2_center + + distance = sqrt((c2_y - c1_y)**2 + (c2_x - c1_x)**2) + rad_sum = c1_rad + c2_rad + if(rad_sum < distance): + return "not intesecting" + if(rad_sum == distance): + return "touching" + if(rad_sum > distance): + if(distance + c1_rad <= c2_rad): + if(c1_rad + distance == c2_rad): + return "Circle B contains circle A and they are touching" + else: + return "Circle B contains circle A" + elif(distance + c2_rad <= c1_rad): + if(c1_rad == c2_rad + distance): + return "Circle A contains circle B and they are touching" + else: + return "Circle A contains circle B" + else: + return "intersecting" + + +a_c = (-7,5) +b_c = (4,5) + +a_r = 3 +b_r = 14 + +print(check_Circles(a_c, a_r, b_c, b_r)) From e44ae2da2fd56cd7697f241caa7d48e53e061a13 Mon Sep 17 00:00:00 2001 From: valentinmnaydenov <85516432+valentinmnaydenov@users.noreply.github.com> Date: Wed, 12 Jan 2022 21:06:14 +0200 Subject: [PATCH 2/2] Create zadacha2numways.py --- .../06_Valentin_Naidenov/zadacha2numways.py | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 homeworks/06_Valentin_Naidenov/zadacha2numways.py diff --git a/homeworks/06_Valentin_Naidenov/zadacha2numways.py b/homeworks/06_Valentin_Naidenov/zadacha2numways.py new file mode 100644 index 0000000..6b472dc --- /dev/null +++ b/homeworks/06_Valentin_Naidenov/zadacha2numways.py @@ -0,0 +1,20 @@ +def printCountDP(dist): + count = [0] * (dist + 1) + + count[0] = 1 + if dist >= 1 : + count[1] = 1 + if dist >= 2 : + count[2] = 2 + + + for i in range(2, dist + 1): + count[i] = (count[i-1] + + count[i-2]) + + return count[dist]; + + +dist = 4; +print( printCountDP(dist)) +