题意:如题。
题中 0<m<=3
m=0时 A(m,n)=n+1;
m=1时 A(m,n)=A(0,A(1,n-1))=A(1,n-1)+1=A(1,n-2)+1+1=……=n+2;
m=2时 A(m,n)=n*2+3
m=3时 A(m,n)=A(2,A(m,n-1))=A(m,n-1)*2+3
#include<stdio.h>
int a[4][1000010]={0};
int main()
{
int m,n;
for(n=0;n<=1000000;n++)
a[0][n]=n+1;
for(n=0;n<=1000000;n++)
a[1][n]=n+2;
for(n=0;n<=1000000;n++)
a[2][n]=2*n+3;
a[3][0]=5;
for(n=1;n<=25;n++)
a[3][n]=2*a[3][n-1]+3;
while (scanf("%d %d",&m,&n)!=EOF)
printf ("%d\n",a[m][n]);
return 0;
}