#include <ctime> #include <bitset> #include <iterator> #include <string> #include <vector> #include <map> #include <list> #include <set> #include <queue> #include <iostream> #include <sstream> #include <stack> #include <deque> #include <cmath> #include <memory.h> #include <cstdlib> #include <cstdio> #include <cctype> #include <algorithm> #include <utility> #include <fstream> using namespace std; typedef long long ll; int main() { int sum = 0; int min = 1000; int n; cin >> n; for (int i = 0; i < n; ++i) { int x; cin >> x; if (x & 1 && x < min) { min = x; } sum += x; } if (sum - min == 0) cout << "NIESTETY\n"; else cout << sum - min << 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 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 | #include <ctime> #include <bitset> #include <iterator> #include <string> #include <vector> #include <map> #include <list> #include <set> #include <queue> #include <iostream> #include <sstream> #include <stack> #include <deque> #include <cmath> #include <memory.h> #include <cstdlib> #include <cstdio> #include <cctype> #include <algorithm> #include <utility> #include <fstream> using namespace std; typedef long long ll; int main() { int sum = 0; int min = 1000; int n; cin >> n; for (int i = 0; i < n; ++i) { int x; cin >> x; if (x & 1 && x < min) { min = x; } sum += x; } if (sum - min == 0) cout << "NIESTETY\n"; else cout << sum - min << endl; return 0; } |