[SW Expert Academy] 상원이의 연속 합 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AWoEzJFa2A4DFARq&categoryId=AWoEzJFa2A4DFARq&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=JAVA&select-1=3&pageSize=10&pageIndex=7

SW Expert Academy

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {
			int n = sc.nextInt();

			int count = 0;

			for (int i = 1; i <= n; i++) {

				int num = i;
				int sum = 0;

				while (true) {
					if (sum + num > n)
						break;
					sum += num++;
				}

				//System.out.println(sum);

				if (sum == n)
					count++;
			}

			System.out.println("#" + tc + " " + count);

		}
	}
}

 

완전탐색을 이용해서 해결했다.