Skip to main content

Watermelon codechef lunchtime Problem solution with explanation| September Lunchtime

 Watermelon codechef lunchtime Problem solution with explanation| September Lunchtime-




Problem Statement-

Let's call a sequence good if the sum of all its elements is 0.

You have a sequence of integers A1,A2,,AN. You may perform any number of operations on this sequence (including zero). In one operation, you should choose a valid index i and decrease Ai by i. Can you make the sequence good using these operations?

Input

  • The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
  • The first line of each test case contains a single integer N.
  • The second line contains N space-separated integers A1,A2,,AN.

Output

For each test case, print a single line containing the string "YES" if it is possible to make the given sequence good or "NO" if it is impossible.

Constraints

  • 1T1,000
  • 1N10
  • |Ai|100 for each valid i

Subtasks

Subtask #1 (10 points): N=1

Subtask #2 (30 points): N2

Subtask #3 (60 points): original constraints

Example Input

2
1
-1
2
1 2

Example Output

NO
YES

Explanation

Example case 2: We can perform two operations ― subtract 1 from A1 and 2 from A2.

link of Problem->https://www.codechef.com/LTIME88B/problems/WATMELON

Watermelon codechef lunchtime Problem solution with explanation| September Lunchtime



Watermelon CodeChef lunchtime Problem solution->


This Problem is the easiest problem of this contest. Read carefully the problem as mentioned in the problem 
the sequence good if the sum of all its elements is 0.
So first of all add all the elements of the given array.
There can be 3 cases

1-if the sum is 0 then we need to do nothing we have to print :YES

2- is sum is less then 0 - if the sum of all the element is less then 0 we  never make this array good because i (index) is always positive and subtracting a positive number from a negative number gives us more negative number so in this case we have to print "NO";

3- if sum is grater then 0. read problem care fully it is mentioned in the problem that 
You may perform any number of operations on this sequence (including zero).

means you we can subtract i any number of time.

but we know that we will always have i=1 that is first index and every number is multiple of 1 so we can generate 0 by subtracting 1 any number of times so the conclusion is if the sum is  grater then 0 ans is always "YES" because we can generate 0 by subtracting 1 any number of time.

here we need a little observation for this question. 

complete code of the problem 








Comments

Popular posts from this blog

Vaccine Distribution Codechef December Long challenge solution 2020

 Vaccine Distribution  Codechef December Long challenge solution 2020- This Problem vaccine distribution is taken from December long challenge 2020. lets read problem statement. Problem statement- Finally, a COVID vaccine is out on the market and the Chefland government has asked you to form a plan to distribute it to the public as soon as possible. There are a total of  N N  people with ages  a 1 , a 2 , … , a N a 1 , a 2 , … , a N . There is only one hospital where vaccination is done and it is only possible to vaccinate up to  D D  people per day. Anyone whose age is  ≥ 80 ≥ 80  or  ≤ 9 ≤ 9  is considered to be  at risk . On each day, you may not vaccinate both a person who is at risk and a person who is not at risk. Find the smallest number of days needed to vaccinate everyone. Input The first line of the input contains a single integer  T T  denoting the number of test cases. The description of  T T  test cases follows. The first line of each test case contains two space-separ

Codechef February long challenge solution 2021

   Codechef February  long challenge solution 2021- Hey guys Welcome Again, A small update CodeChef February  long challenge solution 2021 starting from 1st week of beb  2021 . Codechef long challenge is one of the popular contests of CodeChef you should participate in codechef Feb  long challenge.This is first contest of codechef in 2021 so good luck. And wish you happy new year. Contest link- https://www.codechef.com/FEB21/?itm_medium=navmenu&itm_campaign=FEB21 I will post the solution after Contest.Stay tuned. About CodeChef  February  long challenge solution 2021: CodeChef Long Challenge is a 10-day monthly coding contest where you can show off your computer programming skills. The significance being - it gives you enough time to think about a problem, try different ways of attacking the problem, read the concepts etc. If you’re usually slow at solving problems and have ample time at hand, this is ideal for you. We also put in a lot of efforts in getting quality problems, w

Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1