알고리즘/백준

1812_사탕

베리영young 2025. 5. 5. 01:28

사용 알고리즘: 완전 탐색

사용 언어: java

 

package ssafyRoom2_Monthly_Silver_Random_Defense;

import java.util.*;

public class Main_bj_1812_사탕 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] two = new int[n];
		int[] candy = new int[n+1];
		
		for (int i = 0; i < n; i++) {
			two[i] = sc.nextInt();
		}
		int first = 0;
		while(true) {
			Arrays.fill(candy, 0);
			candy[0] = first;
			for (int i = 1; i < candy.length; i++) {
				candy[i] = two[i-1] - candy[i-1];
			}
			
			if(candy[0] == candy[n]) {
				for (int i = 0; i < candy.length-1; i++) {
					System.out.println(candy[i]);
				}
				break;
			}
			
			first++;
		}
	}

}