Evident Cheating in Biweekly 22
Qingchuan Zhang
1939

What kind of the bug

  • staff

Describe the bug

In the Biweekly 22, it is crystal clear that one of #7 please_AC and #12 han3000 plagiarized the other's code for q4.

I've reported multiple times to the staff at LC-CN and yet there hasn't been any action taken. If this kind of behavior is allowed and the codes are not deemed as cheating , I strongly suggest Leetcode remove the rule saying that:

LeetCode heavily emphasizes on the justice and fairness of our contests. We have absolutely ZERO TOLERANCE for violation behaviors (such as plagiarism, cheating, etc).

as it doesn't deserve boasting while other sites such as Codechef and Codeforces have strict and automatic plagiarism detection mechanism deployed.

Please DON'T disappoint your users.

Suspicious codes

class Solution:
    def maxSizeSlices(self, slices: List[int]) -> int:
        import functools
        @functools.lru_cache(None)
        def dp(i, j, k, loop = 0):
            if k == 1:
                return max(slices[i:j+1])
            if j - i + 1 < k * 2 - 1:
                return -float('inf')
            return max(dp(i + loop, j - 2, k - 1) + slices[j], dp(i, j - 1, k))
        
        return dp(0, len(slices) - 1, len(slices) // 3, 1)
# coding=utf-8
# Author: lee215
import functools

class Solution:
    def maxSizeSlices(self, A):

        @functools.lru_cache(None)
        def dp(i, j, k, loop=0):
            if k == 1: return max(A[i:j + 1])
            if j - i + 1 < k * 2 - 1: return -float('inf')
            return max(dp(i + loop, j - 2, k - 1) + A[j], dp(i, j - 1, k))
        return dp(0, len(A) - 1, len(A) // 3, 1)
Comments (5)