Skip to main content

Hacker Rank "Birthday Chocolate " Solution

Question : ---
Lily has a chocolate bar that she wants to share it with Ron for his birthday. Each of the squares has an integer on it. She decides to share a contiguous segment of the bar selected such that the length of the segment matches Ron's birth month and the sum of the integers on the squares is equal to his birth day. You must determine how many ways she can divide the chocolate.
Consider the chocolate bar as an array of squares, . She wants to find segments summing to Ron's birth day,  with a length equalling his birth month, . In this case, there are two segments meeting her criteria: .
Input Format
The first line contains an integer , the number of squares in the chocolate bar.
The second line contains  space-separated integers , the numbers on the chocolate squares where .
The third line contains two space-separated integers,  and , Ron's birth day and his birth month.
Constraints
  • , where ()
Output Format
Print an integer denoting the total number of ways that Lily can portion her chocolate bar to share with Ron.
Sample Input 0
5
1 2 1 3 2
3 2
Sample Output 0
2
Explanation 0
Lily wants to give Ron  squares summing to . The following two segments meet the criteria:
image
Sample Input 1
6
1 1 1 1 1 1
3 2
Sample Output 1
0
Explanation 1
Lily only wants to give Ron  consecutive squares of chocolate whose integers sum to . There are no possible pieces satisfying these constraints:
image
Thus, we print  as our answer.
Sample Input 2
1
4
4 1
Sample Output 2
1
Explanation 2
Lily only wants to give Ron  square of chocolate with an integer value of . Because the only square of chocolate in the bar satisfies this constraint, we print  as our answer
Solution : ---
<?php
/* Write your PHP code here */

$s = array(2, 5, 1, 3, 4, 4, 3, 5, 1, 1, 2, 1, 4, 1, 3, 3, 4, 2, 1,);
$m = 7;
$d = 18;
$count = 0;
$sum = 0;
if($m == 1){
for($i=0;$i<count($s);$i++){
if($s[$i] == $d){
$count++;
}
}
}else{
for($i=0;$i<count($s)-$m+1;$i++){
for($j=$i;$j<($i+$m);$j++){
$sum = $sum+$s[$j];
}
if($sum == $d){
$count++;
$sum = 0;
}
$sum = 0;
}
}
echo $count;
?>


Comments

Post a Comment

Popular posts from this blog

PHP Hacker rank Question solution Mini-Max sum in PHP

Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then print the respective minimum and maximum values as a single line of two space-separated long integers. For example,  . Our minimum sum is   and our maximum sum is  . We would print 26 24 Function Description Complete the  miniMaxSum  function in the editor below. It should print two space-separated integers on one line: the minimum sum and the maximum sum of   of   elements. miniMaxSum has the following parameter(s): arr : an array of   integers Input Format A single line of five space-separated integers. Constraints Output Format Print two space-separated long integers denoting the respective minimum and maximum values that can be calculated by summing exactly  four  of the five integers. (The output can be greater than a 32 bi...
3 comments
Read more

PHP Hacker Rank Question "Time Conversion" Solution in php

Given a time in  -hour AM/PM format , convert it to military (24-hour) time. Note: Midnight is 12:00:00AM on a 12-hour clock, and 00:00:00 on a 24-hour clock. Noon is 12:00:00PM on a 12-hour clock, and 12:00:00 on a 24-hour clock. Function Description Complete the  timeConversion  function in the editor below. It should return a new string representing the input time in 24 hour format. timeConversion has the following parameter(s): s : a string representing time in   hour format Input Format A single string   containing a time in  -hour clock format (i.e.:   or  ), where   and  . Constraints All input times are valid Output Format Convert and print the given time in  -hour format, where  . Solution : ---------------------------------- <?php /* Write your PHP code here */ $s = "12:45:54PM";  $t= $c = substr($s,0,2); $a = (int)$t; $sym = su...
2 comments
Read more

PHP Hacker Rank "Grading Sturdents " Solution Php

HackerLand University has the following grading policy: Every student receives a   in the inclusive range from   to  . Any   less than   is a failing grade. Sam is a professor at the university and likes to round each student's   according to these rules: If the difference between the   and the next multiple of   is less than  , round   up to the next multiple of  . If the value of   is less than  , no rounding occurs as the result will still be a failing grade. For example,   will be rounded to   but   will not be rounded because the rounding would result in a number that is less than  . Given the initial value of   for each of Sam's   students, write code to automate the rounding process. Function Description Complete the function  gradingStudents  in the editor below. It should retu...
1 comment
Read more