E. Living Sequence(数学)

Problem - 1811E - Codeforces

 

找到第k个每一位上都不含4的数

输入

7
3
5
22
10
100
12345
827264634912
 

输出

3
6
25
11
121
18937
2932285320890
 

#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b;	-- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<bool> VB;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N = 2e5 + 10,M = N * 2   ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8,DNF = 1e18;
const int mod = 1e9 + 7 ,base= 20010;
const LL LNF=(LL) INF * INF;


// 10 进制转成 9进制，再判断 每一位是否是4 

inline void solve()
{
	LL n;cin >> n ;
	string s;
	
	while(n)
	{
		int x = n %  9;
// 每10个数只能选9个，其中有一个是4
// 也就是9个要找的数,就占掉了10个位置 
		s += '0' + (x < 4?x : x +1 );
		n /= 9;
	}
	
	reverse(s.begin(),s.end());
	cout << s << endl;
		
	
		
}


signed main()
{
//  freopen("1.txt","r",stdin);
//	#define int long long 
//	init(N-1);
    ios
//	cout << fixed<<setprecision(2);
    int t=1;
    cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}