2021牛客多校9 H
牛客链接
代码:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
#include<math.h>
#include<queue>
using namespace std;
typedef long long ll;
typedef double dd;
typedef pair<int, int> pii;
typedef pair<dd, dd> pdd;
const int MAXN = 100010;
const int MAXM = 10;
const int inf = 1e9 + 7;
const dd eps = 1e-9;
const dd pi = acos(-1);
int main(void)
{
int n;
cin >> n;
vector<int> a;
while (n)
{
n--;
a.push_back(n % 3);
n /= 3;
}
for (int i = a.size() - 1; i >= 0; i--)
{
if (a[i] == 0) cout << 2;
else if (a[i] == 1) cout << 3;
else cout << 6;
}
}