UPDATE: I'm no longer contest coordinator at HackerEarth, contact tripti@hackerearth.com for proposing problems
Please read this blog as an update.
Hi everyone.
I want to describe the process to become a problem setter on HackerEarth. I'm eager to see new problem setters want to prepare contests. It's a great experience for every coder to hold a contest at least once. The first time when I prepared a contest (I was fifteen at that time, a high schooler student!) it was so sweet for me that I continued preparing problems on Codeforces, CodeChef, HackerEarth, Quera, Iran Olympiad of Informatics Finals and several more. Then I worked for 1.5 years in Quera as the contest coordinator, which was great. I'm continuing my job — Contest Coordinating — on HackerEarth from January.
We have three algorithmic contest every month, here is the table:
| Contest | Number of problems | Approximate Difficulty | Length | Comments |
|---|---|---|---|---|
| Easy | 6 | Like Codeforces Div. 2 | 3 Hours | |
| DS and Algo challenge | 3 | Easy to Medium-Hard | 1.5 Hour | |
| Circuits | 8 | One approximate problem and 7 algorithmic, from Very-Easy to Hard | 9 Days | More educational, less competitive, we could use classical problems |
As you can see, we need a lot of problems every month. To propose a problem, follow this instruction:
- Register on Ninja Setters platform. where you can write your proposal.
- I'll check your problem soon. If approved, you should prepare test cases, solution.
- We'll have you in a contest!
Our proposal queue is almost empty, so if you propose a problem today, with a high probability, your problem will be used in August contests. Here is the compensation table:
S. No. | Difficulty level | Indian setters (INR) | International setters (USD) |
1 | Very Easy | 1600 | 23 |
2 | Easy | 2300 | 35 |
3 | Easy-Medium | 3000 | 45 |
4 | Medium | 4700 | 70 |
5 | Medium-Hard | 6000 | 90 |
6 | Hard | 8000 | 120 |
7 | Approx. | 8000 | 120 |
P. S. You don't need to prepare the whole contest. A contest may have many setters, so even if you send one problem, it's welcomed.
P. S. We need an approximation problem every month. Propose it if you have some. Check the last Circuits contest for an example.
Update. It's not needed to send me a message when you register on Ninja Setters, just wait for several days, I'll add you to group such that you can start proposing problems.
Update. Users with rating less than 1600 can propose problems but the probability of acceptance is low.
What are some example problems of each difficulty level?
Very-Easy is something like A-B Div. 2 on codeforces. Easy is something like B-C Div. 2 on codeforces. ... Hard is something like D-E Div. 1 on codeforces.
Is there any rating requirement for problmem setters ?
Yeah, that's the only concern. Normally HE wants problem setters to be above 1600 on HE.
Oh :( . If that was not the case, I could contribute. I'm actively organizing easy — medium level contest on hackerrank for juiors in my college since last year.
How will we know if we are authorized to begin writing proposals on the Ninja Setters platform?
Go to Ninja setters and check if you can propose a problem.
Messaged you my email id on Codeforces add me if still looking
I received a huge number of messages in my email and also here. I'm processing them one by one. Thanks for your patience.
Please award setters for writing editorials. This will be a huge improvement for hackerearth,
Currently, we're awarding them.
Hey, Now Ninja Setters Platform shows no ongoing campaigns. Why is it so?
Registration is not enough. You should become added to HackerEarth HMC Setters group in order to be able to add problems. Now you're added. Check again.
Hey how do I check if my problem idea is accepted or not? Will I be mailed for the same?
It'll be available in the Ninja-Setters itself, but you should wait (approximately, 1 month). Thanks for your patience.
Hello, how do I get added to HackerEarth HMC Setters group?
Just message me. I added a lot of persons. Check if you are added or not.
hello, where should I message you to get added to Hackerearth HMC Setters group... I eagerly wants to share some nice set of questions made by me
Update. It's not needed to send me a message when you register on Ninja Setters, just wait for several days, I'll add you to group such that you can start proposing problems.
Well well, I think I missed this blog. Was finding a way to contribute problems apart from hiring challenges on HE. Thanks
Should I invite people to collaborate on my submission?
You can.
I just wanna know Does it help me in getting my submission reviewed earlier or not.. Because I developed the whole problem alone
I don't think so.
Arpa how long does it take to get added in the HMC setters group????
Less than a week.
I cannot find the option for proposing problem on Ninja Setters, are there any other requirements apart from rating?
As I said "Registration is not enough. You should become added to HackerEarth HMC Setters group in order to be able to add problems. Now you're added." You should notify me to do so.
Can you add to the HMC Setter group i have registered on the Ninja setter
P. S. We need an approximation problem every month. Propose it if you have some. Check last Circuits contests for an example.
Hi Arpa! Please add me to HackerEarth HMC setters group.
Currently, we need more "Very-Easy" and "Approximation" problems.
How to submit new questions to you.
https://ninja-setters.hackerearth.com/home I registered here bt the page is blank
How to send you the questions ???
Access granted.
Facing same issue.
Hey Arpa, I have signed up on the Hackerearth link provided by you but the home page shows "No campaigns are ongoing" message, How do I proceed further. A Big Thanks in Advance.
Access granted.
Are you accepting problems from below expert rating writers ?
Yes.
Can u approve my request ?
(DMed)
Hey Arpa, I had sent my details a while ago, please check the inbox.
Thanks.
Edit: Access Granted! Thanks :D
Hey Arpa ! I too had sent my details, can you please check your inbox?
EDIT : Access Received! Thanks :D
Hey Arpa! i have registered on the site provided. please check your inbox. thanks in advance.
I grant access to anyone registered periodically (e. g. every 5 days).
How much do Codeforces pay for a div2 contest?
250$
Am I allowed?
Hey Arpa, I have signed up on the Hackerearth link provided by you but the home page shows "No campaigns are ongoing" message, How do I proceed further. A Big Thanks in Advance.
Arpa Why you people need problem setters when you can easily copy paste problems from codeforces. Look at this problem from August Easy Hackerearth
https://www.hackerearth.com/practice/algorithms/dynamic-programming/2-dimensional/practice-problems/algorithm/color-the-bricks-446ade81/
This problem is exactly same as Shass and Lights from Codeforces https://mirror.codeforces.com/problemset/problem/294/C
It doesn't look copy-pasted to me.
And if something like that happens only once for some setter, it's likely a coincidence.
Ok bro but these coincidences are repeatedly happening these days and I do not have any personal problem with the setter. Every time I sit in any contest and these coincidences start happening. Just lets have a look at some coincidences:
1: Very Recent in this months long challenge at CodeChef : https://discuss.codechef.com/t/copied-problem-in-november-long-challenge/43498
2: In previous months long challenge CodeChef : https://discuss.codechef.com/t/they-removed-tandon/40304
3: Last Month at a Regional College Contest : https://mirror.codeforces.com/blog/entry/69529?#comment-541171
Sorry but these coincidences are against the spirit of the contest !!!!
WOW, do you actually "sit in any contest"?
LOL,an account made only for criticism.
The people here at this platform are fool they do not know what is right and what is wrong. Look at here https://mirror.codeforces.com/blog/entry/69529?#comment-541171 Here a Orange Coder reports Plagiarism and a guy in blue calls it a coincidence ( Orange Coder gets upvotes and Guy in blue gets dislikes) . On my post I reported plagiarism and a red coder calls it a coincidence reverse has happened !! Atleast tell me what is right and what is wrong and if I am wrong then why this https://mirror.codeforces.com/blog/entry/69529?#comment-541171 comment is having upvotes ???
1) Apparently, that problem is an "exact copy". I don't know if that's true though.
2) You tried to mock Hackerearth and Arpa with "Why you people need problem setters when you can easily copy paste problems from codeforces". Just point out that there is same problem, that's it.
Ok I accept that I mocked Hackerearth, But it is because of some reasons , In Competitive Programming we compete with others during a contest , I find it really irritating and disgusting when I come to know that any problem is copied because it gives advantage to others , also sometimes we spend sometimes on solution and later the whole problem is removed. I understand sometimes it is normal and can be a coincidence but it was happening again and again in recent days. I mocked Arpa because he was a tester of that problem and also I found out that he solved some questions from the contest from which the question was copied ( It can be a coincidence also that he did not noticed it ) . Tester and Author can do a Google Search to make sure that the question is not present on internet. Here is one more example where a very standard question was asked in Codeforces Round which was available on GeeksForGeeks and was just the first result after Google Search. https://mirror.codeforces.com/problemset/problem/1143/B https://www.geeksforgeeks.org/find-the-number-in-a-range-having-maximum-product-of-the-digits/
And people downvote you because you keep calling it copying. It usually isn't copying. Yes, problems are repeated. It's very hard to come up with a problem that has a short statement and hasn't appeared anywhere. I completely agree that authors and coordinators should try to find a problem first in Google and that digit product problem is a good example that shows they don't do it. Unless that GFG article was written after the CF round happened :D
FYI, I didn't downvote any of your comments. I just pointed out why some people do. Take that into account, but ofc. keep watching for repeated problems. The more people like you, the more careful authors will be — and that's a good thing.
There would be people that did those problems already, and they'd have an unfair advantage.
rajankur ,you shouldn't have done this!
This is highly disappointing. :(
But whatever may be the outcome rajankur , me and 17ucs031 will always be there to support you.
Few doubts regarding problem submission:
"Users with rating less than 1600 can propose problems but the probability of acceptance is low." which rating is this being referred to, HackerEarth or Codeforces? As many people like me rarely give contests on HE but appear in contests in CF.
What type of problems are in requirement currently on the basis of difficulty levels?
PS: How about highlighting the requirement for every month or 2 month on HMC Setters group?
"Arpa" you should stop testing problems. You are greedy to do both admin and tester. The testing is awful, wrong statement, weak test cases and wrong checker. Even you are tester of your own problem. What the fk here?
Can you please add me to the group?
How to check approximate questions?
Can anyone provide me the checker file of any approximate question.
The code below is the checker of the approximation problem of February Easy.
include<bits/stdc++.h>
define ll long long int
define ULL unsigned long long
define F first
define S second
define pb push_back
define PLL pair<LL,LL>
define FOR(i,lb,ub) for(i=lb;i<=ub;i++)
define RFOR(i,ub,lb) for(i=ub;i>=lb;i--)
define FORS(it,v) for(it=v.begin();it!=v.end();it++)
using namespace std;
define LIMIT 100000000
vectoradjacent[100005];
int main(int argc, char* argv[]) { // ---------------------get input-----------------// int n,m; cin>>n>>m; // n = inf.readInt(); // m = inf.readInt(); vector<pair<int,int> >edges; for(int i = 1 ; i <= m ; i++) { int u,v; cin>>u>>v; // u = inf.readInt(); // v = inf.readInt(); edges.push_back({u,v}); adjacent[u].push_back(v); adjacent[v].push_back(u); }
ll weight[n+1]; ll temp1[n+1]; for(int i = 1 ; i <= n ; i++) { cin>>weight[i]; // weight[i] = inf.readLong(); temp1[i] = weight[i]; } sort(temp1+1,temp1+n+1); /* int n,i; cin>>n; set<pair<LL,LL> > points,temp; FOR(i,0,n-1) { LL x,y; cin>>x; cin>>y; points.insert(make_pair(x,y)); } */ //-------------get output ------------------// ll k,score = 0; ll w[n+1]; ll temp[n+1]; for(int i = 1 ; i <= n ; i++) { cin>>w[i]; // w[i] = ouf.readLong((ll)1,(ll)1000000,"weight"); temp[i] = w[i]; } sort(temp+1,temp+n+1); int flag = 0; for (int i = 1; i <= n ; ++i) { assert(temp1[i] == temp[i]); } if(flag == 1) { assert(1 < 0); // quitf(_wa, "Wrong Answer"); } for(int i = 0 ; i < m ; i++) { int u = edges[i].first; int v = edges[i].second; score += (max(w[u],w[v])); } cout<<score<<endl; // quitf(_ok, "Accepted Answer");return 0; }
But their is no approximate question in Feb easy.
Oh, mistaken. I mean February Circuits.
Arpa I found "No campaigns are ongoing" on ninja-setters.hackerearth.com How can I send problem. Thanks in advance.
Refer to this blog post.
Hi, I have submitted a few problems till when will they be reviewed?
Takes 1~2 months. Thanks for your patience.