You've successfully subscribed to The Poor Coder | Hackerrank Solutions
Great! Next, complete checkout for full access to The Poor Coder | Hackerrank Solutions
Welcome back! You've successfully signed in.
Success! Your account is fully activated, you now have access to all content.
Hackerrank - Diwali Lights Solution

Hackerrank - Diwali Lights Solution

Beeze Aal
Beeze Aal

On the eve of Diwali, Hari is decorating his house with a serial light bulb set. The serial light bulb set has N bulbs placed sequentially on a string which is programmed to change patterns every second. If at least one bulb in the set is on at any given instant of time, how many different patterns of light can the serial light bulb set produce?

Note: Lighting two bulbs *-* is different from **-

Input Format
The first line contains the number of test cases T, T lines follow.
Each line contains an integer N, the number of bulbs in the serial light bulb set.

Output Format
Print the total number of patterns modulo 105

Constraints
1 <= T <= 1000
0< N < 104

Sample Input

2
1
2

Sample Output

1
3

Explanation

Case 1: 1 bulb can be lit in only 1 way.
Case 2: 2 bulbs can be lit in -*, *-, ** i.e. 3 ways.

Solution in Python

def lights(n):
    return (2**n-1)%10**5

for _ in range(int(input())):
    print(lights(int(input())))