太戈编程第1628、1629、1630、1631题

1628题

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=20;
int n,m,f[N][N];
int main(){
	freopen("qiuhe1.in","r",stdin);
	freopen("qiuhe1.out","w",stdout);
	cin>>n>>m;
	if(n<m){
		cout<<0<<endl;
		return 0;
	}
	for(ll i=1;i<=n;i++) f[i][1]=1;
	for(ll j=2;j<=m;j++)
		for(ll i=j;i<=n;i++)
			f[i][j]=f[i-1][j-1]+f[i-j][j];
	cout<<f[n][m]<<endl;
    return 0;
}

1629题

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=20;
int n,m,f[N][N];
int main(){
	freopen("qiuhe2.in","r",stdin);
	freopen("qiuhe2.out","w",stdout);
	cin>>n>>m;
	if(n<m){
		cout<<0<<endl;
		return 0;
	}
	ll ans=1;
	for(ll i=1;i<=m-1;i++){
		ans*=n-i;
		ans/=i;
	}
	cout<<ans<<endl;
	return 0;
}

1630题

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=20;
int n,m,S[N][N];
int main(){
	freopen("qiuhe3.in","r",stdin);
	freopen("qiuhe3.out","w",stdout);
	cin>>n>>m;
	if(n<m){
		cout<<0<<endl;
		return 0;
	}
	for(ll i=1;i<=n;i++) S[i][1]=1;
	for(ll j=2;j<=m;j++)
		for(ll i=j;i<=n;i++)
			S[i][j]=S[i-1][j-1]+j*S[i-1][j];
	cout<<S[n][m]<<endl;
	return 0;
}

1631题

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=20;
ll n,m,S[N][N];
ll a(ll x){
	ll mul=1;
	for(ll i=1;i<=x;i++){
		mul*=i;
	}
	return mul;
}
int main(){
	freopen("qiuhe4.in","r",stdin);
	freopen("qiuhe4.out","w",stdout);
	cin>>n>>m;
	if(n<m){
		cout<<0<<endl;
		return 0;
	}
	for(ll i=1;i<=n;i++) S[i][1]=1;
	for(ll j=2;j<=m;j++)
		for(ll i=j;i<=n;i++)
			S[i][j]=S[i-1][j-1]+j*S[i-1][j];
	cout<<S[n][m]*a(m)<<endl;
	return 0;
}

希望这些对大家有用，三连必回