Tukukkk

 sqrt(16) -> sqrt(4) -> 2. 

import math

# For each perfect square, calculate the depth of square root operations

# applied against it.

def square(n):

  if n == 2 or n == 1:

    return 0

  sol = (int(n**0.5))**2

  if sol != n : return 0

  return  1 + square(int(n**0.5))





A = int(input())

B = int(input())



# Returns the perfect squares within that range

squares = [x for x in range(A,B) if (int(x**0.5))**2 == x]



print(max([square(i) for i in squares]))

 sqrt(16) -> sqrt(4) -> 2. 

import math

# For each perfect square, calculate the depth of square root operations

# applied against it.

def square(n):

  if n == 2 or n == 1:

    return 0

  sol = (int(n**0.5))**2

  if sol != n : return 0

  return  1 + square(int(n**0.5))





A = int(input())

B = int(input())



# Returns the perfect squares within that range

squares = [x for x in range(A,B) if (int(x**0.5))**2 == x]



print(max([square(i) for i in squares]))

 sqrt(16) -> sqrt(4) -> 2. 

import math

# For each perfect square, calculate the depth of square root operations

# applied against it.

def square(n):

  if n == 2 or n == 1:

    return 0

  sol = (int(n**0.5))**2

  if sol != n : return 0

  return  1 + square(int(n**0.5))





A = int(input())

B = int(input())



# Returns the perfect squares within that range

squares = [x for x in range(A,B) if (int(x**0.5))**2 == x]



print(max([square(i) for i in squares]))

 sqrt(16) -> sqrt(4) -> 2. 

import math

# For each perfect square, calculate the depth of square root operations

# applied against it.

def square(n):

  if n == 2 or n == 1:

    return 0

  sol = (int(n**0.5))**2

  if sol != n : return 0

  return  1 + square(int(n**0.5))





A = int(input())

B = int(input())



# Returns the perfect squares within that range

squares = [x for x in range(A,B) if (int(x**0.5))**2 == x]



print(max([square(i) for i in squares]))

Your Answer

StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");

StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});