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. Practice
  2. Algorithms
  3. Greedy
  4. Sherlock and The Beast
  5. Discussions

Sherlock and The Beast

  • sagemode + 3 comments

    yeah finding the pivot is important. My solution is similar. I aimed to remove the expensive operation "modulo", here's my solution.

    #Python solution without modulo
t = int(input().strip())
for a0 in range(t):
    n = int(input().strip())
    x = (int(n / 3)) * 3
    y = 0
    while True:
        y = n - x
        if ((int(y / 5)) * 5 != y):
            if (x == 0):
                print("-1")
                break
            x = (int((x - 1) / 3)) * 3
        else:
            print (int(x) * "5" + int(y) * "3")
            break
    • mdsmithson + 1 comment

      why are you putting a solution in the discussion?

    • gauraviitkgp + 0 comments
      [deleted]
    • gauraviitkgp + 0 comments

      import sys can u telll me what is error in my code

      t = int(raw_input())

      test = 0

      for a0 in xrange(t):

      n = int(raw_input().strip())
for i in range(0,n):
    if (n-5*i)>=0 and (n-5*i)%3==0:
        print("5"*(n-5*i)+"3"*(i*5))
        test = test + 1
    if test==0:
        print("-1")