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;
Simplex, simplex, and half duplex.
Hope this helps!!
<h3>
Answer:</h3><h2>TRUE</h2>
Explanation:
BRAINLIEST PLSSSSSSSSSSSSSSSSSSS
Answer:
1.enhace the speed and accuracy of work
2.Large historical data can be stored easily for future use.
3.Quick calculation and display of graphical and mathematical data.
