ACCENTURE EXAM SOLUTIONS

Now share everyone group @codeing_area

def max_points(chocolates,initial):   chocolates=sorted(chocolates)   points=1   l=[1]   i=0   while i < len(chocolates):     if chocolates[i]<=initial:       initial=initial-chocolates[i]       points+=1       i+=1     else:       points-=1       initial+=chocolates[-1]       chocolates.pop()     l.append(points)   return max(l) # Example usage: chocolates_list = list(map(int, input().split()))  # Input list of chocolates initial_chocolates = int(input())  # Initial chocolates Bittu has result = max_points(chocolates_list, initial_chocolates) print(result,end="") Choclate Code TCS CODEVITA PYTHON3 Share fasttt @codeing_area

Fast maki it 5k

Next code readyy 💯💯💯💯 Full passed code✅✅ Make it 5k fastt Telegram @codeing_area

#include <iostream> #include <vector> #include <algorithm> using namespace std; int max_efficiency(vector<int>& numbers) { sort(numbers.begin(), numbers.end()); int n = numbers.size(); int max_efficiency = 0; for (int i = 0; i < n; ++i) { int efficiency = 0; for (int j = i; j < n; ++j) { efficiency += numbers[j] * (j - i + 1); } max_efficiency = max(max_efficiency, efficiency); } return max_efficiency; } int main() { // Input parsing int n; cin >> n; vector<int> numbers(n); for (int i = 0; i < n; ++i) { cin >> numbers[i]; } // Output int result = max_efficiency(numbers); cout << (result >= 0 ? result : 0) << endl; return 0; } . sports codee in C+++ Fully passsd ✅✅✅✅✅ Now make it 5k

Sports code donee ✅✅✅✅ Please share ✅✅✅✅✅ I will share code soon

Share Channel When 5000 Done I will post Fencing problem Maximum gem Sports day telegram @codeing_area

def toggle(num):     result = ""     for bit in num:         if bit == "0":             result += "1"         else:             result += "0"     return result def get_max_sum(arr, k):     max_val = max(arr)     max_index = arr.index(max_val)     left = max(0, max_index-k)     right = min(len(arr)-1, max_index+k)          selected = arr[left:max_index+1] + arr[max_index:right+1]      arr = [x for x in arr if x not in selected]          return sum(selected), arr # Input  arr = list(map(int, input().split()))   a1, b1 = input().split() a2, b2 = input().split() k = int(input()) sum1, sum2 = 0, 0 while arr:     s1, arr = get_max_sum(arr, k)      sum1 += s1          if not arr:         break              s2, arr = get_max_sum(arr, k)     sum2 += s2      if sum1 > sum2:     a1 = toggle(a1)     b2 = toggle(b2) else:     a2 = toggle(a2)      b1 = toggle(b1) xor1 = int(a1, 2) ^ int(b1, 2)   xor2 = int(a2, 2) ^ int(b2, 2) if xor1 > xor2:     print("Rahul",end="") elif xor2 > xor1:     print("Rupesh",end="") else:     print("both",end="") WHO IS LUCKY CODE TCS CODEVITA PYTHON3

Share @codeing_area

def mirror_reflection(digits, side): images = { '0': 'com.tcs.cv.automata.ei.middleware.DocxToHtmlConverter@a7e2d9d:image1.png', '1': 'com.tcs.cv.automata.ei.middleware.DocxToHtmlConverter@a7e2d9d:image2.png', '2': 'com.tcs.cv.automata.ei.middleware.DocxToHtmlConverter@a7e2d9d:image3.png', '3': 'com.tcs.cv.automata.ei.middleware.DocxToHtmlConverter@a7e2d9d:image4.png', '4': 'com.tcs.cv.automata.ei.middleware.DocxToHtmlConverter@a7e2d9d:image5.png', '5': 'com.tcs.cv.automata.ei.middleware.DocxToHtmlConverter@a7e2d9d:image6.png', '6': 'com.tcs.cv.automata.ei.middleware.DocxToHtmlConverter@a7e2d9d:image7.png', '7': 'com.tcs.cv.automata.ei.middleware.DocxToHtmlConverter@a7e2d9d:image8.png', '8': 'com.tcs.cv.automata.ei.middleware.DocxToHtmlConverter@a7e2d9d:image9.png', '9': 'com.tcs.cv.automata.ei.middleware.DocxToHtmlConverter@a7e2d9d:image0.png', } result = [] for d, s in zip(digits, side): if s == 'L': result.append(images[d]) else: # For U, D, R, and S, print the seven segment display result.append(d) return ''.join(result) # Input parsing digits = input().strip() side = input().strip() # Output print(mirror_reflection(digits, side)) Mirror reflection code .... python✅✅✅✅ Full passes ✅✅✅

No one sharing group everyone Please share group ✅✅✅✅✅ I will send all code ✅✅✅

import numpy as np def find_widest_valley(n, A, B): def surface_equation(x): return sum(np.sin(a*x + b) for a, b in zip(A, B)) def find_local_maxima(): maxima = [] for i in range(1, n-1): if surface_equation(i-1) < surface_equation(i) > surface_equation(i+1): maxima.append(i) return maxima def find_valley_width(left, right): return right - left maxima = find_local_maxima() widest_valley_width = 0 widest_valley_index = 0 for i in range(len(maxima)-1): left_maxima = maxima[i] right_maxima = maxima[i+1] current_valley_width = find_valley_width(left_maxima, right_maxima) if current_valley_width > widest_valley_width: widest_valley_width = current_valley_width widest_valley_index = left_maxima + 1 return widest_valley_index # Input parsing n = int(input()) A = list(map(int, input().split())) B = list(map(int, input().split())) # Output print(find_widest_valley(n, A, B))

Sending answer

I am waittingg everyone ✅✅✅✅ Please do fast 5k ✅✅✅ @codeing_area Code are ready everyone ✅✅

I am waittingg everyone ✅✅✅✅ Please do fast 5k ✅✅✅ @codeing_area

Now share everyone ✅✅✅✅✅✅ @codeing_area

def convert(expression): stack = [] tokens = expression.split() for token in reversed(tokens): if is_operand(token): stack.append(int(token)) elif is_operator(token): if len(stack) < 2: return float('-inf') operand2 = stack.pop() operand1 = stack.pop() if token == "+": stack.append(operand1 + operand2) elif token == "-": stack.append(operand1 - operand2) elif token == "*": stack.append(operand1 * operand2) elif token == "/": stack.append(operand1 / operand2) elif token == "^": stack.append(operand1 ** operand2) elif token == "%": stack.append(operand1 % operand2) if len(stack) != 1: return float('-inf') return stack.pop() def is_operand(token): return token.lstrip('-').isdigit() def is_operator(token): return token in {"+", "-", "*", "/", "^", "%"} def main(): prefix = input() word_map = { "zero": "0", "one": "1", "two": "2", "three": "3", "four": "4", "five": "5", "six": "6", "seven": "7", "eight": "8", "nine": "9", "mul": "*", "add": "+", "sub": "-", "div": "/", "rem": "%", "pow": "^" } words = prefix.split() real_prefix = "" for word in words: if word in word_map: real_prefix += word_map[word] + " " continue small_words = word.split("c") for s in small_words: if s: if s not in word_map: print("expression evaluation stopped invalid words present") return real_prefix += word_map[s] real_prefix += " " infix = convert(real_prefix) if infix == float('-inf'): print("expression is not complete or invalid") else: print(int(infix)) if name == "main": main() No more suffle✅✅✅✅✅(python All passsd ✅✅✅ Share everyone ✅✅✅

Please make it 5k fasttt everyone ✅✅✅ Then i will post all code....and fully correct ✅✅✅✅

Share fasttt everyone ✅✅✅✅✅ @codeing_area

#include <iostream> #include <vector> using namespace std; int main() { int n; cin >> n; vector<tuple<int, int, int>> stocks; for (int i = 0; i < n; ++i) { int a, b, c; cin >> a >> b >> c; stocks.push_back(make_tuple(a, b, c)); } int m; cin >> m; int real = 0; int unreal = 0; vector<vector<int>> prices; for (int i = 0; i < n; ++i) { vector<int> arr(m); for (int j = 0; j < m; ++j) { cin >> arr[j]; } prices.push_back(arr); } int day; cin >> day; for (int i = 0; i < n; ++i) { int a, b, c; tie(a, b, c) = stocks[i]; if (b > day) { continue; } else if (c > day || !c) { unreal += a * (prices[i][day - 1] - prices[i][b - 1]); } else { real += a * (prices[i][c - 1] - prices[i][b - 1]); } } cout << real << endl; cout << unreal << endl; return 0; } Roi code fully passsd ✅✅✅✅✅ Share @codeing_area