Reasonzzz的博客

#include<iostream>#include<cstdio>#include<cstring>using namespace std;int dp[1234][1234];int main(){ int n,k; scanf("%d%d",&n,&k); int i,j; dp[0][0]=1; for(i=1;i<=n;i++) { dp[i][1]=1;

#include<iostream>using namespace std;char a[30],b[30];int n;void f(int L,int R){ int k; if(L>R)return; bool flag=false; for(int i=0;i<=n;i++) { for(int j=L;j<=R;j++) { if(b[i]==a[j])

(https://pintia.cn/problem-sets/1433281645203116032/problems/1437018860810612736)#include<iostream>#include<cmath>using namespace std;int a[1000][1000];void f(int k,int n){ if(n==2) { a[k][1]=k; a[k][2]=k+1; a[k+1][1]=k+1; a[k+1

[用交换的分治法实现前m（m<10）个自然数数的全排列。 提示：通过交换实现的全排列不是字典序的全排列。输入格式:输入一个数m，代表要用1-m个自然数的全排列。输出格式:输出前m个自然数的全排列。(每个数之间用一个空格隔开，每行结束后有一个空格。最后一行数后面有一个空行，即每输出一行后添加一个换行，不考虑是否是最后一行)输入样例:](https://pintia.cn/problem-sets/1433281645203116032/problems/1437018731755806720

#include <iostream>using namespace std;void hanoi(int n, char a, char b, char c){ if(n==0) return; hanoi(n-1, a, c, b); printf("%c-->%c\n", a, b); hanoi(n-1, c, b, a);}int main(){ int n; cin >> n; hanoi(n, 'a', 'b', 'c'); ret..

7-2 杨辉三角#include <iostream>using namespace std;int main(){ int a[100][100] = { 0 }; int i, j, n; //cout << "请输入行数:" << endl; cin >> n; for (i = 0; i < n; i++) { for(j = 0; j <= i; j++) { if (j < 1) a[i][j] =

C语言:#include<stdio.h>int MaxSubseqSum(int A[],int N ){ int ThisSum, MaxSum; int i; ThisSum = MaxSum = 0; for( i = 0; i <N; i++ ) { ThisSum += A[i]; if( ThisSum > MaxSum ) MaxSum = ThisSum; else if( ThisSu