{"problem":{"name":"A Recursive Function","description":{"content":"A function $f(x)$ defined for non-negative integer $x$ satisfies the following conditions: *   $f(0) = 1$; *   $f(k) = k \\times f(k-1)$ for all positive integers $k$. Find $f(N)$.","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc273_a"},"statements":[{"statement_type":"Markdown","content":"A function $f(x)$ defined for non-negative integer $x$ satisfies the following conditions:\n\n*   $f(0) = 1$;\n*   $f(k) = k \\times f(k-1)$ for all positive integers $k$.\n\nFind $f(N)$.\n\n## Constraints\n\n*   $N$ is an integer such that $0 \\le N \\le 10$.\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":"abc273_a","tags":[],"sample_group":[["2","2\n\nWe have $f(2) = 2 \\times f(1) = 2 \\times 1 \\times f(0) = 2 \\times 1 \\times 1 = 2$."],["3","6\n\nWe have $f(3) = 3 \\times f(2) = 3 \\times 2 = 6$."],["0","1"],["10","3628800"]],"created_at":"2026-03-03 11:01:14"}}