Codeforces Round 816 Div 2 | Problem B : Beautiful Array Solution | InHindi | Explanation + Code

[@nitishbyahut25]

it was just maths... nice explanation sir... The best part about you is that You make us understand how to think ... so that next we dont get stuck in similar question.. Thank you sir.

[@KaranMashru]

Code : #include using namespace std; #define ll long long int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ll t, n, k, b, s, i, ans; cin>>t; for(;t--;) { cin>>n>>k>>b>>s; if((k*b+n*(k-1))

[@worldfromhome4033]

Sir in a[0] why did you add min(k-1,s) and not just k-1?

[@codingcommunitynewtonschoo8582]

Suppose after adding b*k to a[0], the remaining value of s=5 and value of k-1=7. Now, since we want to the sum to be exact s, the final value of s should be exact 0, bcoz we subtract array elements from it. So, now we add 5 and not 7. Similarly, if value of s remaining is 10 and value of k-1=7, then we add 7 only. Bcoz adding values greater than k-1 will increase the beauty value and hence it will not remain b. I hope you got my point.

[@craftsworld3237]

11:54 me loop 1 se nhi chalna chahiye? a[0] to pehle hi hm kb define kar chuke h na hm

[@001_kavyagaur5]

No buddy loop 0 se hi start hoga kyuki first element ki max value k*b + k-1 tk hoskti h

[@parthvaghela7820]

Hats off for consistency !! Keep going, you're doing a great job!!!

[@RohitBindalMusic]

Mene same approach use kar ke solve kar liya tha ye question contest mei but somehow I was not satisfied with my solution but after watching your video now I’m crystal clear ❤️ Thank you for your efforts 🙏🏻

[@FinanceMode14]

thank you sir for explaination 🙏🏻

[@omkarsase6518]

Good Explanation🙏🙏

[@Super-lj1rf]

thanku sir 💖💖

[@hritikanand9734]

osm

[@kky7811]

Thanks 🙏

[@mridul1075]

good explaination

[@armed3719]

I saw the answers of others almost everyone came up with the range solution.How? I was not able to think that way

[@codingcommunitynewtonschoo8582]

One of the things to notice here is that, for output they said that if no such array exists print -1. So if you figure out the condition of -1 i.e no such array possible , a lot of things will get cleared. So if you think in this direction you will realize that s can have a range of values for a given b, n and k. So if s lies in this range, solve further otherwise print -1. I hope you got the idea how we can approach such things.

[@ayushnautiyal7965]

Same

[@girishbhargava6367]

What would be the expected rating of this question?

[@rudranilacharya5293]

Sir please explain monoblock

[@dam7854]

what is the difficulty of this question?

[@vedantkakade]

sir but i think this logic might fail at test case 2 5 5 30 where it will print 25 4 and sum of array will be less than expected sum.

[@codingcommunitynewtonschoo8582]

No this logic will store 29 1 . So sum will be 30 and beauty will be 5. I hope you got the point.

[@harikeshsingh93]

bhaiya c ka solution bhi upload kr do

[@omkarsase6518]

regarding max sum if first ele has value k*b then there will be n-1 ele remaining and for each ele value will be k-1 so sholud it be (k * b) +((k - 1)*(n-1)) ? (k * b) +((k - 1)*(n-1)) by using this I got wrong ans

[@codingcommunitynewtonschoo8582]

Max sum is (k*b)+(n*(k-1)), bcoz you can add k-1 to first element also. This will make first element k*b+k-1. It will still give beauty value as b. I hope you got my point.

[@omkarsase6518]

@@codingcommunitynewtonschoo8582 Understood sir. Thanks for clearing my doubt

[@Shubham_adi_com]

Sir python+java

[@Shubham_adi_com]

Sir mei coding free me kaha se shikhe

[@ssv6055]

bhaiya ,title change kardijiye

[@codingcommunitynewtonschoo8582]

😅 done. Thank you

[@GauravKumar-kd9pp]

I was able to solve the question and passes all the pretests but while testing it Gave runtime error on 13th test case and then I observed that for k = 1 my code will give error and able to solve later. 🥲 From 7000 my rank reached 11k . 🥲🥲