The number having odd divisors between 2 numbers
Plot of a tornado-shaped surface
What exact color does ozone gas have?
It grows, but water kills it
What should you do when eye contact makes your subordinate uncomfortable?
Strong empirical falsification of quantum mechanics based on vacuum energy density
Why does the Sun have different day lengths, but not the gas giants?
Terse Method to Swap Lowest for Highest?
Does an advisor owe his/her student anything? Will an advisor keep a PhD student only out of pity?
How to cover method return statement in Apex Class?
What happens if you are holding an Iron Flask with a demon inside and walk into an Antimagic Field?
Extract more than nine arguments that occur periodically in a sentence to use in macros in order to typset
Is this toilet slogan correct usage of the English language?
Can disgust be a key component of horror?
Creepy dinosaur pc game identification
Has any country ever had 2 former presidents in jail simultaneously?
When were female captains banned from Starfleet?
Angel of Condemnation - Exile creature with second ability
Lowest total scrabble score
Keeping a ball lost forever
Is there a way to get `mathscr' with lower case letters in pdfLaTeX?
How does the math work for Perception checks?
Redundant comparison & "if" before assignment
Can a College of Swords bard use a Blade Flourish option on an opportunity attack provoked by their own Dissonant Whispers spell?
Mixing PEX brands
The number having odd divisors between 2 numbers
$begingroup$
I am trying to solve a problem from Hackerearth. I'm able to solve sample testcases but somehow when I am submitting the solution it gives time limit exceeded error(15 sec+) or wrong output message.
Problem
Little Dipu is a small kid and like all the other kids, he likes to play, but he plays with numbers (He is extraordinary you know). Now-a-days Dipu has some extra interest in odd numbers. So, he says that a number N is interesting if it has odd number of divisors. Now Dipu turns to you and asks you to tell him how many interesting numbers are there between two given numbers, L and R (both inclusive).
Input
First line of input contains the number of test cases T. Each of the next T lines contains two space separated integers L and R.
Output
For each test case, output an integer, denoting the count of interesting numbers between L and R (both inclusive).
Constraints
1 <= T <= 100000
1 <= L <= R <= 1018
SAMPLE INPUT
2
1 3
6 10
SAMPLE OUTPUT
1
1
Explanation
In 1st test case, 1 has 1 divisor, 2 has 2 divisors and 3 also has 2 divisors. So only 1 has odd number of divisors. Hence count of interesting numbers is 1.
In 2nd test case, 9 is the only number to have odd number of divisors. So answer is again 1.
My Code:
n = int(input())
for _ in range(n):
i,j = [int(k) for k in input().split(" ")]
s = []
for l1 in range(i, j):
count = 0
for l2 in range(l1):
if l1 % (l2+1)==0:
count += 1
if count%2 != 0:
s.append(l1)
print(len(s))
How can I improve above code?
python python-3.x time-limit-exceeded
asked 3 mins ago
AkshayNevrekarAkshayNevrekar
1184
$endgroup$
add a comment |
$begingroup$
I am trying to solve a problem from Hackerearth. I'm able to solve sample testcases but somehow when I am submitting the solution it gives time limit exceeded error(15 sec+) or wrong output message.
Problem
Little Dipu is a small kid and like all the other kids, he likes to play, but he plays with numbers (He is extraordinary you know). Now-a-days Dipu has some extra interest in odd numbers. So, he says that a number N is interesting if it has odd number of divisors. Now Dipu turns to you and asks you to tell him how many interesting numbers are there between two given numbers, L and R (both inclusive).
Input
First line of input contains the number of test cases T. Each of the next T lines contains two space separated integers L and R.
Output
For each test case, output an integer, denoting the count of interesting numbers between L and R (both inclusive).
Constraints
1 <= T <= 100000
1 <= L <= R <= 1018
SAMPLE INPUT
2
1 3
6 10
SAMPLE OUTPUT
1
1
Explanation
In 1st test case, 1 has 1 divisor, 2 has 2 divisors and 3 also has 2 divisors. So only 1 has odd number of divisors. Hence count of interesting numbers is 1.
In 2nd test case, 9 is the only number to have odd number of divisors. So answer is again 1.
My Code:
n = int(input())
for _ in range(n):
i,j = [int(k) for k in input().split(" ")]
s = []
for l1 in range(i, j):
count = 0
for l2 in range(l1):
if l1 % (l2+1)==0:
count += 1
if count%2 != 0:
s.append(l1)
print(len(s))
How can I improve above code?
python python-3.x time-limit-exceeded
asked 3 mins ago
AkshayNevrekarAkshayNevrekar
1184
$endgroup$
add a comment |
$begingroup$
I am trying to solve a problem from Hackerearth. I'm able to solve sample testcases but somehow when I am submitting the solution it gives time limit exceeded error(15 sec+) or wrong output message.
Problem
Little Dipu is a small kid and like all the other kids, he likes to play, but he plays with numbers (He is extraordinary you know). Now-a-days Dipu has some extra interest in odd numbers. So, he says that a number N is interesting if it has odd number of divisors. Now Dipu turns to you and asks you to tell him how many interesting numbers are there between two given numbers, L and R (both inclusive).
Input
First line of input contains the number of test cases T. Each of the next T lines contains two space separated integers L and R.
Output
For each test case, output an integer, denoting the count of interesting numbers between L and R (both inclusive).
Constraints
1 <= T <= 100000
1 <= L <= R <= 1018
SAMPLE INPUT
2
1 3
6 10
SAMPLE OUTPUT
1
1
Explanation
In 1st test case, 1 has 1 divisor, 2 has 2 divisors and 3 also has 2 divisors. So only 1 has odd number of divisors. Hence count of interesting numbers is 1.
In 2nd test case, 9 is the only number to have odd number of divisors. So answer is again 1.
My Code:
n = int(input())
for _ in range(n):
i,j = [int(k) for k in input().split(" ")]
s = []
for l1 in range(i, j):
count = 0
for l2 in range(l1):
if l1 % (l2+1)==0:
count += 1
if count%2 != 0:
s.append(l1)
print(len(s))
How can I improve above code?
python python-3.x time-limit-exceeded
asked 3 mins ago
AkshayNevrekarAkshayNevrekar
1184
$endgroup$
I am trying to solve a problem from Hackerearth. I'm able to solve sample testcases but somehow when I am submitting the solution it gives time limit exceeded error(15 sec+) or wrong output message.
Problem
Little Dipu is a small kid and like all the other kids, he likes to play, but he plays with numbers (He is extraordinary you know). Now-a-days Dipu has some extra interest in odd numbers. So, he says that a number N is interesting if it has odd number of divisors. Now Dipu turns to you and asks you to tell him how many interesting numbers are there between two given numbers, L and R (both inclusive).
Input
First line of input contains the number of test cases T. Each of the next T lines contains two space separated integers L and R.
Output
For each test case, output an integer, denoting the count of interesting numbers between L and R (both inclusive).
Constraints
1 <= T <= 100000
1 <= L <= R <= 1018
SAMPLE INPUT
2
1 3
6 10
SAMPLE OUTPUT
1
1
Explanation
In 1st test case, 1 has 1 divisor, 2 has 2 divisors and 3 also has 2 divisors. So only 1 has odd number of divisors. Hence count of interesting numbers is 1.
In 2nd test case, 9 is the only number to have odd number of divisors. So answer is again 1.
My Code:
n = int(input())
for _ in range(n):
i,j = [int(k) for k in input().split(" ")]
s = []
for l1 in range(i, j):
count = 0
for l2 in range(l1):
if l1 % (l2+1)==0:
count += 1
if count%2 != 0:
s.append(l1)
print(len(s))
How can I improve above code?
python python-3.x time-limit-exceeded
python python-3.x time-limit-exceeded
asked 3 mins ago
AkshayNevrekarAkshayNevrekar
1184
asked 3 mins ago
AkshayNevrekarAkshayNevrekar
1184
asked 3 mins ago
AkshayNevrekarAkshayNevrekar
1184
asked 3 mins ago
AkshayNevrekarAkshayNevrekar
1184
asked 3 mins ago
AkshayNevrekarAkshayNevrekar
1184
1184
add a comment |
add a comment |
0
active
oldest
votes
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
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216034%2fthe-number-having-odd-divisors-between-2-numbers%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216034%2fthe-number-having-odd-divisors-between-2-numbers%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
