We invite you to participate in CodeChef's Starter's 64, today, November 9, rated till 5-stars Coders (i.e. for users with rating < 2200). This contest is organized by Exun Clan, Delhi Public School, R. K. Puram.
Time: 8:00 PM — 11:00 PM IST
Joining us on the setting panel are:
- Setters: Vishesh vishesh312 Saraswat, Ritul ritul_kr_singh Kumar Singh, Utkarsh Utkarsh.25dec Gupta, Satyam satyam343
- Testers: Nishank IceKnight1093 Suresh, Satyam satyam343
- Statement Verifier: Kanhaiya notsoloud1 Mohan
- Video Editorialists: Sundar K , Garvit Virmani, Vibhu Bhatia, Madhav Jha, Suraj Jha, Jwala, Rohit Oze, Adhish Kancharla
- Text Editorialist: Nishank IceKnight1093 Suresh
- Contest Admins: Jeevan JeevanJyot Jyot Singh, Utkarsh Utkarsh.25dec Gupta
High School Students registered here have to participate at https://www.codechef.com/EXUN22MI to be eligible for the following:
- Top 3 High School Students will receive prizes and certificates of merit.
- Top 8 Indian High School Students will be invited for onsite finals at Delhi Public School, R.K. Puram on November 13. More details can be found here.
Registrations are now closed.
Check out our invite if you are interested in participating in other technical events including our flagship Cryptic Hunt X CTF Sudocrypt v12.0.
Written editorials will be available for all on CodeChef Discuss. Pro users can find the editorials directly on the problem pages after the contest.
The video editorials of the problems will be available for all users for 1 day as soon as the contest ends, after which they will be available only to Pro users.
Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef’s contests, you can share them here.
Good luck and we hope you enjoy the contest!
Just name it codechef regular lol
another cheaters contest :)
Looking forward to the contest!
Enjoyed last year's contest a lot Hoping for a good contest this time too!
Written editorials will be available for all on CodeChef Discuss.
Why? at least you should keep the written editorials on the problem page. At this rate one day we can see pro users can submit in contest time and others can not. That day is not very far from today.
I'm not sure what you're trying to convey. CodeChef Discuss is public.
When you stuck at a problem in codeforces, do you search in google writing "round x problem y editorial"? or just click tutorial link button at the bottom right corner? In codechef discuss lots of other topics will be popped up and after a few days another contest will take place which will replace the past contests editorials. You have no alternative but searching in google writing "round x problem y editorial".
Ok I get it. There's a workaround though. If you're in a problem's practice section, click 'expand' at the top and it will show the name and link of the contest. In the contest page, I still see a link to 'textual problem solutions'. If they get rid of that link, you can still access CodeChef Discuss like this, writing the contest tag at the top (e.g. startXX for Starters), so you only see posts of editorials from that contest.
I know it's still a bit tedious but this way you don't search in Google. If anyone from CodeChef is reading this, please don't set tags for pro users only :D
Now you have found out another important aspect. Codechef will definitely make this available only for pro users very soon.
Written editorial is public bro, and though there are some drawbacks in Codechef, don't spread hate here.
See the above comment for my point of view. I am not spreading hate. CP is a fun. Hiding editorial and other things just demoralize the users to use the site and thats it.
only fools gonna buy codechef pro ;)
Prime Factor Division was straightforward available on GFG :)
Lol I should've looked it up, but from someone that didn't think to look it up, I thought the problem was kind of cool.
Prime factor division was so standard problem that literally a naive google search can get it accepted. Just search, "check if a number is divisible by all prime divisors of another number".
Anyways, can somebody give hints on
XORARRAY?for a particular bit k, you cant have two pairs in the subarray, such that a[i] < a[i+1] and another pair a[j] > a[j+1] where k is first unequal bit for both
can someone pls tell whats wrong? don't know whats wrong. I have done similar to what explained in editorial. problem: SQUARESORT link: https://www.codechef.com/viewsolution/79565377
Distinct Neighbour Any idea why my method is failing?
idea:
-sort the array
-assign some different value to ith index
-remainging elements groups and groups made should be less than 2
Try this case
6
1 1 2 2 3 3 3 3 3 3 3 3
It should be “YES”
You can group in this way
1 3
3 1
3 3
2 3
3 2
3 3
The editorials are now available here!