A. K-divisible Sum | Educational Codeforces Round 103 | BITS PILANI

[@arijitdey8419]

Very good explanation..better way of explaining than the editorial.. thanks a lot for this

[@arjunprasad1071]

Great explanation !! So much better than the editorial.

[@codeExplainer]

Glad it was helpful!

[@sumeetubale3923]

very nice explaination sir!!

[@codeExplainer]

Thanks for liking

[@softwarelanguages8324]

Thank you so much for the explaination man Really helped me

[@codeExplainer]

Glad it helped

[@Pooh__7__]

very nice explanation , codeforces editorial was quiet hard to understand

[@codeExplainer]

thank you so much

[@ranaabhijeet497]

Is this question related to book allocation problem in which we have to allocate minimum no. Of pages

[@anshshah4927]

A was done B was almost done just messed up the formula part of adding minimum number

[@codeExplainer]

ohh, you always learn new things along the way.

[@sober_junkie5709]

very good approach, the direct formulaic answer on the editorial wasn't that good.

[@motivation_hubPJ]

Can you please tell why would this solution won't work : public static void solve(int n,int k){ if(n==k)System.out.println("1"); else if(k==1)System.out.println(n); else if(n==1)System.out.println(k); else{ int max=2; while(true){ if(n*max>=k)break; max++; } System.out.println(max); } }

[@adityaprakash7228]

if k==1 then also ans=1.

[@rajmittal5394]

Sir but here if n is greater than k than possible ans is always either 1 and 2 We don't have any code for this Better work

[@mahipalsingh-yo4jt]

good explanation..!!!!!!!

[@codeExplainer]

Glad you liked it

[@ambarjaiswal771]

I did the problem A and B but the problem A was hacked what's that mean?

[@codeExplainer]

it means there are some test case your code is missing and some other coder hacked your problem. It means some other coder run your code on some other test case which was not on pretest and your code gives wrong ans , and thus it got hacked.

[@motivation_hubPJ]

I Wasn't able to do both i felt a lot tough the first problem itself

[@codeExplainer]

ya the problems are difficult.