ID stringlengths 8 10 | Year int64 2.01k 2.01k | Problem Number int64 1 15 | Part stringclasses 2
values | problem stringlengths 115 910 | answer stringlengths 1 3 | completion sequencelengths 16 16 | completion_answer sequencelengths 16 16 | completion_correct sequencelengths 16 16 | completion_succ_rate float64 0 1 |
|---|---|---|---|---|---|---|---|---|---|
2008-I-10 | 2,008 | 10 | I | "Let $ABCD$ be an isosceles trapezoid with $\\overline{AD}||\\overline{BC}$ whose angle at the longe(...TRUNCATED) | 32 | ["Okay, let's try to solve this problem step by step. It seems a bit complicated, but I'll take it s(...TRUNCATED) | [". so,..","31",".",".","\\ \\ we coordinates\\ \\ \\ \\ \\ perhaps \\\\88 given800\\ \\ given10\\7\(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | 0 |
2008-I-11 | 2,008 | 11 | I | "Consider sequences that consist entirely of $A$ 's and $B$ 's and that have the property that every(...TRUNCATED) | 172 | ["Okay, so I've got this problem here about counting sequences made up of A's and B's. The condition(...TRUNCATED) | ["377",":",".,?",":?,?)","1","377","256","377","-by is,?. but.",",,,. but.","34","377",".","610","..(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | 0 |
2008-I-12 | 2,008 | 12 | I | "On a long straight stretch of one-way single-lane highway, cars all travel at the same speed and al(...TRUNCATED) | 375 | ["Okay, so I have this problem about cars on a highway, and I need to figure out the maximum number (...TRUNCATED) | ["375","375"," wait","375","337"," wait",".wait?","375","750","375","100","375","300",". wait",". wa(...TRUNCATED) | [
true,
true,
false,
true,
false,
false,
false,
true,
false,
true,
false,
true,
false,
false,
false,
false
] | 0.375 |
2008-I-13 | 2,008 | 13 | I | "Let $p(x,y) = a_0 + a_1x + a_2y + a_3x^2 + a_4xy + a_5y^2 + a_6x^3 + a_7x^2y + a_8xy^2 + a_9y^3$ . (...TRUNCATED) | 40 | ["Okay, so I have this problem about a polynomial p(x, y) of degree 3 in both x and y. The polynomia(...TRUNCATED) | [".wait",". wait is +....wait."," x is is","."," something. etc wait)( is isWait,.... wait=I?, etc,)(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | 0 |
2008-I-14 | 2,008 | 14 | I | "Let $\\overline{AB}$ be a diameter of circle $\\omega$ . Extend $\\overline{AB}$ through $A$ to $C$(...TRUNCATED) | 432 | ["<think>\nOkay, let's try to solve this geometry problem step by step. So, here's the problem again(...TRUNCATED) | ["= wait","81","m^2","."," wait is x成为一个 somethingWait","162","162","324","810","486"," Wait(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | 0 |
2008-II-1 | 2,008 | 1 | II | "Let $N = 100^2 + 99^2 - 98^2 - 97^2 + 96^2 + \\cdots + 4^2 + 3^2 - 2^2 - 1^2$ , where the additions(...TRUNCATED) | 100 | ["Alright, let me try to figure out how to solve this problem. The problem is:\n\nLet \\( N = 100^2 (...TRUNCATED) | [
"100",
"100",
"100",
"100",
"100",
"100",
"100",
"100",
"800",
"400",
"300",
"100",
"100",
"100",
"100",
"100"
] | [
true,
true,
true,
true,
true,
true,
true,
true,
false,
false,
false,
true,
true,
true,
true,
true
] | 0.8125 |
2008-II-2 | 2,008 | 2 | II | "Rudolph bikes at a constant rate and stops for a five-minute break at the end of every mile. Jennif(...TRUNCATED) | 620 | ["Okay, let's see. I have this problem where Rudolph and Jennifer are both biking to a 50-mile mark.(...TRUNCATED) | [
"605",
"605",
"620",
"625",
"620",
"620",
"620",
"620",
"625",
"625",
"625",
"625",
"620",
"620",
"625",
"605"
] | [
false,
false,
true,
false,
true,
true,
true,
true,
false,
false,
false,
false,
true,
true,
false,
false
] | 0.4375 |
2008-II-3 | 2,008 | 3 | II | "A block of cheese in the shape of a rectangular solid measures $10$ cm by $13$ cm by $14$ cm. Ten s(...TRUNCATED) | 729 | ["Okay, so I have this problem about a block of cheese shaped like a rectangular solid with dimensio(...TRUNCATED) | ["729","600","729","520"," wait,","720","520","729","520","520","729","729","520","1720","729","729"(...TRUNCATED) | [
true,
false,
true,
false,
false,
false,
false,
true,
false,
false,
true,
true,
false,
false,
true,
true
] | 0.4375 |
2008-II-4 | 2,008 | 4 | II | "There exist $r$ unique nonnegative integers $n_1 > n_2 > \\cdots > n_r$ and $r$ integers $a_k$ ( $1(...TRUNCATED) | 21 | ["Alright, let's try to tackle this problem step by step. The problem is about expressing the number(...TRUNCATED) | ["21"," wait","20","21",". wait,? is",",=","15","21","? is"," is is...,","."," is. but","24","20","1(...TRUNCATED) | [
true,
false,
false,
true,
false,
false,
false,
true,
false,
false,
false,
false,
false,
false,
false,
false
] | 0.1875 |
2008-II-5 | 2,008 | 5 | II | "In trapezoid $ABCD$ with $\\overline{BC}\\parallel\\overline{AD}$ , let $BC = 1000$ and $AD = 2008$(...TRUNCATED) | 504 | ["Okay, so I have this trapezoid problem. Let me try to visualize it first. The problem says:\n\nIn (...TRUNCATED) | ["?"," =x something?. wait","1504","1504","1504","504","1504","504","504","504","504","1504","1504",(...TRUNCATED) | [
false,
false,
false,
false,
false,
true,
false,
true,
true,
true,
true,
false,
false,
false,
false,
true
] | 0.375 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 18