left[0]=a[0];
for(int i=1;i<=n-1;i++)
left[i]=(left[i-1]*a[i])%M;
right[n-1]=a[n-1];
for(int i=n-2;i>=0;i--)
right[i]=(right[i-1]*a[i])%M;
for query q
if(q==0)
return right[1]%M;
if(q==n-1)
return left[n-2]%M;
return (left[q-1]*right[q+1])%M;
Answer:
i think it helps
Explanation:
sorry there was someone else rude as heck messaging and responding I couldn't see their screen name
what isig naame
oh okay
I have sent dm
i dont know your name there
Answer:
otp
Explanation:
don't know bro ask to your teacher
1) Use a good cam 2) Make sure you focus on it 3) Make sure you snap it at the right time.... I hope this helps!!!!!
Answer:
A collating machine is used to gather or arrange in their proper sequence.
Explanation:
