//Aleksander Łukasiewicz #include<bits/stdc++.h> using namespace std; #define fru(j,n) for(int j=0; j<(n); ++j) #define tr(it,v) for(typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it) #define x first #define y second #define pb push_back #define mp make_pair #define ALL(G) (G).begin(),(G).end() typedef long long LL; typedef pair<int,int> PII; typedef vector<int> VI; const int INF = 1000000009; const int MAXN = 1000000; int n; int tab[MAXN + 3]; int main(){ int sum = 0; scanf("%d", &n); fru(i, n) scanf("%d", &tab[i]), sum+=tab[i]; if(sum%2==0){ printf("%d\n", sum); return 0; } int a = INF; fru(i, n) if(tab[i]%2 == 1 && tab[i] < a) a = tab[i]; sum -= a; if(sum == 0) puts("NIESTETY"); else printf("%d\n", sum); 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 | //Aleksander Łukasiewicz #include<bits/stdc++.h> using namespace std; #define fru(j,n) for(int j=0; j<(n); ++j) #define tr(it,v) for(typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it) #define x first #define y second #define pb push_back #define mp make_pair #define ALL(G) (G).begin(),(G).end() typedef long long LL; typedef pair<int,int> PII; typedef vector<int> VI; const int INF = 1000000009; const int MAXN = 1000000; int n; int tab[MAXN + 3]; int main(){ int sum = 0; scanf("%d", &n); fru(i, n) scanf("%d", &tab[i]), sum+=tab[i]; if(sum%2==0){ printf("%d\n", sum); return 0; } int a = INF; fru(i, n) if(tab[i]%2 == 1 && tab[i] < a) a = tab[i]; sum -= a; if(sum == 0) puts("NIESTETY"); else printf("%d\n", sum); return 0; } |