{"problem":{"name":"A*B*C","description":{"content":"Given a positive integer $K$, find the number of triples of positive integers $(A, B, C)$ such that $ABC \\leq K$. Two triples that only differ in the order of numbers are also distinguished.","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc113_a"},"statements":[{"statement_type":"Markdown","content":"Given a positive integer $K$, find the number of triples of positive integers $(A, B, C)$ such that $ABC \\leq K$. Two triples that only differ in the order of numbers are also distinguished.\n\n## Constraints\n\n*   $1\\leq K\\leq 2\\times 10^5$\n*   $K$ is an integer.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$K$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc113_a","tags":[],"sample_group":[["2","4\n\nWe have the following triples: $(1,1,1),(1,1,2),(1,2,1),(2,1,1)$."],["10","53"],["31415","1937281"]],"created_at":"2026-03-03 11:01:14"}}