import java.util.Arrays;
import java.util.Scanner;
public class _1 {
static int n;
static int[][] dp=new int[25][25];
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
for (int i = 2; i <= n; i++) {
dp[i][2]=i*(i-1);
}
for (int i = 3; i <= n; i++) {
for (int j = 3; j <= n; j++) {
dp[i][j]=dp[i-1][j-1]+dp[i-1][j];
}
}
long ans=0;
for (int i = 2; i <=n; i++) {
ans+=dp[n][i];
}
System.out.println(ans);
}
}
蓝桥杯 摆动序列 简单dp
最新推荐文章于 2024-07-09 16:46:46 发布