BEAKJOON JAVA ALGORITHM #2775(부녀회장)

https://www.acmicpc.net/problem/2775

import java.util.Scanner; public class a2775 { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int n=sc.nextInt(); for(int i=0;i<n;i++){ int s=sc.nextInt(); //층 int h=sc.nextInt(); //호 int[] arr=new int[h]; for(int j=0;j<h;j++){ //0층부터 시작 arr[j]=j+1; } for(int j=0;j<s;j++){ int sum=0; for(int k=0;k<h;k++){ sum+=arr[k]; arr[k]=sum; } } System.out.println(arr[h-1]); } } }