Add files via upload

Code Forces Contest Problems.

Author: Ram-95

Badges_CF.py

@@ -0,0 +1,30 @@
+#Badges - Codeforces
+
+b = int(input())
+g = int(input())
+n = int(input())
+
+decks = []
+
+for i in range(n+1):
+    decks.append((i, n-i))
+
+count = 0
+
+#if 1 means boys are minimum else girls are minimum
+flag = 1 if min(b,g) == 1 else 0
+
+
+for idx in decks:
+    if flag == 1:
+        if idx[0] <= b and idx[1] <= g:
+            #print(idx)
+            count += 1
+    else:
+        if idx[1] <= g and idx[0] <= b:
+            #print(idx)
+            count += 1
+
+print(count)
+
+        

Block Adventure CF.py

@@ -0,0 +1,32 @@
+def game(arr, n, m, k):
+    i = 0
+    ans = True
+    for i in range(n-1):
+        val = max(0, arr[i+1] - k)
+        if val < arr[i]:
+            m += arr[i] - val
+        elif val - arr[i] > m:
+            ans = False
+            break
+        else:
+            m -= (val - arr[i])
+
+    if ans:
+        return 'YES'
+    else:
+        return 'NO'
+ 
+        
+        
+    
+ 
+t = int(input())
+while t:
+    nmk = list(map(int, input().rstrip().split()))
+    n = nmk[0]
+    m = nmk[1]
+    k = nmk[2]
+    #heights array
+    arr = list(map(int, input().rstrip().split()))
+    print(game(arr, n, m, k))
+    t = t - 1

Common Divisors-CF.py

@@ -0,0 +1,23 @@
+#Common Divisors - Codeforces
+import math
+
+def common_divisors(n):
+    count = 0
+    
+        
+    for i in range(1,round(math.sqrt(n))+1):
+        if i != n//i:
+            if n % i == 0:
+                count += 2
+        else:
+            if n%i == 0:
+                count += 1
+        
+        
+    return count
+
+    
+n = int(input())
+arr = list(map(int, input().rstrip().split()))
+m = min(arr)
+print(common_divisors(m))

Compress Words - CF.py

@@ -0,0 +1,5 @@
+#Compress Words - Codeforces
+n = int(input())
+s_list = list(input().rstrip().split())
+
+

Creating a Character_CF.py

@@ -0,0 +1,20 @@
+#Creating a Character - Codeforces
+
+def create_character(s,i,e):
+    ans = 0
+    if s > i + e:
+        ans = e + 1
+    elif s + e <= i:
+        ans = 0
+    else:
+        s += e
+        ans = ((s-i)+1)//2
+
+    return ans
+ 
+ 
+t = int(input())
+while t:
+    (s,i,e) = (map(int, input().split()))
+    print(create_character(s,i,e))
+    t = t - 1

From_Hero_to_Zero_CF.py

@@ -0,0 +1,24 @@
+#From Hero to Zero
+
+
+def hero_to_zero(n,k):
+    count = 0
+    while n:
+        nex = (n//k) * k
+        count = count + (n - nex)
+        n = n - (n-nex)
+
+        while(n and n%k == 0):
+            n = n // k
+            count += 1
+
+    return count
+
+
+t = int(input())
+while t:
+    nk = list(map(int, input().rstrip().split()))
+    n = nk[0]
+    k = nk[1]
+    print(hero_to_zero(n,k))
+    t = t - 1

Nauuo_and_Votes_CF.py

@@ -0,0 +1,48 @@
+#Nauuo and Votes - Codeforces
+
+xyz = list(map(int, input().rstrip().split()))
+
+up = xyz[0]
+down = xyz[1]
+tie = xyz[2]
+
+
+if tie == 0:
+    if up > down:
+        print('+')
+    elif down > up:
+        print('-')
+    else:
+        print('0')
+
+else:
+    if up == down and down == tie:
+        print('?')
+    elif up == down and tie > up:
+        print('?')
+    elif up > (down + tie):
+        print('+')
+    elif up == (down + tie):
+        print('?')
+    elif down > (up + tie):
+        print('-')
+    elif down == (up + tie):
+        print('?')
+    elif max(up,down) == up:
+        if down + tie < up:
+            print('+')
+        elif down + tie == up:
+            print('?')
+        else:
+            print('?')
+    elif max(up,down) == down:
+        if up + tie < down:
+            print('-')
+        elif up + tie == down:
+            print('?')
+        else:
+            print('?')
+    
+
+                
+    

Optimal_Currency_Exchange_CF.py

@@ -0,0 +1,16 @@
+#Optimal Currency Exchange - Codeforces
+
+n = int(input())
+d = int(input())
+e = int(input())
+
+ans = n
+
+i = 0
+while n >= (i*5*e):
+    ans = min(ans, (n-i*5*e) % d)
+    i += 1
+
+print(ans)
+        
+

Tale_of_Two_Lands_CF.py

@@ -0,0 +1,31 @@
+#Tale of Two Lands - CodeForces
+def TaleofTwo(a,b):
+    count = 0
+    #array_land = abs(a - b) + 1
+    v_a = abs(a - b)
+    v_b = abs(a + b)
+
+    #Finding the absolute values of a and b
+    a = abs(a)
+    b = abs(b)
+
+    if v_a < v_b:
+        if (a in range(v_a, v_b + 1)) and (b in range(v_a, v_b + 1)):
+            count = count + 1
+    elif v_a >= v_b:
+        if (a in range(v_b, v_a + 1)) and (b in range(v_b, v_a + 1)):
+            count = count + 1
+        
+      
+    return count
+    
+        
+
+
+n = int(input())
+
+xyz = list(map(int, input().rstrip().split()))
+
+print(TaleofTwo(arr))
+        
+

Three_piles_of_Candies_CF.py

@@ -0,0 +1,13 @@
+#Three piles of candies - Codeforces A
+
+def three_piles(arr, n):
+    return sum(arr)//2
+    
+
+
+
+q = int(input())
+while q:
+    arr = list(map(int, input().rstrip().split()))
+    print(three_piles(arr, len(arr)))
+    q = q - 1