Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package it.samsung;
- import org.omg.CORBA.ORB;
- import java.util.Arrays;
- import java.util.Scanner;
- public class Main {
- public static int arraySum(int[] numbers) {
- int sum = 0;
- for (int i = 0; i < numbers.length; i++) {
- sum += numbers[i];
- }
- return sum;
- }
- public static int[] swapEnemies(int[] enemies) {
- }
- public static boolean carpetFits(int a, int b, int x, int y) {
- // возвращает true, если ковёр a*b войдет в комнату x*y
- return (x >= a && y >= b) || (x >= b && y >= a);
- }
- public static void main(String[] args) {
- Scanner sc = new Scanner(System.in);
- int n = sc.nextInt();
- int[] numbers = new int[n];
- for (int i = 0; i < numbers.length; i++) {
- numbers[i] = sc.nextInt();
- }
- int sum = arraySum(numbers);
- sum /= 2;
- // оформить в виде функции int[] swapEnemies(int[] enemies) строки 26-32
- for (int i = 0; i < numbers.length; i++) {
- if (sum == numbers[i]) {
- int swap = numbers[i];
- numbers[i] = numbers[numbers.length-1];
- numbers[numbers.length-1] = swap;
- }
- }
- for (int i = 0; i < numbers.length; i++) {
- System.out.printf("%d ", numbers[i]);
- }
- /*
- long[] rabbits = new long[m];
- rabbits[0] = 1;
- for (int i = 0; i < n-1; i++) {
- long child = 0;
- for (int j = 1; j < rabbits.length; j++) {
- child += rabbits[j];
- }
- for (int j = rabbits.length-1; j > 0; j--) {
- rabbits[j] = rabbits[j-1];
- }
- rabbits[0] = child;
- }
- long sum = 0;
- for (int j = 0; j < rabbits.length; j++) {
- sum += rabbits[j];
- }
- System.out.println(sum);
- //System.out.println(Arrays.toString(n));
- */
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement