#include<cstdio> #include<algorithm> #define FOR(i, b, n) for ( int (i) = b; (i) < (n); (i)++) #define FORR(i, b, n) for ( (i) = b; (i) < (n); (i)++) #define REP(i, n) for ( int (i) = 0; (i) < (n); (i)++) #define SC(n) scanf("%d", &(n)) #define SC2(n, m) scanf("%d%d", &(n), &(m)) #define SCLL(n) scanf("%lld", &(n)) #define PRT(n) printf("%d ", (n)) #define PRTLL(n) printf("%lld ", (n)) #define NXL printf("\n") typedef long long LL; typedef unsigned long long ULL; using namespace std; #define st first #define nd second #define pb push_back const int MANY = 1e6+9; const int INF = 100000; int main() { int n; SC(n); int sum = 0, mn = INF; REP(i, n) { int a; SC(a); sum += a; if(a%2 && a < mn) mn = a; } if(sum % 2 == 0) PRT(sum); else if(mn == INF || mn == sum) printf("NIESTETY"); else PRT(sum - mn); NXL; 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 | #include<cstdio> #include<algorithm> #define FOR(i, b, n) for ( int (i) = b; (i) < (n); (i)++) #define FORR(i, b, n) for ( (i) = b; (i) < (n); (i)++) #define REP(i, n) for ( int (i) = 0; (i) < (n); (i)++) #define SC(n) scanf("%d", &(n)) #define SC2(n, m) scanf("%d%d", &(n), &(m)) #define SCLL(n) scanf("%lld", &(n)) #define PRT(n) printf("%d ", (n)) #define PRTLL(n) printf("%lld ", (n)) #define NXL printf("\n") typedef long long LL; typedef unsigned long long ULL; using namespace std; #define st first #define nd second #define pb push_back const int MANY = 1e6+9; const int INF = 100000; int main() { int n; SC(n); int sum = 0, mn = INF; REP(i, n) { int a; SC(a); sum += a; if(a%2 && a < mn) mn = a; } if(sum % 2 == 0) PRT(sum); else if(mn == INF || mn == sum) printf("NIESTETY"); else PRT(sum - mn); NXL; return 0; } |