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. Taum and B'day
  5. Discussions

Taum and B'day

Sort by

recency

|

941 Discussions

|

  • aziztuit19
     + 0 comments
    def taumBday(b, w, bc, wc, z):
    # Write your code here
    if bc>wc+z:
        x=(w+b)*wc+b*z
        return x
    elif wc>bc+z:
        y=(b+w)*bc+w*z
        return y
    else:
        z=b*bc+w*wc
        return z

  • akulbachandra67
     + 0 comments

    **Simple Python Solution **

    x = min(bc,wc+z)
y = min(wc,bc+z)
return (b*x) + (w*y)

  • trupti29
     + 0 comments

    def taumBday(b, w, bc, wc, z): if bc == wc: return (b*bc)+(w*wc) else: if min(bc,wc)+z >= max(bc,wc): return (b*bc)+(w*wc) else: if wc < bc: return ((wc+z)*b)+(w*wc) else: return ((bc+z)*w)+(b*bc)

  • spriyamalar
     + 0 comments
    public static long taumBday(long noOfBlackGifts, long noOfWhiteGifts, long blackGiftPrice, long whiteGiftPrice, int conversionCost) {
    if(conversionCost < Math.abs(blackGiftPrice-whiteGiftPrice)) {
        if(blackGiftPrice < whiteGiftPrice) {
            whiteGiftPrice = blackGiftPrice + conversionCost;
        } else if(whiteGiftPrice < blackGiftPrice){
            blackGiftPrice = whiteGiftPrice + conversionCost;
        }
    }
    return (noOfBlackGifts * blackGiftPrice) + (noOfWhiteGifts * whiteGiftPrice);
}

  • yashdeora98294
     + 0 comments

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