#include<cstdio> #include<vector> #include<algorithm> #include<set> #include<iostream> using namespace std; #define rep(i,n) for(int i=0; i<(int)n; i++) #define st first #define nd second #define mp make_pair #define pb push_back typedef vector<int> vi; typedef pair<int, int> pi; typedef vector<pi> vpii; typedef set<int> SI; #ifdef DEBUG const bool debug = true; #else const bool debug = false; #endif long long n, m, k, l; const int inf = 1000 * 1000 * 1000 ; const int MAKSN = 1000 * 1000 + 13; // UZUPElnic long long mini = inf; long long sum = 0; void readIn() { scanf("%lld", &n); rep(i, n) { scanf("%lld", &k); sum += k; if (k % 2 == 1) mini = min(mini, k); } } void solve() { if (n == 1 && mini != inf) printf("NIESTETY\n"); else printf("%lld\n", sum % 2 ? sum - mini : sum); } int main() { readIn(); solve(); 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 | #include<cstdio> #include<vector> #include<algorithm> #include<set> #include<iostream> using namespace std; #define rep(i,n) for(int i=0; i<(int)n; i++) #define st first #define nd second #define mp make_pair #define pb push_back typedef vector<int> vi; typedef pair<int, int> pi; typedef vector<pi> vpii; typedef set<int> SI; #ifdef DEBUG const bool debug = true; #else const bool debug = false; #endif long long n, m, k, l; const int inf = 1000 * 1000 * 1000 ; const int MAKSN = 1000 * 1000 + 13; // UZUPElnic long long mini = inf; long long sum = 0; void readIn() { scanf("%lld", &n); rep(i, n) { scanf("%lld", &k); sum += k; if (k % 2 == 1) mini = min(mini, k); } } void solve() { if (n == 1 && mini != inf) printf("NIESTETY\n"); else printf("%lld\n", sum % 2 ? sum - mini : sum); } int main() { readIn(); solve(); return 0; } |