#include <cstdio> #include <algorithm> using namespace std; int n, x; int * tab; int min_odd, sum; int main() { min_odd = 1001; sum = 0; scanf("%d", &n); tab = new int[n]; for (int i = 0; i < n; i++){ scanf("%d", &x); if ((x % 2 == 1) && (x < min_odd)) { min_odd = x; } sum = sum + x; } if ((sum % 2 == 1) && (min_odd < 1001)) { sum = sum - min_odd; } else if (sum % 2 == 1) { puts("NIESTETY"); } if (sum > 0){ printf("%d", 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 | #include <cstdio> #include <algorithm> using namespace std; int n, x; int * tab; int min_odd, sum; int main() { min_odd = 1001; sum = 0; scanf("%d", &n); tab = new int[n]; for (int i = 0; i < n; i++){ scanf("%d", &x); if ((x % 2 == 1) && (x < min_odd)) { min_odd = x; } sum = sum + x; } if ((sum % 2 == 1) && (min_odd < 1001)) { sum = sum - min_odd; } else if (sum % 2 == 1) { puts("NIESTETY"); } if (sum > 0){ printf("%d", sum); } else { puts("NIESTETY"); } return 0; } |