天梯答案

从菜鸟到汉诺塔游戏的代码在：http://tieba.baidu.com/p/2489324307?pn=1

1098
#include<stdio.h>
int a[109];int main(){ int n; while(scanf("%d",&n)!=EOF) { int i,all=0,temp,add=0; for(i=1;i<=n;i++) { scanf("%d",&a[i]); all+=a[i]; } temp=all/n; for(i=1;i<n;i++) { if(a[i]==temp) continue; if(a[i]<temp) a[i+1]-=temp-a[i]; else a[i+1]+=a[i]-temp; add++; } printf("%d\n",add); }}

1214
var n,i,j,t,ans,a,b:longint; x,y,f:array[0..100] of longint; function max(a,b:longint):longint; begin if a>b then exit(a) else exit(b); end; begin read(n); for i:=1 to n do begin read(a,b); if a<=b then begin x[i]:=a; y[i]:=b; end else begin x[i]:=b; y[i]:=a; end; end; for i:=1 to n-1 do for j:=i+1 to n do if (y[i]>y[j])or(y[i]=y[j])and(x[i]>x[j]) then begin t:=y[i]; y[i]:=y[j]; y[j]:=t; t:=x[i]; x[i]:=x[j]; x[j]:=t; end; f[1]:=1; for i:=2 to n do for j:=1 to i-1 do begin if x[i]>=y[j] then f[i]:=max(f[i],f[j]+1); if f[i]>ans then ans:=f[i]; end; writeln(ans); end.

3115
#include <iostream>
#include <cstring>
using namespace std;
int *Str2Int(char *str) {
int i,len = strlen(str);
int *a = new int [(len+1)*sizeof(int)];
for(i=0; i<len; i++)
a[i] = (int)str[len-i-1]-48;
return a;
}
char *subtract(char *m1,char *m2)
{
int i,len1,len2,len;
int *t1,*t2,cf = 0;
char *temp,*csub;
len1 = strlen(m1);
len2 = strlen(m2);
len = (len1 > len2)?len1:len2;
t1 = new int[(len+2)*sizeof(int)];
t2 = new int[(len+2)*sizeof(int)];
temp = new char[(len+2)*sizeof(char)];
csub = new char[(len+3)*sizeof(char)];
if(len>len1 || ((len1 == len2) && strcmp(m1,m2)<0))
{
strcpy(temp,m1);
strcpy(m1,m2);
strcpy(m2,temp);
len1 = strlen(m1);
len2 = strlen(m2);
cf = 1;
}
t1 = Str2Int(m1);
t2 = Str2Int(m2);
for(i=len1; i<len; i++)
t1[i] = 0;
for(i=len2; i<len; i++)
t2[i] = 0;
for(i=0; i<len; i++)
{
if(t1[i]>=t2[i]) t1[i] -= t2[i];
else
{
t1[i] -= t2[i];
t1[i] += 10;
t1[i+1] -=1;
}
}
int n=i,begin = 0;
while(t1[n-1] == 0 && n>1) n--;
if(cf)
{
csub[0] = '-';
n++;
begin = 1;
}
for(i=begin; i<n; i++)
csub[i] = (char)t1[n-i-1]+48;
csub[n] = '\0';
delete []t1;
delete []t2;
delete []temp;
return csub;
}
int main()
{
char a[1000],b[1000];
cin >> a >> b;
cout << subtract(a,b) << endl;
return 0;
}

我会把大家送到“进入省队”。

3116
#include <cstdlib>
#include <iostream>
#include <cstring>
using namespace std;
int main(int argc, char *argv[])
{
char a[550],b[550],s[550];
cin >>a>>b;
int l , l1 , l2 , i , j;
l1 = strlen(a);
l2 = strlen(b);
for (i = 0 ; i < l1 / 2; i++)
swap(a[i],a[l1-i-1]);
for (i = 0 ; i < l2 / 2; i++)
swap(b[i],b[l2-i-1]);
int max;
if (l1 < l2)
{
l = l2;
for (i = l1 ; i < l ; i++)
a[i]='0';
a[i]='\0';
}
else
{
l = l1 ;
for (i = l2 ; i < l ; i++)
b[i]='0';
b[i]='\0';
}
int jin = 0 ;
int t;
for (i = 0 ; i < l; i++)
{
t=a[i]+b[i]+jin-'0'*2;
s[i]=t % 10+'0';
jin = t / 10;
}
if (jin != 0)
{
s[l] = jin +'0';
l++;
}
s[l]='\0';
for (i = 0 ; i < l / 2; i++)
swap(s[i],s[l-i-1]);
cout <<s;
return EXIT_SUCCESS;
}

3117
#include <stdio.h>
#include <string.h>
int main()
{
char m[555],n[555],temp[555];
int i,j,len_m,len_n;
int a[555]={0},b[555]={0},c[1111]={0};
scanf("%s",m);
scanf("%s",n);
if(strlen(m)<strlen(n))
{
strcpy(temp,m);
strcpy(m,n);
strcpy(n,temp);
} len_m =strlen(m);
for(i=0;i<=len_m -1;i++)
a[i]=m[len_m -1 -i]-'0';
len_n=strlen(n);
for(i=0;i<=len_n -1;i++)
b[i]=n[len_n -1 -i]-'0';
for(i=0;i<len_n;i++)
for(j=0;j<len_m;j++)
c[i+j]+=a[j]*b[i];
for(i=0;i<2*len_m;i++)
if(c[i]>=10)
{
c[i+1]+=c[i]/10;
c[i]%=10;
}
i=2*len_m;
while(c[i]==0) i--;
if(i<0) printf("0");
else
{
for(;i>=0;i--)
printf("%d",c[i]);
}
return 0;
}

1014
#include <iostream>
using namespace std;
int f[20001];
int main()
{
int v,n,a[31],i,j,d;
cin>>v>>n;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=n;i++)
{
for(j=v;j>0;j--)
if(f[j]==1&&j+a[i]<=v)
f[j+a[i]]=1;
f[a[i]]=1;
}
d=v;
while(d>0&&f[d]!=1)
d--;
cout<<v-d<<endl;
return 0;
}

1068
#include<stdio.h> int tos[41][41][41][41]={0};int card[5]={0};int n,m,step[356]={0};main(){ int tor(int a,int b,int c,int d); int i,j,x; scanf("%d%d",&n,&m); for(i=0;i<n;i++)scanf("%d",&step[i]); for(i=0;i<m;i++){scanf("%d",&x);card[x]++;} printf("%d",tor(card[1],card[2],card[3],card[4])); return(0);} int tor(int a,int b,int c,int d){ int i,j,x=0,y=0,z=0,w=0,stp=0,temp=0; if(tos[a][b][c][d]==0) { stp=a+b*2+c*3+d*4; if(stp==-1) { return(step[0]); } else { if(a-1>=0)x=tor(a-1,b,c,d); if(b-1>=0)y=tor(a,b-1,c,d); if(c-1>=0)z=tor(a,b,c-1,d); if(d-1>=0)w=tor(a,b,c,d-1); if(x>temp)temp=x; if(y>temp)temp=y; if(z>temp)temp=z; if(w>temp)temp=w; tos[a][b][c][d]=temp+step[stp]; return(tos[a][b][c][d]); } } else return(tos[a][b][c][d]);} 运行耗费

1044
var a,x,a2:array[0..1000]of integer;
n,i,j,max,o:integer;
Begin
while not eoln do
begin
inc(n);
read(x[n]);
end;
for i:=1 to n do
begin
o:=0;
for j:=i downto 0 do
if (x[i]<=x[j])and(o<a[j])
then o:=a[j];
a[i]:=o+1;
if a[i]>max then max:=a[i];
end;
writeln(max);
fillchar(a2,sizeof(a2),0);
max:=0;
for i:=1 to n do
begin
o:=0;
for j:=0 to i-1 do
if (x[i]>x[j])and(o<a2[j])
then o:=a2[j];
a2[i]:=o+1;
if a2[i]>max then max:=a2[i];
end;
writeln(max);
End.

1576
#include <iostream>
#define SIZE 1001
using namespace std;
int main()
{
int i, j, n, top, temp;
int stack[SIZE];
cin >> n; top = 0;
/* 第一个元素可能为0 */
stack[0] = -1;
for (i = 0; i < n; i++)
{
cin >> temp;
if (temp > stack[top])
{
stack[++top] = temp;
}
else
{
int low = 1, high = top;
int mid;
while(low <= high)
{
mid = (low + high) / 2;
if (temp > stack[mid])
{
low = mid + 1;
}
else
{ high = mid - 1;
}
}
stack[low] = temp;
}
}
cout << top << endl;
return 0;
}

3027
Uses math;
var a,b,f:array[1..1000]of longint;
i,j,k,n,ans:longint;
Begin
readln(n);
for i:=1to n do
read(a[i],b[i],f[i]);//read
for i:=1 to n-1 do
for j:=i+1 to n do
if b[i]>b[j] then
begin
k:=a[i];a[i]:=a[j];a[j]:=k;
k:=b[i];b[i]:=b[j];b[j]:=k;
k:=f[i];f[i]:=f[j];f[j]:=k;
end; //sort
for i:=2to n do
begin
k:=0;
for j:=1to i-1 do
if b[j]<=a[i] then k:=max(k,f[j]);
f[i]:=k+f[i];
end; //dp
ans:=0;
for i:=1 to n do if(f[i]>ans)then ans:=f[i];
writeln(ans);
end.

大家说句话啊

#include<stdio.h>
1048
#include<string.h>
#define INF 0xffffff
int main()
{
int n, num[111], sum[111] = {0}, min;
int dp[111][111];
memset(dp, 0, sizeof(dp));
scanf("%d", &n);
for(int i = 1; i <= n; i++)
{
scanf("%d", &num[i]);
sum[i] = sum[i - 1] + num[i];
}
for(int len = 2; len <= n; len++)
{
for(int i = 1; i <= n - len + 1; i++)
{
int j = i + len - 1; min = INF;
for(int k = i; k < j; k++)
{
if(dp[i][k] + dp[k + 1][j] + sum[j] - sum[i - 1] < min)
min = dp[i][k] + dp[k + 1][j] + sum[j] - sum[i - 1];
}
dp[i][j] = min;
}
}
printf("%d\n", dp[1][n]);
return 0;
}