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.
I'm coding in python.
The sample test case works perfectly. But, all other test cases fail badly..I'm using precision of 10000 digits..
@shashank21j
Can you give more test cases to check my code??
Thanks Ashraf.
This line from the explanation of the problem also confuses me a lot..
"For the first N natural numbers, find the total of the digital sums of the first P digits for all the irrational square roots x such that x≤N "
Should we perform our calculations only for the natural number given as input, or should we take it as an indicator for 'first N natural numbers?' @shashank21j
Project Euler #80: Square root digital expansion
You are viewing a single comment's thread. Return to all comments →
I'm coding in python. The sample test case works perfectly. But, all other test cases fail badly..I'm using precision of 10000 digits.. @shashank21j Can you give more test cases to check my code??
The precision is given as P.
Thanks Ashraf. This line from the explanation of the problem also confuses me a lot..
"For the first N natural numbers, find the total of the digital sums of the first P digits for all the irrational square roots x such that x≤N "
Should we perform our calculations only for the natural number given as input, or should we take it as an indicator for 'first N natural numbers?' @shashank21j
Only for a natural number N
@shashank21j We should calculate for all the number below N right?
yes
"Only for a natural number N" and "Yes. We should calculate for all the numbers below N"
Both these statements are confusing me..!
Thanks @shashank21j
@shashank21j Should we round the decimal to P digits scale with HALF_UP method or else take the first 100 digits without rounding?
first 100 digits without rounding.