lgallet/epicours
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

vault backup: 2023-11-20 14:11:33

Browse Source
This commit is contained in:
Louis Gallet 2023-11-20 14:11:33 +01:00
parent d0de81cc65
commit 227bbc4c71
Signed by: lgallet
SSH Key Fingerprint: SHA256:qnW7pk4EoMRR0UftZLZQKSMUImbEFsiruLC7jbCHJAY
1 changed files with 2 additions and 35 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

37
Algo/B2/Exercises/Repetitive tutorial.md
View File

@ -14,7 +14,7 @@ def zorglub(n: int) -> int:
The function return the sum of the factorial of n The function return the sum of the factorial of n
## Exercise 1.2 ## Exercise 1.2
``` ```python
def multiplication(x: int, y: int) -> int: def multiplication(x: int, y: int) -> int:
result = 0 result = 0
while y > 0: while y > 0:
@ -22,41 +22,8 @@ def multiplication(x: int, y: int) -> int:
y -= 1 y -= 1
return result return result
def multiplication2(x: int, y: int) -> int:
result = 0
if x < 0 and y < 0:
i = 0
x = -x
y = -y
while i < y:
result = result + x
i += 1
return result
elif y < 0:
y = -y
i = 0
while i < y:
result = result + x
i += 1
return -result
else:
i = 0
while i < y:
result = result + x
i += 1
return result
def multiplication2(x: int, y: int) -> int: def multiplication2(x: int, y: int) -> int: # Thanks Hugo :p
if x < 0 and y < 0:
return multiplication(-x, -y)
elif y < 0:
return -multiplication(x, -y)
elif x < 0:
return -multiplication(-x, y)
else
return multiplication(x, y)
def multiplication2(x: int, y: int) -> int:
if y < 0: if y < 0:
y = -y y = -y
if x < 0: if x < 0: