#include <cstdio> #include <cstdlib> #include <vector> #include <map> #include <algorithm> #include <set> #include <time.h> #include <queue> using namespace std; int main () { int n, a; scanf("%d", &n); int sum = 0; int min_odd = 1000; bool odd_odds = false; for (int i = 0; i < n; ++i) { scanf("%d", &a); sum += a; if (a % 2) { odd_odds = !odd_odds; min_odd = min(min_odd, a); } } if (odd_odds) { sum -= min_odd; } if (sum) { printf("%d\n", sum); } else { 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 | #include <cstdio> #include <cstdlib> #include <vector> #include <map> #include <algorithm> #include <set> #include <time.h> #include <queue> using namespace std; int main () { int n, a; scanf("%d", &n); int sum = 0; int min_odd = 1000; bool odd_odds = false; for (int i = 0; i < n; ++i) { scanf("%d", &a); sum += a; if (a % 2) { odd_odds = !odd_odds; min_odd = min(min_odd, a); } } if (odd_odds) { sum -= min_odd; } if (sum) { printf("%d\n", sum); } else { printf("NIESTETY\n"); } return 0; } |