uz
Feedback

Firibgarlarga uchmang! Telemetrio bunday kanallarni topadi va belgilaydi 👉 Belgini ko‘rmoqchi bo‘lsangiz, obuna bo‘ling

ACCENTURE EXAM SOLUTIONS

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 13 823 obunachidan iborat bo'lib, Taʼlim toifasida 14 760-o'rinni va Hindiston mintaqasida 28 177-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

невідомо sanasidan buyon loyiha tez o‘sib, 13 823 obunachiga ega bo‘ldi.

20 Noyabr, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -171 ga, so‘nggi 24 soatda esa 0 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.

  • Tasdiqlash holati: Tasdiqlanmagan
  • Jalb etish (ER): Auditoriya o‘rtacha 3.50% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 1.07% ini tashkil etuvchi reaksiyalarni to‘playdi.
  • Post qamrovi: Har bir post o‘rtacha 484 marta ko‘riladi; birinchi sutkada odatda 148 ta ko‘rish yig‘iladi.
  • Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 1 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 21 Noyabr, 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.

13 823
Obunachilar
Ma'lumot yo'q24 soatlar
-397 kun
-17130 kun
Postlar arxiv
class SegmentTree: def init(self, data): self.n = len(data) self.tree = [0] * (2 * self.n) self.build(data) def build(self, data): for i in range(self.n): self.tree[self.n + i] = data[i] for i in range(self.n - 1, 0, -1): self.tree[i] = max(self.tree[2 * i], self.tree[2 * i + 1]) def range_max(self, left, right): left += self.n right += self.n max_val = 0 while left < right: if left % 2: max_val = max(max_val, self.tree[left]) left += 1 if right % 2: right -= 1 max_val = max(max_val, self.tree[right]) left //= 2 right //= 2 return max_val def calculate_total_xp(N, A, Bonus): seg_tree = SegmentTree() seg_tree.init(Bonus) last_seen = [-1] * (N // 2 + 1) right_multiple = [-1] * N for i in range(N - 1, -1, -1): power = A[i] next_pos = float('inf') for multiple in range(power, N // 2 + 1, power): if last_seen[multiple] != -1: next_pos = min(next_pos, last_seen[multiple]) if next_pos != float('inf'): right_multiple[i] = next_pos last_seen[power] = i total_xp = 0 for i in range(N): if right_multiple[i] != -1: max_bonus = seg_tree.range_max(i, right_multiple[i] + 1) total_xp += max_bonus return total_xp N = int(input().strip()) A = [int(input().strip()) for _ in range(N)] Bonus = [int(input().strip()) for _ in range(N)] result = calculate_total_xp(N, A, Bonus) print(result) Some help
04 Avg 2024, 04:06
04 Avg 2024, ~06:06

#include <bits/stdc++.h> using namespace std; vector<int> sieve(int max_number) { vector<bool> is_prime(max_number + 1, true); vector<int> primes; for (int number = 2; number <= max_number; ++number) { if (is_prime[number]) { primes.push_back(number); for (int multiple = number * number; multiple <= max_number; multiple += number) { is_prime[multiple] = false; } } } return primes; } int count_divisors(int number, const vector<int>& primes) { int divisor_count = 0; int prime_count = primes.size(); for (int subset = 1; subset < (1 << prime_count); ++subset) { long long least_common_multiple = 1; int bit_count = 0; for (int bit = 0; bit < prime_count; ++bit) { if (subset & (1 << bit)) { least_common_multiple *= primes[bit]; bit_count++; if (least_common_multiple > number) break; } } if (least_common_multiple > number) continue; if (bit_count % 2 == 1) divisor_count += number / least_common_multiple; else divisor_count -= number / least_common_multiple; } return divisor_count; } int count_non_divisors(int number, const vector<int>& primes) { if (number == 0) return 0; return number - count_divisors(number, primes); } int count_non_divisors_range(int max_prime, int left, int right) { vector<int> primes = sieve(max_prime); int right_count = count_non_divisors(right, primes); int left_count = count_non_divisors(left - 1, primes); return right_count - left_count; } int main() { int max_prime; string left_str, right_str; cin >> max_prime >> left_str >> right_str; cout << count_non_divisors_range(max_prime, stoi(left_str), stoi(right_str)) << endl; return 0; } Divisible string
04 Avg 2024, 03:34
04 Avg 2024, ~06:10

?
04 Avg 2024, 03:27
04 Avg 2024, ~06:10

This one need
04 Avg 2024, 03:27
04 Avg 2024, ~06:10

Faatt
04 Avg 2024, 03:23
04 Avg 2024, ~06:10

Share group
04 Avg 2024, 03:23
04 Avg 2024, ~06:10

Want answer ?
04 Avg 2024, 03:20
04 Avg 2024, ~06:10

Don't message me yrrr
04 Avg 2024, 03:16
04 Avg 2024, ~06:10

photo content
04 Avg 2024, 02:50

Task management
04 Avg 2024, 02:45

photo content
04 Avg 2024, 02:45

Contact @srksvk
Contact @srksvk
04 Avg 2024, 02:43

First Contact @srksvk
First Contact @srksvk
04 Avg 2024, 02:43

It's paid
04 Avg 2024, 02:36
04 Avg 2024, ~06:10

Infosys codes❤️ 1) Army invasion 2) Disturbuting books 3) Count subtree factors code 4) Task management Contact @srksvk
All test cases passed✅
04 Avg 2024, 02:35
04 Avg 2024, ~06:10

Join here 👇👇👇👇👇👇👇👇👇 https://t.me/codeing_are https://t.me/codeing_are https://t.me/codeing_are https://t.me/codeing_are Shared Chanel and take code
04 Avg 2024, 02:32
04 Avg 2024, ~06:10

#include <iostream> #include <vector> #include <numeric> #define MOD 1000000007 using namespace std; long long mod_inv(long long x, long long mod) { long long result = 1; long long power = mod - 2; while (power) { if (power % 2) { result = result * x % mod; } x = x * x % mod; power /= 2; } return result; } vector<long long> factorial(int n, long long mod) { vector<long long> fact(n + 1, 1); for (int i = 2; i <= n; ++i) { fact[i] = fact[i - 1] * i % mod; } return fact; } long long binomial_coeff(int n, int k, const vector<long long>& fact, long long mod) { if (k > n || k < 0) { return 0; } return fact[n] * mod_inv(fact[k], mod) % mod * mod_inv(fact[n - k], mod) % mod; } long long count_ways(int N, int K, const vector<int>& A) { int sum_A = accumulate(A.begin(), A.end(), 0); int M = K - sum_A; vector<long long> fact = factorial(M + N - 1, MOD); return binomial_coeff(M + N - 1, N - 1, fact, MOD); } int main() { int N, K; cin >> N >> K; vector<int> A(N); for (int i = 0; i < N; ++i) { cin >> A[i]; } cout << count_ways(N, K, A) << endl; return 0; } DISTURBUTING BOOKS
04 Avg 2024, 02:30
04 Avg 2024, ~06:10

Change' variable
04 Avg 2024, 01:50
04 Avg 2024, ~06:10

#include<bits/stdc++.h> using namespace std; #define int long long int findMax(vector<int>& a, vector<int>& height, int n, int i, int h, vector<vector<int>>& dp) {     if (i >= n) return 0;     if (dp[i][h] != -1) return dp[i][h];         int vol = height[i] * a[i] * a[i];     int inc = 0;     int exc = 0;         if (vol > h) {         inc = vol + findMax(a, height, n, i + 1, vol, dp);     }     exc = findMax(a, height, n, i + 1, h, dp);         return dp[i][h] = max(inc, exc); } int32_t main() {     int n;     cin >> n;     vector<int> a(n);     for (int i = 0; i < n; i++) cin >> a[i];     vector<int> height(n);     for (int i = 0; i < n; i++) cin >> height[i];         int maxVol = 0;     for (int i = 0; i < n; i++) {         maxVol = max(maxVol, height[i] * a[i] * a[i]);     }     // Using the maximum possible value of h to size the dp table     vector<vector<int>> dp(n, vector<int>(maxVol + 1, -1));     int ans = findMax(a, height, n, 0, 0, dp);     cout << ans << endl;     return 0; } Volume of cylinder(c++ Share https://t.me/codeing_are https://t.me/codeing_are
04 Avg 2024, 01:49
04 Avg 2024, ~06:10

Don't send me questions personally...if I am done code then j will share...so please don't message me everyone's Only everyone share group ohk
04 Avg 2024, 01:46
04 Avg 2024, ~06:10