Chef and String | CHEFSTR1 | CodeChef


Having already mastered cooking, Chef has now decided to learn how to play the guitar. Often while trying to play a song, Chef has to skip several strings to reach the string he has to pluck. Eg. he may have to pluck the 1st string and then the 6th string. This is easy in guitars with only 6 strings; However, Chef is playing a guitar with 106 strings. In order to simplify his task, Chef wants you to write a program that will tell him the total number of strings he has to skip while playing his favorite song.

fig1
This is how guitar strings are numbered (In ascending order from right to left). Eg. to switch from string 1 to 6, Chef would have to skip 4 strings (2,3,4,5).
Input:

  • First-line will contain T, number of test cases. Then the test cases follow.
  • The first line of each test case contains N, the number of times Chef has to pluck a string
  • The second line of each test case contains N space-separated integers - S1, S2, …, SN, where Si is the number of the  string Chef has to pluck.

Output:

For each test case, output the total number of strings Chef has to skip over while playing his favorite song.


Constraints

  • 1≤T≤10
  • 2≤N≤105
  • 1≤Si≤106
  • For each valid I, Si≠Si+1

Subtasks

  • 30 points: for each valid I, Si<Si+1
  • 70 points: No additional constraints

Sample Input:

2
6
1 6 11 6 10 11
4
1 3 5 7

Sample Output:

15
3
Explanation:

Test Case 1
  • Chef skips 4 strings (2,3,4,5) to move from 1 to 6
  • Chef skips 4 strings (7,8,9,10) to move from 6 to 11
  • Chef skips 4 strings (10,9,8,7) to move from 11 to 6
  • Chef skips 3 strings (7,8,9) to move from 6 to 10
  • Chef skips 0 strings to move from 10 to 11
Therefore, the answer is 4+4+4+3+0=15
Test Case 2
  • Chef skips 1 string to move from 1 to 3
  • Chef skips 1 string to move from 3 to 5
  • Chef skips 1 string to move from 5 to 7
Therefore, the answer is 

Solution (C++ 14):


#include <bits/stdc++.h>
using namespace std;

int main() {
// your code goes here
int t;
cin>>t;
while(t--)
{
    int num;
    cin>>num;
    int arr[num];
    for(int i=0;i<num;i++)
    {
        cin>>arr[i];
    }
    long int sum=0;
    for(int i=1; i<num;i++)
    {
       sum+=abs(arr[i]-arr[i-1])-1; 
    }
    cout<<sum<<endl;
}
return 0;
}

Comments

Post a Comment

Popular posts from this blog

Boxes through a Tunnel | HackerRank

You are transporting some boxes through a tunnel, where each box is a  parallelepiped , and is characterized by its length, width and height. The height of the tunnel   feet and the width can be assumed to be infinite. A box can be carried through the tunnel only if its height is strictly less than the tunnel's height. Find the volume of each box that can be successfully transported to the other end of the tunnel. Note: Boxes cannot be rotated. Input Format The first line contains a single integer  , denoting the number of boxes.  lines follow with three integers on each separated by single spaces    ,   and   which are length, width and height in feet of the  -th box. Constraints Output Format For every box from the input which has a height lesser than   feet, print its volume in a separate line. Sample Input 0 4 5 5 5 1 2 40 10 5 41 7 2 42 Sample ...
Read more

Array Manipulation | HackerRank

Image
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in your array. For example, the length of your array of zeros  . Your list of queries is as follows: a b k 1 5 3 4 8 7 6 9 1 Add the values of   between the indices   and   inclusive: index -> 1 2 3 4 5 6 7 8 9 10 [ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ] [ 3 , 3 , 3 , 3 , 3 , 0 , 0 , 0 , 0 , 0 ] [ 3 , 3 , 3 , 10 , 10 , 7 , 7 , 7 , 0 , 0 ] [ 3 , 3 , 3 , 10 , 10 , 8 , 8 , 8 , 1 , 0 ] The largest value is   after all operations are performed. Function Description Complete the function  arrayManipulation  in the editor below. It must return an integer, the maximum value in the resulting array. arrayManipulation has the fo...
Read more

String Validators | HackerRank

Python has built-in string validation methods for basic data. It can check if a string is composed of alphabetical characters, alphanumeric characters, digits, etc. str.isalnum() This method checks if all the characters of a string are alphanumeric  (a-z, A-Z and 0-9) . >>> print 'ab123'.isalnum() True >>> print 'ab123#'.isalnum() False str.isalpha() This method checks if all the characters of a string are alphabetical  (a-z and A-Z) . >>> print 'abcD'.isalpha() True >>> print 'abcd1'.isalpha() False str.isdigit() This method checks if all the characters of a string are digits  (0-9) . >>> print '1234'.isdigit() True >>> print '123edsd'.isdigit() False str.islower() This method checks if all the characters of a string are lowercase characters  (a-z) . >>> print 'abcd123#'.islower() True >>> print 'Abcd123#'.islower() False str....
Read more