View Code of Problem 3695

#include<stdio.h>
//二刷 
long long dp[91];
void Initial(){
	dp[0] = 1;
	dp[1] = 2;
	for(int i=2; i<91; i++){
		dp[i] = dp[i-1] + dp[i-2];
	}
	return;
}

int main(){
	Initial();
	int T;
	scanf("%d", &T);
	while(T--) {
		int n;
		scanf("%d", &n);
		long long sum = 0;
		for(int i=0; i<n; i++){ //i=0是第一天，i=n-1是第n天 
			sum += dp[i];
		}
		printf("%lld\n", sum); //注意事项%lld 
	} 
	return 0;
}