Submission #9895751

Source Code Expand

mod=10**6+3
P=[0 for i in range(mod)]
P[0]=1
for i in range(0,len(P)-1):
    P[i+1]=(P[i]*(i+1))%mod
P[0]=0
Q=int(input())
for q in range(Q):
    x,d,n=map(int,input().split())
    if d>0:
        D=pow(d,mod-2,mod)
        L=x*D%mod
        if L+n-1<mod:
            if L>0:
                value=P[L+n-1]*pow(P[L-1],mod-2,mod)*pow(d,n,mod)
            else:
                value=P[L+n-1]*pow(d,n,mod)
            print(value%mod)
        else:
            print(0)
    else:
        print(pow(x,n,mod))

Submission Info

Submission Time
Task E - Product of Arithmetic Progression
User karutelina
Language PyPy3 (2.4.0)
Score 600
Code Size 528 Byte
Status AC
Exec Time 1376 ms
Memory 114064 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 1
AC × 21
Set Name Test Cases
Sample example0.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, example0.txt
Case Name Status Exec Time Memory
000.txt AC 1258 ms 114032 KiB
001.txt AC 1239 ms 114032 KiB
002.txt AC 1240 ms 114032 KiB
003.txt AC 1234 ms 114032 KiB
004.txt AC 1255 ms 114032 KiB
005.txt AC 1224 ms 114064 KiB
006.txt AC 1245 ms 114032 KiB
007.txt AC 1275 ms 114032 KiB
008.txt AC 1237 ms 114032 KiB
009.txt AC 1211 ms 114032 KiB
010.txt AC 1224 ms 114032 KiB
011.txt AC 1229 ms 114032 KiB
012.txt AC 1209 ms 114032 KiB
013.txt AC 1343 ms 114032 KiB
014.txt AC 1376 ms 114032 KiB
015.txt AC 1355 ms 114032 KiB
016.txt AC 1285 ms 114032 KiB
017.txt AC 1356 ms 114032 KiB
018.txt AC 1172 ms 114032 KiB
019.txt AC 1289 ms 114032 KiB
example0.txt AC 234 ms 114032 KiB