{"problem":{"name":"ABC conjecture","description":{"content":"You are given a positive integer $N$. Find the number of triples of positive integers $(A, B, C)$ such that $A\\leq B\\leq C$ and $ABC\\leq N$. The Constraints guarantee that the answer is less than $2^{","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc227_c"},"statements":[{"statement_type":"Markdown","content":"You are given a positive integer $N$.\nFind the number of triples of positive integers $(A, B, C)$ such that $A\\leq B\\leq C$ and $ABC\\leq N$.\nThe Constraints guarantee that the answer is less than $2^{63}$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^{11}$\n*   $N$ is an integer.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc227_c","tags":[],"sample_group":[["4","5\n\nThere are five such triples: $(1,1,1),(1,1,2),(1,1,3),(1,1,4),(1,2,2)$."],["100","323"],["100000000000","5745290566750"]],"created_at":"2026-03-03 11:01:14"}}