SlavicG's blog

Codeforces Round #827 (Div. 4)
By SlavicG, 2 years ago, In English

Hello Codeforces!

mesanu, flamestorm, MikeMirzayanov and I are glad to invite you to Codeforces Round 827 (Div. 4)! It starts on Oct/13/2022 17:35 (Moscow time).

The format of the event will be identical to Div. 3 rounds:

  • 5-8 tasks;
  • ICPC rules with a penalty of 10 minutes for an incorrect submission;
  • 12-hour phase of open hacks after the end of the round (hacks do not give additional points)
  • after the end of the open hacking phase, all solutions will be tested on the updated set of tests, and the ratings recalculated
  • by default, only "trusted" participants are shown in the results table (but the rating will be recalculated for all with initial ratings less than 1400 or you are an unrated participant/newcomer).

We urge participants whose rating is 1400+ not to register new accounts for the purpose of narcissism but to take part unofficially. Please do not spoil the contest for the official participants.

Only trusted participants of the fourth division will be included in the official standings table. This is a forced measure for combating unsporting behavior. To qualify as a trusted participant of the fourth division, you must:

  • take part in at least five rated rounds (and solve at least one problem in each of them),
  • do not have a point of 1400 or higher in the rating.

Regardless of whether you are a trusted participant of the fourth division or not, if your rating is less than 1400 (or you are a newcomer/unrated), then the round will be rated for you.

We would like to thank:

We suggest reading all of the problems and hope you will find them interesting!

GLHF!

UPD: Editorial

  • Vote: I like it
  • +177
  • Vote: I do not like it

Comments Comments (158)
| Write comment?
»
2 years ago, # |
  Vote: I like it +19 Vote: I do not like it

As the one, who translated statements, I promise, Timur has legs!

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I got pinged lol

→ Reply
»
2 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Finally, MY FIRST UNRATED ROUND >:D

→ Reply
»
2 years ago, # |
  Vote: I like it +2 Vote: I do not like it

As a tester, SlavicG orz

→ Reply
»
2 years ago, # |
  Vote: I like it +17 Vote: I do not like it

As a tester, I suggest while(true){ if(time != contest_time) continue; else return write_contest; }

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    That code uses 100% of CPU Thread, use something like std::this_thread::sleep_for(std::chrono::milliseconds(1)) to avoid that.

    → Reply
»
2 years ago, # |
  Vote: I like it +1 Vote: I do not like it

There were no Div. 4 rounds before. There were times...

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Love to see haochenkang testing! Gl everyone!

→ Reply
»
2 years ago, # |
  Vote: I like it +19 Vote: I do not like it

As a tester, I'm really happy to be a part of this contest :)

→ Reply
»
2 years ago, # |
  Vote: I like it +3 Vote: I do not like it

waiting for long time...Finally div 4 come ..very exited ...

→ Reply
»
2 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Best Div. 4 round I've tested so far!

Source
→ Reply
»
2 years ago, # |
  Vote: I like it +1 Vote: I do not like it

I hope this is my last rated Div 4 :>

→ Reply
»
2 years ago, # |
  Vote: I like it +5 Vote: I do not like it

As a tester, I just wanna say the G in SlavicG stands for top G.

→ Reply
»
2 years ago, # |
  Vote: I like it +4 Vote: I do not like it

How do you become problem setter, tester, helper or any of such things?

And also do these people get paid or they do it for fun?

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    setters do get paid, there's a blog in the catalog about that. in the meantime, testers either get contacted from setters directly or from other testers, and don't necessarily get paid.

    → Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    No, testers do not get paid.

    I like being a div. 4 tester because i can't wait for div 4 problems XD

    Spoiler
    → Reply
    • »
      »
      »
      2 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      If you want to prove that you are SlavicG's #1 fan, then you should change to my profile pic to show your loyalty.

      → Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +27 Vote: I do not like it

    Please read this, it's about becoming a problem setter.

    You can become tester if your friend is the author/coordinator/another tester, they'll invite you. Note that authors need to be very careful who to trust, because they don't want to get the problems leaked.

    Also, testers don't get paid unlike authors and coordinators. We do it for free because it's fun :)

    → Reply
    • »
      »
      »
      2 years ago, # ^ |
        Vote: I like it +31 Vote: I do not like it

      I think it's unfair, testers should get paid with at least an autograph from SlavicG himself. You already got plenty of autographs but us the average testers never get to taste an autograph >;((

      → Reply
      • »
        »
        »
        »
        2 years ago, # ^ |
          Vote: I like it +19 Vote: I do not like it

        What an excellent suggestion, I also want autograph from SlavicG! But he didn't invite me this time, so I have no right to claim it unlike you :(

        → Reply
        • »
          »
          »
          »
          »
          2 years ago, # ^ |
            Vote: I like it +8 Vote: I do not like it

          Oooof right, you know what, let's go on a strike if he doesn't invite you next time, or if he doesn't pay us with juicy autographs

          → Reply
»
2 years ago, # |
  Vote: I like it +1 Vote: I do not like it

I can't believe that I have 2 more rating than the maximum to participate in this contest as rated contestant, I wish I had waited a few minutes before submitting the last problem in the previous contest. -_-

→ Reply
»
2 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Specialists Be Like

→ Reply
»
2 years ago, # |
  Vote: I like it -8 Vote: I do not like it

This is harsh. I have used codingblocks.com online compiler and have not copied any text from anywhere and done it on my own. This is just a coincidence and nothing else. https://mirror.codeforces.com/submissions/code_vishal18# https://drive.google.com/file/d/1xTv1xVGfwwAsr0OIcfZEwf4nqu2GZLF9/view?usp=sharing. Please roll back my ratings. This is really frustrating and demotivating.

→ Reply
»
2 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Hi, I'm a Chinese student, my English is bad. So, I want to Make frinends to learning it. After reading the previous words, you can also find that my English is not good. We can also progress on algorithms together. Thanks to you read my words.

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    "to learning" should be "to learn".

    → Reply
    • »
      »
      »
      2 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      yes, thank for your help

      → Reply
      • »
        »
        »
        »
        2 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        能不能给这个hack div4点个upvote？https://mirror.codeforces.com/blog/entry/107979

        → Reply
        • »
          »
          »
          »
          »
          2 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          点赞了hh，看来你的英语不错，我很菜，一直在学习

          → Reply
»
2 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Some users with rating 1400+ create new accounts and participate in such contests and it affects us low rated users. I hope they stop doing this. This happens in div 2 contests as well.

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Finally, I can increase my rating :)

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

OmG My FIrsT UNofficIAL ROunD!!!!!!

→ Reply
»
2 years ago, # |
  Vote: I like it +3 Vote: I do not like it

rp++！

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Good luck to you

→ Reply
»
2 years ago, # |
  Vote: I like it +9 Vote: I do not like it

Hope it won't be queueforces.

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    Unfortunately, the queue is very long.

    → Reply
    • »
      »
      »
      2 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      It may because there are too many testcases.

      → Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    And that's how you jinxed it.

    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Very long queue !!

→ Reply
»
2 years ago, # |
  Vote: I like it +1 Vote: I do not like it

I keep seeing "Oops! Codeforces is broken"

→ Reply
»
2 years ago, # |
  Vote: I like it -8 Vote: I do not like it

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Servers down O_o

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Div 4 became so popular...

→ Reply
»
2 years ago, # |
  Vote: I like it +13 Vote: I do not like it

stresstestingforces XD

→ Reply
»
2 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

As an unrated participant, I really enjoyed the contest. Good job slavicg and team.

Why don't div3/div2 contests have similar problems? :sad:

→ Reply
»
2 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Great contest for a div 4, covered a lot of basic concepts, for the first time I was able to solve the whole set of problems, enjoyed it thoroughly.

→ Reply
»
2 years ago, # |
  Vote: I like it +21 Vote: I do not like it

Imagine submitting a solution and after 30 min long queue getting wrong answer on tc 1.

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Thank div4 for making me feel less useless, first time full AC without any WA :(

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I'm so tired for waiting.

→ Reply
»
2 years ago, # |
← Rev. 2   Vote: I like it -26 Vote: I do not like it

Deleted.

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it -8 Vote: I do not like it

    What's the issue with C++20's gcd function? Let me know so I can mention it next time I cover it on STL in CP

    → Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You are invoking undefined behaviour by sorting empty vectors. Gcd is in no way invalid in c++20

    → Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +20 Vote: I do not like it

    I am impressed by how many different explanations there are for why your code is wrong. Check the test case that you failed on. You mistakenly assumed that if the GCD of the entire array is $$$1$$$, then there exists a pair of elements that is coprime. You fixed it by initializing $$$\mathrm{ans}$$$ to $$$-1$$$ instead of $$$0$$$. Everything else was fine.

    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Why was site down all the time! It was frustrating.

→ Reply
»
2 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Is it just me who think that E has way more right submissions that it should have?

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Dude, $$$E$$$ was easy, I actually solved it before $$$C$$$ and $$$D$$$ !

    → Reply
    • »
      »
      »
      2 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      So I guess it has a simple solution that I didn't think of

      → Reply
  • »
    »
    2 years ago, # ^ |
    ← Rev. 2   Vote: I like it +4 Vote: I do not like it

    It's because of Um_nik everyone knows how to Binary Search

    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

how to solve G?

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Video Solution for G.

    Hint:
    → Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Use a mask. Initialize it as the max element in the beginning. Add this to the answer and mark it as used. Then, for each unused element update the element with a new key of (original value with the masked bits cleared). This is the key. The value is a vector of the original values. Use the largest key and sort the vector of the original values. Take the max. Add to answer and mark it as used. Repeat the above until key is 0. Add all unused elements to the answer.

    176046217 I submitted 5 minutes after contest ended.

    → Reply
  • »
    »
    2 years ago, # ^ |
    ← Rev. 3   Vote: I like it 0 Vote: I do not like it

    Let the max element of the array to be the beginning of the sequence, since it has the highest lexicographical order. Then we try to find the element that results in the highest OR value, then update the prefix OR and mark that index as used. At one point where the higher OR value cannot be found, we fill the rest of the sequence with unused elements.

    Since a[i] <= 1e9, which is less than 31 bits, the time complexity is O(N).

    → Reply
»
2 years ago, # |
  Vote: I like it +26 Vote: I do not like it

POV : You missed red and blue being horizontal and vertical specifically

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    And after getting WA2 wonder if this problem is even solvable.

    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Is there any more efficient way to check coprime than generating all in O(1000^2 * log(1000)) time.

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    they can be generated in 1000^2 operations by memoizing eucledian gcd

    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Problem E Why my solution is giving TLE for test case 4 176003168 176020081 176037934

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

approach for F?

→ Reply
  • »
    »
    2 years ago, # ^ |
    ← Rev. 2   Vote: I like it +1 Vote: I do not like it

    Only two things matter:

    • number of 'a's in the string

    • does the string have any character other than a?

    → Reply
  • »
    »
    2 years ago, # ^ |
    ← Rev. 2   Vote: I like it +1 Vote: I do not like it

    I'd like to expand on tsuu's explanation.

    1) Both strings 's' and 't' contain only the character 'a': Eg: aaa vs aaaa => we can see that the one with lesser frequency wins

    2) String 's' contains many different characters, while string 't' contains 'a' only Eg: aaab vs aaaaaaa => S will never win aaab vs aa => again, S loses

    3) Both 's' and 't' contains many different characters Eg: abcde vs aaazxy => Just pick 'a' as the starting character in S, and any character other than 'a' in t Here we pick a**** vs z***, so S wins

    → Reply
    • »
      »
      »
      2 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      About the 3rd case, both strings are 'a' initially so if string T has different characters, S will win because we can make S starts with 'a' and T starts with anything other than 'a'.

      → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

https://mirror.codeforces.com/contest/1742/submission/176025562 Why this is not passed any counter exam ple

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    1 6 1 1 3 1 2 5 4 3

    Output should be 1+3+1+2 = 7 but it considers 5 as well and wrongly prints 12

    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone provide me a stress test like wa2 for my submission[submission:176043362]

→ Reply
»
2 years ago, # |
  Vote: I like it +3 Vote: I do not like it

I wasted 1 hour getting WA on Problem C, because, I thought each row or column can be painted with both red or blue colour! Then I noticed, only columns can be painted blue and rows can be painted with only red!!

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    A similar thing happened to me in the past, a few extra seconds spent reading problem statements are worth it.

    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve D

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +1 Vote: I do not like it
    Hint1
    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Please, share why this code getting TLE. Problem E time limit is 3 seconds. is q*n more than 3 seconds?

Spoiler
→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    q*n=4*1e10,it need more than ten seconds.

    → Reply
»
2 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Thought in E we rearranged both s and t in the lexicographically least arrangement and then compare, wasted about 30 mins there, then re-read the question again and understood it properly, my ADD is really messing up with my performance, maybe it's time to cut down insta reels and tik tok ;(

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    i increased my performance 3x just by cutting porn.

    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Will 827div4 be unrated?

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

SlavicG

Is something wrong with the checker of problem F? I tried to hack and kept getting "Unexpected verdict" result.

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Same Issue here. I find many people using int to store the number of characters. When k and q are large I created a set of data to overflow the counter back to 1... But the hack gives me "Unexpected verdict".

    → Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Sorry for the inconvenience, it should be fixed now.

    → Reply
»
2 years ago, # |
  Vote: I like it +3 Vote: I do not like it

C was the biggest anti-speedforces bait I've ever seen.

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    C still needed weak testcases for full effect ;) The number of FSTs would probably set an all time high record if the testcases were weak.

    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone tell why I am getting wrong answer on test case 2 of problem E.. It is because of wrong implementation or because of wrong logic. Submission link

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

This is the first round that I AK :D

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Imho problem F was easier than E and D

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

editorial?

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    if you want, I can explain you any problem from this round

    → Reply
    • »
      »
      »
      2 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      In problem C, you have to check whether "RRRRRRRR" is present in a row or not? Is that a wrong logic? because i wasted an hour on that and I couldn't find out what am i missing.

      → Reply
»
2 years ago, # |
  Vote: I like it +4 Vote: I do not like it

It was a cool round. The last assignment is a lot of fun to underestimate why you can write n^2 code with one break and it will be accepted.

→ Reply
»
2 years ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

Overall this contest was good.

Spoiler :(
Problem F
→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    hacks in F because some people didn't read the first line in the statement

    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to do F, if s and t are initially empty ?

→ Reply
»
2 years ago, # |
  Vote: I like it +1 Vote: I do not like it

GEO THERMAL WROTE IT a newbie sadly

→ Reply
»
2 years ago, # |
  Vote: I like it +14 Vote: I do not like it


I had a problem accessing the page.
How can I not panic?
I hope this div not reflected in my rating.

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Is the contest declared unrated?
The contest is shown under the 'only unrated' tab..

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    It takes time to update rating. Until the rating is updated, the contest is shown under unrated tab only.

    → Reply
    • »
      »
      »
      2 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Oh sorry, I wasn't aware of this, thank youu.

      → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Wtf how is my F solution wrong, even some Gms had it wrong

→ Reply
  • »
    »
    2 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    temp*y can be greater than 2e9. so you should use long long

    → Reply
    • »
      »
      »
      2 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I'm an idiot i knew it should be long long and set the size variable to long long but the mul operation variables were integer.. Short sad story

      → Reply
»
2 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Is it possible to solve E this way without getting TLE in test case 9? 176125836

→ Reply
  • »
    »
    2 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    q*log(n) is right.q*n is not enough.you can see my code.It only needs 467ms.176015222

    → Reply
    • »
      »
      »
      2 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Yeah but that's binary search. I was asking that can I do some improvement in this code only and get the job done? Or binary search is a must to reduce it to q*log(n)?

      → Reply
      • »
        »
        »
        »
        2 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        of course we need binary search.q*n=4e10,it will need more than ten seconds

        → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Guys, I mistakenly resubmitted my own code for problem D, and CF sent me this:

Attention!

Your solution 176041980 for the problem 1742D significantly coincides with solutions tllwtg/176009167, tllwtg/176041980. Such a coincidence is a clear rules violation. Note that unintentional leakage is also a violation. For example, do not use ideone.com with the default settings (public access to your code). If you have conclusive evidence that a coincidence has occurred due to the use of a common source published before the competition, write a comment to post about the round with all the details. More information can be found at http://mirror.codeforces.com/blog/entry/8790. Such violation of the rules may be the reason for blocking your account or other penalties. In case of repeated violations, your account may be blocked.

Dose that mean my account are going to be blocked? :(

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    the same for me, also round somehow became rated for me

    → Reply
    • »
      »
      »
      2 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Thats strange. I guess the rating will soon be rolled back. lol

      → Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    It's just a warning. But In case of repeated violations, your account may be blocked

    → Reply
  • »
    »
    2 years ago, # ^ |
    ← Rev. 2   Vote: I like it +7 Vote: I do not like it

    same here. I wrote a blog post here. I did not cheat, and I don't know how they matched those 2 solutions as a "significant coincidence" case.

    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I ranked ~400 in the round (~95 officially) but I found I was disqualified and I am accused of cheating. I wrote a post here. Please help by upvoting.

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Something strange happened to me. For problem B, I used "goto" in my code, and the judge gave me WA ( 175907076 ) though the code works well in my computer, when I replaced it with "flag" , I got AC.( 176139742 ) Could someone tell me whats going on with "goto" in this problem? that would help me a lot, thanks : )

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    It's because you don't read the input correctly. You are breaking early while reading the input so the values for the next test case start from the array of the previous test case, so all future values are just messed up.

    → Reply
»
2 years ago, # |
  Vote: I like it +8 Vote: I do not like it

https://mirror.codeforces.com/contest/1742/submission/175924333 https://mirror.codeforces.com/contest/1742/submission/175959376 I don't know why my code for this problem in 827div4 has been repeated by other's code. I don't know the people at all and if you see the links of code above , you could find that the codes could certainly made by different people. And the problem D , the solution I solved was right and simple. I can't really understand that this code could be repeater by others. Attention!Your solution 175924333 for the problem 1742D significantly coincides with solutions 0x4c/175924333, alitarekkk/175959376. Such a coincidence is a clear rules violation. Note that unintentional leakage is also a violation. For example, do not use ideone.com with the default settings (public access to your code). If you have conclusive evidence that a coincidence has occurred due to the use of a common source published before the competition, write a comment to post about the round with all the details. More information can be found at http://mirror.codeforces.com/blog/entry/8790. Such violation of the rules may be the reason for blocking your account or other penalties. In case of repeated violations, your account may be blocked.

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

My English is not good, so some of them are translated.

D guarantees that n is greater than or equal to 2, but they have n is equal to 1 in their data.

The first solution get Accepted. https://mirror.codeforces.com/contest/1742/submission/176077405

The second solution adds assert(n! =1) Then it gets Runtime error on test2.

https://mirror.codeforces.com/contest/1742/submission/176155308

→ Reply
»
2 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

MikeMirzayanov SlavicG I have been submitting my Java solution for problem E div4 827, and getting judgement failed verdict continuously. This happened at the time of contest as well. Kindly check.

Attaching the submission links : 175975446 176169782 176170045

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

    Try renaming your class, con is a restricted filename on windows.

    → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Why Problem D coprime in Codeforce round 827(Div 4) is retesting

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Hi everyone,

As a contestant I found that the test in the probem F wasn't good enough. I have all the prestest passed, but then somebody hacked me, so I checked what was the problem with my code and it was the size of a variant. I needed to put long long int and I used int, I think that it should give me wrong answer in a pretest, but it didn't.

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Help me for find my mistake. I don't understand. https://mirror.codeforces.com/contest/1742/submission/176450420

→ Reply