Update README.md
Browse files
README.md
CHANGED
@@ -51,4 +51,45 @@ size_categories:
|
|
51 |
|
52 |
1.4k pairs dataset of math problems and their solutions in Japanese scraped from [OnlineMathContest](https://onlinemathcontest.com/).
|
53 |
|
54 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
51 |
|
52 |
1.4k pairs dataset of math problems and their solutions in Japanese scraped from [OnlineMathContest](https://onlinemathcontest.com/).
|
53 |
|
54 |
+
Note: All problems and solutions have source urls (the `url` field), and their authors and OnlineMathContest own the copyrights.
|
55 |
+
|
56 |
+
## Dataset fields
|
57 |
+
|
58 |
+
- `contest`: Name of the contest that contains each problem.
|
59 |
+
- `contest_url`: The url of a contest that contains each problem.
|
60 |
+
- `url`: The url of each problem.
|
61 |
+
- `alphabet`: The alphabet of each problem. (e.g. `A`, `B`, ...)
|
62 |
+
- `name`: The name of each problem.
|
63 |
+
- `score`: The number of points earned for solving each problem.
|
64 |
+
- `correct`: The number of people who could solve each problem during their contest.
|
65 |
+
- `total`: The total number of people who tried to solve each problem during their contest.
|
66 |
+
- `editorials`: The solution and explanation of each problem by the author or volunteers.
|
67 |
+
- `url`: The url of each solution.
|
68 |
+
- `name`: The name of each solution. (e.g. `公式解説`)
|
69 |
+
- `content`: The content text of each solution. This might be null sometimes.
|
70 |
+
- `task_content`: The content text of each problem.
|
71 |
+
|
72 |
+
`editorials.content` and `task_content` uses Markdown and [KaTeX](https://katex.org/) markup.
|
73 |
+
|
74 |
+
## Example
|
75 |
+
|
76 |
+
```json
|
77 |
+
{
|
78 |
+
"contest": "OMC215 (お茶ゼミ√+杯)",
|
79 |
+
"contest_url": "https://onlinemathcontest.com/contests/all?page=1",
|
80 |
+
"url": "https://onlinemathcontest.com/contests/omc215/tasks/9284",
|
81 |
+
"alphabet": "A",
|
82 |
+
"name": "OMC215(A)",
|
83 |
+
"score": "100",
|
84 |
+
"correct": 387,
|
85 |
+
"total": 412,
|
86 |
+
"editorials": [
|
87 |
+
{
|
88 |
+
"content": "$$\\frac{a^2-1001a+1001^2}{b^2-1001b+1001^2}\\leq\\frac{\\max\\lbrace a^2-1001a+1001^2\\rbrace}{\\min\\lbrace b^2-1001b+1001^2\\rbrace}$$\r\nであり,等号が成立するのは $a=1,1000$ かつ $b=500,501$ のときであるので解答すべき値は\r\n$$(1+500)+(1+501)+(1000+500)+(1000+501)=\\mathbf{4004}.$$",
|
89 |
+
"text": "公式解説",
|
90 |
+
"url": "https://onlinemathcontest.com/contests/omc215/editorial/9284"
|
91 |
+
}
|
92 |
+
],
|
93 |
+
"task_content": " $1\\leq a\\leq 1000, ~ 1\\leq b\\leq 1000$ なる整数 $a,b$ について,\r\n$$\\frac{a^2-1001a+1001^2}{b^2-1001b+1001^2}$$\r\nがありうる最大の値をとるとき,$a+b$ としてありうる値の総和を求めてください."
|
94 |
+
}
|
95 |
+
```
|