{"problem":{"name":"Problem where Commas Separate Digits","description":{"content":"You are given a string $S$ consisting of digits between `1` and `9`, inclusive. You will insert at most $K$ commas (`,`) into this string to separate it into multiple numbers. Your task is to minimize","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":3000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"asaporo_f"},"statements":[{"statement_type":"Markdown","content":"You are given a string $S$ consisting of digits between `1` and `9`, inclusive. You will insert at most $K$ commas (`,`) into this string to separate it into multiple numbers.\nYour task is to minimize the maximum number among those produced by inserting commas. Find minimum possible such value.\n\n## Constraints\n\n*   $0 ≦ K < |S| ≦ 100,000$\n*   $S$ consists of digits between `1` and `9`, inclusive.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$K$\n$S$\n\n## Partial Scores\n\n*   In the test set worth $100$ points, $|S| ≦ 2$.\n*   In the test set worth another $100$ points, $|S| ≦ 16$.\n*   In the test set worth another $200$ points, $|S| ≦ 100$.\n*   In the test set worth another $200$ points, $|S| ≦ 2,000$.\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"asaporo_f","tags":[],"sample_group":[["2\n15267315","315\n\nWhen the string is separated into $152$, $67$ and $315$, the maximum among these is $315$, which is the minimum possible value."],["0\n12456174517653111","12456174517653111\n\n$12456174517653111$ itself is the answer."],["8\n127356176351764127645176543176531763517635176531278461856198765816581726586715987216581","5317635176"]],"created_at":"2026-03-03 11:01:13"}}