{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"hlce","formal_name":"Humanity's Last Code Exam","introduction":"Humanity's Last Code Exam evaluates problem solving and code generation using ICPC World Finals and IOI problems. The project describes 235 problems; this import selects its public ICPC dataset of 146 problems.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://humanity-s-last-code-exam.github.io/website/","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"fd2f6c0b-a49e-5842-af72-630e432de898","task_key":"ICPC~2dWorld~2dFinals--examples--2012~5fD","task_revision_id":"3","upstream_id":"2012_D","short_description":"Fibonacci Words","config":"ICPC-World-Finals","split":"examples","body":"{\"platform\":\"atcoder\",\"question_content\":\"## Problem Description\\n\\nThe Fibonacci word sequence of bit strings is defined as:\\n\\n\\\\[ F(n) = \\n\\\\begin{cases} \\n0 & \\\\text{if } n = 0 \\\\\\\\\\n1 & \\\\text{if } n = 1 \\\\\\\\\\nF(n-1) + F(n-2) & \\\\text{if } n \\\\geq 2 \\n\\\\end{cases} \\\\]\\n\\nHere `+` denotes concatenation of strings. The first few elements are:\\n\\n\\\\[\\n\\\\begin{align*}\\nn & \\\\quad F(n) \\\\\\\\\\n0 & \\\\quad 0 \\\\\\\\\\n1 & \\\\quad 1 \\\\\\\\\\n2 & \\\\quad 10 \\\\\\\\\\n3 & \\\\quad 101 \\\\\\\\\\n4 & \\\\quad 10110 \\\\\\\\\\n5 & \\\\quad 10110101 \\\\\\\\\\n6 & \\\\quad 1011010110110 \\\\\\\\\\n7 & \\\\quad 101101011011010110101 \\\\\\\\\\n8 & \\\\quad 1011010110110101101011011010110110 \\\\\\\\\\n9 & \\\\quad 1011010110110101101011011010110110101101011011010110101 \\\\\\\\\\n\\\\end{align*}\\n\\\\]\\n\\nGiven a bit pattern `p` and a number `n`, determine how often `p` occurs in `F(n)`.\\n\\n## Input\\n\\n- The first line of each test case contains the integer \\\\( n \\\\) \\\\((0 \\\\leq n \\\\leq 100)\\\\).\\n- The second line contains the bit pattern `p`. The pattern `p` is nonempty and has a length of at most 100,000 characters.\\n\\n## Output\\n\\n- For each test case, display its case number followed by the number of occurrences of the bit pattern `p` in `F(n)`. Occurrences may overlap.\\n- The number of occurrences will be less than \\\\( 2^{63} \\\\).\\n\\n## Sample Input\\n\\n```\\n6\\n10\\n7\\n10\\n6\\n01\\n6\\n101\\n96\\n10110101101101\\n```\\n\\n## Sample Output\\n\\n```\\nCase 1: 5\\nCase 2: 8\\nCase 3: 4\\nCase 4: 4\\nCase 5: 7540113804746346428\\n```\",\"question_title\":\"Fibonacci Words\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://humanity-s-last-code-exam.github.io/website/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}