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
const int MOD 1000000007; int subsetSumCount(const vector& A, int L, int R, int K) { vector dp(K+1, 0); dp[0] = 1; for (int i=L; i<=R; ++i) { for (int j = K; j >= A[1]; --j) { dp[j] = (dp[j] + dp[j- A[i]]) % MOD; } } return dp[K];} int findXOR(int n, int Q, const vector& A, const vector>& B) { int result = 0; for (const auto& query: B) { int L= query [0] - 1; int R= query [1] -1; int K = query[2]; int P=subsetSumCount(A,L,R,K); result ^= P; } return result; } Subset sum Fully passed ✅✅✅✅ Just paste it
06 Iyul 2024, 04:04

Share with your Friends and in Big groups we will definitely post answers here We will Try to share Some answers Here also in our Groups. So must Join 1) @codeing_area 2) @codeing_area 3) @codeing_area
06 Iyul 2024, 03:59

#include <bits/stdc++.h> using namespace std; #define ll long long const ll MOD=1e9+7; struct FenwickTree { vector<ll> bit; ll n; FenwickTree(ll size) { n = size; bit.assign(n + 1, 0); } void update(ll idx, ll val) { for (; idx <= n; idx += idx & -idx) bit[idx] = max(bit[idx], val); } ll query(ll idx) { ll res = 0; for (; idx > 0; idx -= idx & -idx) res = max(res, bit[idx]); return res; } }; ll solve(vector<ll>& a) { ll n=a.size(); vector<pair<ll,ll>>ia(n); for (ll i=0;i<n;i++) { ia[i] = make_pair(a[i], i); } sort(ia.begin(),ia.end(),[](const pair<ll,ll>&p1,const pair<ll,ll>&p2) { return p1.first<p2.first; }); FenwickTree fenwick(n); ll maxBeauty=0; for (ll i=0;i<n;i++) { ll val=ia[i].first; ll og=ia[i].second; ll beauty=0; for (ll j=og-1;j>=0;j--) { if (__gcd(abs(a[j]),abs(a[og]))>1) { beauty=max(beauty,fenwick.query(j+1)+(a[og]-a[j])*(a[og]-a[j]) % MOD); } } fenwick.update(og + 1, beauty); maxBeauty = max(maxBeauty, beauty); } return maxBeauty; } signed main() { ll n; cin>>n; vector<ll>a(n); for (ll i=0;i<n;i++) cin>>a[i]; cout<<solve(a)<<endl; return 0; } subsequence beauty Share group @srksvk
06 Iyul 2024, 03:55

Share guy's @codeing_area
06 Iyul 2024, 03:51

Share everyone for answer 🙏 @codeing_area
06 Iyul 2024, 03:48

dp[i+1][0][0][(j + addv)%k][pv+1] += dp[i][1][0][j][pv]; dp[i+1][0][0][(j + addv)%k][pv+1] %= mod; } else{ dp[i+1][1][0][(j + addv)%k][pv+1] += dp[i][1][0][j][pv]; dp[i+1][1][0][(j + addv)%k][pv+1] %= mod; } // le = 0, re = 1 if(r[i] == '0'){ dp[i+1][0][1][j][pv-1] += dp[i][0][1][j][pv]; dp[i+1][0][1][j][pv-1] %= mod; } else{ dp[i+1][0][1][(j + addv)%k][pv+1] += dp[i][0][1][j][pv]; dp[i+1][0][1][(j + addv)%k][pv+1] %= mod; dp[i+1][0][0][j][pv-1] += dp[i][0][1][j][pv]; dp[i+1][0][0][j][pv-1] %= mod; } // le = 0, re = 0 dp[i+1][0][0][j][pv-1] += dp[i][0][0][j][pv]; dp[i+1][0][0][j][pv-1] %= mod; dp[i+1][0][0][(j + addv)%k][pv+1] += dp[i][0][0][j][pv]; dp[i+1][0][0][(j + addv)%k][pv+1] %= mod; } } } } int ans = 0; for(int i = 0; i <= n; i++){ for(int j = 0; j < 2; j++){ for(int z = 0; z < 2; z++){ ans += dp[n][j][z][0][i]; ans %= mod; } } } return ans; } int32_t main(){ cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); int m, n, k; cin>>m>>n>>k; string l, r; cin>>l>>r; cout<
06 Iyul 2024, 03:47

Share the group ✅✅⏩ Fast for next answer
06 Iyul 2024, 03:43

import sys MOD = 1000000007 def getCount(N, M, S):     dp = [[[0] * (M + 1) for _ in range(N + 1)] for _ in range(N + 1)]     dp[0][0][0] = 1         for i in range(N):         for j in range(N + 1):             for k in range(M + 1):                 if dp[i][j][k] == 0:                     continue                                 if j + 1 <= N:                     if k < M and S[k] == '(':                         dp[i + 1][j + 1][k + 1] = (dp[i + 1][j + 1][k + 1] + dp[i][j][k]) % MOD                     else:                         dp[i + 1][j + 1][k] = (dp[i + 1][j + 1][k] + dp[i][j][k]) % MOD                                 if j > 0:                     if k < M and S[k] == ')':                         dp[i + 1][j - 1][k + 1] = (dp[i + 1][j - 1][k + 1] + dp[i][j][k]) % MOD                     else:                         dp[i + 1][j - 1][k] = (dp[i + 1][j - 1][k] + dp[i][j][k]) % MOD         return dp[N][0][M] def main():     N = int(sys.stdin.readline().strip())     M = int(sys.stdin.readline().strip())     S = sys.stdin.readline().strip()         result = getCount(N, M, S)         print(result) if name == "main":     main() Bracket sequence,✅✅✅✅
06 Iyul 2024, 03:42

Pre bookings slot help successfully done ... Now I will upload answer... guy's just share group fast ⏩⏩⏩
06 Iyul 2024, 03:39

String container Fully passed 🔥🔥🔥 Infosys 🔥🔥 All three code done 😎😎😎
String container Fully passed 🔥🔥🔥 Infosys 🔥🔥 All three code done 😎😎😎
06 Iyul 2024, 03:38

Share with your Friends and in Big groups we will definitely post answers here We will Try to share Some answers Here also in our Groups. So must Join 1) @codeing_area 2) @codeing_area 3) @codeing_area
06 Iyul 2024, 03:08

Don't ask these code everyone... Note:: This one prebooking 👍👍👍 So I am not share these code... because plug 👍👍
06 Iyul 2024, 02:59

Count Travel routers 🔥🔥🔥🔥🔥 Fully passed ✅✅✅✅
Count Travel routers 🔥🔥🔥🔥🔥 Fully passed ✅✅✅✅
06 Iyul 2024, 02:57

Infosys 🔥🔥🔥🔥🔥 Cost of string s Fully ✅✅✅
Infosys 🔥🔥🔥🔥🔥 Cost of string s Fully ✅✅✅
06 Iyul 2024, 02:56

Just share group everyone ✅🥺😀 If you want more answers 😜
06 Iyul 2024, 02:30

100% running code
06 Iyul 2024, 02:29

const int MOD = 1000000007; int subsetSumCount(const vector& A, int L, int R, int K) { vector dp(K + 1, 0); dp[0] = 1; for (int i = L; i <= R; ++i) { for (int j = K; j >= A[i]; --j) { dp[j] = (dp[j] + dp[j - A[i]]) % MOD; } } return dp[K]; } int findXOR(int n, int Q, const vector& A, const vector>& B ) { int result = 0; for (const auto& query : B ) { int L = query[0] - 1; int R = query[1] - 1; int K = query[2]; int P = subsetSumCount(A, L, R, K); result ^= P; } return result; } //subarray subset sum
06 Iyul 2024, 02:29

#include <bits/stdc++.h> #define int long long using namespace std; #define ll long long ll solve(ll n,ll k,vector<ll>&a) { k++; unordered_map<ll,ll>freq; map<ll,vector<ll>>mpp; for (ll i=0;i<n;i++) { freq[a[i]]++; mpp[freq[a[i]]].push_back(a[i]); } ll ans=0; for (auto it:mpp) ans+=it.second.size(); return ans; } signed main() { ll n,k; cin>>n>>k; vector<ll>a(n); for(ll i=0;i<n;i++) cin>>a[i]; cout<<solve(n,k,a); return 0; } sequence split (Infosys) 100💯✅ running
06 Iyul 2024, 02:27

So do fastt
06 Iyul 2024, 02:24

I will upload code 💯% running
06 Iyul 2024, 02:24