NICESEQ - NICE SEQUENCES
A nice sequence is a sequence of digits in which a digit d is placed at any index iff d is 0 or any divisor of d(except 1) has been placed already. First digit can be anything from 1 to 9.
Find the number of nice sequences of length n.
Input consists of number of test cases t
Following t lines have a single line containing n as described in the problem statement.
Print the number of nice sequences of length n modulo 1000000007 in a seperate line .
Input: 2 1 2 Output 9 23
Explaination : For n=2 nice sequences are :
10,20,22,24,26,28,30,33,36,39,40,44,48 and so on !
for n = 3, result = 71.
what will be the answer for n=3?
atleast explain the question and testcases properly
Nice question ! ;)Last edit: 2018-06-26 17:20:28
good question a2j sirjee :)
Nice question a2j !
nice question a2j ;)