数组的运用

题目描述

In class, kangkang learned to use the computer to solve N factorial, and then came home to show off to Jane. In order not to let kangkang be too complacent, Jane gave kangkang a question "since you're going to ask for N factorial, you'll help me figure out 1! + 2! -3! + 4! -5! +... N!" It is. Can you help him?

输入

The first line enters an integer T (0 < = 20), which represents T group test data.

After that, it has T rows, and each row enters a positive integer N (0 < N < = 20).

输出

Each group of test data accounts for one line, output 1! + 2! - 3! +... .. N! The value of the.

样例输入

2
2
4

样例输出

3
21

提示


#include<stdio.h>

int main()

{

long long a[30];//用long long。

a[0]=1;

for(int i=1;i<=20;i++)

a[i]=a[i-1]*i;

int t,n;

long long ans;

scanf("%d",&t);

while(t--)

{

ans=1;

scanf("%d",&n);

if(n==1)

printf("1\n");

else

{

for(int i=2;i<=n;i++)

{

if(i%2==0)

ans+=a[i];

else if(i%2==1)

ans-=a[i];

}

printf("%lld\n",ans);

}

}

return 0;

}

 



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值