[백준 2003] 수들의 합 <Java>

import java.util.Arrays;
import java.util.Scanner;

public class 수들의합2 {
	static int n,m,count;
	static int a[],num[];
	static boolean visited[];
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		n = sc.nextInt();
		m = sc.nextInt();
		a = new int[n];

		for(int i=0;i<n;i++) {
			a[i] = sc.nextInt();
		}
		
		long sum = 0;
        int left=0, right=0;
        while (true){
            if(sum >= m){
                sum -= a[left++];
 
            }else if(right ==n){
                break;
            }
            else {
                sum += a[right++];
            }
 
            if(sum == m){
                count++;
            }
 
        }
		
		System.out.println(count);
		
	}
	
	
}