| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
Problem E is very similar to this on GFG: https://www.geeksforgeeks.org/find-two-numbers-sum-xor.
They are almost identical (you only need a small observation to notice they basically ask the same thing).
And when plagiarism checking begins, lots of people (including me) shouldn't get plagged bcz the authors created a VERY similar problem, that already exists.
I will likely get a skip. I copy pasted the exact code.
Same. But it’s legal as code was published before contest.
Yeah same here, although I've seen that in the past and could have coded on my own why not to find their code, copy paste, and save some time if it's allowed.
Totally Agree.
This is in accordance to rule that code was copied from a common published source on internet and should not be plagiarized.!!!!
Please read this.
Lots of competitive programming materials and online judges are there for decades. I think it is almost impossible to think about a problem that no one ever thought about before
It is probably quite hard but I don't think its impossible. There are almost infinite ways to start with a well-known problem and then just slightly tweak it to make a whole new problem.
190856750
same solution , wow I hate cheaters.
It is ok to use code published before the contest
Use code such as a segment tree or any algorithm, but use the problem solution from a site without any personal effort?
I don't understand, how is the person a cheater? He was able to reduce the problem to a well-known problem and got the solution online. I see nothing wrong with that. What personal effort are you talking of?
You mean that it is fair that someone took the solution from a site and another person thought about the problem and solved it? Is this fair?
I see no problem with that. Incase you never knew being able to search the internet properly could also be a useful skill in competitive programming.
Btw, so is it okay to copy segment trees online? while another person codes it from scratch during a contest?
So let's not use modern languages like Java and C++ because they have libraries and we use Assembly so we can write everything from scratch LOL
This is exactly what your first comment sounded like to me. If I know there is a solution to a problem already, why do I have to code it again? Especially when time is an important factor in CF contests. Maybe I could as well code my own custom sort during contests, instead of using inbuilt library methods.
Yes exactly, but this code is probably part of the solution, not the complete solution If this behavior is not cheating, I think this contest unrated
Again, there is nothing wrong with this contest. Sometimes in competitive programming you have reduce a problem to a well-known problem in order to solve it. Although, the reduction in this problem wasn't too much, it is not a duplicate problem. Have a nice day.
It is 100% fair because it is explicitly allowed on codeforces (link).
Meanwhile, me(;-;) who checked for all the samples and random test cases by doing brute force instead of googling it. ;-;
Still, I support your point, both problems are almost identical.
MikeMirzayanov
i think contest should be unrated.as this supports cheating online.
Pretty sure intended solution is o(1) and much simpler than the one provided.190844276
Fun fact F in this contest was also very well-known centroid-decomposition problem. For example, 342E - Xenia and Tree and 100633D - LWDB
Problem setters should Google their own problem to make sure it's not super easy to just copy and paste from an online resource bc it's not fair if people who Google beat people who want to do it on their own
Yeah, but I did it by myself. I used O(t \times log2(x)) algorithm. If it becomes unrated, I will lose 300~400 ratings.