uva 10568

交了好幾次都Submission Error

原來是我的問題

//
//        GGGGGGGGGGGGG        CCCCCCCCCCCCC               AAA
//     GGG::::::::::::G     CCC::::::::::::C              A:::A
//   GG:::::::::::::::G   CC:::::::::::::::C             A:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C            A:::::::A
// G:::::G       GGGGGG C:::::C       CCCCCC           A:::::::::A
//G:::::G              C:::::C                        A:::::A:::::A
//G:::::G              C:::::C                       A:::::A A:::::A
//G:::::G    GGGGGGGGGGC:::::C                      A:::::A   A:::::A
//G:::::G    G::::::::GC:::::C                     A:::::A     A:::::A
//G:::::G    GGGGG::::GC:::::C                    A:::::AAAAAAAAA:::::A
//G:::::G        G::::GC:::::C                   A:::::::::::::::::::::A
// G:::::G       G::::G C:::::C       CCCCCC    A:::::AAAAAAAAAAAAA:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C   A:::::A             A:::::A
//   GG:::::::::::::::G   CC:::::::::::::::C  A:::::A               A:::::A
//     GGG::::::GGG:::G     CCC::::::::::::C A:::::A                 A:::::A
//        GGGGGG   GGGG        CCCCCCCCCCCCCAAAAAAA                   AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define VAR(a,b) decltype(b) a=(b)
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)
#define gettime() end_time=clock();printf("now running time is %.7f\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);
#else
#define VAR(a,b) __typeof(b) a=(b)
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
typedef unsigned long long UInt;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 30005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define eps 1e-6
clock_t start_time=clock(), end_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
UInt c[65][65];
char cmd[20];
int n,k;
int needgroup;
int oddppl;

void pre(){
    Set(c,0);
    for(int i=0;i<64;i++){
        c[i][0]=1;
        for(int j=1;j<=i;j++){
            c[i][j]=c[i-1][j]+c[i-1][j-1];
        }
    }
}
UInt count(int n,int k){
    UInt ans=c[n][n%k];
    n-=n%k;
    int e=n/k;
    for(int i=0;i<e;i++){
        ans*=c[n-1][k-1];
        n-=k;
    }
    return ans;
}
char ans[2005];
int anslen;
int num;
bool used[130];
void dfs(int index,int nowgroup,int nowppl,int dep,bool alused){
    if(nowgroup==needgroup){
        ans[anslen-1]='';
        puts(ans);
        num++;
        return;
    }
    if(nowppl==k){
        ans[anslen++]=' ';
        dfs(0,nowgroup+1,0,dep+1,alused);
        anslen--;
        return;
    }
    if(alused==false&&nowppl==oddppl){
        ans[anslen++]=' ';
        dfs(0,nowgroup+1,0,dep+1,true);
        anslen--;
//        return;
    }
    if(alused==true){
        int cnt=0;
        for(int i=index;i<n;i++){
            if(!used[i])cnt++;
        }
        if(cnt<k-nowppl)return;
    }
    for(int i=index;i<n;i++){
        if(used[i])continue;
        used[i]=1;
        ans[anslen++]='A'+i;
        dfs(i+1,nowgroup,nowppl+1,dep+1,alused);
        anslen--;
        used[i]=0;
        if(nowppl==0)break;
    }
}
int main() {
//    ios_base::sync_with_stdio(0);
    char str[1000];
    pre();
    while(scanf(" %s %d %d",cmd,&n,&k)==3){
        if(k>n)k=n;
        num=0;
        if(cmd[0]=='C'){
            printf("%llu\n",count(n,k));
        }else if(cmd[0]=='G'){
            printf("%llu\n",count(n,k));
            needgroup=(n+k-1)/k;
            oddppl=n%k;
//            debug("%d %d\n",needgroup,oddppl);
            Set(used,0);
            anslen=0;
            dfs(0,0,0,0,(n%k==0)?true:false);
//            debug("%d\n",num);
        }else break;
    }

















}