Codechef Starters 143 ( Div 4) | Non-Divisor Array | Binary Conversion | A-D

#codechefsolution #codechef
Hi, I am Amit Dhyani. Today, we solved problems from Codechef Starteres 143 (Div 4).
Problem A: International Justice Day
Problem B: Maximum Coins
Problem C: Binary Conversion
Problem D: Non-Divisor Array
Problem E: Max Min and length • Codechef Starters 143 ...
********************************************
Checkout my Segment Tree Playlist:
• Segment Tree : Basic t...
🌐 Connect with me:
📧 Gmail: [e-mail]
💼 LinkedIn: / amit-dhyani-5164b8138
📸 Instagram: / amit.dhyani.1
#contest #143 #faang #maang

[@Shivam-wl7fg]

Bhaiya third wale problem ka explanation ma maja aa gya....thank you!

[@sonu.00581]

great sir 👏

[@roshangeorge97]

loved the third problem explanation!

[@RiteshSingh-yp1sm]

godlike explaination

[@manpatel9157]

Bhaiya, In Problem-C (Binary Conversion), Constraints is given that 1

[@funfacts9544]

15:35 pe six conflicts hai

[@amit_dhyani]

Yup 😅

[@tahmiszubair1644]

nice bhaii

[@pradeepdobriyal4738]

Great job beta❤❤keep it up

[@SatyamGupta-nx4zj]

Bhaiya, How to identify edge cases for any problem like for problem C?

[@RishabhKumar0094]

thanks

[@kunjshah2991]

please give us the solution of the code after D problem sir!!!!

[@amit_dhyani]

Hey Bro, Sorry i was busy with some other stuff. Here is the code
#include
#include
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;

int C = floor(log2(n)) + 1;
cout

[@39_jatinjain4]

Can u tell why it is giving WA-
const int MAXN = 200001;
bool prime[MAXN];
void sieve() {
fill(begin(prime), end(prime), true);
prime[0] = prime[1] = false;
for (int p = 2; p * p > n;
vectorb(n+1);
for (int i = 2; i

[@Nisha-yu3sj]

Good ❤❤

[@dhaneshwaridobriyal2943]

😍😍😍😍

[@amardeep7714]

noicee