#include <iostream> #include <vector> using namespace std; /** * Mateusz Smiech * Zadanie Kieszonkowe [B] z 1. rundy Potyczek * Algorytmicznych 2015. */ int main() { ios_base::sync_with_stdio(0); int n, k; cin >> n; int sum = 0; int impairCount = 0; int smallestImpair = -1; for (int i = 0; i < n; i++) { cin >> k; sum += k; if (k % 2 == 1) { impairCount++; if (k < smallestImpair || smallestImpair == -1) smallestImpair = k; } } if (impairCount % 2 == 1) sum -= smallestImpair; if (sum == 0) cout << "NIESTETY" << endl; else cout << sum << 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 | #include <iostream> #include <vector> using namespace std; /** * Mateusz Smiech * Zadanie Kieszonkowe [B] z 1. rundy Potyczek * Algorytmicznych 2015. */ int main() { ios_base::sync_with_stdio(0); int n, k; cin >> n; int sum = 0; int impairCount = 0; int smallestImpair = -1; for (int i = 0; i < n; i++) { cin >> k; sum += k; if (k % 2 == 1) { impairCount++; if (k < smallestImpair || smallestImpair == -1) smallestImpair = k; } } if (impairCount % 2 == 1) sum -= smallestImpair; if (sum == 0) cout << "NIESTETY" << endl; else cout << sum << endl; return 0; } |