nines | web performance tool aimed to help developers find | Performance Testing library

I want to write a function that counts a given number n's digits occurrence. I have the following code:

I'm trying to denormalize a few MySQL tables I have into a new table that I can use to speed up some complex queries with lots of business logic. The problem that I'm having is that there are 2.3 million records I need to add to the new table and to do that I need to pull data from several tables and do a few conversions too. Here's my query (with names changed)

We have to find the minimum number of digits required to make a given number, for example: 14 => 95 (9 + 5 = 14) is two digits which is the minimum to form 14.

I was working on reading values in variables from a byte positioned file and I had to represent some value read into decimal with 6 digits representing fractional part, total no. of digits 20.

So the value could be for example be 99999999999999999999 (20 9s) and it is to be used as float considering the last six 9s representing fractional part.

Now when I was tring to do it with the method employed:

I have been working on a "WAR" card game in class. I seem to have most of it setup correctly, however, I am having some issues dealing 2 new cards to the image boxes when clicking the deal button.

The exact things I need the draw button to accomplish is When the draw button is pressed, the first two cards from the shuffled deck should show up, one on the left and one on the right side. The middle card will be the “Left win”, “Right Win”, or “Tie” image and is correctly indicate who won (with the higher card). Furthermore, the winner’s score should increase by 1 point.

I will include a screenshot of my form to give you an idea of what I am working with and where I should go with the deal button. My guess is when I click the deal button a second time it is resetting the values back to 0 and 26 respectively.

enter image description here

I am looking for an algorithm, that is able to find all numbers, that are n digits long and have the sum of their digits equal to x. As the code is part of a large program, a low time complexity is desired.

Examples:

I saved a search in https://news.google.com/ but google does not use the actual links found on its results page. Rather, you will find links like this:

As a starter project, I'm making a code that writes out digits of pi. The code prompts for an int, and prints that many decimal places of pi, which uses a predetermined string. The problem is that each individual digit is on a separate line, like this:

3
.
1
4
1
5
9

That code used a for loop that ends at the index that is given by the scanner. It printed one character at a time. I'm struggling to find a way to make the code print ten-digit substrings of pi separately, each on their own line, meaning 26 digits would be printed like this:

3 .
1415926535
8979323846
264338

That is two sets of ten, and a third set containing the remaining six. I'm struggling to divide the string printing into groups of ten, and still have the printing stop at the given index, even if that index is not a multiple of ten. In addition, the for loop from the old code is being used for a digit counter, so I would like to keep it. Placing "/n" into the string to make spaces interrupts the counting system, as those characters are counted and printed as well, invalidating that option. Thus far I haven't had any other ideas to fix this. If you know of a way to print in this fashion, let me know. My code is below, feel free to copy it and experiment, and credit me if you decide to use it somewhere.

I have the following function: