{"problem":{"name":"Modulo Summation","description":{"content":"You are given $N$ positive integers $a_1, a_2, ..., a_N$. For a non-negative integer $m$, let $f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N)$. Here, $X\\ mod\\ Y$ denotes the remainder of t","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc103_c"},"statements":[{"statement_type":"Markdown","content":"You are given $N$ positive integers $a_1, a_2, ..., a_N$.\nFor a non-negative integer $m$, let $f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N)$.\nHere, $X\\ mod\\ Y$ denotes the remainder of the division of $X$ by $Y$.\nFind the maximum value of $f$.\n\n## Constraints\n\n*   All values in input are integers.\n*   $2 \\leq N \\leq 3000$\n*   $2 \\leq a_i \\leq 10^5$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$a_1$ $a_2$ $...$ $a_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc103_c","tags":[],"sample_group":[["3\n3 4 6","10\n\n$f(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10$ is the maximum value of $f$."],["5\n7 46 11 20 11","90"],["7\n994 518 941 851 647 2 581","4527"]],"created_at":"2026-03-03 11:01:14"}}