Update README.md
Browse files
README.md
CHANGED
@@ -97,7 +97,7 @@ Competitive programming has emerged as a critical benchmark for evaluating the r
|
|
97 |
|
98 |
## Highlights
|
99 |
|
100 |
-
**Problem Curation from Top-Tier Competitions**: AetherCode is the first benchmark to systematically collect problems from premier programming competitions worldwide, including the Olympiad in Informatics (OI) and the International Collegiate Programming Contest (ICPC). Our process involved a comprehensive collection, meticulous cleaning, and format conversion of problems from PDF to a Markdown+LaTeX structure. Each problem statement was manually proofread for correctness, and a team of competitive programming experts mannotated each problem with classification tags.
|
101 |
|
102 |
**High-Quality Test Cases**: We developed a hybrid methodology, combining automated generation with expert annotation, to create high-quality test cases for every problem. We evaluated the correctness and comprehensiveness of our test cases by validating them against a large corpus of collected solutions, enforcing a standard of zero false positives and zero false negatives.
|
103 |
|
|
|
97 |
|
98 |
## Highlights
|
99 |
|
100 |
+
**Problem Curation from Top-Tier Competitions**: AetherCode is among the first benchmark to systematically collect problems from premier programming competitions worldwide, including the Olympiad in Informatics (OI) and the International Collegiate Programming Contest (ICPC). Our process involved a comprehensive collection, meticulous cleaning, and format conversion of problems from PDF to a Markdown+LaTeX structure. Each problem statement was manually proofread for correctness, and a team of competitive programming experts mannotated each problem with classification tags.
|
101 |
|
102 |
**High-Quality Test Cases**: We developed a hybrid methodology, combining automated generation with expert annotation, to create high-quality test cases for every problem. We evaluated the correctness and comprehensiveness of our test cases by validating them against a large corpus of collected solutions, enforcing a standard of zero false positives and zero false negatives.
|
103 |
|