ACCENTURE EXAM SOLUTIONS

#include <bits/stdc++.h> using namespace std; int solve(vector<int>items,int ind,int size,vector<vector<int>>&dp){ if(ind>=items.size()){ return 0; } if(dp[ind][size]!=-1){ return dp[ind][size]; } int take = items[ind] * size + solve(items, ind + 1, size + 1,dp); int nottake = solve(items, ind + 1, size,dp); return dp[ind][size]=max(take, nottake); } int main() { string itemsInput; getline(cin, itemsInput); vector<int> items; stringstream ss(itemsInput); int item; while (ss >> item) { items.push_back(item); } sort(items.begin(),items.end()); vector<vector<int>> dp(items.size()+1, vector<int>(items.size()+1, -1)); int ans = solve(items, 0, 1,dp); cout << ans << endl; }

If you more code then share group @codeing_areaa Make it 5.5 k then I will share codes

Full passed

Full workings ✅✅✅✅✅

def shyam_and_strings(s1, s2, k): n, m = len(s1), len(s2) dp = [[0] * (m + 1) for _ in range(n + 1)] for i in range(n + 1): for j in range(m + 1): if i == 0 or j == 0: dp[i][j] = 0 else: cnt = 0 if s1[i - 1] != s2[j - 1]: cnt = min(abs(ord(s1[i - 1]) - ord(s2[j - 1])), 26 - abs(ord(s1[i - 1]) - ord(s2[j - 1]))) if cnt <= k: dp[i][j] = 1 + dp[i - 1][j - 1] dp[i][j] = max(dp[i][j], max(dp[i - 1][j], dp[i][j - 1])) return dp[n][m] s1 = input().strip() s2 = input().strip() k = int(input().strip()) if not s1 or not s2: print(0) else: print(shyam_and_strings(s1, s2, k), end="")

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