#include <iostream> #include <vector> using namespace std; int tab[1000000]; int main(int argc, char** argv) { int a=0; cin>>a; vector<int> elements; for(int i=0; i<a ;++i) { cin>>tab[i]; elements.push_back(tab[i]); } unsigned int suma = 0; for(int j=0; j<elements.size(); ++j) { suma = suma + elements[j]; } int max = 0; int min = 0; if(suma%2 != 0) { for(int k=0; k<elements.size(); ++k) { max = elements[k]; if(k==0) { min = elements[0]; } if((min>max) && (max%2 != 0)) { min = max; } } if((suma-min)%2 != 0) { for(int k=0; k<elements.size(); ++k) { max = elements[k]; if(k==0) { min = elements[elements.size()-1]; } if((min>max) && (max%2 != 0)) { min = max; } } } if((suma-min) == 0) { cout<<"NIESTETY"<<endl; return 0; } cout<<suma-min<<endl; } else if(suma%2 == 0) { 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 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 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 | #include <iostream> #include <vector> using namespace std; int tab[1000000]; int main(int argc, char** argv) { int a=0; cin>>a; vector<int> elements; for(int i=0; i<a ;++i) { cin>>tab[i]; elements.push_back(tab[i]); } unsigned int suma = 0; for(int j=0; j<elements.size(); ++j) { suma = suma + elements[j]; } int max = 0; int min = 0; if(suma%2 != 0) { for(int k=0; k<elements.size(); ++k) { max = elements[k]; if(k==0) { min = elements[0]; } if((min>max) && (max%2 != 0)) { min = max; } } if((suma-min)%2 != 0) { for(int k=0; k<elements.size(); ++k) { max = elements[k]; if(k==0) { min = elements[elements.size()-1]; } if((min>max) && (max%2 != 0)) { min = max; } } } if((suma-min) == 0) { cout<<"NIESTETY"<<endl; return 0; } cout<<suma-min<<endl; } else if(suma%2 == 0) { cout<<suma<<endl; } else { cout<<"NIESTETY"<<endl; } return 0; } |