// Karol Kosinski #include <cstdio> #include <algorithm> using namespace std; const int NMX = 1234567; int main() { int n, sum = 0, k = NMX; int A[NMX], *ptr = A; scanf("%d", &n); for_each(A, A + n, [&ptr](int){ scanf("%d", ptr++); }); for_each(A, A + n, [&sum](int j){ sum += j; }); if( sum % 2 == 0 ) { printf("%d\n", sum); return 0; } else if( n == 1 ) { printf("NIESTETY\n"); return 0; } for_each(A, A + n, [&k](int j){ if( j % 2 == 1 and j < k ) k = j; }); printf("%d\n", sum - k); 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 | // Karol Kosinski #include <cstdio> #include <algorithm> using namespace std; const int NMX = 1234567; int main() { int n, sum = 0, k = NMX; int A[NMX], *ptr = A; scanf("%d", &n); for_each(A, A + n, [&ptr](int){ scanf("%d", ptr++); }); for_each(A, A + n, [&sum](int j){ sum += j; }); if( sum % 2 == 0 ) { printf("%d\n", sum); return 0; } else if( n == 1 ) { printf("NIESTETY\n"); return 0; } for_each(A, A + n, [&k](int j){ if( j % 2 == 1 and j < k ) k = j; }); printf("%d\n", sum - k); return 0; } |