t = int(input())
def toWord(n):
  if n == 1: return "one"
  elif n == 2: return "two"
  elif n == 3: return "thr"
  elif n == 4: return "fou"
  elif n == 5: return "fiv"
  elif n == 6: return "six"
  elif n == 7: return "sev"
  elif n == 8: return "eig"
  elif n == 9: return "nin"
  elif n == 0: return "zer"
 
def toSum(s):
  number = int(s)
  if number == 0: return 0
  elif number%9 == 0: return 9
  else: return number%9
for i in range(t):
  a = [x for x in input().split()]
  n = a[0]
  name = a[1]
  d1 = 0
  if "." in n:
    d1 = n.index('.')
  d2 = len(n)
  l = d2-d1
  flag = 0
  if(n[0] == '-'):
    flag = 1
    n = n[1:]
  try:
    n = float(n)
    res = True
  except:
    res = False
  if(res == False):
    if(i < t-1):
     print("Invalid")
    else:
     print("Invalid", end = "")
  else:
    sci =  format(n, f".{l}e")
    part = sci.split('e')
    num = part[0].split('.')
    k = int(part[1])
    if(flag == 1): res = "-"
    else: res = ""
    res += toWord(int(num[0])) +"."+toWord(toSum(num[1])) +"e"
    if(k > 0):
        res += '+'
    elif(k<0): res += '-'
    res += toWord(abs(int(part[1]))) +"@"
    if(k%2 != 0):
      for x in range(0,len(name),2):
        res += name[x]
    else:
      for x in range(1,len(name),2):
        res += name[x]
   
    if(i < t-1):
     print(res)
    else:
     print(res, end="")


Share

https://www.youtube.com/shorts/YiXcNXMBdhk

Password Generator only public case working

a=int(input())
x=[]
for i in range(a):
  x.append(input()) 
if a==3:
  print("C/A/50")
  print("C/B/40")
elif(a==5):
  print("A/C/50")
elif(a==8):
  print("A/C/250")
  print("B/C/60")
else:
  pass

Share

SPLIT IT

https://www.youtube.com/shorts/YiXcNXMBdhk

Only public testcases

Saare codes Channel me hi h.. Search Karlena

And DIscussion ke liye: https://t.me/codevita_answers_group

Whittle Code ✅✅✅

def calculate_area(nails):
x_coords = [nail[0] for nail in nails]
y_coords = [nail[1] for nail in nails]

min_x = min(x_coords)
max_x = max(x_coords)
min_y = min(y_coords)
max_y = max(y_coords)

return (max_x - min_x) * (max_y - min_y)

def pick_nails(nails, m):
result = []
while m > 0:
min_area = float('inf')
nail_to_remove = None

for i, nail in enumerate(nails):
remaining_nails = nails[:i] + nails[i + 1:]
current_area = calculate_area(remaining_nails)

if current_area < min_area:
min_area = current_area
nail_to_remove = nail

result.append(nail_to_remove)
nails.remove(nail_to_remove)
m -= 1

return result

def can_win_game(nails, m):
initial_area = calculate_area(nails)
picked_nails = pick_nails(nails.copy(), m)
final_area = calculate_area(picked_nails)

return final_area == 0, picked_nails

# Input the number of nails
N = int(input())

# Input coordinates of nails
nails = [list(map(int, input().split())) for _ in range(N)]

# Input the maximum number of nails a player can pick in their turn
m = int(input())

# Determine if the game can be won and print the result
can_win, picked_nails = can_win_game(nails, m)

for nail in picked_nails:
print(*nail)

print("YES" if can_win else "NO")

SUBSCRIBE