ACCENTURE EXAM SOLUTIONS
Open in Telegram
🔥Guys plz Stop fearing for daily exams 📝 👨💻 @srksvk is here to help you all at lowest cost possible.💪 🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company 🔥Effort from our side = 💯 📱Main Channel: @coding_are 📱Tel I'd : @srksvk
Show more📈 Analytical overview of Telegram channel ACCENTURE EXAM SOLUTIONS
Channel ACCENTURE EXAM SOLUTIONS (@coding_are) in the English language segment is an active participant. Currently, the community unites 14 042 subscribers, ranking 14 513 in the Education category and 28 403 in the India region.
📊 Audience metrics and dynamics
Since its creation on невідомо, the project has demonstrated rapid growth, gathering an audience of 14 042 subscribers.
According to the latest data from 14 October, 2026, the channel demonstrates stable activity. Although there has been a change in the number of participants by -133 over the last 30 days and by -6 over the last 24 hours, overall reach remains high.
- Verification status: Not verified
- Engagement rate (ER): The average audience engagement rate is 3.61%. Within the first 24 hours after publication, content typically collects 1.82% reactions from the total number of subscribers.
- Post reach: On average, each post receives 507 views. Within the first day, a publication typically gains 256 views.
- Reactions and interaction: The audience actively supports content: the average number of reactions per post is 2.
- Thematic interests: Content is focused on key topics such as placement, gaurntee, suree, capgemini, infosy.
📝 Description and content policy
The author describes the resource as a platform for expressing subjective opinions:
“🔥Guys plz Stop fearing for daily exams 📝
👨💻 @srksvk is here to help you all at lowest cost possible.💪
🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company
🔥Effort from our side = 💯
📱Main Channel: @coding_are
📱Tel I'd : @srks...”
Thanks to the high frequency of updates (latest data received on 15 October, 2026), the channel maintains relevance and a high level of publication reach. Analytics show that the audience actively interacts with content, making it an important point of influence in the Education category.
14 039
Subscribers
-624 hours
-347 days
-13330 days
Posts Archive
14 039
#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
14 039
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
14 039
def hamming_distance(str1, str2):
return sum(c1 != c2 for c1, c2 in zip(str1, str2))
def minimize_cost_and_print_distance(binary_string, a, b):
# Count occurrences of "01" and "10"
count_01 = binary_string.count("01")
count_10 = binary_string.count("10")
# Calculate costs
cost_01 = count_01 * a
cost_10 = count_10 * b
# Determine rearranged string for minimum cost
if cost_01 < cost_10:
rearranged_string = "01" * count_01 + "0" * (len(binary_string) - 2 * count_01)
else:
rearranged_string = "10" * count_10 + "1" * (len(binary_string) - 2 * count_10)
# Calculate and print hamming distance
distance = hamming_distance(binary_string, rearranged_string)
print(distance)
# Input reading and processing
T = int(input("Enter the number of test cases: "))
for _ in range(T):
binary_string = input("Enter the binary string: ")
a, b = map(int, input("Enter A and B separated by space: ").split())
minimize_cost_and_print_distance(binary_string, a, b)
Hamming distance
Share @codeing_area
14 039
Tcs code vitaaa passed successfully ✅✅✅
Share everyone i will post soon
14 039
Share our channel One more code soon
Need your support guys
Sitting from last 3 hours to share Codes in free
Share it
@codeing_area
14 039
ROI
100% Working ✅
Python
TCS Codevita
@codeing_area
n = int(input())
stocks = []
for _ in range(n):
a, b, c = map(int, input().split())
stocks.append((a, b, c))
m = int(input())
real = 0
unreal = 0
placementlelo = []
for i in range(n):
arr = [int(i) for i in input().split()]
placementlelo.append(arr)
day = int(input())
for i in range(n):
a, b, c = stocks[i]
if b > day: continue
elif c > day or not c: unreal += a * (placementlelo[i][day - 1] - placementlelo[i][b - 1])
else: real += a * (placementlelo[i][c - 1] - placementlelo[i][b - 1])
print(real)
print(unreal)
ROI
100% Working ✅
Python
TCS Codevita
@codeing_area
14 039
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
14 039
X from Y Code
C++ Language
✅ Done
TCS Codevita
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define codeingarea vector<int>
#define all(a) (a).begin() , (a).end()
#define sz(a) ((int)((a).size()))
const ll INF = 4e18;
vector<codeingarea> dp(1e4+1 , codeingaarea(1e4+1 , -1));
int f(int i , int j , int s , int r , string &x , string &y , string &y1)
{
if(i>j)return 0;
if(dp[i][j] != -1)return dp[i][j];
int mini = 1e9;
for(int k=i; k<=j; k++)
{
if(y1.find(x.substr(i , k-i+1)) != string::npos)mini = min(mini , r+f(k+1 , j , s , r , x , y , y1));
if(y.find(x.substr(i , k-i+1)) != string::npos)mini = min(mini , s+f(k+1 , j , s , r , x , y , y1));
}
return mini;
}
int solve(int s , int r , string x, string y)
{
string y1 = y;
reverse(all(y1));
return f(0 , sz(x)-1 , s, r , x , y , y1);
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string x , y;
cin >> x >> y;
int s, r;
cin >> s >> r;
int ans = solve(s , r, x , y);
cout << ans;
return 0;
}
X from Y
C++ Language
100% Working ✅
TCS Codevita
