Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

The Smallest Window I

For a given array $a_1, a_2, a_3, ... , a_N$ of $N$ elements and an integer $S$, find the smallest sub-array size (smallest window length) where the sum of the sub-array is greater than or equal to $S$. If there is not such sub-array, report 0.

Constraints

$1 \leq N \leq 10^5$

$1 \leq S \leq 10^9$

$1 \leq a_i \leq 10^4$

Input

The input is given in the following format.

$N$ $S$

$a_1$ $a_2$ ... $a_N$

Output

Print the smallest sub-array size in a line.

Sample Input 1

6 4
1 2 1 2 3 2

Sample Output 1

2

Sample Input 2

6 6
1 2 1 2 3 2

Sample Output 2

3

Sample Input 3

3 7
1 2 3

Sample Output 3

0

Solution in C (judge verdict: Time Limit Exceeded)

#include <stdio.h>

int main(void){
  int S,N,count,sum,add,num,i;
  
  do{
    scanf("%d",&N);
  }while(N>=100000);
  do{
    scanf("%d",&S);
  }while(S>=1000000000);
  
  int numin[N];
  for(count=0;count<N;count++){
    scanf("%d",&numin[count]);
  }
  sum=0;
  for(add=1;add<=N;add++){
    num=0;
    do{
      for(count=1;count<=add;count++){
      sum += numin[num];
      num++;
      }
      // printf("sum=%d\n",sum);
      if(sum>=S){
	//printf("Rsum=%d\n",sum);
	printf("%d\n",add);
	return 0;
      }
      for(i=1;i<add;i++){
      num--;
      }
      sum=0;
    }while(num+add<N+1);
  }
  i=0;
  printf("%d\n",i);
  return 0;
}