mem = [0]*n
def fn(x,n):
if n==0:return 1
elif mem[n]!=0:return mem[n]
else:
mem[n] = fn(n-1)*x
return mem[n]
def func(arr,x,n):
sum = 0
for i in range(n+1):
sum += arr[i]*fn(x,i)
return sum
public static int miltX(int X, int[] a){
int sum = 0;
int temp = 1;
int n = a.length;
for(int i=0; i<n; i++){
sum += a[i]*temp;
temp *= X;
}
return sum;
}
int fun(int x,int n)
{
for(int i=0;i<=n;i++)
{
int *p;
int a[n+1]={a0,a1,...,an};
p=a;
int sum=0;
sum+=(*(p+i))*huan(int i, int x);
}
return sum;
}
int huan(int i, int x)
{
if(i=0)
return 1;
else
{
for(int j=0;j<i;j++)
{
int m=1;
m*=x;
}
}
return m;
}