#include <iostream> #include <cstdio> using namespace std; const int MAXN = 1000000; int tab[MAXN+7]; int main() { int n; scanf("%d", &n); for(int i=0; i<n; i++) scanf("%d", &tab[i]); int minOdd = MAXN, sum = 0; for(int i=0; i<n; i++) { if(tab[i] % 2 == 1 && tab[i] < minOdd) minOdd = tab[i]; sum += tab[i]; } if(sum % 2 == 0) printf("%d", sum); else { int res = sum - minOdd; if(res == 0) printf("NIESTETY"); else printf("%d", res); } 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 | #include <iostream> #include <cstdio> using namespace std; const int MAXN = 1000000; int tab[MAXN+7]; int main() { int n; scanf("%d", &n); for(int i=0; i<n; i++) scanf("%d", &tab[i]); int minOdd = MAXN, sum = 0; for(int i=0; i<n; i++) { if(tab[i] % 2 == 1 && tab[i] < minOdd) minOdd = tab[i]; sum += tab[i]; } if(sum % 2 == 0) printf("%d", sum); else { int res = sum - minOdd; if(res == 0) printf("NIESTETY"); else printf("%d", res); } return 0; } |