/* * Copyright (C) 2015 Paweł Widera * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details: * http://www.gnu.org/licenses/gpl.html */ #include <iostream> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int banknote; int total = 0; int sum_odd = 0; int min_odd = 1001; int count_odd = 0; for (int i = 0; i < n; ++i) { cin >> banknote; if (banknote % 2 == 0) { total += banknote; } else { ++count_odd; sum_odd += banknote; min_odd = min(banknote, min_odd); } } if (sum_odd > 0) { total += sum_odd; if (count_odd % 2 != 0) { total -= min_odd; } } if (total == 0) { cout << "NIESTETY" << endl; } else { cout << total << 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 46 47 48 49 50 51 52 53 54 55 56 | /* * Copyright (C) 2015 Paweł Widera * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details: * http://www.gnu.org/licenses/gpl.html */ #include <iostream> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int banknote; int total = 0; int sum_odd = 0; int min_odd = 1001; int count_odd = 0; for (int i = 0; i < n; ++i) { cin >> banknote; if (banknote % 2 == 0) { total += banknote; } else { ++count_odd; sum_odd += banknote; min_odd = min(banknote, min_odd); } } if (sum_odd > 0) { total += sum_odd; if (count_odd % 2 != 0) { total -= min_odd; } } if (total == 0) { cout << "NIESTETY" << endl; } else { cout << total << endl; } return 0; } |