POJ 1702 Eva's Balance

//============================================================================
// Name        : hello.cpp
// Author      : key
// Version     : 8
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================



#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
#include <map>
using namespace std;

#define NUM_INF 0x7FFFFFFF

int le[35];
int ri[35];
int le_num;
int ri_num;

void jud(int W)
{
	le_num=ri_num=0;	
    int i=1;	
    while (W)	
    {		
        int flag=W%3;	
		
        if (flag==1) 
			ri[ri_num++]=i,W--;//-1
        else if(flag==2) 
			le[le_num++]=i,W++;//+1

        W/=3;i*=3;
    }
}
int main()
{
	int t;
	scanf("%d",&t);
	int  n;
	int i;

	while(t-- && scanf("%d",&n)!=EOF)
	{
		jud(n);

// 		for(i=0;i<le_num;i++)
// 		{
// 			printf("%d ", le[i]);
// 		}
// 		printf("\n");
// 		for(i=0;i<ri_num;i++)
// 		{
// 			printf("%d ",ri[i] );
// 		}
// 		printf("\n");

		if(le_num==0)
			printf("empty");
		else
		{
			for(i=0;i<le_num;i++)
			{
				if(i)
					printf(",");
				printf("%d", le[i]);
			}
		}
		printf(" ");

		if(ri_num==0)
			printf("empty");
		else
		{
			for(i=0;i<ri_num;i++)
			{
				if(i)
					printf(",");
				printf("%d", ri[i]);
			}
		}
		printf("\n");


	}
	
	return 0;
}

这样的题居然是进制问题