#include <iostream> #include <algorithm> #include <vector> #include <string> #include <stack> #include <queue> #include <cmath> #include <cstdio> #include <set> #include <iomanip> using namespace std; typedef vector<int> VI; typedef long long LL; #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,e) for(int x = 0 ; x < (e) ; ++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 const int inf = 1000000000,maxn=1e6+5; int main() { ios::sync_with_stdio(0); int n; cin >> n; int suma=0,minimum=inf; while(n--) { int x; cin >> x; suma+=x; if(x%2)minimum=min(minimum,x); } if(suma%2&&suma-minimum)cout<< suma-minimum; else if(suma%2)cout<<"NIESTETY"; else cout << suma; }
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 | #include <iostream> #include <algorithm> #include <vector> #include <string> #include <stack> #include <queue> #include <cmath> #include <cstdio> #include <set> #include <iomanip> using namespace std; typedef vector<int> VI; typedef long long LL; #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,e) for(int x = 0 ; x < (e) ; ++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 const int inf = 1000000000,maxn=1e6+5; int main() { ios::sync_with_stdio(0); int n; cin >> n; int suma=0,minimum=inf; while(n--) { int x; cin >> x; suma+=x; if(x%2)minimum=min(minimum,x); } if(suma%2&&suma-minimum)cout<< suma-minimum; else if(suma%2)cout<<"NIESTETY"; else cout << suma; } |