Benchmark · coding
Codeforces (Elo)
Codeforces (Elo) measures a model's competitive-programming ability by having it solve timed contest problems, reported as a Codeforces Elo rating (roughly 0–4000, where about 2000+ is strong).
Read more
- Example
- A typical item is a timed algorithmic puzzle — for example, read a problem's input and print the correct answer within strict time and memory limits, using techniques like graph search, dynamic programming, or greedy algorithms.
- Scoring
- The result is a single Elo number computed from how many contest problems the model solves and how hard they are, placed on the same rating scale Codeforces uses for human competitors.
- Verification
- Each submitted solution is judged automatically: the code is compiled and run against a hidden set of test cases and only counts as solved if it produces correct output within the time and memory limits.
- Why it matters
- It reflects multi-step algorithmic reasoning and the ability to write correct, efficient code under constraints, and maps a model's coding skill onto a rating scale people already understand.
Worked example
Task
Watermelon: given an integer w (1 ≤ w ≤ 100), the weight of a watermelon, determine whether it can be divided into two parts such that each part weighs a positive even number of kilograms. Print «YES» or «NO».
Solution
w = int(input())
print("YES" if w > 2 and w % 2 == 0 else "NO")Walkthrough
The sum of two positive even integers is itself even and at least 4, so a valid split exists exactly when w is even and w > 2 (e.g. w=8 → 2+6). Codeforces grades by compiling the submission and running it against hidden test cases, requiring exact stdout within the time and memory limits.