Good Numbers (easy version) Codeforces Round #595 (Div. 3)

原题目：

The only difference between easy and hard versions is the maximum value of nn .

You are given a positive integer number nn . You really love good numbers so you want to find the smallest good number greater than or equal to nn .

The positive integer is called good if it can be represented as a sum of distinct powers of 33 (i.e. no duplicates of powers of 33 are allowed).

For example:

• 3030 is a good number: 30=33+3130=33+31 ,
• 11 is a good number: 1=301=30 ,
• 1212 is a good number: 12=32+3112=32+31 ,
• but 22 is not a good number: you can't represent it as a sum of distinct powers of 33 (2=30+302=30+30 ),
• 1919 is not a good number: you can't represent it as a sum of distinct powers of 33 (for example, the representations 19=32+32+30=32+31+31+31+3019=32+32+30=32+31+31+31+30 are invalid),
• 2020 is also not a good number: you can't represent it as a sum of distinct powers of 33 (for example, the representation 20=32+32+30+3020=32+32+30+30 is invalid).

Note, that there exist other representations of 1919 and 2020 as sums of powers of 33 but none of them consists of distinct powers of 33 .

For the given positive integer nn find such smallest mm (n≤mn≤m ) that mm is a good number.

You have to answer qq independent queries.

Input

The first line of the input contains one integer qq (1≤q≤5001≤q≤500 ) — the number of queries. Then qq queries follow.

The only line of the query contains one integer nn (1≤n≤1041≤n≤104 ).

Output

For each query, print such smallest integer mm (where n≤mn≤m ) that mm is a good number.

中文概要：
一个数分解为有3的幂次方那个幂次方不能相同，输出下一个符合要求的好数

思路：

通过判断n%3==2

2=3的0次方+3的0次方

所以只要n%3==2就不符合要求

#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
	int n, m;
	int T;
	scanf("%d", &T);
	while (T--)
	{
		scanf("%d",& m);
		n = m;
		int sum = 0;
		while (1)
		{
			bool sign = true;
			while (n > 0)
			{
				if (n % 3 == 2)
				{
					sign = false;
					break;
				}
				n = n / 3;
			}
			if (sign == true)
			{
				printf("%d\n", m + sum);
				break;
			}
			else
			{
				++sum;
				n = m + sum;
			}
			
		}
	}
	return 0;
}