> #include <iostream.h>
> #include <stdlib.h>
> #include <memory.h>
> int left=0;
> int temp[21];
> int Data[21];
> void Go(int i,int mod);
> int main(int argc, char *argv[])
> {
> 	int Times=0;
> 	cin>>Times;
> 	while(Times-->0)
> 	{
> 	cin>>left;
> 	memset(temp,0,sizeof(temp));
> 	memset(Data,0,sizeof(Data));
> 
> 	int i=0;
> 	if(left%3==1)
> 	{
> 		left/=3;
> 		Data[0]=1;
> 		Go(i+1,left%3);
> 	}
> 	else if(left%3==2)
> 	{
> 		left/=3;
> 		temp[0]=1;
> 		Go(i+1,left%3+1);
> 	}
> 	else
> 	{
> 		left/=3;
> 		Go(i+1,left%3);
> 	}
> 	int max=1;
> 	for(i=0;i<20;i++)
> 	{
> 		if(temp[i]!=0)
> 		temp[i]=max;
> 		if(Data[i]!=0)
> 		Data[i]=max;
> 		max*=3;
> 	}
> 	max=0;
> 	for(i=0;i<20;i++)
> 	{
> 		if(temp[i]!=0)
> 		{
> 		if(max==1)
> 		cout<<",";
> 		cout<<temp[i];
> 		max=1;
> 		}
> 	}
> 	if(max!=1)
> 	cout<<"empty";
> 	cout<<" ";
> 	max=0;
> 	for(i=0;i<20;i++)
> 	{
> 		if(Data[i]!=0)
> 		{
> 		if(max==1)
> 		cout<<",";
> 		cout<<Data[i];
> 		max=1;
> 		}
> 	}
> 	if(max==0)
> 	cout<<"empty";
> 	cout<<endl;
> 	}
> 
>   return EXIT_SUCCESS;
> }
> void Go(int i,int mod)
> {
> 	if(left==0)
> 	{
> 	if(mod==1)
> 	Data[i]=1;
> 	if(mod==2)
> 	{
> 		Data[i+1]=1;
> 		temp[i]=1;
> 	}
> 	return ;
> 	}
> 	if(mod==1)
> 	{
> 		Data[i]=1;
> 		left/=3;
> 		Go(i+1,left%3);
> 	}
> 	else if(mod==2)
> 	{
> 		temp[i]=1;
> 		left/=3;
> 		Go(i+1,left%3+1);
> 	}
> 	else
> 	{
> 		left/=3;
> 		Go(i+1,left%3);
> 	}
> 	
> }

• 算法这么强,这是什么意思... (0) cx19860824 2007-04-06 09:47:09
  • Re:算法这么强,这是什么意思... (35) forceil 2007-04-06 09:59:25