ACCENTURE EXAM HELP ! CISCO EXAM !

def max_efficiency(numbers): numbers.sort() n = len(numbers) max_efficiency = 0 for i in range(n): efficiency = 0 for j in range(i, n): efficiency += numbers[j] * (j - i + 1) max_efficiency = max(max_efficiency, efficiency) return max_efficiency # Input parsing numbers = list(map(int, input().split())) # Output result = max_efficiency(numbers) print(result if result >= 0 else 0) Sport's daye full running 💯💯💯💯 In python 3 Now share ✅✅

import math mapval = { "add": -1, "sub": -2, "mul": -3, "rem": -4, "pow": -5, "zero": 0, "one": 1, "two": 2, "three": 3, "four": 4, "five": 5, "six": 6, "seven": 7, "eight": 8, "nine": 9 } def values(): global mapval mapval = { "add": -1, "sub": -2, "mul": -3, "rem": -4, "pow": -5, "zero": 0, "one": 1, "two": 2, "three": 3, "four": 4, "five": 5, "six": 6, "seven": 7, "eight": 8, "nine": 9 } def generate_value(s, stack): s += 'c' str_val = "" sn = "" for char in s: if char == 'c': if str_val not in mapval: return False sn += str(mapval[str_val]) str_val = "" else: str_val += char ans = int(sn) stack.append(ans) return True def solve_this(stack1, stack2): while stack1: top = stack1.pop() if top < 0 and len(stack2) < 2: return "expression is not complete or invalid" elif top < 0: val1 = stack2.pop() val2 = stack2.pop() if top == -1: new_val = val1 + val2 elif top == -4: new_val = val1 % val2 elif top == -2: new_val = val1 - val2 elif top == -3: new_val = val1 * val2 elif top == -5: new_val = int(math.pow(val1, val2)) stack2.append(new_val) else: stack2.append(top) return str(stack2[0]) if len(stack2) == 1 else "expression is not complete or invalid" def perform_task(s, stack): i = 0 str_val = "" s += " " count_of_c = 0 while i < len(s): if s[i] == ' ': if str_val not in mapval: if count_of_c == 0: return "expression evaluation stopped invalid words present" if not generate_value(str_val, stack): return "expression evaluation stopped invalid words present" count_of_c = 0 else: stack.append(mapval[str_val]) str_val = "" else: if s[i] == 'c': count_of_c += 1 str_val += s[i] i += 1 return "" def solve_it(s): st = [] st1 = [] an = perform_task(s, st) if an != "": return an return solve_this(st, st1) def main(): values() s = input() print(solve_it(s)) if name == "main": main() No more symobol python Fully passed ✅💯👍🎉

No need pay

Everyone share group fastttt✅✅✅✅✅ I will upload all answers soon fastt

Tcs code vitaa exam successfully done by remote access ✅✅✅✅✅ He need only 2 code code fully passed ✅✅ with all tets case passed ✅✅✅ Contact for exams @codeing_area

Tcs code vitaa exam successfully done by remote access ✅✅✅✅✅ 6/ 6 code fully passed ✅✅ with all tets case passed ✅✅✅ Contact for exams @codeing_area

Donee Chocolat day ✅✅😗😗 Share group everyone I will share soon

#include<bits/stdc++.h> using namespace std; int main() {     int x,y,x1,y1,x2,y2;     cin>>x>>y>>x1>>y1>>x2>>y2;     x=abs(x);     y=abs(y);     x1=abs(x1);     y1=abs(y1);     x2=abs(x2);     y2=abs(y2);     int r1 = ceil(sqrt(((x1-x)*(x1-x))+((y1-y)*(y1-y))));     int r2 = ceil(sqrt(((x2-x)*(x2-x))+((y2-y)*(y2-y))));     int a1 = ceil(3.14*r1*r1);     int a2 = ceil(3.14*r2*r2);     if(a2>a1)     {         int e = a2-a1;         int f = ceil(sqrt(e));         int g = f*f;         int h = g-e;         int i = h*20;         cout<<"Krishna ";         cout<<i;     }     else if(a1>a2)     {       int p = a1-a2;       int q = p*20;       cout<<"Shiva ";       cout<<q;     }     else if(a1==a2)     {         cout<<"-1";     } } FencingProblem:  Shiva and Krishna public test cases passed C++ TCS CODEVITA SOLUTIONS @codeing_area @codeing_area

#include<bits/stdc++.h> using namespace std; int main() {     int x,y,x1,y1,x2,y2;     cin>>x>>y>>x1>>y1>>x2>>y2;     x=abs(x);     y=abs(y);     x1=abs(x1);     y1=abs(y1);     x2=abs(x2);     y2=abs(y2);     int r1 = ceil(sqrt(((x1-x)*(x1-x))+((y1-y)*(y1-y))));     int r2 = ceil(sqrt(((x2-x)*(x2-x))+((y2-y)*(y2-y))));     int a1 = ceil(3.14*r1*r1);     int a2 = ceil(3.14*r2*r2);     if(a2>a1)     {         int e = a2-a1;         int f = ceil(sqrt(e));         int g = f*f;         int h = g-e;         int i = h*20;         cout<<"Krishna ";         cout<<i;     }     else if(a1>a2)     {       int p = a1-a2;       int q = p*20;       cout<<"Shiva ";       cout<<q;     }     else if(a1==a2)     {         cout<<"-1";     } } FencingProblem:  Shiva and Krishna public test cases passed C++ TCS CODEVITA SOLUTIONS @codeing_area @codeing_area

Remaining code I will send After 5k So do fast sharee

def max_efficiency(numbers): numbers.sort() n = len(numbers) max_efficiency = 0 for i in range(n): efficiency = 0 for j in range(i, n): efficiency += numbers[j] * (j - i + 1) max_efficiency = max(max_efficiency, efficiency) return max_efficiency # Input parsing numbers = list(map(int, input().split())) # Output result = max_efficiency(numbers) print(result if result >= 0 else 0) Sport's daye full running 💯💯💯💯 In python Now share ✅✅ Make it 5k

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