#include <iostream> #include <algorithm> #include <cstdint> using namespace std; uint64_t n; uint64_t a; uint64_t minanp = 100000; uint64_t numanp = 0; uint64_t sumap = 0; uint64_t sumanp = 0; int main() { cin >> n; int i; for (i = 0; i < n; i++) { cin >> a; if ((a % 2) == 0) { sumap += a; } else { sumanp += a; if (a < minanp) minanp = a; numanp ++; } } if ((n == 1) && (numanp == 1)) { cout << "NIESTETY" << endl; return 0; } if ((numanp % 2) == 0) cout << (sumanp + sumap) << endl; else cout << (sumanp + sumap - minanp) << endl; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 | #include <iostream> #include <algorithm> #include <cstdint> using namespace std; uint64_t n; uint64_t a; uint64_t minanp = 100000; uint64_t numanp = 0; uint64_t sumap = 0; uint64_t sumanp = 0; int main() { cin >> n; int i; for (i = 0; i < n; i++) { cin >> a; if ((a % 2) == 0) { sumap += a; } else { sumanp += a; if (a < minanp) minanp = a; numanp ++; } } if ((n == 1) && (numanp == 1)) { cout << "NIESTETY" << endl; return 0; } if ((numanp % 2) == 0) cout << (sumanp + sumap) << endl; else cout << (sumanp + sumap - minanp) << endl; return 0; } |