How to resolve the algorithm First power of 2 that has leading decimal digits of 12 step by step in the FreeBASIC programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm First power of 2 that has leading decimal digits of 12 step by step in the FreeBASIC programming language

Table of Contents

Problem Statement

(This task is taken from a   Project Euler   problem.) (All numbers herein are expressed in base ten.)

27   =   128   and   7   is the first power of   2   whose leading decimal digits are   12. The next power of   2   whose leading decimal digits are   12   is   80, 280   =   1208925819614629174706176.

Define     p(L,n)     to be the nth-smallest value of   j   such that the base ten representation of   2j   begins with the digits of   L .

You are also given that:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm First power of 2 that has leading decimal digits of 12 step by step in the FreeBASIC programming language

Source code in the freebasic programming language

#define FAC 0.30102999566398119521373889472449302677

function p( L as uinteger, n as uinteger ) as uinteger
    dim as uinteger count, j = 0
    dim as double x, y
    dim as string digits, LS = str(L)
    while count < n
        j+=1
        x = FAC * j
        if x < len(LS) then continue while
        y = 10^(x-int(x))
        y *= 10^len(LS)
        digits  = str(y)
        if left(digits,len(LS)) = LS then count += 1
    wend
    return j
end function

print p(12, 1)
print p(12, 2)
print p(123, 45)
print p(123, 12345)
print p(123, 678910)

  

You may also check:How to resolve the algorithm Permutations step by step in the Ecstasy programming language
You may also check:How to resolve the algorithm Create an object at a given address step by step in the 8086 Assembly programming language
You may also check:How to resolve the algorithm Address of a variable step by step in the REXX programming language
You may also check:How to resolve the algorithm Count in octal step by step in the Swift programming language
You may also check:How to resolve the algorithm Combinations with repetitions step by step in the OCaml programming language