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. Data Structures
  3. Advanced
  4. Divisibility
  5. Discussions

Divisibility

Sort by

recency

|

9 Discussions

|

  • w818656
     + 0 comments

    thanks

  • joshiruhi37
     + 0 comments

    Thanks for providing solution for this. Change my life spell

  • sarahpretson
     + 0 comments

    Got it easily , share some more problems to so that I can easily tackle them.... wazifa for husband to come back

  • shudik_dev
     + 1 comment

    Anyone can help me for optimizing this code?

    def solve(p, s, queries):
    bigNumber = str(s)
    count=0
    result = []
    for i in queries:
        count=0
        q=i[1]+2-i[0]
        for j in range(i[0],i[1]+1):
            for k in range(1,q):
                if (int(bigNumber[j-1:j+k-1]))%p==0:
                    count+=1
            q-=1
        result.append(count)
    return result

  • shubhamrock19998
     + 1 comment

    sorry, I forgot what I wrote. seeing upvotes to my http://tanktrouble.xyz it looks there are enough clues, try once again carefully reading my comment above if you have time)