#include<iostream> using namespace std; unsigned long long n, sum = 0, lowest_odd = 1001, t; int main() { ios_base::sync_with_stdio(0); cin >> n; for( int i = 0; i < n; i++ ) { cin >> t; sum += t; if( ( t % 2 ) == 1 ) { if( t < lowest_odd ) lowest_odd = t; } } if( sum == 0 ) { cout << "NIESTETY" << endl; return 0; } if( sum == lowest_odd ) { cout << "NIESTETY" << endl; return 0; } if( sum % 2 == 0 ) { cout << sum << endl; return 0; } cout << sum - lowest_odd << 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 36 | #include<iostream> using namespace std; unsigned long long n, sum = 0, lowest_odd = 1001, t; int main() { ios_base::sync_with_stdio(0); cin >> n; for( int i = 0; i < n; i++ ) { cin >> t; sum += t; if( ( t % 2 ) == 1 ) { if( t < lowest_odd ) lowest_odd = t; } } if( sum == 0 ) { cout << "NIESTETY" << endl; return 0; } if( sum == lowest_odd ) { cout << "NIESTETY" << endl; return 0; } if( sum % 2 == 0 ) { cout << sum << endl; return 0; } cout << sum - lowest_odd << endl; return 0; } |