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. Mathematics
  3. Fundamentals
  4. Die Hard 3
  5. Discussions

Die Hard 3

Sort by

recency

|

62 Discussions

|

  • 2k23csaiml231366
     + 0 comments

    def solve(a, b, c): yes, no = "YES", "NO" a, b = max(a, b), min(a, b)

    """ KAIFU KI AAWAAZ BADI MANHOOS HAI ,SUN LO TO AISA LAGEGA MANO JAISE LAKADBAGHGHE KA GALA BAITHA HAI , KAIF KI ID: 2301641530110"""

  • vaishnavisingh72
     + 0 comments
    public static String solve(int a, int b, int c) {

    // char* solve(int a, int b, int c) { int c1=hcf(a,b); if(c<=Math.max(a,b)&&c%c1==0) return "YES"; else return "NO";

    } public static int hcf(int n1, int n2) { if (n2 != 0) return hcf(n2, n1 % n2); else return n1; } }

  • siddhanthbiswas
     + 0 comments

    My Python3 solution

    def solve(a, b, c):
    yes, no = "YES", "NO"
    a, b = max(a, b), min(a, b)

    b_states = {0, b}
    a_states = {0, a}
    b_state = b_states.copy()
    a_state = a_states.copy()
    if c in a_states or c in b_states:
        return yes
    search = True
    while search:
        for jug_a in a_state:
            for jug_b in b_state:
                
                a1, a2 = min(a, jug_a + jug_b), max(0, jug_a - (b - jug_b))
                b1, b2 = min(b, jug_b+jug_a), max(0, jug_b - (a - jug_a))
                
                if c in {a1, a2, b1, b2}:
                    return yes
        
                a_states.add(a1)
                a_states.add(a2)
                
                b_states.add(b1)
                b_states.add(b2)
    
        if a_states == a_state and b_states == b_state:
            break
    

        b_state = b_states.copy()
        a_state = a_states.copy()

    # print(a_states, b_states)
    return no

  • patrick_gendotti
     + 0 comments

    I first solved this problem with backtracking (which works great for games, or procedures with limited next steps available), but using the gcd was a lot simpler - I didn't think about it for a while, though. So there are a few ways to solve this problem!

  • Kunaleleven23
     + 1 comment
    def solve(a, b, c):
    hcf=math.gcd(a,b)
    if c<=max(a,b) and c%hcf==0:
          return "YES"
    return "NO"