#include<cstdio> #include<algorithm> #include<vector> #include<cstring> #include<set> #include<assert.h> using namespace std; #define FOR(i,a,b) for(int i = a; i <= b; ++i) #define FORD(i,a,b) for(int i = a; i >= b; --i) #define REP(i,n) FOR(i,0,(n)-1) #define RI(i,n) FOR(i,1,n) #define pb push_back #define mp make_pair #define st first #define nd second #define mini(a,b) a=min(a,b) #define maxi(a,b) a=max(a,b) bool debug; typedef vector<int> vi; typedef long long ll; typedef long double ld; typedef pair<int,int> pii; const int inf = 1e9 + 5; const int nax = 1e6 + 5; int main(int argc, char * argv[]) { int x, n, suma = 0, dupa = 10001; scanf("%d",&n); REP(i,n) { scanf("%d",&x); suma += x; if (x&1) dupa = min(dupa, x); } if (suma&1) { if (suma == dupa) { puts("NIESTETY"); return 0; } suma -= dupa; } printf("%d\n",suma); 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 | #include<cstdio> #include<algorithm> #include<vector> #include<cstring> #include<set> #include<assert.h> using namespace std; #define FOR(i,a,b) for(int i = a; i <= b; ++i) #define FORD(i,a,b) for(int i = a; i >= b; --i) #define REP(i,n) FOR(i,0,(n)-1) #define RI(i,n) FOR(i,1,n) #define pb push_back #define mp make_pair #define st first #define nd second #define mini(a,b) a=min(a,b) #define maxi(a,b) a=max(a,b) bool debug; typedef vector<int> vi; typedef long long ll; typedef long double ld; typedef pair<int,int> pii; const int inf = 1e9 + 5; const int nax = 1e6 + 5; int main(int argc, char * argv[]) { int x, n, suma = 0, dupa = 10001; scanf("%d",&n); REP(i,n) { scanf("%d",&x); suma += x; if (x&1) dupa = min(dupa, x); } if (suma&1) { if (suma == dupa) { puts("NIESTETY"); return 0; } suma -= dupa; } printf("%d\n",suma); return 0; } |