#include <cstdio> #include <iostream> #include <algorithm> #include <string> #include <sstream> #include <vector> #include <list> #include <set> #include <map> using namespace std; typedef vector<int> VI; typedef vector<VI> VVI; typedef pair<int, int> PI; typedef vector<PI> VPI; typedef long long LL; typedef vector<LL> VLL; #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 FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define PB push_back #define MP make_pair #define ST first #define ND second const int INF = 1000000001; const double EPS = 10e-9; int main() { int n, b, sum = 0, least = INF; scanf("%d", &n); REP(x, n) { scanf("%d", &b); sum += b; if (b % 2 == 1 && b < least) { least = b; } } if (sum % 2 == 0) { printf("%d\n", sum); } else { sum -= least; if (sum > 0) { printf("%d\n", sum); } else { printf("NIESTETY\n"); } } 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 | #include <cstdio> #include <iostream> #include <algorithm> #include <string> #include <sstream> #include <vector> #include <list> #include <set> #include <map> using namespace std; typedef vector<int> VI; typedef vector<VI> VVI; typedef pair<int, int> PI; typedef vector<PI> VPI; typedef long long LL; typedef vector<LL> VLL; #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 FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define PB push_back #define MP make_pair #define ST first #define ND second const int INF = 1000000001; const double EPS = 10e-9; int main() { int n, b, sum = 0, least = INF; scanf("%d", &n); REP(x, n) { scanf("%d", &b); sum += b; if (b % 2 == 1 && b < least) { least = b; } } if (sum % 2 == 0) { printf("%d\n", sum); } else { sum -= least; if (sum > 0) { printf("%d\n", sum); } else { printf("NIESTETY\n"); } } return 0; } |