en
Feedback

Don't get caught by a cheater! Telemetrio finds and tags such channels πŸ‘‰ If you want to see the tag, subscribe

ACCENTURE EXAM SOLUTIONS

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 13 835 subscribers, ranking 14 761 in the Education category and 28 197 in the India region.

πŸ“Š Audience metrics and dynamics

Since its creation on Π½Π΅Π²Ρ–Π΄ΠΎΠΌΠΎ, the project has demonstrated rapid growth, gathering an audience of 13 835 subscribers.

According to the latest data from 19 November, 2026, the channel demonstrates stable activity. Although there has been a change in the number of participants by -179 over the last 30 days and by -11 over the last 24 hours, overall reach remains high.

  • Verification status: Not verified
  • Engagement rate (ER): The average audience engagement rate is 3.43%. Within the first 24 hours after publication, content typically collects 1.12% reactions from the total number of subscribers.
  • Post reach: On average, each post receives 474 views. Within the first day, a publication typically gains 155 views.
  • Reactions and interaction: The audience actively supports content: the average number of reactions per post is 1.
  • 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 20 November, 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.

13 835
Subscribers
-1124 hours
-467 days
-17930 days
Posts Archive
#include <bits/stdc++.h> using namespace std; static int min_ops(const vector<int>& a) { int n = (int)a.size(); string s(n, '\0'), g(n, '\0'); for (int i = 0; i < n; ++i) s[i] = char(a[i]); for (int i = 0; i < n; ++i) g[i] = char(i); if (s == g) return 0; vector<array<int, 3>> mv; mv.reserve(n * n * n); for (int i = 0; i < n; ++i) { for (int j = i + 1; j <= n; ++j) { int ln = j - i; for (int k = 0; k <= n - ln; ++k) { if (k == i) continue; mv.push_back({i, j, k}); } } } deque<string> q1, q2; unordered_map<string, int> d1, d2; q1.push_back(s); d1.emplace(s, 0); q2.push_back(g); d2.emplace(g, 0); auto expand = [&](deque<string>& q, unordered_map<string, int>& dself, unordered_map<string, int>& dother) -> int { int m = (int)q.size(); while (m--) { string x = q.front(); q.pop_front(); int dx = dself[x]; for (auto& t : mv) { int i = t[0], j = t[1], k = t[2]; int ln = j - i; string b = x.substr(i, ln); string r = x.substr(0, i) + x.substr(j); string y = r.substr(0, k) + b + r.substr(k); if (dself.find(y) != dself.end()) continue; int nd = dx + 1; auto it = dother.find(y); if (it != dother.end()) return nd + it->second; dself.emplace(y, nd); q.push_back(y); } } return -1; }; while (!q1.empty() && !q2.empty()) { if (q1.size() <= q2.size()) { int ans = expand(q1, d1, d2); if (ans != -1) return ans; } else { int ans = expand(q2, d2, d1); if (ans != -1) return ans; } } return 0; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; if (!(cin >> n)) return 0; string line; getline(cin, line); // consume endline after n getline(cin, line); // blank line vector<string> sh(n), og(n); for (int i = 0; i < n; ++i) getline(cin, sh[i]); getline(cin, line); // blank line for (int i = 0; i < n; ++i) getline(cin, og[i]); unordered_map<string, int> mp; mp.reserve(n * 2); for (int i = 0; i < n; ++i) mp[og[i]] = i; vector<int> a(n); for (int i = 0; i < n; ++i) a[i] = mp[sh[i]]; cout << min_ops(a) << "\n"; return 0; } Order it (cpp)
01 Nov 2025, 04:20

photo content
01 Nov 2025, 03:30

include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int N, M; cin >> N >> M; vector grid(N); for (int i = 0; i < N; i++) { grid[i].resize(M); for (int j = 0; j < M; j++) { cin >> grid[i][j]; } } vector horizontal_rods, vertical_rods; for (int i = 0; i < N; i++) { if (all_of(grid[i].begin(), grid[i].end(), [](char c){ return c != '.'; })) horizontal_rods.push_back(i); } for (int j = 0; j < M; j++) { bool full = true; for (int i = 0; i < N; i++) if (grid[i][j] == '.') full = false; if (full) vertical_rods.push_back(j); } vector> is_cross(N, vector(M, false)); for (int c : vertical_rods) { for (int i = 0; i < N; i++) { int left = c - 1, right = c + 1; if (left >= 0 && right < M && grid[i][left] == 'C' && grid[i][right] == 'C') is_cross[i][c] = true; } } for (int r : horizontal_rods) { for (int j = 0; j < M; j++) { int up = r - 1, down = r + 1; if (up >= 0 && down < N && grid[up][j] == 'C' && grid[down][j] == 'C') is_cross[r][j] = true; } } vector> cable(N, vector(M, false)); for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) if (grid[i][j] == 'C' || is_cross[i][j]) cable[i][j] = true; vector> adj(N * M); int di[4] = {-1, 0, 1, 0}; int dj[4] = {0, 1, 0, -1}; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { if (!cable[i][j]) continue; int id = i * M + j; for (int d = 0; d < 4; d++) { int ni = i + di[d], nj = j + dj[d]; if (ni >= 0 && ni < N && nj >= 0 && nj < M && cable[ni][nj]) adj[id].push_back(ni * M + nj); } } } int start = -1; for (int i = 0; i < N && start == -1; i++) for (int j = 0; j < M; j++) if (cable[i][j] && adj[i * M + j].size() == 1) { start = i * M + j; break; } vector visited(N * M, false); vector sum_h(N, 0), sum_v(M, 0); int curr = start, prevv = -1; visited[curr] = true; while (true) { int cr = curr / M, cc = curr % M; int nextt = -1; for (int nb : adj[curr]) if (nb != prevv && !visited[nb]) { nextt = nb; break; } if (is_cross[cr][cc] && prevv != -1) { int pr = prevv / M, pc = prevv % M; int sign = (grid[cr][cc] == 'C') ? 1 : -1; if (pr == cr) sum_v[cc] += ((pc < cc) ? 1 : -1) * sign; else sum_h[cr] += ((pr < cr) ? 1 : -1) * sign; } if (nextt == -1) break; prevv = curr; curr = nextt; visited[curr] = true; } long long answer = 0; for (int r : horizontal_rods) answer += abs(sum_h[r]) / 2; for (int c : vertical_rods) answer += abs(sum_v[c]) / 2; cout << answer; return 0; } Cable (c++)
01 Nov 2025, 03:27

Zoobin cpp
01 Nov 2025, 03:26

include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int a; cin >> a; vector> b(a), c(a); set d; for (int i = 0; i < a; i++) { cin >> b[i].first >> b[i].second; d.insert(b[i].first); d.insert(b[i].second); } for (int i = 0; i < a; i++) cin >> c[i].first >> c[i].second; vector e(d.begin(), d.end()); auto f = [](vector> g) { for (auto& [h, i] : g) if (h > i) swap(h, i); sort(g.begin(), g.end()); return g; }; auto j = [](const vector>& k) { string l; for (auto [m, n] : k) l += to_string(m) + "-" + to_string(n) + ","; return l; }; vector> o = f(c); string p = j(o); vector> q = f(b); string r = j(q); if (r == p) { cout << 0; return 0; } map s; queue>,int>> t; t.push({q,0}); s[r] = 0; while (!t.empty()) { auto [u,v] = t.front(); t.pop(); map> w; for (auto [x,y] : u) { w[x].push_back(y); w[y].push_back(x); } set> z; for (int aa : e) { function&,set&)> ab = [&](int ac,int ad,vector& ae,set& af) { ae.push_back(ac); af.insert(ac); for (int ag : w[ac]) { if (ag == ad) continue; if (af.count(ag)) { auto ah = find(ae.begin(), ae.end(), ag); if (ah != ae.end()) { vector ai(ah, ae.end()); if (ai.size() >= 3) { int aj = min_element(ai.begin(), ai.end()) - ai.begin(); rotate(ai.begin(), ai.begin() + aj, ai.end()); z.insert(ai); } } } else if (ae.size() < e.size()) ab(ag, ac, ae, af); } ae.pop_back(); af.erase(ac); }; vector ak; set al; ab(aa, -1, ak, al); } for (const auto& am : z) { map an; for (int ao : e) an[ao] = ao; int ap = am.size(); for (int aq = 0; aq < ap; aq++) an[am[aq]] = am[(aq + 1) % ap]; vector> ar; for (auto [as, at] : u) ar.push_back({an[as], an[at]}); ar = f(ar); string au = j(ar); if (au == p) { cout << v + 1; return 0; } if (!s.count(au)) { s[au] = v + 1; t.push({ar, v + 1}); } } } cout << -1; return 0; }
01 Nov 2025, 03:25

else t = (p.y - A.y) / dy; } withT.push_back({t, p}); } sort(withT.begin(), withT.end(), [](const pair&a, const pair&b){ return a.first < b.first; }); for (size_t k=1;k visited(V,0); vector path; set cyclesSeen; bool anyCycle = false; const double EPS_COMPARE = 1e-7; auto cycleKeyCanon = [&](const vector &c)->string{ int n = c.size(); int minpos = 0; for (int i=1;i r1; for (int i=0;i r2; for (int i=0;i> foundCycles; function dfs = [&](int start, int u){ for (int v : adj[u]){ if (v == start && path.size() >= 3){ vector cycle = path; string key = cycleKeyCanon(cycle); if (!cyclesSeen.count(key)){ cyclesSeen.insert(key); foundCycles.push_back(cycle); } anyCycle = true; continue; } if (!visited[v] && v > start){ visited[v] = 1; path.push_back(v); dfs(start, v); path.pop_back(); visited[v] = 0; } } }; for (int s=0;s poly; for (int id : cycle) poly.push_back(nodes[id]); double areaK = polygonArea(poly); if (areaK <= EPS) continue; double usedPerim = 0.0; for (int i=0;i areaC + EPS_COMPARE){ cout<<"Kalyan"; return 0; } } cout<<"Computer"; return 0; }
01 Nov 2025, 03:24

include <iostream> #include <vector> #include <string> #include <cmath> #include <iomanip> #include <sstream> #include <unordered_map> #include <algorithm> #include <set> #include <functional> using namespace std; const double EPS = 1e-9; const double PI = acos(-1.0); struct P { double x,y; }; struct Seg { P a,b; }; double cross(const P &u, const P &v){ return u.x*v.y - u.y*v.x; } P operator-(const P &a, const P &b){ return {a.x-b.x, a.y-b.y}; } double dot(const P&a,const P&b){ return a.x*b.x + a.y*b.y; } bool eq(double a,double b){ return fabs(a-b) < EPS; } bool onSeg(const P &a, const P &b, const P &p){ if (!eq(cross(b-a, p-a), 0.0)) return false; if (p.x < min(a.x,b.x)-EPS || p.x > max(a.x,b.x)+EPS) return false; if (p.y < min(a.y,b.y)-EPS || p.y > max(a.y,b.y)+EPS) return false; return true; } bool lineIntersect(const P &p1, const P &p2, const P &p3, const P &p4, P &out){ P r = p2 - p1; P s = p4 - p3; double rxs = cross(r, s); double qpxr = cross(p3 - p1, r); if (fabs(rxs) < EPS) return false; double t = cross(p3 - p1, s) / rxs; out = { p1.x + t * r.x, p1.y + t * r.y }; return true; } double dist(const P &a, const P &b){ double dx = a.x - b.x, dy = a.y - b.y; return sqrt(dx*dx + dy*dy); } string keyPt(const P &p){ ostringstream oss; oss<<fixed<<setprecision(8)<<p.x<<","<<p.y; return oss.str(); } double polygonArea(const vector<P> &poly){ int n = poly.size(); if (n < 3) return 0.0; double a = 0; for (int i=0;i<n;i++){ int j=(i+1)%n; a += poly[i].x*poly[j].y - poly[j].x*poly[i].y; } return fabs(a)/2.0; } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int N; if(!(cin>>N)) return 0; vector<Seg> segs(N); double totalLen = 0.0; for (int i=0;i<N;i++){ cin>>segs[i].a.x>>segs[i].a.y>>segs[i].b.x>>segs[i].b.y; totalLen += dist(segs[i].a, segs[i].b); } vector<vector<P>> ptsOnSeg(N); for (int i=0;i<N;i++){ ptsOnSeg[i].push_back(segs[i].a); ptsOnSeg[i].push_back(segs[i].b); } for (int i=0;i<N;i++){ for (int j=i+1;j<N;j++){ P inter; bool linesInt = lineIntersect(segs[i].a, segs[i].b, segs[j].a, segs[j].b, inter); if (linesInt){ if (onSeg(segs[i].a, segs[i].b, inter) && onSeg(segs[j].a, segs[j].b, inter)){ ptsOnSeg[i].push_back(inter); ptsOnSeg[j].push_back(inter); } } else { } } } unordered_map<string,int> nodeId; vector<P> nodes; vector<vector<int>> adj; auto addNode = [&](const P &p)->int{ string k = keyPt(p); auto it = nodeId.find(k); if (it!=nodeId.end()) return it->second; int id = nodes.size(); nodes.push_back(p); nodeId[k] = id; adj.emplace_back(); return id; }; for (int i=0;i<N;i++){ auto &vec = ptsOnSeg[i]; sort(vec.begin(), vec.end(), [](const P &u, const P &v){ if (!eq(u.x, v.x)) return u.x < v.x; return u.y < v.y; }); vector<P> uniquePts; for (auto &p : vec){ if (uniquePts.empty() fabs(p.x - uniquePts.back().x) > 1e-7 fabs(p.y - uniquePts.back().y) > 1e-7) uniquePts.push_back(p); } if (uniquePts.size() < 2) continue; P A = segs[i].a, B = segs[i].b; double dx = B.x - A.x, dy = B.y - A.y; vector<pair<double,P>> withT; for (auto &p : uniquePts){ double t; if (fabs(dx) >= fabs(dy)){ if (fabs(dx) < EPS) t = 0.0; else t = (p.x - A.x) / dx; } else { if (fabs(dy) < EPS) t = 0.0;
01 Nov 2025, 03:24

#include <bits/stdc++.h> using namespace std; long long fn(const vector<array<int,4>>& rs, int lo, int hi, int ax) {     int i1 = (ax == 0 ? 0 : 1), i2 = (ax == 0 ? 2 : 3);     set<int> st{lo, hi};     for (auto &r : rs) { st.insert(r[i1]); st.insert(r[i2]); }     vector<int> a(st.begin(), st.end());     vector<int> vf;     for (int x : a) {         bool ok = true;         for (auto &r : rs) if (r[i1] < x && x < r[i2]) { ok = false; break; }         if (ok) vf.push_back(x);     }     long long ans = (long long)1e18;     for (size_t i = 0; i + 1 < vf.size(); ++i) {         int d = vf[i+1] - vf[i];         if (d == 1) return 1;         if (d < ans) ans = d;     }     for (size_t i = 0; i + 1 < a.size(); ++i) {         int x = a[i], y = a[i+1];         if (y - x <= 1) continue;         bool bad = false;         for (auto &r : rs) if (r[i1] <= x && y <= r[i2]) { bad = true; break; }         if (!bad) return 1;     }     return ans; } int main() {     ios::sync_with_stdio(false);     cin.tie(nullptr);     int n;     if (!(cin >> n)) return 0;     vector<array<int,4>> rs(n);     for (int i = 0; i < n; ++i) cin >> rs[i][0] >> rs[i][1] >> rs[i][2] >> rs[i][3];     int ox1, oy1, ox2, oy2;     cin >> ox1 >> oy1 >> ox2 >> oy2;     long long w = fn(rs, ox1, ox2, 0);     long long h = fn(rs, oy1, oy2, 1);     cout << (w * h) << '\n';     return 0; } Smallest Region Code done βœ…βœ… Share with Friends .Don't MissπŸ˜Šβœ… https://t.me/coding_are
01 Nov 2025, 03:22

import sys from collections import defaultdict def main(): a = list(map(int, sys.stdin.read().strip().split())) i = 0 n = a[i]; i += 1 sl = [] for _ in range(n): x1, y1, x2, y2 = a[i:i+4]; i += 4 sl.append((x1, y1, x2, y2)) sx, sy, e = a[i], a[i+1], a[i+2] g = defaultdict(list) nx = {} for s, (x1, y1, x2, y2) in enumerate(sl): dx = 1 if x2 > x1 else -1 dy = 1 if y2 > y1 else -1 L = abs(x2 - x1) if dy == -1: for k in range(L): x = x1 + dx * k y = y1 - k g[(x, y)].append(s) nx[(x, y, s)] = (x + dx, y - 1) g[(x2, y2)].append(s) else: for k in range(L): x = x2 - dx * k y = y2 - k g[(x, y)].append(s) nx[(x, y, s)] = (x - dx, y - 1) g[(x1, y1)].append(s) def fall(x, y): for yy in range(y - 1, -1, -1): if (x, yy) in g: return x, yy return x, 0 x, y = sx, sy if (x, y) not in g: x, y = fall(x, y) while True: if y == 0: break if (x, y) not in g: x, y = fall(x, y) continue ids = g[(x, y)] if len(ids) == 1: s = ids[0] if (x, y, s) not in nx: x, y = fall(x, y) continue if e == 0: break e -= 1 x, y = nx[(x, y, s)] else: c = x * y dn = [(s, nx[(x, y, s)]) for s in ids if (x, y, s) in nx] if e <= c: if not dn: x, y = fall(x, y) continue break e -= c if not dn: x, y = fall(x, y) continue bx, by = None, -1 for s, (xx, yy) in dn: if yy > by: bx, by = xx, yy if e == 0: break e -= 1 x, y = bx, by print(x, y) if name == "main": main() GRAVITY GLIDE βœ… SHARE CHANNEL TO UR FRIENDS https://t.me/coding_are
01 Nov 2025, 03:17

#include <bits/stdc++.h> using namespace std; using ll = long long; using P = pair<ll,ll>; static vector<P> merge_itv(vector<P> v){ sort(v.begin(), v.end()); vector<P> r; for(auto &p: v){ if(r.empty() || p.first > r.back().second){ r.push_back(p); }else{ if(p.second > r.back().second) r.back().second = p.second; } } return r; } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n; if(!(cin >> n)) return 0; map<ll, vector<P>> hv; map<ll, vector<P>> vv; for(int i=0;i<n;i++){ ll x1,y1,x2,y2; cin >> x1 >> y1 >> x2 >> y2; if(y1 == y2){ if(x1 > x2) swap(x1,x2); hv[y1].push_back({x1,x2}); }else{ if(y1 > y2) swap(y1,y2); vv[x1].push_back({y1,y2}); } } struct H { ll y,l,r; }; vector<H> hs; for(auto &e: hv){ ll y = e.first; auto m = merge_itv(e.second); for(auto &q: m) hs.push_back({y, q.first, q.second}); } struct V { ll x,yb,yt; }; vector<V> vs; for(auto &e: vv){ ll x = e.first; auto m = merge_itv(e.second); for(auto &q: m) vs.push_back({x, q.first, q.second}); } int h = (int)hs.size(); int v = (int)vs.size(); int w = (h + 63) >> 6; vector<vector<unsigned long long>> msk(v, vector<unsigned long long>(w, 0ULL)); for(int i=0;i<v;i++){ ll x = vs[i].x, yb = vs[i].yb, yt = vs[i].yt; for(int j=0;j<h;j++){ const auto &hh = hs[j]; if(yb <= hh.y && hh.y <= yt && hh.l <= x && x <= hh.r){ int b = j >> 6, o = j & 63; msk[i][b] |= (1ULL << o); } } } long long ans = 0; for(int i=0;i<v;i++){ for(int j=i+1;j<v;j++){ long long k = 0; for(int b=0;b<w;b++){ unsigned long long x = msk[i][b] & msk[j][b]; k += __builtin_popcountll(x); } if(k >= 2) ans += k*(k-1)/2; } } cout << ans << "\n"; return 0; } *Shape Counts* 😍😍 *Join & Share this channel in your College groups For Placement Help* https://t.me/coding_are
01 Nov 2025, 02:47

#include <bits/stdc++.h> using namespace std; struct P { int x, y; bool operator==(const P &o) const { return x == o.x && y == o.y; } }; struct PH { size_t operator()(P const &p) const { return (uint64_t(uint32_t(p.x)) << 32) ^ uint32_t(p.y); } }; struct K { int x, y, s; bool operator==(const K &o) const { return x == o.x && y == o.y && s == o.s; } }; struct KH { size_t operator()(K const &k) const { uint64_t h = k.x; h = (h << 21) ^ k.y; h = (h << 21) ^ k.s; return size_t(h); } }; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); vector<long long> a; long long v; while (cin >> v) a.push_back(v); int i = 0; int n = (int)a[i++]; vector<array<int,4>> sl(n); for (int j = 0; j < n; j++) { sl[j][0] = (int)a[i++]; sl[j][1] = (int)a[i++]; sl[j][2] = (int)a[i++]; sl[j][3] = (int)a[i++]; } int sx = (int)a[i++], sy = (int)a[i++], e = (int)a[i++]; unordered_map<P, vector<int>, PH> g; unordered_map<K, pair<int,int>, KH> nx; for (int s = 0; s < n; s++) { int x1 = sl[s][0], y1 = sl[s][1], x2 = sl[s][2], y2 = sl[s][3]; int dx = (x2 > x1) ? 1 : -1; int dy = (y2 > y1) ? 1 : -1; int L = abs(x2 - x1); if (dy == -1) { for (int k = 0; k < L; k++) { int x = x1 + dx * k; int y = y1 - k; g[{x,y}].push_back(s); nx[{x,y,s}] = {x + dx, y - 1}; } g[{x2,y2}].push_back(s); } else { for (int k = 0; k < L; k++) { int x = x2 - dx * k; int y = y2 - k; g[{x,y}].push_back(s); nx[{x,y,s}] = {x - dx, y - 1}; } g[{x1,y1}].push_back(s); } } auto fall = [&](int x, int y) -> pair<int,int> { for (int yy = y - 1; yy >= 0; yy--) { auto it = g.find({x, yy}); if (it != g.end()) return {x, yy}; } return {x, 0}; }; int x = sx, y = sy; if (g.find({x,y}) == g.end()) { auto p = fall(x, y); x = p.first; y = p.second; } while (true) { if (y == 0) break; auto it = g.find({x,y}); if (it == g.end()) { auto p = fall(x, y); x = p.first; y = p.second; continue; } auto &ids = it->second; if (ids.size() == 1) { int s = ids[0]; auto it2 = nx.find({x,y,s}); if (it2 == nx.end()) { auto p = fall(x, y); x = p.first; y = p.second; continue; } if (e == 0) break; e--; x = it2->second.first; y = it2->second.second; } else { long long c = 1LL * x * y; vector<pair<int,pair<int,int>>> dn; dn.reserve(ids.size()); for (int s : ids) { auto it3 = nx.find({x,y,s}); if (it3 != nx.end()) dn.push_back({s, it3->second}); } if ((long long)e <= c) { if (dn.empty()) { auto p = fall(x, y); x = p.first; y = p.second; continue; } break; } e -= (int)c; if (dn.empty()) { auto p = fall(x, y); x = p.first; y = p.second; continue; } int bx = 0, by = -1; for (auto &qq : dn) { int xx = qq.second.first; int yy = qq.second.second; if (yy > by) { by = yy; bx = xx; } } if (e == 0) break; e--; x = bx; y = by; } } cout << x << " " << y; return 0; } Gravity Code βœ…βœ… Share our channel Fast https://t.me/coding_are
01 Nov 2025, 02:32

Uno Code #include <bits/stdc++.h> using namespace std; int findp(int x, vector<int>& p) { return p[x] == x ? x : p[x] = findp(p[x], p); } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<string> names(n); for (int i = 0; i < n; i++) cin >> names[i]; vector<int> skill(n); for (int i = 0; i < n; i++) cin >> skill[i]; unordered_map<string, int> id; for (int i = 0; i < n; i++) id[names[i]] = i; int f; cin >> f; vector<int> p(n); iota(p.begin(), p.end(), 0); for (int i = 0; i < f; i++) { string a, b; cin >> a >> b; int x = findp(id[a], p), y = findp(id[b], p); if (x != y) p[y] = x; } unordered_map<int, vector<int>> clusters; for (int i = 0; i < n; i++) clusters[findp(i, p)].push_back(i); vector<vector<int>> group; vector<int> groupSkill, groupSize; for (auto& [r, v] : clusters) { group.push_back(v); int s = 0; for (int x : v) s += skill[x]; groupSkill.push_back(s); groupSize.push_back(v.size()); } int r; cin >> r; int m = group.size(); vector<vector<int>> rival(m); unordered_map<int, int> idx; { int i = 0; for (auto& [root, _] : clusters) idx[root] = i++; } for (int i = 0; i < r; i++) { string a, b; cin >> a >> b; int ga = idx[findp(id[a], p)]; int gb = idx[findp(id[b], p)]; if (ga != gb) { rival[ga].push_back(gb); rival[gb].push_back(ga); } } int limit; cin >> limit; int best = 0; int total = 1 << m; for (int mask = 0; mask < total; mask++) { int sumSkill = 0, count = 0; bool valid = true; for (int i = 0; i < m && valid; i++) { if (mask & (1 << i)) { for (int x : rival[i]) { if (mask & (1 << x)) { valid = false; break; } } sumSkill += groupSkill[i]; if (sumSkill > limit) { valid = false; break; } count += groupSize[i]; } } if (valid) best = max(best, count); } cout << best; return 0; } Uno Code βœ… βœ… All Passed πŸ’―πŸ’―βœ…βœ… Share our channel Fast https://t.me/coding_are
01 Nov 2025, 02:27

C++ Cable Wrap TCS CodeVita Zone 2 #include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int N, M; cin >> N >> M; vector<string> grid(N); for (int i = 0; i < N; i++) { grid[i].resize(M); for (int j = 0; j < M; j++) { cin >> grid[i][j]; } } vector<int> horizontal_rods, vertical_rods; for (int i = 0; i < N; i++) { if (all_of(grid[i].begin(), grid[i].end(), [](char c){ return c != '.'; })) horizontal_rods.push_back(i); } for (int j = 0; j < M; j++) { bool full = true; for (int i = 0; i < N; i++) if (grid[i][j] == '.') full = false; if (full) vertical_rods.push_back(j); } vector<vector<bool>> is_cross(N, vector<bool>(M, false)); for (int c : vertical_rods) { for (int i = 0; i < N; i++) { int left = c - 1, right = c + 1; if (left >= 0 && right < M && grid[i][left] == 'C' && grid[i][right] == 'C') is_cross[i][c] = true; } } for (int r : horizontal_rods) { for (int j = 0; j < M; j++) { int up = r - 1, down = r + 1; if (up >= 0 && down < N && grid[up][j] == 'C' && grid[down][j] == 'C') is_cross[r][j] = true; } } vector<vector<bool>> cable(N, vector<bool>(M, false)); for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) if (grid[i][j] == 'C' || is_cross[i][j]) cable[i][j] = true; vector<vector<int>> adj(N * M); int di[4] = {-1, 0, 1, 0}; int dj[4] = {0, 1, 0, -1}; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { if (!cable[i][j]) continue; int id = i * M + j; for (int d = 0; d < 4; d++) { int ni = i + di[d], nj = j + dj[d]; if (ni >= 0 && ni < N && nj >= 0 && nj < M && cable[ni][nj]) adj[id].push_back(ni * M + nj); } } } int start = -1; for (int i = 0; i < N && start == -1; i++) for (int j = 0; j < M; j++) if (cable[i][j] && adj[i * M + j].size() == 1) { start = i * M + j; break; } vector<bool> visited(N * M, false); vector<int> sum_h(N, 0), sum_v(M, 0); int curr = start, prevv = -1; visited[curr] = true; while (true) { int cr = curr / M, cc = curr % M; int nextt = -1; for (int nb : adj[curr]) if (nb != prevv && !visited[nb]) { nextt = nb; break; } if (is_cross[cr][cc] && prevv != -1) { int pr = prevv / M, pc = prevv % M; int sign = (grid[cr][cc] == 'C') ? 1 : -1; if (pr == cr) sum_v[cc] += ((pc < cc) ? 1 : -1) * sign; else sum_h[cr] += ((pr < cr) ? 1 : -1) * sign; } if (nextt == -1) break; prevv = curr; curr = nextt; visited[curr] = true; } long long answer = 0; for (int r : horizontal_rods) answer += abs(sum_h[r]) / 2; for (int c : vertical_rods) answer += abs(sum_v[c]) / 2; cout << answer; return 0; } C++ Cable Wrap TCS CodeVita Zone 2 https://t.me/coding_are
01 Nov 2025, 02:26

Ubs exam successfully completed by remote access πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘ 1/1 code done with all tests cases passed βœ…βœ…βœ…βœ… 27/27 mce do
+2
Ubs exam successfully completed by remote access πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘ 1/1 code done with all tests cases passed βœ…βœ…βœ…βœ… 27/27 mce done with πŸ’― correct answer βœ… Contact for placement exam @srksvk
31 Oct 2025, 13:30

Accenture on campus exam successfully completed by remote access πŸ‘πŸ‘πŸ‘πŸ‘ 90/90 MCQ done βœ… and first round CLEARED πŸŽ‰ πŸ₯³ πŸ₯³ οΏ½
+2
Accenture on campus exam successfully completed by remote access πŸ‘πŸ‘πŸ‘πŸ‘ 90/90 MCQ done βœ… and first round CLEARED πŸŽ‰ πŸ₯³ πŸ₯³ πŸ₯³ πŸ₯³ πŸ₯³ πŸ₯³ πŸ₯³ πŸ₯³ 2/2 code done with all tests case's passed πŸ”₯ πŸ₯³ Contact for placement exam @srksvk
31 Oct 2025, 04:12

Accenture on campus Accolite IBM Amazon Capgemini Any off campus or on campus exam  help available Contact fast and book your slots Contact @srksvk 200% suree clearance grauntee πŸ”₯   Remote access available All company interview help available with sure clearance gaurntee
30 Oct 2025, 01:15

Capgemini exam CLEARED πŸŽ‰πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³ Congratulations bro πŸŽ‰πŸŽ‰πŸŽ‰πŸŽ‰πŸŽ‰πŸŽ‰πŸŽ‰ Helped proof πŸ‘‡πŸ‘‡πŸ‘‡ Co
+1
Capgemini exam CLEARED πŸŽ‰πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³πŸ₯³ Congratulations bro πŸŽ‰πŸŽ‰πŸŽ‰πŸŽ‰πŸŽ‰πŸŽ‰πŸŽ‰ Helped proof πŸ‘‡πŸ‘‡πŸ‘‡ Contact for placement exam @srksvk
29 Oct 2025, 12:42

Eurofin exam successfully completed by remote access πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘ 2/2 code done with all tests cases passedβœ… 42/42 MCQ done
+5
Eurofin exam successfully completed by remote access πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘ 2/2 code done with all tests cases passedβœ… 42/42 MCQ done with πŸ’― correct answer βœ…βœ… Contact for placement exam @srksvk
29 Oct 2025, 12:37

Black and green exam successfully completed by remote access πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘ 196/196 question done with πŸ’― correct answer πŸ”₯ Conta
+1
Black and green exam successfully completed by remote access πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘ 196/196 question done with πŸ’― correct answer πŸ”₯ Contact for placement exam @srksvk
29 Oct 2025, 06:39

Visa exam successfully completed by remote access πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘ 4/4 code done with all tests cases passed βœ…βœ… Contact for p
+4
Visa exam successfully completed by remote access πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘πŸ‘ 4/4 code done with all tests cases passed βœ…βœ… Contact for placement exam @srksvk 200% suree clearance gaurntee
28 Oct 2025, 12:57