Loser_'s blog

By Loser_, history, 17 months ago, In English

hello I am stuck in this problem Digit Queries.I think I need to use recursion here although not quite sure how? Which algo or technique I need to study to solve this problem? Also please share similar types of problems from other ojs.Please help me with that.

 
 
 
 
  • Vote: I like it
  • -2
  • Vote: I do not like it

»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

simple constructive algorithms is enough to solve this

»
17 months ago, # |
Rev. 3   Vote: I like it 0 Vote: I do not like it

This string contains numbers, numbers contain digits.

Note: summary length of all n-digit numbers is easy to calculate.

more detailed solution
»
15 months ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

Hello,

  • I try to solve this problem https://cses.fi/problemset/task/2431/
  • I come up with a formuler:
  • x is length of number (1,2,3,4)
  • k = 9*1 + 90*2 + 900*3 + 9000*4 +..+9*(10^x)*x : total number

here my code: https://cses.fi/paste/f1e04f128ac4fe471ae4e1/ however, my code passed only two first test cases. I don't know what wrong with my code.

Here are test cases' result

Please help me to point what's wrong. thank you.

  • »
    »
    11 months ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    I use c++ and i had same problem(1st 2 test cases were passed but other 2 gave error) the thing is dont use inbuilt math functions as you used pow function(build your own pow function instead of using inbuilt pow function, then all test cases get satisfied).Here's the code i used https://onlinegdb.com/fnTAINkFb

    moral of story: dont use/avoid in built math functions

    • »
      »
      »
      9 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Or just use them properly. pow is not meant to be used for integers, it's meant to be used for doubles. There are plenty of built in math functions that are very useful, you just have to use the right ones.

  • »
    »
    8 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Here is a solution that uses similar logic and passes all tests:

    Code
»
15 months ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

this problem is same as Digits Sequence

»
15 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Good Constructive Algorithm question! Here is my descriptive solution (https://ideone.com/4yYbq4)

»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

you can find a complete video editorial of that problem here: https://youtu.be/QAcH8qD9Pe0