/*PA2015 etap1 Kieszonkowe*/ #include <iostream> using namespace std; int main() { ios_base::sync_with_stdio(0); int n, a, aMinNieparzyste = 1000, suma = 0; cin >> n; for(int i = 0; i < n; ++i) { cin >> a; suma += a; if(a % 2 && a < aMinNieparzyste) aMinNieparzyste = a; } if(suma % 2) suma -= aMinNieparzyste; if(suma) cout << suma << endl; else cout << "NIESTETY" << 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 | /*PA2015 etap1 Kieszonkowe*/ #include <iostream> using namespace std; int main() { ios_base::sync_with_stdio(0); int n, a, aMinNieparzyste = 1000, suma = 0; cin >> n; for(int i = 0; i < n; ++i) { cin >> a; suma += a; if(a % 2 && a < aMinNieparzyste) aMinNieparzyste = a; } if(suma % 2) suma -= aMinNieparzyste; if(suma) cout << suma << endl; else cout << "NIESTETY" << endl; return 0; } |