Pinned Repositories
cgv
dbms-assignment
frustrated-coders
Hacker-and-traffic-lights1
Jchethana
monkwatchingfight
online-course
pink-floyd-and-happiness
Pink is sad because of some reasons, he wants to cheer up by listening to some songs from his favorite band, Pink Floyd. There are N records and Pink will be happy if he listens to them in the ascending order, i.e., first the song No. 1, then No.2 and so on (He has to listen to all the N songs to become Happy). Pink is delivered his records in some given order, he can either add the record to the Playlist in the delivered order or put some on another table. After being put on the table only the topmost record can be added to the playlist at any time. Print whether Pink will be sad or happy after the delivery of the records. Input Format N - Number of records followed by N numbers- order of records. Output Format Print "Happy" if the playlist has songs from 1 to N in order else "Sad".
prog2.c-
Programming--in-c
Jchethana1990's Repositories
Jchethana1990/online-course
Jchethana1990/prog2.c-
Jchethana1990/cgv
Jchethana1990/frustrated-coders
Jchethana1990/monkwatchingfight
Jchethana1990/pink-floyd-and-happiness
Pink is sad because of some reasons, he wants to cheer up by listening to some songs from his favorite band, Pink Floyd. There are N records and Pink will be happy if he listens to them in the ascending order, i.e., first the song No. 1, then No.2 and so on (He has to listen to all the N songs to become Happy). Pink is delivered his records in some given order, he can either add the record to the Playlist in the delivered order or put some on another table. After being put on the table only the topmost record can be added to the playlist at any time. Print whether Pink will be sad or happy after the delivery of the records. Input Format N - Number of records followed by N numbers- order of records. Output Format Print "Happy" if the playlist has songs from 1 to N in order else "Sad".
Jchethana1990/Programming--in-c
Jchethana1990/dbms-assignment
Jchethana1990/Hacker-and-traffic-lights1
Jchethana1990/Jchethana
Jchethana1990/Jchethana1990
Jchethana1990/Jchethana1990.github.io
Jchethana1990/Machine-learning-workshop
Jchethana1990/ML-PROGRAMMS
Jchethana1990/online-course-2-july
Jchethana1990/Preplacement-report
Jchethana1990/program1
1. Micro and Array Update Micro purchased an array A having N integer values. After playing it for a while, he got bored of it and decided to update value of its element. In one second he can increase value of each array element by 1. He wants each array element's value to become greater than or equal to K. Please help Micro to find out the minimum amount of time it will take, for him to do so. Input: First line consists of a single integer, T, denoting the number of test cases. First line of each test case consists of two space separated integers denoting N and K. Second line of each test case consists of N space separated integers denoting the array A. Output: For each test case, print the minimum time in which all array elements will become greater than or equal to K. Print a new line after each test case.
Jchethana1990/Web-Development-Assignment