3 3 8 3 18 1 1000
6
10
900
For the first two cases, the following are good sets $A$ with the maximum number of elements.
* Case $1$: $A={3,4,5,6,7,8}$.
* Case $2$: $A={3,4,6,8,9,10,11,12,15,17}$.{
"problem": {
"name": "Antichain of Integer Strings",
"description": {
"content": "A set $A$ of positive integers is said to be **good** when it satisfies the following condition. * For any two distinct elements $a, b \\in A$, the string representing $a$ in base ten is **not** a s",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "agc057_a"
},
"statements": [
{
"statement_type": "Markdown",
"content": "A set $A$ of positive integers is said to be **good** when it satisfies the following condition.\n\n* For any two distinct elements $a, b \\in A$, the string representing $a$ in base ten is **not** a s...",
"is_translate": false,
"language": "English"
}
]
}