Cheating! Cheating! Cheating!

Some people have posted the solutions of codechef January long challenge on YouTube 1 week ago , and codechef did nothing. Whyyyy ? The video already got 24k views . Do something Fast @codechef team please.

19 Likes

yes bro…
this is bad for real

3 Likes

ruins the competitive spirit of the game(contest)

4 Likes

Won’t be surprised if a admin jumps in and deletes this thread soon

1 Like

Ye sab apne pe depend karta hai bhai, mai ne bhi wo video dekhi hai lekin I didn’t submit for that question, cz I know usse kuch nahi milega. What you’ll do with fake ratings. So complain karna chod do jo copy karega uska hi loss hoga aage.

10 Likes

Bro, sab bewakoof h ye sochre h ki Amazon Google uthake leke jayenge Rating agar 2000+ ho. Newbies ka google, microsoft, morgan stanley m ho jata h(Proof- Every day some or other I have seen so many 2 stars bag Jp Morgan Analyst role). Also kabhi kabhi Red coders ka nhi hota. Demoralizer ko Google codenation reject kiye h. Bas Ds karo, projects karo

2 Likes

Absolutely agree with you! Cheating is awful and loses the whole point of some things

1 Like

This is why I deactivated my 5 star rated account last year. :slightly_smiling_face:

I feel that 5* rating of CodeChef doesn’t even have value that pupil on codeforces has, literally, I was very demotivated in march long challenge when I saw most of the codes which were just different in a few statements. And what’s worst, I was trying the same problem since like 4-5 days. That’s what demotivated me extremely and I gave up CP and decided not to use CodeChef again. But then, college placements started, and I couldn’t find any relevent suggestions & guidance except on CodeChef discuss :slightly_frowning_face:

Even after having 2000+ rating this is what happened to me back then. And today, when I opened some last hour submissions of Expected Number of SCCs in Div 2, I was shocked to see same code everywhere, :fire: pretty cool, everyone just got the same logic of some complex code, that too in the last hour. :exploding_head:

Now I am wondering what kind of dilemma are the genuine guys who pariticipated seriously are in, after witnessing their rank fall drastically in the last few hours. Seems like I made a right decision back then. :relieved:

3 Likes

Code Chef says they will decrease rating / ban the user who cheats -

Le us -

5 Likes

This is nothing, WIPL question was good in terms of difficulty, people who don’t know full name of DP did this question in one go😂

And ANTCHEF in which I gave my three days made diagrams ,analysis… etc, last day the submissions of this question increased exponentially :unamused:

and at last by cheating who think after five stars they will get MNC , may you get
but one thing which is always with you throughout with your life that is honesty.

5 Likes

LMAO , from my college two of them has same code , also i doubt they copied from somewhere else :rofl:

1 Like

codechef is just now to learn nothing else !

Though I have gone through some of the submissions from my college mates i found this 3 submission similar. where is the MOSS detector of codechef or it has gone with directi

Differentiate among the following!!
1.) Solution: 41555389 | CodeChef
2.) Solution: 41469820 | CodeChef
3.) Solution: 41511821 | CodeChef

I don’t know weather they feel it or not this discourage talents though its there choice completely.

I have one approach that why not code chef have one option for fellow mates to flag over the solution and that to can be check for plagiarism.@admin

2 Likes

In my college, one of them wrote WIPL code same to same in java language which was leaked and she submitted it in java.
and their others codes were written in c++, then after she was trying to change the WIPL code in c++, because of it her code has 6 wrong submission :rofl:

and then she will post on linkedin , by saying see my hardwork i solved X questions , and then some random guy tell in comment section then she will reply , u don’t know how hard i worked for that question , u don’t have any right to judge someone . … blah blah

2 Likes

Here we are getting nightmares due to questions and some are buying solution for real money. Seriously, this ruins the enthusiasm for the contest. :frowning_face:
Indeed, people are buying and that’s why they’re selling, instead of buying if they would have reported then the whole scenario would have been different. :disappointed:
No one can help if you don’t understand the feeling of honesty and happiness after solving a question by yourself. :slightly_smiling_face:

3 Likes

long run me rating sabki giregi , it took me 8 hours to come up with optimized solution for black jack and some only copied it and submited it

2 Likes

yeah I have a humble request from the codechef to do something.

This is how cheaters submit there code to avoid plag…
bloody cheaters…
.
#include<bits/stdc++.h>
#define int long long
int mod = 1e9 + 7;
using namespace std;
//aaaaaaaasssssddddddd
signed main()
{
int t;
//dddddsssssdddd
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
cin>>t;
while(t–){
int n;
cin>>n;
//dkdjdhih
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
map<int , unordered_set> m;
vector<unordered_set> pos_num(n) , neg_num(n);
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
//wguiwggw
for(int i = 0; i<n; i++){
int k;
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
cin>>k;
for(int j = 0; j<k; j++){
int temp;
cin>>temp;
//qwhuhuhuhuhuhuhuhuhuhuhuhuhuhuhuhdwqoooooh2qgduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduoduod222222222222222222222222222222222
m[abs(temp)].insert(i);
if(temp > 0){
pos_num[i].insert(temp);
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
}
else{
neg_num[i].insert(-1*temp);
}
}
}

	//o2dgo2dg82d9
	//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
	//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
	//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
	//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
	int ans1 = 0;
	for(auto d : m){
		if(d.second.size() > 1){
			//cout<<">1 \n";
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			ans1 ++;
			for(auto i : d.second){
				if(pos_num[i].count(d.first)){
					pos_num[i].erase(d.first);
					ans1 += pos_num[i].size();
				}
				
				
				if(neg_num[i].count(d.first)){
					neg_num[i].erase(d.first);
					ans1 += neg_num[i].size();
				}
				//cout<<">1 \n";
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//cout<<">1 \n";
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			}
		}
		else{
			//cout<<"<n \n";
			for(auto i : d.second){
				if(pos_num[i].count(d.first)){
					pos_num[i].erase(d.first);
					ans1 += neg_num[i].size();
				}
				
				
				if(neg_num[i].count(d.first)){
					//cout<<"y ";
					
					//cout<<">1 \n";
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
					neg_num[i].erase(d.first);
					
			//cout<<">1 \n";
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
					ans1 += pos_num[i].size();
				}
			}
			//cout<<">1 \n";
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
			//ddddddffffffffffgggggggggggggbbbbbbbbbbbbgdeeeee
		}
	}
	cout<<ans1<<"\n";
}

}

1 Like