/* * Kie.cpp * * Created on: 28 wrz 2015 * Author: Marcin Skibinski */ #include "cstdio" #include "algorithm" inline bool isOdd(const int & bill) { return bill & 1; } int main() { int n, a; int sum = 0; int minOddBill = 999, numberOfOddBills = 0; std::scanf("%d", &n); for (int i=0; i<n; ++i) { std::scanf("%d", &a); if (isOdd(a)) { minOddBill = std::min(minOddBill, a); ++numberOfOddBills; } sum += a; } if (isOdd(numberOfOddBills)) { sum -= minOddBill; } if (sum) { std::printf("%d\n", sum); } else { std::printf("NIESTETY\n"); } 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 | /* * Kie.cpp * * Created on: 28 wrz 2015 * Author: Marcin Skibinski */ #include "cstdio" #include "algorithm" inline bool isOdd(const int & bill) { return bill & 1; } int main() { int n, a; int sum = 0; int minOddBill = 999, numberOfOddBills = 0; std::scanf("%d", &n); for (int i=0; i<n; ++i) { std::scanf("%d", &a); if (isOdd(a)) { minOddBill = std::min(minOddBill, a); ++numberOfOddBills; } sum += a; } if (isOdd(numberOfOddBills)) { sum -= minOddBill; } if (sum) { std::printf("%d\n", sum); } else { std::printf("NIESTETY\n"); } return 0; } |