Use this for anything related to plagiarism - Reporting cheating, appeals, etc

general
, ,
1459

Hopefully 1B will be fair

1460

if plag not checked this time i will leave CODECHEF

15 Likes
1461

guys lets show codechef the power of unity . just dont participate from next contest as a protest against their plag checking . i would like to request all the people out there advancing to next round plz dont participate to stop it right here .

7 Likes
1462

But how are you sure that there will be no cheaters in 1B :rofl: :rofl:

5 Likes
1463

I have been watching guys who are newbies in Codeforces solving 5 problems … Ahhh only codechef things :woozy_face:

3 Likes
1464

There will not be enough cheaters on round 1B so congrats to all you guys will qualify in next round.

Cheaters are lazy too :slight_smile:

3 Likes
1465

The best part is that 40% of solutions would give a 90% and above match rate on a simple plagiarism checker which they obviously won’t run.

3 Likes
1467

~2000 out of ~20000 people cheating! That’s not really the cp community that CodeChef advertises.

1 Like
1468

Best think is some 2 star guy who himself did plagiarism is saying in threads that he mailed the leaked solution to codechef when his c++ solution of equal beauty matched with 60 percent people.

2 Likes
1469

cause after cheating 4 solutions they thought they will qualify.LOL

2 Likes
1470

Lol.:rofl:

1471

MY Snackdown’s rank is second most disappointing thing in my life first one is being getting ignored by my crush.

1472

Solved four questions still haven’t qualified maybe codechef has done swap(me, 2 star(guy))

1 Like
1473

If you don’t mind can you please explain your solution for Equal Beauty?

1474

oh brother this question has really made me suffer a lot I can’t think any simpler solution for this

1 Like
1475

Hi,can you explain the approach for the 4th problem?

1476

Fantastic

1477

Actually how people get the correct solution in last 1hour that too 1000 people in one are correct thats insane!!!
i think green ticks appear more Fastly at end.

1478

the first loop is for dividing the whole array in two subsegment and making all the element in both the subsegment equal (optimal way to make equal is to change all element to the middle value)
the second loop isn’t complex its self explanatory
the last loop for see if I take the ith element and minimum element then what is the most optimal value I need to take to match with maximum element this is done by binary search first I take difference as ith element - min then I need to get a value equal or close to max - diff

1 Like
1479

i don’t know if you get the solution but I make the solution look like a nightmare

1 Like