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

1628题

#include 
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

1629题

#include 
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

1630题

#include 
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

1631题

#include 
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

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

你可能感兴趣的:(算法)