Weak test cases for CIRCHAOS

#1

Test cases for the CIRCHAOS were really weak.

I have a unending list of submissions which were accepted during the contest.

Test Cases:

5
999987300 2
999987301 999987301
999987300 2
999987301 999987301
999987300 2
999987301 999987301
999987300 2
999987301 999987301
999987300 2
999987301 999987301

I am really disappointed @admin

Above Code takes around 12sec for 5test cases only. I am not sure How this code got accepted.

12 Likes
#2

Test cases should be strong. You are great bhaiya.

3 Likes
#3

I have to agree with you.

1 Like
#4

Do you guys feel the same? @anj_sam @akg150

2 Likes
#5

There is no need of 5 test cases bro. Only 1 test case will give time limit exceeded​:crazy_face::crazy_face:

4 Likes
#6

there is a reason codechef hides its test cases
nothing new with it…get over it

5 Likes
#7

https://images.app.goo.gl/oHJT4KzLus7Eq76p6

#8

Aap great ho bhaiya. Kaise kar lete ho yeh sab :slight_smile:

#9

If it was a long contest, I had no problem. There is a reason I only participate in short contests.
…

2 Likes
#10

I believe some kind of hacking phase must be introduced to overcome such problems, it would be beneficial for everyone I guess.

2 Likes
#11

@admin we need some solution.

#12

Really Disappointing😒

#13

Yes

#15

I think cases are just random.
No work done on having better test cases.
If n is smaller than gcd definately they should have stopped these too slow solutions.

1 Like
#16

It happens on Codechef very often

#17

@All : My mistake I did not notice the constraints. Where it is clearly mentioned that all the power are unique. If any power is prime, the you would get the gcd as 1. in All other cases, maximum gcd that we can get ~10^5. Hence the complexity becomes linear

#20

What if there is only 1 power and that also near 10e9 ??

#21

True that.