#include <iostream> #include <sstream> #include <fstream> #include <string> #include <vector> #include <queue> #include <algorithm> #include <map> #include <set> using namespace std; typedef long long LL; #define MAX(a, b) ((a) > (b) ? (a) : (b)) #define MIN(a, b) ((a) < (b) ? (a) : (b)) #define ABS(val) ((val) < 0 ? -(val) : (val)) #define FOR(x, b, e) for(int x = b; x <= (e); ++x) #define FORD(x, b, e) for(int x = b; x >= (e); --x) #define REP(x, n) for(int x = 0; x < (n); ++x) #define VAR(v, n) __typeof(n) v = (n) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PB push_back #define ST first #define ND second const int INF = 1e9 + 1000; /* PA-2015 R1 */ int main() { int n; scanf("%d", &n); int sum = 0; int min_odd = INF; int v; REP(x, n) { scanf("%d", &v); if (v & 1) { min_odd = MIN(min_odd, v); } sum += v; } int res = sum; if (sum & 1) { res -= min_odd; } if (res == 0) { printf("NIESTETY\n"); } else { printf("%d\n", 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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 | #include <iostream> #include <sstream> #include <fstream> #include <string> #include <vector> #include <queue> #include <algorithm> #include <map> #include <set> using namespace std; typedef long long LL; #define MAX(a, b) ((a) > (b) ? (a) : (b)) #define MIN(a, b) ((a) < (b) ? (a) : (b)) #define ABS(val) ((val) < 0 ? -(val) : (val)) #define FOR(x, b, e) for(int x = b; x <= (e); ++x) #define FORD(x, b, e) for(int x = b; x >= (e); --x) #define REP(x, n) for(int x = 0; x < (n); ++x) #define VAR(v, n) __typeof(n) v = (n) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PB push_back #define ST first #define ND second const int INF = 1e9 + 1000; /* PA-2015 R1 */ int main() { int n; scanf("%d", &n); int sum = 0; int min_odd = INF; int v; REP(x, n) { scanf("%d", &v); if (v & 1) { min_odd = MIN(min_odd, v); } sum += v; } int res = sum; if (sum & 1) { res -= min_odd; } if (res == 0) { printf("NIESTETY\n"); } else { printf("%d\n", res); } return 0; } |