{"problem":{"name":"Making Triangle","description":{"content":"We have sticks numbered $1, \\cdots, N$. The length of Stick $i$ $(1 \\leq i \\leq N)$ is $L_i$. In how many ways can we choose three of the sticks with different lengths that can form a triangle? That i","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc175_b"},"statements":[{"statement_type":"Markdown","content":"We have sticks numbered $1, \\cdots, N$. The length of Stick $i$ $(1 \\leq i \\leq N)$ is $L_i$.\nIn how many ways can we choose three of the sticks with different lengths that can form a triangle?\nThat is, find the number of triples of integers $(i, j, k)$ $(1 \\leq i < j < k \\leq N)$ that satisfy both of the following conditions:\n\n*   $L_i$, $L_j$, and $L_k$ are all different.\n*   There exists a triangle whose sides have lengths $L_i$, $L_j$, and $L_k$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 100$\n*   $1 \\leq L_i \\leq 10^9$\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$L_1$ $L_2$ $\\cdots$ $L_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc175_b","tags":[],"sample_group":[["5\n4 4 9 7 5","5\n\nThe following five triples $(i, j, k)$ satisfy the conditions: $(1, 3, 4)$, $(1, 4, 5)$, $(2, 3, 4)$, $(2, 4, 5)$, and $(3, 4, 5)$."],["6\n4 5 4 3 3 5","8\n\nWe have two sticks for each of the lengths $3$, $4$, and $5$. To satisfy the first condition, we have to choose one from each length.\nThere is a triangle whose sides have lengths $3$, $4$, and $5$, so we have $2 ^ 3 = 8$ triples $(i, j, k)$ that satisfy the conditions."],["10\n9 4 6 1 9 6 10 6 6 8","39"],["2\n1 1","0\n\nNo triple $(i, j, k)$ satisfies $1 \\leq i < j < k \\leq N$, so we should print $0$."]],"created_at":"2026-03-03 11:01:14"}}