poj 2876 Cantoring Along 递归

View Code
#include <stdio.h>
#include <string.h>
#include <math.h>

char ans[1000000];

void dfs(int s,int e)
{
int i,len;
if(e-s==1)
{
ans[s]='-';
return;
}
len=(e-s)/3;
dfs(s,s+len);
dfs(s+2*len,e);
}

int main()
{
int i,n,len;
while (scanf("%d",&n)!=EOF)
{
len=pow(3*1.0,n);
memset(ans,'',sizeof(ans));
dfs(0,len);
for (i=0;i<len;i++)
printf("%c",ans[i]);
printf("\n");
}
return 0;
}
posted @ 2011-11-18 20:01  104_gogo  阅读(315)  评论(0编辑  收藏  举报