Sort by

recency

|

83 Discussions

|

  • + 0 comments

    a nanny can surely help you with this check this Nannies

  • + 0 comments

    I want the algorithm to embed for the page budget.

  • + 0 comments

    What Does "Self Help" Mean? On the eve of each new year, people commit to making lifestyle changes they believe will usher in personal satisfaction and happiness. But while an entire industry exists to help people meet these pressing goals, most individuals still flounder. Generally, information based on peer-reviewed science is the standard to adhere to; Isaac Euler, when executed intelligently, can work. How can I seek mutual support? Created with Sketch. Self-help doesn’t necessarily mean going it alone. People who have more self-love tend to know what they think, feel, and want. Taking actions based on need rather than want. By staying focused on what you need, you turn away from automatic behavior patterns that get you into trouble, keep you stuck in the past, and lessen self-love. Practicing good self-care.

  • + 0 comments

    Test case 2, 3 and 15 fails with this code. Can anyone maybe check where I went wrong?

    def solve(n, k): # Write your code here # math. ceil() first_k = k end = False count = 1 summation = 0 while(not end): x = 0 incr = 0 if (kn):

            x = int(math.ceil(((k/2)+0.5)))
            if (x>n):
                end = True    
            else:
                incr = n - x + 1
                summation = summation + incr
                if (incr==1):
                    end = True        
        elif (k==n):
            end = True   
        count = count + 1
        k = k + first_k
    return summation
    
  • + 0 comments

    Test case 2, 3 and 15 fails with this code. Can anyone maybe check where I went wrong?

    def solve(n, k): # Write your code here # math. ceil() first_k = k end = False count = 1 summation = 0 while(not end): x = 0 incr = 0 if (kn):

            x = int(math.ceil(((k/2)+0.5)))
            if (x>n):
                end = True    
            else:
                incr = n - x + 1
                summation = summation + incr
                if (incr==1):
                    end = True        
        elif (k==n):
            end = True   
        count = count + 1
        k = k + first_k
    return summation