{"problem":{"name":"Ringo's Favorite Numbers 2","description":{"content":"Ringo loves the integer $200$. Solve the problem below for him.   Given a sequence $A$ of $N$ positive integers, find the pair of integers $(i, j)$ satisfying all of the following conditions: *   $1 ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc200_c"},"statements":[{"statement_type":"Markdown","content":"Ringo loves the integer $200$. Solve the problem below for him.  \nGiven a sequence $A$ of $N$ positive integers, find the pair of integers $(i, j)$ satisfying all of the following conditions:\n\n*   $1 \\le i < j \\le N$;\n*   $A_i - A_j$ is a multiple of $200$.\n\n## Constraints\n\n*   All values in input are integers.\n*   $2 \\le N \\le 2 \\times 10^5$\n*   $1 \\le A_i \\le 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $\\dots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc200_c","tags":[],"sample_group":[["6\n123 223 123 523 200 2000","4\n\nFor example, for $(i, j) = (1, 3)$, $A_1 - A_3 = 0$ is a multiple of $200$.  \nWe have four pairs satisfying the conditions: $(i,j)=(1,3),(1,4),(3,4),(5,6)$."],["5\n1 2 3 4 5","0\n\nThere may be no pair satisfying the conditions."],["8\n199 100 200 400 300 500 600 200","9"]],"created_at":"2026-03-03 11:01:14"}}