## problem:-

Prateek wants to give a party to his N friends on his birthday, where each friend is numbered from 1 to N. His friends are asking for a gift to come to the party, instead of giving him one. The cost of the gifts are given in the array Value where i

But, Prateek has only X amount of money to spend on gifts and he wants to invite his friends which are in continuous range such that sum of the cost of the gifts of those friends will be exactly equal to X.

If he can invite his friends, who can satisfy the above condition then, print YES otherwise print NO.

Input:

The first line contains a single integer T, denoting the number of test cases. In each test case, the following input will be present: - The next line contains two space-separated integers N and X, where N represents the number of friends and X represents amount of money which Prateek can spend on gifts.

- Next N line contains N integers, where i

Ouput

Output exactly T lines, each containing the answer to the corresponding test case .

Constraints:

1 <= T <= 10

1 <= N , Cost

1 <= X <= 10

^{th}friend asks for a gift which has a cost Cost_{i}.But, Prateek has only X amount of money to spend on gifts and he wants to invite his friends which are in continuous range such that sum of the cost of the gifts of those friends will be exactly equal to X.

If he can invite his friends, who can satisfy the above condition then, print YES otherwise print NO.

Input:

The first line contains a single integer T, denoting the number of test cases. In each test case, the following input will be present: - The next line contains two space-separated integers N and X, where N represents the number of friends and X represents amount of money which Prateek can spend on gifts.

- Next N line contains N integers, where i

^{th}line contains i^{th}integer, which represents the Cost_{i}.Ouput

Output exactly T lines, each containing the answer to the corresponding test case .

Constraints:

1 <= T <= 10

1 <= N , Cost

_{i}<= 10^{6}1 <= X <= 10

^{12}
Explanation

In the sample input, T is equal to 1. So, accordingly, in next line, values of N and X are given which are 5 and 12 respectively. In the next 5 lines, you have cost

_{i}asked by i^{th}friend. As friends numbered from 2 to 4 (inclusively) have gifts value which are {3, 4, 5}, and their sum equals to 12 - that is, the given value of X. So, the answer is YES.## solution:-

#include<stdio.h>

void main()

{

long long int a[1000000],n,x,j,k,sum=0;

int t;

scanf("%d",&t);

for(int i=0;i<t;i++)

{

scanf("%lld%lld",&n,&x);

for(j=0;j<n;j++)

scanf("%lld",&a[j]);

for(j=0;j<n;j++)

{

for(k=j;k<n;k++)

{

sum=sum+a[k];

if(sum==x||sum>x)

break;

}

if(sum==x)

break;

else

sum=0;

}

if(j==n)

printf("NO\n");

else

printf("YES\n");

sum=0;

}

}

## 1 Comments

The way of programming is too good

ReplyDelete