#include <iostream> #include <algorithm> using namespace std; long long int n, number_of_odd, odd_sum, a; long long int even_sum, min_odd=100000; int main() { ios_base::sync_with_stdio(0); cin>>n; for(int i = 0; i < n; ++i){ cin>>a; if(a%2 == 0) { even_sum += a; } else { odd_sum += a; min_odd = min(min_odd, a); } } if(odd_sum % 2 != 0){ odd_sum -= min_odd; } if(n == 1 && odd_sum == 0 && even_sum == 0) { cout<<"NIESTETY"<<endl; } else { cout << even_sum + odd_sum << endl; } 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 | #include <iostream> #include <algorithm> using namespace std; long long int n, number_of_odd, odd_sum, a; long long int even_sum, min_odd=100000; int main() { ios_base::sync_with_stdio(0); cin>>n; for(int i = 0; i < n; ++i){ cin>>a; if(a%2 == 0) { even_sum += a; } else { odd_sum += a; min_odd = min(min_odd, a); } } if(odd_sum % 2 != 0){ odd_sum -= min_odd; } if(n == 1 && odd_sum == 0 && even_sum == 0) { cout<<"NIESTETY"<<endl; } else { cout << even_sum + odd_sum << endl; } return 0; } |