题意 :
- 开心数仅由2,3,6组成,求第n个开心数是多少
思路 :
- 并非朴素十进制转三进制,2,3,6,22,23,26…,22在三进制中是00,23则是01,说明这里的三进制应该是0,1,2,00,01,02,10,11,12,“00”是不和谐的,于是分别用1,2,3表示,就变成 :1,2,3,11,12,13,21,22…,
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <map>
#define endl '\n'
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
const double pi = acos(-1);
typedef long long ll;
string p = "236";
int main()
{
IOS;
int n;
cin >> n;
string s = "";
while (n > 0)
{
-- n;
s.push_back(p[n % 3]);
n /= 3;
}
reverse(s.begin(), s.end());
cout << s << endl;
return 0;
}