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

I appreciate your effort to point out those who are cheating, let’s hope CodeChef will take necessary action.

1 Like

Yes I have mailed the link to this blog to codechef. It would probly be better if more and more people mailed them. Maybe they will then do something about it. Although i dont expect them to but still I will encourage more people to mail to the following help@codechef.com

i also mailed them

1 Like

Maybe if u want please do mail at help@codechef.com

https://www.codechef.com/viewsolution/48193343 , this guy cheated whole div2 4th problem (check his code , variables ++) and become 5 star , also the funny part is he posted this on linkedin -

Hey everyone.
I am happy to announce that I got blessed with 5 :star2: on Codechef in June Lunchtime 2021 with a Global Rank of 70.
Being from a pure Tier 3 college it was too difficult but all thanks to Raj Vikramaditya. I never had a conversation with him but his videos waere a constant source of motivation for me. Every morning I woke up and said to myself ā€œRaj bhaiya kr skte to mai kyu naiā€ and that kept me going.

matlb hadd hai :rofl:

1 Like

Carryminati kabse krna lga programming :rofl:

3 Likes

Ky hi milega aise 5 star baan ke

2 Likes

Godzilla had a stroke trying to read this and fricking died.

1 Like

Waah! itne tejaswi log hai hamare paas.

3 Likes

Bhai tumhara code ekdam same hae leaked code se. And tumne code obfuscate karne k liye isme CodeChef: Practical coding for everyone faaltu k variable use kiye hae.

1 Like

Bro i never saw any genuine coder using dummy variable names like you . This code CodeChef: Practical coding for everyone and many others matches with your code. All are same as leaked code.

2 Likes
#include <bits/stdc++.h>
using namespace std;

#define fastio                        \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define INF 1000000000000000000
#define inf 1000000000
typedef long long ll;
typedef vector<vector<int>> vvi;
typedef vector<int> vi;
int sid=0,rasa=0;
void solve()
{
    ll n, m, k;
    cin >> n >> m >> k;
    ll x[n * m + 1], y[n * m + 1];
    rep(i, n * m) cin >> x[i + 1] >> y[i + 1];
    ll left = 1, right = n * m;
    ll steps = INF;
    ll mul = (n + 2) * (m + 2);
    while (left <= right)
    {
        ll mid = (left + right) / 2;
        vector<vector<int>> status(n + 5, vector<int>(m + 5, 0));
        for (int i = 1; i <= mid; i++)
        {
            if (i & 1)
                status[x[i]][y[i]] = 1;
            else
                status[x[i]][y[i]] = 2;
        }
        ll fn = 0;
        vvi col(n + 2, vi(m + 2, 0));
        for (int i = n; i >= 1; i--)
        {
            for (int j = 1; j <= m; j++)
            {
                if (status[i][j] == 1)
                    col[i][j] = col[i + 1][j] + 1;
                else
                    col[i][j] = 0;
            }
        }
        for (int i = n; i >= 1; i--)
        {
            for (int j = m; j >= 1; j--)
            {
                if (col[i][j] >= k)
                    col[i][j] = col[i][j + 1] + 1;
                else
                    col[i][j] = 0;
                if (col[i][j] >= k)
                    fn = 1;
            }
        }
        col.clear();
        col.resize(n + 2, vi(m + 2, 0));
        for (int i = n; i >= 1; i--)
        {
            for (int j = 1; j <= m; j++)
            {
                if (status[i][j] == 2)
                    col[i][j] = col[i + 1][j] + 1;
                else
                    col[i][j] = 0;
            }
        }
        for (int i = n; i >= 1; i--)
        {
            for (int j = m; j >= 1; j--)
            {
                if (col[i][j] >= k)
                    col[i][j] = col[i][j + 1] + 1;
                else
                    col[i][j] = 0;
                if (col[i][j] >= k)
                    fn = 2;
            }
        }
        if (fn == 0)
        {
            left = mid + 1;
        }
        else
        {
            if (mid < steps)
            {
                steps = mid;
                if (fn == 1)
                    ans = "Alice";
                else
                    ans = "Bob";
            }
            right = mid - 1;
        }
    }
    cout << ans << "\n";
}

signed main()
{

    fastio
        ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
}

your solution after clear obfuscation.

check this : (CodeChef: Practical coding for everyone)

your whole things are common like status , i&1 and many things .

2 Likes

https://www.codechef.com/viewsolution/48181454

And to add you have a history of cheating in codeforces too and then bragging on linkedin.
Personal submissions - Codeforces

Your solutions are skipped

2 Likes

:rofl:

1 Like

@sid_rasa galti kiye :joy: :joy:

2 Likes

@sid_rasa
Here’s the thing this is your 1st attempt(CodeChef: Practical coding for everyone) for solving which quite stands unique but your final solution to this problem is CodeChef: Practical coding for everyone
Here you have unnecasirly declared increments/decrement operations between col.clear() and col.resize() and kept the entire code almost same with little change in variables. I havent checked ur other solutions but i can tell that u copied atleast Problem4

ab jaane dijiye :rofl:

I don’t think any action would be taken. It happens in almost every contest and codechef does nothing. They are busy promoting unacademy courses

2 Likes

image