bzoj1081

题解：

先暴力找规律

然后就一加一减的枚举

代码：

#include<bits/stdc++.h>
using namespace std;
int n,m,f[],p[];
int main()
{
    scanf("%d%d",&n,&m);
    for (int i=;i<=n;i++)f[i]=,p[i]=;
    while ()
     {
         for (int i=;i<=n;i++)
          if (p[i]>)putchar(p[i]-+'A');
          else putchar(p[i]+'');
         puts("");
         int i=;
         while ((p[i]+f[i]<||p[i]+f[i]>=m)&&i<=n)i++;
         p[i]+=f[i];
         if (i>n)return ;
         for (i-=;i;i--)f[i]=-f[i];
     }
}