aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-06 15:01:38 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-06 15:01:38 +0200
commit27b754215ceda985f0f8e3b64ab5c5f8e84ab826 (patch)
treeff4bf84b578b8f774612c511c9c4ed4e615683fa
parentbfd47647651229dd98734db1b1ef6bdc55dd65d3 (diff)
downloadcompetitive-programming-27b754215ceda985f0f8e3b64ab5c5f8e84ab826.tar.xz
competitive-programming-27b754215ceda985f0f8e3b64ab5c5f8e84ab826.zip
Solved Combinational lock codeforces
-rw-r--r--RecursiveDigitSum.py14
-rw-r--r--python/CombinationLock.py12
2 files changed, 12 insertions, 14 deletions
diff --git a/RecursiveDigitSum.py b/RecursiveDigitSum.py
deleted file mode 100644
index 4d7dbd7..0000000
--- a/RecursiveDigitSum.py
+++ /dev/null
@@ -1,14 +0,0 @@
-x,n = map(int, input().split())
-x = str(x)
-x = x * n
-print(x)
-def recursive_digit_sum(x):
- y = 0
- if len(x) == 1:
- return x;
- else:
- for i in x:
- y += int(i)
- print("y: ", y)
- return recursive_digit_sum(str(y))
-print(recursive_digit_sum(x))
diff --git a/python/CombinationLock.py b/python/CombinationLock.py
new file mode 100644
index 0000000..0ac8b2c
--- /dev/null
+++ b/python/CombinationLock.py
@@ -0,0 +1,12 @@
+t = int(input())
+count = 0
+n1 = input()
+n2 = input()
+for i in range(len(n1)):
+ if abs(int(n1[i]) - int(n2[i])) > 5:
+ count+= 10 - max(int(n1[i]),int(n2[i])) + min(int(n1[i]),int(n2[i]))
+ else:
+ count+=abs(int(n1[i]) - int(n2[i]))
+print(count)
+
+