We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Halloween Sale
  5. Discussions

Halloween Sale

Sort by

recency

|

675 Discussions

|

  • anarod_val25
     + 0 comments

    Why so many test cases?

    int games = 0;
    
    while(p>m && s>0){
        
        s-=p;
        
        if(s>0){
            games++;
            p-=d;
        }
    }
    
    if((s-m)>=0){
        return games + (s/m);
    }
    
    return games;

  • sivaram_movva1
     + 0 comments

    public static int howManyGames(int p, int d, int m, int s) { // Return the number of games you can buy

        int n=0;        

    while(s-p>=0)
    {            
        n++;
        s-=p;            
        p-=d;

        if(p<=m)
        {
            p=m;
        }      
    }

    return n;
}

  • greivin_lopez
     + 0 comments
    def how_many_games(p, d, m, s):
    if s < p:
        return 0
    c = 0
    while s >= m:
        s -= (p - c*d) if ((p - c*d) >= m) else m
        c += 1 if s >= 0 else 0
    return c

  • yashdeora98294
     + 0 comments

    Here is problem solution in Python, Java, C++, C and Javascript - https://programmingoneonone.com/hackerrank-halloween-sale-problem-solution.html

  • unknownagnibha
     + 0 comments

    PYTHON If in dought pls ask

    def howManyGames(p, d, m, s):
    # Return the number of games you can buy
    games=0
    i=0
    while s>=0:
        cost=p-d*i
        if cost>m:
            s-=cost
        else:
            s-=m
        games+=1
        i+=1
    return games-1