Comments
0

Nvm, got it now.
0

I had thought of this, but I wasn't convinced this would work. Can you prove or maybe give a hint why this should work as opposed to this https://codeforces.me/contest/1551/submission/123536923?
+2

Thanks a lot. Got AC now :)
+1

In D, https://codeforces.me/contest/1553/submission/123351567 I am getting WA on pretest 4, any idea what is the issue? I can see in my submissions but pretest 4 is too huge, so portions of it has got cut out, so I cant understand my mistake. can someone help?
0

Thanks
0

how is cabad cabac correct in problem B: Reverse String?
0

Thanks a lot.
0

also k can be 1 if n%m ==0

0

Bro, I covered all corner cases still getting WA, c=this case also I have covered. Can you point out any possible case I am missing. Thank you.

int p=max(a,b),q=min(a,b);

    if(p%q==0 && k==1) {
        cout<<"YES"<<'\n'; continue;
    } 
    if(factors(p)+factors(q)>=(ll)k && k!=1){
        cout<<"YES"<<'\n'; continue;
    }
    else cout<<"NO"<<'\n';

Submission link: https://codeforces.me/contest/1538/submission/119430768
0

One thing seems weird in D. if a==b then shouldn't k be equal to 0 ? so like since it is not mentioned that when they are equal we stop... maybe this is the reason, but dont we sort of generally stop when we reach the condition a==b? in any other q for eg
0

Can problem C be solved by (set.upper_bound(r-*it)-set.begin())-(set.lower_bound(l-*it) — set.begin())+1? Ik that set.upper_bound(r-*it)-set.begin() generally gives the index but here its giving me a compilation error.can someone help?
0

Thanks a lot :)
0

https://codeforces.me/contest/1535/submission/118488665

Can someone plz help? My approach seems to be correct + it runs on almost every tc i can think of.

Please help, any possible tc it may fail. I have no idea :((
0

Sorry, I got my answer

0

Can I ask a doubt? How are you sure that the inversion count is the number of swaps of neighbouring elements we make and like not the number of inversions we make of a contiguous subarray from the first till last elements?

Thank you.
0

Thanks a lot, bro
0

Will the round be unrated or rated? I see no rating change
-8

Is this contest unrated? I see no rating changes. plz someone tell me.

0

Yep, I did the same, though I didn't use stack, i simply used array, but the idea was same, but I am getting WA, any idea why? https://codeforces.me/contest/1523/submission/117923732
0

Can someone please point out my mistake in today's C?

https://codeforces.me/contest/1523/problem/C

My own testcases passed.. and I feel pretty sure I have done right. Please help.
0

yes same here, did you figure out the mistake? https://codeforces.me/problemset/submission/1515/116187499 This is my submission Thank you. Please do tell me if you have figured out
0

I did exactly the same but I am getting WA on test 3

https://codeforces.me/problemset/submission/1515/116187499

Can you please help point out my mistake? Thank you!
0

Thanks a lot!
0

i too did bruteforce in C. Got TLE. can you tell me where I went wrong? I can't think of any more optimisation. :/

https://codeforces.me/contest/1519/submission/114607388

link to my submission.
On Ari → Codeforces Round #715 Editorial, 6 years ago
0

Thanks a lot
On Ari → Codeforces Round #715 Editorial, 6 years ago
0

https://codeforces.me/contest/1509/submission/113292585 i did according to the tutorial but my submission gives WA on test 9. Where am I going wrong? please someone help
On Monogon → Codeforces Round #712, 6 years ago
0

I always get stuck with interactive problems. Can you help me with some tips?
On Monogon → Codeforces Round #712, 6 years ago
+2

Need help in problem C. Apparently tried n number of test cases but it says WA on test 2 :(((( https://codeforces.me/contest/1504/submission/111936720 this is my link to submission. Please help me out.

Thank you
0

https://codeforces.me/contest/932/submission/110505285

this is my submission I used bottom up dp as suggested still am getting tle in test case 7 can you plz help in some more optimisation?
On shishyando → Codeforces Round #708, 6 years ago
+5

same lol ://
0

Can you plz point out error in my submission? https://codeforces.me/contest/1369/submission/110135442

thanks in advance!
-8

Can we discuss? I am getting runtime error then WA on pretest 2.. Shall I share my submission?
0

yes sad.. :/
0

n problem B there is one test case 51 3 30:01 (8th case) How is answer 50:00? shouldn't the answer be 00:00? as if 50:00 then 00:05 isn't a valid time...plz explain someone

https://codeforces.me/contest/1493/submission/109793069 here is my submission Can you plz help me out? is the jury's answer wrong?
0

In problem B there is one test case 51 3 30:01 (8th case) How is answer 50:00? shouldn't the answer be 00:00? as if 50:00 then 00:05 isn't a valid time...plz explain someone

https://codeforces.me/contest/1493/submission/109793069 here is my submission
On Imakf → Codeforces Round #706, 6 years ago
0

same with me too. https://codeforces.me/contest/1496/submission/109620775 here is my submission. can anyone help plz?
0

thanks a lot :)
0

Can you briefly explain the naive algorithm mentioned in q? I am not even able to understand that :((
0

Can you please explain C1?

https://codeforces.me/contest/1486/submission/109003138

This is the link to my submission. But I am getting wrong answer on test 3. I can't understand why. Please help me out :((
0

Can anyone plz show their ProbA solution? I used gcd to calculate but i dk how to check if both are positive.