ACCENTURE EXAM SOLUTIONS

----- PICK UP SERVICE ----- 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="") PICKUP SERVICE CODE TCS CODEVITA SOLUTIONS Python3 SHARE ✅✅ @codeing_area @codeing_area

----- PICK UP SERVICE ----- 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="") PICKUP SERVICE CODE TCS CODEVITA SOLUTIONS Python3 SHARE ✅✅ @codeing_area

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="") Password Generator only public case working

I am not asking money 💰💰 We want share my group everyone Then I will share all correct 💯 code very soon Share @codeing_area Share ✅ share✅ share✅

Broo now share everyone ✅✅✅✅✅ I am posted all correct answer ✅👍👍 Share @codeing_area

Proof everyone

Share share ✅✅✅✅☺️

Fully paased ✅🎉🎉🎉🎉🎉🎉✅💯💯

import math def calculate_distance(point1, point2):     return abs(point1[0] - point2[0]) + abs(point1[1] - point2[1]) def assign_vehicles(passengers, vehicles):     allocated_vehicles = {}     total_distance = 0     for passenger in sorted(passengers):         min_distance = math.inf         closest_vehicle = ""         passenger_coordinates = passengers[passenger]         for vehicle in vehicles:             if vehicles[vehicle] == "":                 vehicle_coordinates = vehicles[vehicle + "_coordinates"]                 distance = calculate_distance(passenger_coordinates, vehicle_coordinates)                 if distance < min_distance or (distance == min_distance and vehicle < closest_vehicle):                     min_distance = distance                     closest_vehicle = vehicle                 allocated_vehicles[passenger] = closest_vehicle         vehicles[closest_vehicle] = passenger         total_distance += min_distance     return total_distance N, M = map(int, input().split()) passengers = {} vehicles = {} for _ in range(N):     name, x, y = input().split()     passengers[name] = (int(x), int(y)) for _ in range(M):     vehicle, x, y = input().split()     vehicles[vehicle] = ""     vehicles[vehicle + "_coordinates"] = (int(x), int(y)) minimum_distance = assign_vehicles(passengers, vehicles) print(minimum_distance,end="") Solo rider✅✅ Python 3 @codeing_area ✅✅✅ Share share ✅✅✅✅

@

Next code will upload soon....✅✅

Share group everyone fastttt✅✅✅✅ @codeing_area

Warehouse Fully paased ✅💯👍

def generate_password(number, name):     # Check if name consists of only lowercase letters     if name.isalpha() and name.islower():         # Convert number to absolute value to handle negative numbers         abs_number = abs(number)                 # Ensure length of name is within the specified range         name_length = min(max(len(name), 1), 100)                 # Generate password using a combination of number and name         password = str(abs_number) + name[:name_length]         return password     else:         return "Invalid" try:     # Input: Number of test cases     T = int(input())     # Process each test case     for _ in range(T):         # Input: Number and Name separated by space         test_input = input().split()         if len(test_input) == 2:             number = int(test_input[0])             name = test_input[1]             # Output: Print the password for each test case in a new line             result = generate_password(number, name)             print(result)         else:             print("Invalid input format") except Exception as e:     print("An error occurred:", e) password generator updated all passed

def minVehicles(weights, limit): weights.sort() # Sort the weights in ascending order left, right = 0, len(weights) - 1 vehicles = 0 while left <= right: if weights[left] + weights[right] <= limit: left += 1 right -= 1 vehicles += 1 return vehicles # Python 3 compatibility try: # Python 3 raw_input = input except NameError: # Python 2 pass weights = list(map(int, raw_input().split())) limit = int(raw_input()) result = minVehicles(weights, limit) # Output the result without extra spaces or newline characters print(result, end="") Warehouse public passed ✅✅✅... python 3 Shared @codeing_area fastt everyone

def bubble_sort(a1, a2): n = len(a1) for i in range(n): swapped = False for j in range(0, n - i - 1): if a1[j] > a1[j + 1]: a1[j], a1[j + 1] = a1[j + 1], a1[j] a2[j], a2[j + 1] = a2[j + 1], a2[j] swapped = True if not swapped: break return a2 a1 = list(map(int, input().split())) a2 = list(map(int, input().split())) result = bubble_sort(a1, a2) print(*result) Bubble sort in python Full working ✅💯💯💯💯 Share @codeing_area

I will post all code after 10am 💯💯 So don't worry everyonee ✅✅✅ Share @codeing_are Fastt

Sahre fasttt everyone group I am not asking money....you need to sahare group only