Codeforces Round #617 (Div. 3) A-E2題解

A - Array with Odd Sumc++ You are given an array $$$a$$$ consisting of $$$n$$$ integers.數組 In one move, you can choose two indices $$$1 \le i, j \le n$$$ such that $$$i \ne j$$$ and set $$$a_i := a_j$
相關文章
相關標籤/搜索