#include <iostream> #include <cstdio> #include <ctime> #include <cstdlib> #include <algorithm> #include <cmath> #include <vector> #include <map> #include <queue> #include <stack> #include <set> #include <utility> #include <fstream> #include <cassert> #define INF 999999999999999999LL #define MOD 1000000007 #define MAX 1010 #define ALL 50 #define DEBUG false using namespace std; int main() { int n,x; scanf("%d", &n); int res = 0, minOdd = MAX; for (int i = 0; i < n; ++i) { scanf("%d", &x); if ((x % 2 == 1) && minOdd > x) { minOdd = x; } res += x; } if (res % 2 == 1) res -= minOdd; if (res > 0) { printf("%d", res); } else { printf("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 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 | #include <iostream> #include <cstdio> #include <ctime> #include <cstdlib> #include <algorithm> #include <cmath> #include <vector> #include <map> #include <queue> #include <stack> #include <set> #include <utility> #include <fstream> #include <cassert> #define INF 999999999999999999LL #define MOD 1000000007 #define MAX 1010 #define ALL 50 #define DEBUG false using namespace std; int main() { int n,x; scanf("%d", &n); int res = 0, minOdd = MAX; for (int i = 0; i < n; ++i) { scanf("%d", &x); if ((x % 2 == 1) && minOdd > x) { minOdd = x; } res += x; } if (res % 2 == 1) res -= minOdd; if (res > 0) { printf("%d", res); } else { printf("NIESTETY"); } return 0; } |