import java.util.Scanner; public class kie { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int sum = 0; int lowestOdd = Integer.MAX_VALUE; for (int i = 0; i < n; ++i) { int bajtalars = in.nextInt(); sum += bajtalars; if (bajtalars % 2 != 0 && bajtalars < lowestOdd) { lowestOdd = bajtalars; } } String out = ""; if (sum % 2 != 0) { sum -= lowestOdd; } if (sum != 0) { out = Integer.toString(sum); } else { out = "NIESTETY"; } System.out.println(out); } }
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 | import java.util.Scanner; public class kie { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int sum = 0; int lowestOdd = Integer.MAX_VALUE; for (int i = 0; i < n; ++i) { int bajtalars = in.nextInt(); sum += bajtalars; if (bajtalars % 2 != 0 && bajtalars < lowestOdd) { lowestOdd = bajtalars; } } String out = ""; if (sum % 2 != 0) { sum -= lowestOdd; } if (sum != 0) { out = Integer.toString(sum); } else { out = "NIESTETY"; } System.out.println(out); } } |