[SWEA][JAVA]D3 : 상원이의 연속 합

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

SW Expert Academy

 

---

투포인터 알고리즘만 쓰면 끝

 

 

import java.util.Scanner;
class Solution{
    public static void main(String args[]) throws Exception{
        Scanner kb = new Scanner(System.in);
        int T = kb.nextInt();
        for (int t = 1; t <= T; t++) {
            int n=kb.nextInt();
            int[] arr=new int[n];
            for(int i=0; i<n; i++) arr[i]=i+1;
 
            int sum=0; // 15
            int cnt=0;
            int lt=0;
            for(int rt=0; rt<n; rt++){
                sum+=arr[rt];
                if(sum==n)
                    cnt++;
                while(sum>=n){
                    sum-=arr[lt++];
                    if(sum==n)
                        cnt++;
                }
            }
            System.out.println("#"+t+" "+cnt);
        }
    }
}