7,763
社区成员
发帖
与我相关
我的任务
分享
//由上面的公式可得程序
//设元素都为整数
int[] a = new int[]{...};
int sum = new int();
for(int i = 0;i<a.Lenth;i++)
{
int Num1 = (a[i]+ a[a.lenth - i]);
int Num2 = (a[i]- a[a.lenth - i]);
sum += Num1*Num1 - Num2*Num2;
}
return sum;
double Fn(int n)
{
if (n == 0 || n == 1)
return 1;
if (n == 2)
return 2;
double[] arr = new double[n + 1];
arr[0] = arr[1] = 1;
arr[2] = 2;
for (int i = 3; i <= n; i++)
{
for (int j = 0; j < i; j++)
{
arr[i] += arr[i - j - 1] * arr[j];
}
}
return arr[n];
}
int Fn(int n)
{
if (n == 0 || n == 1)
return 1;
if (n == 2)
return 2;
int fn = 0;
for (int i = 0; i < n; i++)
{
fn += Fn(n - i - 1) * Fn(i);
}
return fn;
}
int Fn(int n)
{
if (n == 0 || n == 1)
return 1;
if (n == 2)
return 2;
int fn = 0;
for (int i = 0; i < n; i++)
{
fn += Fn(n - i - 1) * Fn(i);
}
return fn;
}