#include<iostream>
using namespace std;
int cuo(int n){
int b, b1 = 1, b2 = 0,i;
for ( i = 3; i <= n; i++){
b = ((i - 1)*(b1 + b2));
b2 = b1;
b1 = b;
}
return b;
}
int main()
{
cout << "输入信的个数" << endl;
int n;
cin >> n;
cout<<cuo(n);
}
信封错排算法
最新推荐文章于 2024-08-04 21:58:45 发布