LUCIFER - LUCIFER Number
Lucifer is the only human whi has defeated RA-ONE in a computer game ..
RA-One is after lucifer for revenge and G-One is there to protect him ...
All thi G-One and Ra-one Nonsense has disturbed lucifers life..
He wants to get Rid of Ra-One and kill him . He found that Ra-One can be killed only by throwing Lucifer number of weapons at him.
Any number is LUCIFER NUMBER if the Difference between Sum of digits at even location and Sum of digits at odd location is prime number .. For eg... for 20314210 is lucifer number
digits at odd location 0,2,1,0
digits at even location 1,4,3,2
diff = (1+4+3+2)-(0+2+1+0)=10-3 = 7 ..... a prime number.
Lucifer has access to a Warehouse which has lots of weapons ..
He wants to know in how many ways can he kill him.
Can you help him?
First line will have a number 't' denoting the number of test cases.
each of the following t lines will have 2 numbers 'a' , 'b'
Print single number per test case, depicting the count of Lucifer numbers in the range a,b inclusive.
6NOTE: t will be less than 100
from and to will be between 0 and 10^9 inclusive
Why does this always involve Ra one and G one
After solving GONE AND RAONE....
My 2nd digit dp problem, AC in one go HOLLAHhhhhh.....
I think this question requires further clarifications. Difference here means the signed difference between even and odd positions. The positioning is considered from right to left with 1 based indexing. Negative numbers are not considered prime, even if their absolute value is prime.
Can someone pls explain how the ans for test case-- 0 50 is 6 as I am getting 14 for it.
This felt so good!!AC in 1 go!!My first digit dp :)
AC in one GO;)
Learnt so much..
my first digit dp :D
recursion without memoization is getting accepted too