#include <cstdio> #include <algorithm> using namespace std; const int MAXN = 1000*1000; const int INF = 1001; int n; int sum; int minOdd = INF; int main() { scanf("%d", &n); for (int i = 0; i < n; i++) { int x; scanf("%d", &x); sum += x; if ((x & 1) && x < minOdd) minOdd = x; } if (sum & 1) { if (sum == minOdd) puts("NIESTETY"); else printf("%d\n", sum - minOdd); } else printf("%d\n", sum); 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 | #include <cstdio> #include <algorithm> using namespace std; const int MAXN = 1000*1000; const int INF = 1001; int n; int sum; int minOdd = INF; int main() { scanf("%d", &n); for (int i = 0; i < n; i++) { int x; scanf("%d", &x); sum += x; if ((x & 1) && x < minOdd) minOdd = x; } if (sum & 1) { if (sum == minOdd) puts("NIESTETY"); else printf("%d\n", sum - minOdd); } else printf("%d\n", sum); return 0; } |