B. Special Numbers | Codeforces Round 747 | Solution With Explanation | C++ Code

[@AbhinavAwasthi]

Join Telegram Channel for Post Contest Discussions: t.me/codenavdiscuss

[@joetube1703]

Helpful! thank you

[@AbhinavAwasthi]

Thank you

[@reallifewithawadheshawasth7463]

Helpful!

[@AbhinavAwasthi]

Thanks

[@sandeeptottadi]

Great work. Please continue.

[@AbhinavAwasthi]

Thanks

[@deepbhai9175]

Nice explanation

[@AbhinavAwasthi]

Thanks

[@SurajGaud]

Great explaination

[@AbhinavAwasthi]

Thanks Bro

[@rohitsatpute5518]

Helpful 🙂

[@AbhinavAwasthi]

Thanks

[@suriyaas4877]

Helpful

[@AbhinavAwasthi]

Thanks

[@bhavadeepbhukya5926]

is powermod a function in c++?

[@AbhinavAwasthi]

No, it is in my template

[@AIT-Pune]

Why you used ceil value especially when log2 k divisible by 2 because it comes as whole no.when divisible by 2 so ceil and floor value is same Please explain I am confused because when I use floor value my answer in some case get added by +1.

[@AbhinavAwasthi]

if ceil and floor are equal, then we can take any two of them

[@AIT-Pune]

But when I used floor value answer of some cases get changed

[@AbhinavAwasthi]

May be there's a logical error

[@AIT-Pune]

#include typedef long long ll ; #define int ll using namespace std ; signed main( ) { int t; cin>>t; while(t--) { int n,k; cin>>n>>k; int mod=1000000007; int c=log2(k); int l=pow(n,log2(k)); if(c%2==0) { cout

[@AIT-Pune]

@@AbhinavAwasthi please check the code

[@sandeeptottadi]

I'm not able to solve atleast one 😔

[@AbhinavAwasthi]

Keep trying

[@sandeeptottadi]

@@AbhinavAwasthi sure with your support ☺️

[@AnkitSingh-xp7mm]

Hey abinav, I am getting wrong answer for test case n = 105, k = 564. Apparently I am doing something wrong with modulo. int t = s.nextInt(); // Number of test cases for (int i = 0; i 0) { int x = 0; long sum = (long)Math.pow(2, x); while (sum < k) { x++; sum += (long)Math.pow(2, x); } k = k-(long)Math.pow(2, x); ans += Math.pow(n, x); ans = ans%mod; } System.out.println(ans%mod);

[@AbhinavAwasthi]

Yeah, watch my video on how to find mod

[@shivanggautam541]

Helpful!