วีดีโอ

Like and Subscribe and stay updated..👍

😢

bhai code correct hai to comment me code de do

code in comment

code

Like and Subscribe guys 👍

C. In C++ language #include <bits/stdc++.h> using namespace std; pair<long long, int> computeLucky(long long left, long long right, int threshold) { if (right - left + 1 < threshold) { return {0, 0}; } if (right - left + 1 == 1) { return {left, 1}; } long long mid = left + (right - left) / 2; if ((right - left + 1) % 2) { pair<long long, int> leftResult = computeLucky(left, mid - 1, threshold); long long totalLucky = mid + 2 * leftResult.first + mid * leftResult.second; int totalSegments = 2 * leftResult.second + 1; return {totalLucky, totalSegments}; } else { pair<long long, int> leftResult = computeLucky(left, mid, threshold); long long totalLucky = 2 * leftResult.first + mid * leftResult.second; int totalSegments = 2 * leftResult.second; return {totalLucky, totalSegments}; } } int main() { ios::sync_with_stdio(false); cin.tie(NULL); int test_cases; cin >> test_cases; while (test_cases--) { long long n, k; cin >> n >> k; pair<long long, int> result = computeLucky(1, n, k); cout << result.first << " "; } return 0; }

Like and Subscribe guys..👍 B. In C++ language #include <bits/stdc++.h> using namespace std; #define int long long int32_t main() { int t; cin>>t; while(t--) { int n; cin>>n; vector<pair<int,int>>vec(n); for(int i=0;i<n;i++) { cin>>vec[i].first>>vec[i].second; } string ans1=""; set<int>st; map<int,int>mp; for(int i=0;i<n;i++) { if(vec[i].first==vec[i].second) { st.insert(vec[i].first); mp[vec[i].first]++; } } vector<int>ans; for(auto it=st.begin();it!=st.end();it++) { ans.push_back(*it); } for(int i=0;i<n;i++) { int l=vec[i].first; int r=vec[i].second; if(l==r) { if(mp[l]>1) { ans1.push_back('0'); } else { ans1.push_back('1'); } continue; } int lower=lower_bound(ans.begin(),ans.end(),l)-ans.begin(); int upper=lower_bound(ans.begin(),ans.end(),r+1)-ans.begin(); int len=(upper-1)-lower+1; if(len==r-l+1) { ans1.push_back('0'); } else { ans1.push_back('1'); } } cout<<ans1<<endl; } return 0; }

Like and Subscribe guys 👍 A. In C++ language #include <bits/stdc++.h> using namespace std; #define int long long int32_t main() { int t; cin>>t; while(t--) { int n; cin>>n; vector<int>vec(n); for(int i=0;i<n;i++) { cin>>vec[i]; } bool c=true; for(int i=0;i<n;i++) { if(i-1>=0 && vec[i-1]>=vec[i]) { if(2*vec[i]>vec[i-1]) { c=false; break; } } else if(i-1>=0 && vec[i-1]<vec[i]) { if(2*vec[i-1]>vec[i]) { c=false; break; } } if(i+1<=n-1 && vec[i+1]>=vec[i]) { if(2*vec[i]>vec[i+1]) { c=false; break; } } else if(i+1<=n-1 && vec[i+1]<vec[i]) { if(2*vec[i+1]>vec[i]) { c=false; break; } } } if(c==false) { cout<<"Yes"<<endl; } else { cout<<"NO"<<endl; } } }

correct code do bhai

Like and Subscribe guys..👍

please share this code in comments

Like and Subscribe guys..👍

Like and Subscribe and stay updated..👍

Subscribe to our channel which supports me and solution video of further contest will be uploaded..👍

Like and Subscribe guys

Subscribe to our channel which supports me and solution video of further contest will be uploaded..👍

Yes, please give the code in comments🙏

can u give the code in comments?

Like and Subscribe

Subscribe to our channel which supports me and solution video of further contest will be uploaded..👍

Like and Subscribe 🙏

Like and Subscribe...🙏

//In C++ 17 language #include <bits/stdc++.h> using namespace std; typedef long long ll; vector<int> determineDigits(ll n, ll d) { vector<int> ans; // Always include 1 ans.push_back(1); // Include 3 if n >= 3 or d is divisible by 3 if (n >= 3 || d % 3 == 0) { ans.push_back(3); } // Include 5 if d is 5 if (d == 5) { ans.push_back(5); } // Include 7 if n >= 3 or (n == 2 and d == 7) if (n >= 3 || (n == 2 && d == 7)) { ans.push_back(7); } // Include 9 if special condition or n >= 6 if (n >= 6) { ans.push_back(9); } else { ll factorial = 1; int i = 2; while (i <= n) { factorial *= i; i++; } if ((factorial * d) % 9 == 0) { ans.push_back(9); } } return ans; } int main() { int t; cin >> t; while (t--) { ll n, d; cin >> n >> d; vector<int> ans = determineDigits(n, d); for (int digit : ans) { cout << digit << " "; } cout << " "; } return 0; }

Do the second one bro

Thank you ❤👍 It is 💯 correct...

#include <stdio.h> // Function to calculate maximum number of coins long long maxCoins(long long n) { if (n <= 3) return 1; // Cannot transform if n <= 3 long long coins = 1; // Start with 1 coin while (n > 3) { n /= 4; // Each transformation divides the value by 4 coins *= 2; // Each transformation doubles the number of coins } return coins; } int main() { int t; scanf("%d", &t); // Number of test cases while (t--) { long long n; scanf("%lld", &n); // Read coin value for each test case printf("%lld ", maxCoins(n)); // Output required result } return 0; }

Like and Subscribe it ...

Can you provide the code? I wasn't able to understand what the question was asking :(

code

code

code

provide the correct code

WRONG CODE

Like and Subscribe now

code in description

Like and Subscribe now...

Like and subscribe us and take code from our Telegram channel..

Rank ma name hai but mail nhi aaya abhi tak

Thank you ❤👍

👍

👍

👍

👍