{"problem":{"name":"Repunit Trio","description":{"content":"A repunit is an integer whose digits are all $1$ in decimal representation. The repunits in ascending order are $1, 11, 111, \\ldots$. Find the $N$\\-th smallest integer that can be expressed as the sum","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc333_c"},"statements":[{"statement_type":"Markdown","content":"A repunit is an integer whose digits are all $1$ in decimal representation. The repunits in ascending order are $1, 11, 111, \\ldots$.\nFind the $N$\\-th smallest integer that can be expressed as the sum of exactly three repunits.\n\n## Constraints\n\n*   $N$ is an integer between $1$ and $333$, inclusive.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc333_c","tags":[],"sample_group":[["5","113\n\nThe integers that can be expressed as the sum of exactly three repunits are $3, 13, 23, 33, 113, \\ldots$ in ascending order. For example, $113$ can be expressed as $113 = 1 + 1 + 111$.\nNote that the three repunits do not have to be distinct."],["19","2333"],["333","112222222233"]],"created_at":"2026-03-03 11:01:13"}}