#include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for (int i = (a); i <= (b); ++i) #define REPD(i,a,b) for (int i = (a); i >= (b); --i) #define FORI(i,n) REP(i,1,n) #define FOR(i,n) REP(i,0,int(n)-1) #define mp make_pair #define pb push_back #define sz(x) int((x).size()) #define dbg(v) cerr << #v << " = " << (v) << endl; #define FOREACH(i,t) for (__typeof(t.begin()) i = t.begin(); i != t.end(); ++i) #define fi first #define se second typedef pair<int,int> pii; typedef vector<int> vi; typedef long long ll; int main() { int n; scanf("%d", &n); int x; int sumap = 0; int ilenp = 0; int sumanp = 0; int minnp=10000000; FOR(i,n) { scanf("%d", &x); if (x % 2 == 0) sumap += x; else { ilenp++; sumanp += x; if (x<minnp) minnp = x; } } if (ilenp%2 == 1) sumanp -= minnp; if (sumap+sumanp == 0) printf("NIESTETY\n"); else printf("%d\n", sumap+sumanp); 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 | #include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for (int i = (a); i <= (b); ++i) #define REPD(i,a,b) for (int i = (a); i >= (b); --i) #define FORI(i,n) REP(i,1,n) #define FOR(i,n) REP(i,0,int(n)-1) #define mp make_pair #define pb push_back #define sz(x) int((x).size()) #define dbg(v) cerr << #v << " = " << (v) << endl; #define FOREACH(i,t) for (__typeof(t.begin()) i = t.begin(); i != t.end(); ++i) #define fi first #define se second typedef pair<int,int> pii; typedef vector<int> vi; typedef long long ll; int main() { int n; scanf("%d", &n); int x; int sumap = 0; int ilenp = 0; int sumanp = 0; int minnp=10000000; FOR(i,n) { scanf("%d", &x); if (x % 2 == 0) sumap += x; else { ilenp++; sumanp += x; if (x<minnp) minnp = x; } } if (ilenp%2 == 1) sumanp -= minnp; if (sumap+sumanp == 0) printf("NIESTETY\n"); else printf("%d\n", sumap+sumanp); return 0; } |