Problem:


Score : 600 points

Problem Statement

Consider the following arithmetic progression with n terms:

x, x + d, x + 2d, \ldots, x + (n-1)d

What is the product of all terms in this sequence?
Compute the answer modulo 1\ 000\ 003.

You are given Q queries of this form.
In the i-th query, compute the answer in case x = x_i, d = d_i, n = n_i.

Constraints

1 \leq Q \leq 10^5

0 \leq x_i, d_i \leq 1\ 000\ 002

1 \leq n_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

Q
x_1 d_1 n_1
:
x_Q d_Q n_Q

Output

Print Q lines.

In the i-th line, print the answer for the i-th query.

Sample Input 1

2
7 2 4
12345 67890 2019

Sample Output 1

9009
916936

For the first query, the answer is 7 \times 9 \times 11 \times 13 = 9009.
Don't forget to compute the answer modulo 1\ 000\ 003.



Sample input:
2
7 2 4
12345 67890 2019


Sample output:
9009
916936

Submission status: Runtime Error

Solution code:
import numpy as np
q = int(input())
ans = []
for _ in range(q):
    x,d,n = map(int,input().split())
    a = np.arange(x,x+n*d,d)
    ans.append(np.prod(a)%1000003)
for i in ans:
    print(i)

Submission status: Runtime Error

Solution code:
import math
n, a, b, c = map(int,input().split())
prob=(a)/100.0
answer = math.floor(1/(1-prob))

print(int(answer))

Submission status: Runtime Error

Solution code:
Q=int(input())
for i in range(Q):
     x, d, n = map(int, input().split())
     for j in range(n):
          xd=x
          x=x*(x+d*j)
          X=int(x/xd)
          print(X%1000003)

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10000000)

def product(x_p, d_p, n_p):
    if n_p == 0:
        return 1
    else :
        return x_p * product(x_p + d_p, d_p, n_p - 1)

def main():
    q = int(input())
    for i in range(q):
        x, d, n = map(int,input().split())
        print(int(product(x, d, n) % 1000003))

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(1000000)
q = int(input())

def method(x, d, n):
    if n == 0:
        return 1
    temp = x + (n - 1) * d
#    print('\ntemp: ' + str(temp))
    return temp * method(x, d, n - 1)

for i in range(q):
    x, d, n = map(int, input().split())
    print(method(x, d, n) % 1000003)

Submission status: Runtime Error

Solution code:
# coding:utf-8

import math

def main():
    q = int(raw_input())
    params = []
    for i in range(q):
        params.append(raw_input())
    for p in params:
        x,d,n = map(int,p.split())
        total = 1
        for j in range(n):
            total = total * (x + j * d)
        print total % 1000003



if __name__ == "__main__":
    main()