Hello Codeforces,
It has been a long while, but in this project we close the long-standing open problem proposed by Umnik 2021. You can try it here (discontinued, see the new link below) while supplies last. Currently I only imported problems from Codeforces & BZOJ (the dead Chinese OJ) but adding other OJs should be easy as long as we have the statements crawled (PRs?). Cheers!
Update (8 months later): We finally got an update! In the new version I collected and uploaded most of vjudge (which means 160k problems!). It also got a shiny new domain http://yuantiji.ac. Enjoy! :D
Nice Initiative
I don't understanding anything. But it looks like something useful so I upvote for you.
Nice job!
out of curiosity: how bad would the search results be if we don't use chatgpt to simplify the problem.
Truly amazing work. You should write a paper about it or sth.
I'm slightly worried about consequences for competitive programming... you should probably block usage during contests as an anti-cheating measure. Otherwise you'll lose your credits pretty quickly :)
In regards to cheating concerns, this may actually reduce cheating incidents by making it easier for authors to find repeated problems.
this is neat, but then won't the training data annotators know your next problem when you plug it into openai?
I'm using their paid API (same function as chatgpt but not free..), so in theory they should not be used for training :|
I guess even then someone working at openai who really really wants to cheat on a contest could do it, but that's probably not going to occur. How well does it work? I tried plugging in this year's FHC 3B which seems very similar to 1870E but the ones it gives don't seem very closely related to it.
However, I plugged CF1793F into it but it showed nothing that is even close to CF765F. What can possibly be the issue here? ig it's because of the problem background, but how to deal with that?
Update: also, with this year's CSP-S problem 2, i plugged it in but still, it isnt showing CF1223F. Even after it's paraphrased to "Given an array of integers, we want to count the number of non-empty continuous subarrays that can be reduced to an empty array by repeatedly removing adjacent identical elements.", CF1223F shows nowhere on that list.
Yeah, the system is still imperfect — we should probably experiment a better prompt to remove the backgrounds (you can find the current prompts here).
For your second example, it seems doable with a bit of luck...
Yeah, automatically removing the background and actually "formalizing" the statement will be a great feature, and will help a lot ig:)
Amazing work!
Honestly, that is impressive. I wonder if the same thing could be done but with the editorials (so that people can find applications of different ideas and algorithms).
Is the link still live? not working for me
Wow what a wonderful work. Ask Um_nik for 1000 dollars.
Lol, this could be used in today's contest to figure out the solution for D.
I have implemented this project on Poe, so that the cost of calling ChatGPT will be borne by the platform (i.e. other subscribers).
(Disclaimer: I currently work for Quora / Poe).
Sample query — https://poe.com/huikang/1512928000278451
After reading the code, someone could try some of these
Edit (October 2024): The tool no longer works.
One idea: Use LLMs to read and write a summary for top solutions' source code of a problem and use the summary together with the problem statement for searching.
Why not search the problems in VJudge?
Because that requires you searching by title.
how can i use this to make my practice more efficient ?
Auto comment: topic has been updated by TLE (previous revision, new revision, compare).
this is really working.
I tested with statement of yesterday A. https://mirror.codeforces.com/contest/1996/problem/A
and able to get https://paste.pics/3bd45350b85c97f2da491d3a8789bf3a
i cant access to the website