Блог пользователя CheaterExposer69

Автор CheaterExposer69, история, 4 года назад, По-английски

The contest is not even over yet! And the cheaters are spoiling this place every day. They completely spoiled CodeChef. I stopped doing CodeChef for these people. Now they are killing Codeforces too.
These screenshots doesn't help about building any idea about the problem solution. I cropped them as the contest is not over yet.

  • Проголосовать: нравится
  • +56
  • Проголосовать: не нравится

»
4 года назад, скрыть # |
 
Проголосовать: нравится -167 Проголосовать: не нравится

They did a great job, this is another trash contest anyways

  • »
    »
    4 года назад, скрыть # ^ |
     
    Проголосовать: нравится +2 Проголосовать: не нравится

    Why is it?

    • »
      »
      »
      4 года назад, скрыть # ^ |
       
      Проголосовать: нравится -133 Проголосовать: не нравится

      Problem B was pure guessing, another meaningless constructive problem, without any proofs

      • »
        »
        »
        »
        4 года назад, скрыть # ^ |
         
        Проголосовать: нравится +45 Проголосовать: не нравится

        It is certainly not Pure Guessing! Wait for the editorial before you can say such stuff!

        But if you want the intuition:

        • You want to maximize the Sum of the LCMS. This means that you don't want any loss of TOTAL SUM in the form of COMMON FACTORS!
        • For Numbers with No Common Factors(Co-Prime Numbers), LCM is their PRODUCT! Hence, you would want to pick up Co-Prime numbers together.
        • Any TWO Consecutive Integers are Co-Prime with each other(Think about it, or look it up)!
        • Now, the reason for Grouping the Largest Numbers with their Neighbours together has to do with The below two facts:
        • They are Co-Prime with their neighbors. LCM is the Product and no loss in TOTAL SUM.
        • The largest numbers are grouped together. We are looking at the Sum of Products here. Say you have a set of Resources (1,2,3,...10) and A magical power to Multiply every resource with a Multiplier each chosen from (a, b, c, d, ... j). Assume Multipliers are in sorted order. If you want to maximize your Total resources, you will GREEDILY choose to give your largest Resource the Biggest Multiplier and so on! It is the same idea for this problem, to group the largest numbers together for the product, to Maximize the Sum of Products!
»
4 года назад, скрыть # |
 
Проголосовать: нравится -10 Проголосовать: не нравится

I think, if someone has the same code (not include emptiness) as someone, need to remove him from competition.

»
4 года назад, скрыть # |
 
Проголосовать: нравится +6 Проголосовать: не нравится

How does writing this helps in fighting plagiarism? On the contrary, now many other cheaters know where to look for solutions during the contests.

»
4 года назад, скрыть # |
 
Проголосовать: нравится +4 Проголосовать: не нравится

Link to the telegram group plx

»
4 года назад, скрыть # |
 
Проголосовать: нравится +1 Проголосовать: не нравится

Hope they all enter into div 1 and leave div 2 clean xd

»
4 года назад, скрыть # |
 
Проголосовать: нравится -6 Проголосовать: не нравится

Tell me the group link. Asking for a friend. Of course the friend wants to report the group.

»
4 года назад, скрыть # |
 
Проголосовать: нравится +7 Проголосовать: не нравится

what is the usage of cheating ? Will it make that person better in CP or will it make that person more addicted to cheating in the future ? Solve a problem with rating 800 by your own, I guarantee it's more fun than copying someone else's code for a problem with rating 2000, that's all i want to say. (sorry for the bad English)

»
4 года назад, скрыть # |
 
Проголосовать: нравится -15 Проголосовать: не нравится

They did a great job, this is another trash contest anyways