Codechef vs Codeforces

general
47

Hey we might want collect codeforces traditions as well.

  1. Delay each contest at least by 15 mins (might go upto 30 mins as well). ( PS: last three div2 contests XD).
  2. Get negative reputation so easily XD.
4 Likes
48

I did not get the fact that why do you want plagiarism check removed .

49

And I don’t think he said so…

50

I strongly disagree with point 1.
Every time I participate in Codechef Cook-Off I feel like I’m participating in a real onsite contest ( though i’m not using any hard copy of problem set) And as it’s not sorted in ascending order of difficulty, I’ve to take a look through the problem set to find the easiest one! It’s kinda thrilling to me! :smiley:
It’s a good practice for contests like ACM ICPC :slight_smile:

51

and one contest went unrated because of weak test cases ;_;
Had answered the highest questions in that contest,ugh.

1 Like
52

Not weak test cases. Author tried to include a puzzle in competitive coding and his solution was incorrect LOL.
Thanks to him. My rank was 4000 XD

53

Hahaha was that so, I thought my solution was incorrect but i couldn’t possibly see any other solution to it :frowning: :slight_smile:

54

Where are you ? I can’t see you in HMC aka circuits :stuck_out_tongue:
Gennady also participated in HMC, only @l_returns is missing :stuck_out_tongue:

55

Announcement says author’s solution couldn’t cover all cases. That means it was incorrect.

1 Like
56

I have participated. My handle is different.
Seq que and multiplication que are boring. And got 40 in xor path and haven’t solved challenge que. Rest are AC

57

So what is your Handle ? :stuck_out_tongue: :stuck_out_tongue: :stuck_out_tongue:

58

All right!
Well can you tell me how to solve the Problem C of that contest?
I mean idk how to do a sliding window in O(n) time for that kind of question

59

I have AC in all, now going for full points in XOR-path :slight_smile:

60

Me neither. I tried Big int library with slow io Java XD

61

Yeah those seems easy. Xor path seems different.

62

:smiley:

63

I did not see any multiplication question though…

64

All questions are math questions I believe.

65

If we compute 64 bits at a time then it’s O(n*m/64) which passes and I think that should be the solution

66

I mean the question in which we have to make prefix and suffix multiplication equal

1 Like