{"problem":{"name":"Yet Another Recursive Function","description":{"content":"A function $f(x)$ defined for non-negative integers $x$ satisfies the following conditions. *   $f(0) = 1$. *   $f(k) = f(\\lfloor \\frac{k}{2}\\rfloor) + f(\\lfloor \\frac{k}{3}\\rfloor)$ for any positive","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc275_d"},"statements":[{"statement_type":"Markdown","content":"A function $f(x)$ defined for non-negative integers $x$ satisfies the following conditions.\n\n*   $f(0) = 1$.\n*   $f(k) = f(\\lfloor \\frac{k}{2}\\rfloor) + f(\\lfloor \\frac{k}{3}\\rfloor)$ for any positive integer $k$.\n\nHere, $\\lfloor A \\rfloor$ denotes the value of $A$ rounded down to an integer.\nFind $f(N)$.\n\n## Constraints\n\n*   $N$ is an integer satisfying $0 \\le N \\le 10^{18}$.\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":"abc275_d","tags":[],"sample_group":[["2","3\n\nWe have $f(2) = f(\\lfloor \\frac{2}{2}\\rfloor) + f(\\lfloor \\frac{2}{3}\\rfloor) = f(1) + f(0) =(f(\\lfloor \\frac{1}{2}\\rfloor) + f(\\lfloor \\frac{1}{3}\\rfloor)) + f(0) =(f(0)+f(0)) + f(0)= 3$."],["0","1"],["100","55"]],"created_at":"2026-03-03 11:01:14"}}