"I want to ask a question" - Ask them all here!

meta
,
401

I am having exams dear, so I dont have any time at hand right now. And no, see what @admin said at top “Only ask here if you have less karma”.

402

Please search first on forum, this is a very commonly asked question.

403

Could’nt find the question of my type

Can u Tell where my code fails pls, I have’nt got any test-case error when I tried from my side.

404

Anyways, coming to the error, the scores per round are CUMULATIVE scores instead of individual scores. Meaning, New score= sum of score of all rounds till now. Lead and difference are calculated on this one.

Try to search better, because this question is so commonly asked, I think you are doing some mistake while searching.

405

ty, finally got that :slight_smile:

406

Hello everyone!

I was working on a problem, MINEAT(https://www.codechef.com/MARCH18B/problems/MINEAT/) from March Long challenge div2, MARCH18B. I think I have solved the problem correctly, but fail to pass all the tests.

Other than Wrong answer, I am facing TLE error as well. Can anyone discuss on the edge test cases and suggest solution to bypass TLE error?

PS: I will add my code for review, once the challenge is over.

Thanks in advance :slight_smile:

407

can someone explain me MINEAT PROBLEM, i saw the successfull submission but fails to under, why they did sorting of the array?

(https://www.codechef.com/MARCH18B/problems/MINEAT/)

408

Editorial

Is there any editorial to the problem STRIMPOR of ZCO 2018. If there is, can somebody please share the link?

Thanks In advance

409

Did you check the editorial?

410

Probably no… You want me to upgrade this to a question?

411

Why Binary search? Just make an array which has all the distances upto {10}^{9} and iterate through it to find the closest possible distance. Use it in formula for the answer.

I will upgrade it to a question once you add more details of your approach.

412

If you are to use binary search only you can refer my solution. I used std::lower_bound instead of hard-coding binary search.

413

Hi,

I recently participated in March Cook-off Div2 (contest link). In the rating graph I can see that my rating increased by 114 to 1901 but my main profile is still showing the old rating (1787) and 3 stars (I should have 4 stars now). Can you pls take a look and resolve this?

You can see this on my profile here - mayank_kool

414

Already forwarded to @admin yesterday. They are looking into the issue. Thanks for reporting though :slight_smile:

415

@vijju123 I think that my approach is the most optimal approach. I calculate everything in O(1) tc and find the sum of n numbers <= N in Log(n) tc and O(1) spaceC . I did as everyone. my logic was correct.(atleset i thougt so )
So i needed to know where it fails .

416

@divik you used a Dp approach , i think . but I used BS to find the sum of natual numbers; less than equal to given N.
your appraoch is different than mine.

417

Can you give the reference link?

418
419

question link please.

420

Its a standard question “Merge k sorted list/arrays”. Did you refer to geeksforgeeks code for comparison?