#include <cstdio> #include <cstring> #include <cmath> #include <iostream> #include <algorithm> #include <climits> #include <queue> #include <vector> using namespace std; int n, m= INT_MAX, sum = 0, x; int main(){ scanf("%i", &n); for(int i = 0; i < n; ++i){ scanf("%i", &x); sum += x; if( x%2 == 1 && x < m) m = x; } if( sum % 2 == 1) sum -= m; if (sum == 0) printf("NIESTETY\n"); else printf("%i\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 31 | #include <cstdio> #include <cstring> #include <cmath> #include <iostream> #include <algorithm> #include <climits> #include <queue> #include <vector> using namespace std; int n, m= INT_MAX, sum = 0, x; int main(){ scanf("%i", &n); for(int i = 0; i < n; ++i){ scanf("%i", &x); sum += x; if( x%2 == 1 && x < m) m = x; } if( sum % 2 == 1) sum -= m; if (sum == 0) printf("NIESTETY\n"); else printf("%i\n", sum); return 0; } |