import java.util.Scanner; /** * Created by kamil on 28.09.15. */ public class kie { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); long sum=0; long min_odd=Long.MAX_VALUE; long max_odd=0; long last_odd=0; scanner.nextLong(); while(scanner.hasNextLong()){ long item = scanner.nextLong(); if(item%2==0){ sum+=item; } else { min_odd = Math.min(min_odd,item); max_odd = Math.min(max_odd,item); if(last_odd>0){ sum += last_odd+item; last_odd = 0; } else { last_odd = item; } } } if(last_odd>0 && last_odd!=min_odd && min_odd != Long.MAX_VALUE){ sum -= min_odd; sum+=last_odd; } if(sum>0){ System.out.println(sum); } else { System.out.println("NIESTETY"); } } }
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 | import java.util.Scanner; /** * Created by kamil on 28.09.15. */ public class kie { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); long sum=0; long min_odd=Long.MAX_VALUE; long max_odd=0; long last_odd=0; scanner.nextLong(); while(scanner.hasNextLong()){ long item = scanner.nextLong(); if(item%2==0){ sum+=item; } else { min_odd = Math.min(min_odd,item); max_odd = Math.min(max_odd,item); if(last_odd>0){ sum += last_odd+item; last_odd = 0; } else { last_odd = item; } } } if(last_odd>0 && last_odd!=min_odd && min_odd != Long.MAX_VALUE){ sum -= min_odd; sum+=last_odd; } if(sum>0){ System.out.println(sum); } else { System.out.println("NIESTETY"); } } } |