#include <iostream> #include <cstdio> #include <algorithm> #define For(i, n) for (int i = 0; i < (n); i++) #define ForD(i, n) for (int i = (n) - 1; i >= 0; i--) using namespace std; int main() { int n; scanf("%d", &n); int sum = 0; int lowest = 0; //min nieparzysta; For (i, n) { int a; scanf("%d", &a); sum += a; if ((a & 1) && (lowest == 0 || a < lowest)) lowest = a; } if (sum & 1) sum -= lowest; if (lowest && sum > 0) printf("%d\n", sum); else puts("NIESTETY"); 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 | #include <iostream> #include <cstdio> #include <algorithm> #define For(i, n) for (int i = 0; i < (n); i++) #define ForD(i, n) for (int i = (n) - 1; i >= 0; i--) using namespace std; int main() { int n; scanf("%d", &n); int sum = 0; int lowest = 0; //min nieparzysta; For (i, n) { int a; scanf("%d", &a); sum += a; if ((a & 1) && (lowest == 0 || a < lowest)) lowest = a; } if (sum & 1) sum -= lowest; if (lowest && sum > 0) printf("%d\n", sum); else puts("NIESTETY"); return 0; } |