#include <cstdio> #include <algorithm> #include <cmath> //#define DEBUG #ifdef DEBUG #define D(x) x #else #define D(x) #endif using namespace std; int main() { int n; scanf("%d", &n); int sum = 0; int min_odd = 0; while(n--) { int temp; scanf("%d", &temp); sum += temp; if(temp % 2 != 0 && (min_odd == 0 || temp < min_odd)) { min_odd = temp; } } if(sum % 2 != 0) { sum -= min_odd; } if(sum > 0) { 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 37 38 39 40 41 | #include <cstdio> #include <algorithm> #include <cmath> //#define DEBUG #ifdef DEBUG #define D(x) x #else #define D(x) #endif using namespace std; int main() { int n; scanf("%d", &n); int sum = 0; int min_odd = 0; while(n--) { int temp; scanf("%d", &temp); sum += temp; if(temp % 2 != 0 && (min_odd == 0 || temp < min_odd)) { min_odd = temp; } } if(sum % 2 != 0) { sum -= min_odd; } if(sum > 0) { printf("%d\n", sum); } else { printf("NIESTETY\n"); } return 0; } |