# HackerRank Halloween Sale Solution

Hello Programmers, In this post, you will learn how to solve HackerRank Halloween Sale Solution. This problem is a part of the HackerRank Algorithms Series.

One more thing to add, don’t straight away look for the solutions, first try to solve the problems by yourself. If you find any difficulty after trying several times, then look for the solutions. We are going to solve the HackerRank Algorithms problems using C, CPP, JAVA, PYTHON, JavaScript & SCALA Programming Languages.

You can practice and submit all HackerRank problem solutions in one place. Find a solution for other domains and Sub-domain. I.e. Hacker Rank solution for HackerRank C ProgrammingHackerRank C++ ProgrammingHackerRank Java Programming, HackerRank Python ProgrammingHackerRank Linux ShellHackerRank SQL Programming, and HackerRank 10 days of Javascript.

As you already know that this site does not contain only the Hacker Rank solutions here, you can also find the solution for other problems. I.e. Web Technology, Data StructuresRDBMS ProgramsJava Programs Solutions,  Fiverr Skills Test answersGoogle Course AnswersLinkedin Assessment, and Coursera Quiz Answers.

## HackerRank Halloween Sale

You wish to buy video games from the famous online video game store Mist.

Usually, all games are sold at the same price, p dollars. However, they are planning to have the seasonal Halloween Sale next month in which you can buy games at a cheaper price. Specifically, the first game will cost p dollars, and every subsequent game will cost d dollars less than the previous one. This continues until the cost becomes less than or equal to m dollars, after which every game will cost m dollars. How many games can you buy during the Halloween Sale?

Example

p = 20
d = 3
m = 6
s = 70

The following are the costs of the first 11, in order:

20, 17, 14, 11, 8, 6, 6, 6, 6, 6, 6

Start at p = 20 units cost, reduce that by d = 3 units each iteration until reaching a minimum possible price, m = 6. Starting with s = 70 units of currency in your Mist wallet, you can buy 5 games: 20 + 17 + 14 + 11 + 8 = 70.

Function Description

Complete the howManyGames function in the editor below.

howManyGames has the following parameters:

• int p: the price of the first game
• int d: the discount from the previous game price
• int m: the minimum cost of a game
• int s: the starting budget

Input Format

The first and only line of input contains four space-separated integers pdm and s.

Constraints

• 1 <= m <= p <= 100
• 1 <= d <= 100
• 1 <= s <= 104

Sample Input 0

```20 3 6 80
```

Sample Output 0

```6
```

Explanation 0

Assumptions other than starting funds, s, match the example in the problem statement. With a budget of 80, you can buy 6 games at a cost of 20 + 17 + 14 + 11 + 8 + 6 = 76. A 7th game for an additional 6 units exceeds the budget.

Sample Input 1

```20 3 6 85
```

Sample Output 1

```7
```

Explanation 1

This is the same as the previous case, except this time the starting budget s = 85 units of currency. This time, you can buy 7 games since they cost 20 + 17 + 14 + 11 + 8 + 6 + 6 = 82. An additional game at 6 units will exceed the budget.

## HackerRank Halloween Sale Solution

### Halloween Sale Solution in C

```#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {

int num,i,valley=0;
scanf("%d",&num);
char steps[num];
scanf("%s",steps);
int sea=0;
for(i=0;i<num;i++)
{
if(sea==0 && steps[i]=='D')
valley++;
if(steps[i]=='U')
sea++;
else
sea--;
//printf("%d ",sea);
}
printf("%d",valley);
return 0;
}```

### Halloween Sale Solution in Cpp

```#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {

unsigned long long int N, Sum = 0, i, Num;

cin>>N;

for (i = 1 ; i <= N ; i++)
{
cin>> Num;
Sum += Num;
}

cout<<Sum<<endl;

/* Enter your code here. Read input from STDIN. Print output to STDOUT */
return 0;```

### Halloween Sale Solution in Java

```import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int length = input.nextInt();
int sum = 0;

for(int i = 0; i < length; i++) {
sum += input.nextInt();
}

System.out.println(sum);
}```

### Halloween Sale Solution in Python

```n = input()
arr = map(int,raw_input().split())
print sum(arr)```

### Halloween Sale Solution using JavaScript

```function processData(input) {
var inputs = input.split('\n');
var arrayToSum = inputs[1].split(' ');
var sum = 0;

for (var i = 0; i < arrayToSum.length; i++) {
sum += parseInt(arrayToSum[i], 10);

}
console.log(sum);
}

process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
_input += input;
});

process.stdin.on("end", function () {
processData(_input);
});```

### Halloween Sale Solution in Scala

```bject Solution {

def main(args: Array[String]) {
val lines = io.Source.stdin.getLines
val sum = lines.drop(1).next.split(" ").toList.map( _.toInt ).sum
println(sum)
}```

### Halloween Sale Solution in Pascal

```(* Enter your code here. Read input from STDIN. Print output to STDOUT *)
var n, s, x: longint;
begin
s:= 0;
while n>0 do begin
inc(s,x);
dec(n);
end;
writeln(s);

end.```

Disclaimer: This problem (Halloween Sale) is generated by HackerRank but the solution is provided by Chase2learn. This tutorial is only for Educational and Learning purposes.

## FAQ:

1. How do you solve the first question in HackerRank?

If you want to solve the first question of Hackerrank then you have to decide which programing language you want to practice i.e C programming, Cpp Programing, or Java programming then you have to start with the first program HELLO WORLD.

2. How do I find my HackerRank ID?

You will receive an email from HackerRank to confirm your access to the ID. Once you have confirmed your email, the entry will show up as verified on the settings page. You will also have an option to “Make primary”. Click on that option. Read more

3. Does HackerRank detect cheating?

yes, HackerRank uses a powerful tool to detect plagiarism in the candidates’ submitted code. The Test report of a candidate highlights any plagiarized portions in the submitted code and helps evaluators to verify the integrity of answers provided in the Test.

4. Does HackerRank use camera?

No for coding practice Hackerrank does not use camera but for companies’ interviews code submission time Hackerrank uses the camera.

5. Should I put HackerRank certificate on resume?

These certificates are useless, and you should not put them on your resume. The experience you gained from getting them is not useless. Use it to build a portfolio, and link to it on your resume.

6. Can I retake HackerRank test?

The company which sent you the HackerRank Test invite owns your Test submissions and results. It’s their discretion to permit a reattempt for a particular Test. If you wish to retake the test, we recommend that you contact the concerned recruiter who invited you to the Test and request a re-invite.

7. What is HackerRank?

HackerRank is a tech company that focuses on competitive programming challenges for both consumers and businesses. Developers compete by writing programs according to provided specifications. Wikipedi

Finally, we are now, in the end, I just want to conclude some important message for you

Note:- I compile all programs, if there is any case program is not working and showing an error please let me know in the comment section. If you are using adblocker, please disable adblocker because some functions of the site may not work correctly.