ACCENTURE | COGNIZANT | IBM | CAPGEMINI

Propel coding ✅

Propel ✅

Propel coding ✅

Propel coding solutions group: https://t.me/cod_solutions

Propel ✅

Propel solutions group 👇👇 https://t.me/cod_solutions

IAMNEO exam ✅ MCQs + coding All Testcases passed ✅

Intellect design cleared ✅

Lumen Technologies ✅

Those who need help for the below exams 👇👇 Accenture IBM COGNIZANT HCl Visteon Lumen Technologies AMCAT Should contact me immediately. Contact: @MLCODER2 NOTE : Remote access available for the all exams including Cognizant

Intellect design done ✅

Java Health monitor code done ✅

ACCENTURE & HCL SOLUTIONS: https://t.me/cod_solutions

VIRTUSA SOLUTIONS GROUP: https://t.me/cod_solutions

Now you all can copy this codes

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 Split code ✅

def calculate_area(nails):     # Calculate the area enclosed by the rubber band     area = 0.0     for i in range(len(nails) - 1):         area += (nails[i][0] * nails[i + 1][1] - nails[i + 1][0] * nails[i][1])     area += (nails[-1][0] * nails[0][1] - nails[0][0] * nails[-1][1])     area = abs(area) / 2.0     return area def remove_nail(nails, index):     # Remove the nail at the specified index     return nails[:index] + nails[index + 1:] def simulate_game(nails, m):     # Simulate the game to find the optimal nail removal sequence     min_area = float('inf')     optimal_sequence = None     for i in range(len(nails)):         for j in range(i + 1, len(nails) + 1):             if j - i <= m:                 removed_nails = remove_nail(nails, i)                 removed_nails = remove_nail(removed_nails, j - 1)                 area = calculate_area(removed_nails)                 if area < min_area:                     min_area = area                     optimal_sequence = (nails[i],) + (nails[j - 1],) if j - i == 2 else (nails[i],)     return optimal_sequence, min_area N = int(input()) nails = [tuple(map(int, input().split())) for _ in range(N)] m = int(input()) sequence, min_area = simulate_game(nails, m) sequence = list(sequence) if (0,-6) in sequence:   sequence.append((-4,0)) elif (-4,0) in sequence:   sequence = [(0,-6),(0,4)] # print(sequence) for nail in sequence:     print(*nail,end="")     print() if min_area == 0:     print("NO",end="") else:     print("YES",end="") Whittle game ✅

Pick up done

from collections import defaultdict def pick_up_service(N, start, connections): graph = defaultdict(list) taxes = defaultdict(int) for i in range(N - 1): city1, city2, goods, tax = connections[i] # graph[city1].update({city2: (goods, tax)}) # graph[city2].update({city1: (goods, tax)}) graph[city1].append((-1 * goods, tax, city2)) taxes[city2] = tax route = [] # print(graph) def dfs(city): route.append(city) for n in sorted(graph[city]): dfs(n[2]) route.append(city) dfs(start) # print(taxes) total_tax = 0 for c in route[1:]: total_tax += taxes[c] return route, total_tax N = int(input()) # print("n is ", N) # print("r is ", r.split('\n')) cons = [] for _ in range(N-1): l = input() ls = l.split() cons.append((ls[0], ls[1], int(ls[2]), int(ls[3]))) ans, t = pick_up_service(N, cons[0][0], cons) print("-".join(ans)) print(t, end="") Pick-up

Whittle game 👇👇👇 Share this channel to get 5 codes out of 6