# Solution of;
# Project Euler Problem 230: Fibonacci Words
# https://projecteuler.net/problem=230
# 
# For any two strings of digits, A and B, we define FA,B to be the sequence 
# (A,B,AB,BAB,ABBAB,. . . ) in which each term is the concatenation of the 
# previous two. Further, we define DA,B(n) to be the nth digit in the first 
# term of FA,B that contains at least n digits. Example:Let A=1415926535, 
# B=8979323846. We wish to find DA,B(35), say. The first few terms of FA,B 
# are:141592653589793238461415926535897932384689793238461415926535897932384614159265358979323846897932384614159265358979323846Then 
# DA,B(35) is the 35th digit in the fifth term, which is 9. Now we use for A 
# the first 100 digits of π behind the decimal 
# point:14159265358979323846264338327950288419716939937510 
# 58209749445923078164062862089986280348253421170679 and for B the next 
# hundred digits:82148086513282306647093844609550582231725359408128 
# 48111745028410270193852110555964462294895493038196 . Find ∑n = 0,1,. . . ,17 
# 10n× DA,B((127+19n)×7n) .
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 230
    timed.caller(dummy, n, i, prob_id)
