ACCENTURE EXAM SOLUTIONS
Kanalga Telegram’da o‘tish
🔥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
Ko'proq ko'rsatish📈 Telegram kanali ACCENTURE EXAM SOLUTIONS analitikasi
ACCENTURE EXAM SOLUTIONS (@coding_are) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 14 128 obunachidan iborat bo'lib, Taʼlim toifasida 14 097-o'rinni va Hindiston mintaqasida 28 067-o'rinni egallagan.
📊 Auditoriya ko‘rsatkichlari va dinamika
невідомо sanasidan buyon loyiha tez o‘sib, 14 128 obunachiga ega bo‘ldi.
26 Sentabr, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -112 ga, so‘nggi 24 soatda esa -6 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.
- Tasdiqlash holati: Tasdiqlanmagan
- Jalb etish (ER): Auditoriya o‘rtacha 3.64% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 1.54% ini tashkil etuvchi reaksiyalarni to‘playdi.
- Post qamrovi: Har bir post o‘rtacha 514 marta ko‘riladi; birinchi sutkada odatda 218 ta ko‘rish yig‘iladi.
- Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 2 ta reaksiya keladi.
- Tematik yo‘nalishlar: Kontent placement, gaurntee, suree, capgemini, infosy kabi asosiy mavzularga jamlangan.
📝 Tavsif va kontent siyosati
Muallif resursni shaxsiy fikrni ifoda etish maydoni sifatida ta’riflaydi:
“🔥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...”
Yuqori yangilanish chastotasi (oxirgi ma’lumot 27 Sentabr, 2026 da olingan) sababli kanal doimo dolzarb va katta qamrovli bo‘lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni Taʼlim toifasidagi muhim ta’sir nuqtasiga aylantirishini ko‘rsatadi.
14 128
Obunachilar
-624 soatlar
-127 kun
-11230 kun
Postlar arxiv
14 128
#include <bits/stdc++.h>
bool isInside(int x, int y, const vector<pair<int, int>>& verts) {
int cross = 0, N = verts.size();
for(int i = 0; i < N; ++i){
int x1 = verts[i].first, y1 = verts[i].second;
int x2 = verts[(i+1)%N].first, y2 = verts[(i+1)%N].second;
if(((y1 <= y) && (y2 > y)) || ((y2 <= y) && (y1 > y))){
double ix = x1 + (double)(y - y1) * (x2 - x1) / (y2 - y1);
if(ix > x) cross++;
}
}
return (cross % 2) != 0;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<pair<int, int>> verts(N);
int minX = INT32_MAX, maxX = INT32_MIN, minY = INT32_MAX, maxY = INT32_MIN;
for(auto &p : verts){
cin >> p.first >> p.second;
minX = min(minX, p.first);
maxX = max(maxX, p.first);
minY = min(minY, p.second);
maxY = max(maxY, p.second);
}
int M;
cin >> M;
int w = maxX - minX + 1, h = maxY - minY + 1;
vector<vector<int>> grid(h, vector<int>(w, 0));
for(int y = minY; y < maxY; ++y){
for(int x = minX; x < maxX; ++x){
if(isInside(x + 0.5, y + 0.5, verts)){
grid[y - minY][x - minX] = 1;
}
}
}
vector<pair<int, int>> cells;
for(int i=0;i<h;i++) {
for(int j=0;j<w;j++) {
if(grid[i][j]==1){
cells.emplace_back(i,j);
}
}
}
sort(cells.begin(), cells.end());
int minPresses = INT32_MAX;
function<void(int, vector<vector<int>>&, int)> backtrack = & {
if(presses >= minPresses) return;
while(idx < cells.size() && curGrid[cells[idx].first][cells[idx].second]==0){
idx++;
}
if(idx == cells.size()){
minPresses = min(minPresses, presses);
return;
}
int y = cells[idx].first, x = cells[idx].second;
bool canPlace = true;
for(int dy=0; dy<M && canPlace; dy++){
for(int dx=0; dx<M && canPlace; dx++){
int ny = y + dy, nx = x + dx;
if(ny >= h nx >= w curGrid[ny][nx]==0) canPlace = false;
}
}
if(canPlace){
vector<vector<int>> newGrid = curGrid;
for(int dy=0; dy<M; dy++){
for(int dx=0; dx<M; dx++){
int ny = y + dy, nx = x + dx;
if(ny < h && nx < w) newGrid[ny][nx] = 0;
}
}
backtrack(idx +1, newGrid, presses +1);
}
};
backtrack(0, grid, 0);
cout << minPresses;
}
COUNT PRESS
14 128
Plague
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
int countInfectedNeighbors(const vector<vector<int>>& grid, int x, int y) {
int n = grid.size();
int infected = 0;
for (int dx = -1; dx <= 1; dx++) {
for (int dy = -1; dy <= 1; dy++) {
if (dx == 0 && dy == 0) continue;
int nx = x + dx, ny = y + dy;
if (nx >= 0 && nx < n && ny >= 0 && ny < n && grid[nx][ny] == 1) {
infected++;
}
}
}
return infected;
}
vector<vector<int>> simulatePlague(const vector<vector<int>>& grid) {
int n = grid.size();
vector<vector<int>> nextGrid = grid;
for (int x = 0; x < n; x++) {
for (int y = 0; y < n; y++) {
int infected = countInfectedNeighbors(grid, x, y);
if (grid[x][y] == 0 && infected == 3) {
nextGrid[x][y] = 1;
} else if (grid[x][y] == 1) {
if (infected < 2 || infected > 3) {
nextGrid[x][y] = 0;
}
}
}
}
return nextGrid;
}
int solve(int n, vector<vector<char>>& initialGrid) {
vector<vector<int>> grid(n, vector<int>(n));
int startx = -1, starty = -1, destx = -1, desty = -1;
for (int x = 0; x < n; x++) {
for (int y = 0; y < n; y++) {
grid[x][y] = (initialGrid[x][y] == '1') ? 1 : 0;
if (initialGrid[x][y] == 's') {
startx = x;
starty = y;
grid[x][y] = 0;
}
if (initialGrid[x][y] == 'd') {
destx = x;
desty = y;
grid[x][y] = 0;
}
}
}
queue<tuple<int, int, vector<vector<int>>, int>> q;
set<tuple<int, int, vector<vector<int>>>> visited;
q.push({startx, starty, grid, 0});
while (!q.empty()) {
auto [x, y, current_grid, days] = q.front();
q.pop();
if (x == destx && y == desty) {
return days;
}
auto state_key = make_tuple(x, y, current_grid);
if (visited.count(state_key)) continue;
visited.insert(state_key);
vector<vector<int>> next_grid = simulatePlague(current_grid);
vector<pair<int, int>> moves = {{0,0}, {-1,0}, {1,0}, {0,-1}, {0,1}};
for (auto [dx, dy] : moves) {
int nx = x + dx, ny = y + dy;
if (nx >= 0 && nx < n && ny >= 0 && ny < n && next_grid[nx][ny] == 0) {
q.push({nx, ny, next_grid, days + 1});
}
}
}
return -1;
}
int main() {
int n;
cin >> n;
vector<vector<char>> grid(n, vector<char>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> grid[i][j];
}
}
cout << solve(n, grid)+1;
return 0;
}
Plague 2050
14 128
SEGMENT DISPLAY (FULLY ACCEPTED)✅
FOLLOW & SHARE OUR CHANNEL WE WILL UPLOAD MORE CODES ✅
14 128
NEED more TCS CODEVITA ANSWERS ?
Give heart to this post ❤️
Fully passed code 👍
14 128
https://t.me/codeing_are
Share group everyone ✅✅👍
I will desert queen code very soon with full passed
14 128
NEED more TCS CODEVITA ANSWERS ?
Give heart to this post ❤️
Fully passed code 👍
