{"problem":{"name":"Index Trio","description":{"content":"You are given an integer sequence $A = (A_1, \\dots, A_N)$ of length $N$. Find the number of triplets of integers $(i, j, k)$ satisfying all of the conditions below. *   $1 \\leq i, j, k \\leq 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":"abc249_d"},"statements":[{"statement_type":"Markdown","content":"You are given an integer sequence $A = (A_1, \\dots, A_N)$ of length $N$.\nFind the number of triplets of integers $(i, j, k)$ satisfying all of the conditions below.\n\n*   $1 \\leq i, j, k \\leq N$\n*   $\\frac{A_i}{A_j} = A_k$\n\n## Constraints\n\n*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq A_i \\leq 2 \\times 10^5 \\, (1 \\leq i \\leq N)$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $\\ldots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc249_d","tags":[],"sample_group":[["3\n6 2 3","2\n\n$(i, j, k) = (1, 2, 3), (1, 3, 2)$ satisfy the conditions."],["1\n2","0"],["10\n1 3 2 4 6 8 2 2 3 7","62"]],"created_at":"2026-03-03 11:01:13"}}