Вже доступно! Дослідження Telegram за 2025 — головні інсайти року 
Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO
Відкрити в Telegram
Main channel https://t.me/Coding_000 Contact Admin 👉 @ILOVEU_143 for booking your exam slots Web- https://coding000.github.io/Projects/ 💯% clearance in any placement exams OffCampus -https://t.me/Offcampus_000 Discussion- https://t.me/exams_discussion
Показати більше3 362
Підписники
-124 години
-47 днів
-4230 день
Архів дописів
Those who need Job in It Companies can check this channel
Join now @Offcampus_000
🔥🔥
Latest Jobs and Internships Updates for 2021,2022, 2023 and 2024 Batch
Any one want to crack Azure Fundamentals
Dumps available ✅
Contact @ILOVEU_143👨💻
100% clearance guarantee 🔥🔥
Share @Coding_000 ❤️
WILEY EDGE exam
Book your slot 👨💻👇
Contact here @ILOVEU_143❤️
100% clearance guarantee 🔥🔥
Share @Coding_000 ❤️
Rate this group
WILEY EDGE ✅
or any exam help available 🔥💯
Book your slot
Contact here @ILOVEU_143❤️
100% clearance guarantee 🔥🔥
Deloitte
Interview clear ❤️💯👨💻
Congratulations bro 🎉
Give reactions and share our channel fast ✅
Please check all Codes uploaded... 👆👆 Jobathon👆👆
@Coding_000❤️
Guys if u support and share our channel i will upload all solutions...free...Any exam...✅
Give reactions and share our channel fast ✅
Please check all Codes uploaded... 👆👆
@Coding_000❤️
Share our channel screenshot in large groups ✅✅✅✅✅
For More answers 🏃🏃🏃🏃
Share our channel screenshot in large groups ✅✅✅✅✅
For More answers 🏃🏃🏃🏃
Fest and Posters Code✅
Python3 ✅
All test cases Passed ✅
All passes check the above 👆👆 pics..👨💻
3 Codes done...👨💻
Share our channel @Coding_000✅
geek and xor play code done ✅
class Solution
{
public:
#define ll long long
vector<ll> xorPairs(int n, vector<int> &A1, vector<int> &A2, int Q, vector<vector<int>> &query)
{
vector<vector<ll>> temperary(30, vector<ll>(n)), typmu(30, vector<ll>(n));
for (int j = 0; j < 30; j++)
{
for (int i = 0; i < n; i++)
{
temperary[j][i] = (i ? temperary[j][i - 1] : 0) + ((A1[i] >> j) & (1ll) == 1);
}
for (int i = 0; i < n; i++)
{
typmu[j][i] = (i ? typmu[j][i - 1] : 0) + ((A2[i] >> j) & (1ll) == 1);
}
}
vector<ll> answer;
for (auto it : query)
{
ll k = it[0];
k--;
ll l1 = it[1];
ll r1 = it[2];
ll l2 = it[3];
ll r2 = it[4];
l1--;
r1--;
l2--;
r2--;
@Coding_000
ll cnt_k_1 = temperary[k][r1] - (l1 ? temperary[k][l1 - 1] : 0);
ll cnt_k_2 = typmu[k][r2] - (l2 ? typmu[k][l2 - 1] : 0);
ll ans1 = 0;
ans1 += (r1 - l1 + 1 - cnt_k_1) * (cnt_k_2);
ans1 += (r2 - l2 + 1 - cnt_k_2) * (cnt_k_1);
answer.push_back(ans1);
}
return answer;
}
};
code in c++ ✅ ✅
share @Coding_000❤️
