Streat思锥

全高精度加法

#include<iostream>using namespace std;int n,a[25];int mmax(int a,int b){ return a>b?a:b;}int d(int i,int j){ if(i>n) return 0; else if(a[i]<=j) return mmax(d(i+1,j),d(i+1,a[i])+1);

#include<stdio.h>#include<string.h>#include<stdlib.h>#include <algorithm>#include<iostream>using namespace std;int f[1000000]; //f[i]表示前i个的最大价值（第i个一定取）struct node{ int a,b,c;}x[1010];int c

#include<iostream>using namespace std;int mmax(int a,int b){ return a>b?a:b;}int a[400],b[5],n,m,x,f[50][50][50][50];int d(int i,int j,int k,int l){ if(f[i][j][k][l]>0) return f[i][j][k][l

#include<iostream>#include<string.h>using namespace std;int n,m,x,y,f[25][25],vis[25][25];int d(int a,int b){ if(f[a][b]>=0) return f[a][b]; else if(a==0&&b==0) return 1;//走到终点总数加一 else

#include<iostream>using namespace std;int n,a[220],f[250][250];int d(int i,int j){ int mmax=0,tt=0; if(f[i][j]>0) return f[i][j]; else if(i==j) return 0; else{ for(int k=i;k<

#include<stdio.h>#include<iostream>using namespace std;char aa[50];int a[50],f[50][50][10],k,n;long long chengji(int x,int y){ long long sum=0; for(int i=x;i<=y;i++) sum=sum*10+a[i]; r

#include<stdio.h>#include<iostream>using namespace std;int n,m,x1,x2,y1,y2;long long f[55][55];long long d(int i,int j){ long long a=0,b=0,c=0,dd=0; if(f[i][j]>0) return f[i][j]; else

#include<stdio.h>#include<iostream>using namespace std;int n,k,f[400][7][100];int d(int l,int m,int n){ int sum=0; if(f[l][m][n]>0) return f[l][m][n]; else if(m<=0||n>l) return f[l][m][

#include<string.h>#include<stdlib.h>#include <algorithm>#include<iostream>using namespace std;struct node{ int l,r;}a[110];int cmp(node x1, node x2) { return x1.r < x2.r; } int main

#include<iostream>using namespace std;int v,n,a[35];int mmax(int a,int b){ return a>b?a:b;} int d(int i,int j){ if(i>n) return 0; if(j>=a[i]) return mmax(d(i+1,j),d(i+1,j-a[i])+a[i]);/

#include<string.h>#include<iostream>using namespace std;struct a{ int chongd,v;}G[25][25];int cut[25],vis[25],trytry,n,maxn=-1;char a[25][20],b;int catchdragon(char* x,char* y,int m,int n){

全高精度减法

#include<iostream>using namespace std;int n,a[25];int mmax(int a,int b){ return a>b?a:b;} int f(int i,int j){ if(i>n) return 0; else if(a[i]>=j) return mmax(f(i+1,j),f(i+1,a[i])+1);

#include<stdio.h>using namespace std;int n,w[110],f[110][110];int mmin(int a,int b){ return a<b?a:b;}int summ(int a,int b){ int ssum=0; for(int k=a;k<=b;k++) ssum+=w[k]; return ssu

#include<string.h>int a[500],vis[500],j,k,n;void dfs(int cur){ if(cur==n+1){ for(int x=1;x<=n;x++) printf("%d ",a[x]); printf("\n"); } else for(int ***i***=1;i<=n;i++){

#include<stdio.h>#include<iostream>#include<string.h>using namespace std;int n,a[110][110],f[110][110];/*int mmax(int a,int b){ return a>b?a:b;}int d(int i,int j){ if(f[i][j]>=0) return

CODEVS 3145汉诺塔游戏

#include<string.h>int n,i,j,k,a[5][30],tot=0;void dfs(int cur){ if(cur==n+1) tot++; else for(int i=1;i<=n;i++){ if(a[0][i]==0&&a[1][i+cur]==0&&a[2][i-cur+n]==0){ a[0][i]=

#include<string.h>int n,a[10][10],tot=0,colour[10],vis[10][10];int searchh(){ int ok=1; for(int m=1;m<=n;m++){ for(int i=1;i<=n;i++){ if(a[i][m]==1&&colour[i]==colour[m]){

#include<stdio.h>#include<iostream>using namespace std;int m,n,a[55][55],f[55][55][55][55];int maxx(int a,int b){ return a>b?a:b;} int d(int x1,int y1,int x2,int y2){ if(f[x1][y1][x2][y2]