zyb的面试

 http://acm.hdu.edu.cn/showproblem.php?pid=6468

思路：dfs从小枚举到第k个；

反思：有个枝没剪以为问题不大，但每次递归后才判断大于n会多出很多次调用的复杂度！！

#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e5+9;
const int mod=1000000007;

inline ll read()
{
    ll f=1,x=0;

    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        n>>=1;
        x=x*x%mod;
    }
    return ans;
}

int n,k;
bool f;
void dfs(int num)
{
    if(f) return ;
    if(num>n)
    {
        return ;
    }
    k--;
    if(k==0)
    {
        cout<<num<<endl;
        f=1;
        return ;
    }
    for(int i=0;i<=9;i++)
    {
        if(f) return ;
        if(num*10+i>n) return ;//要剪这个之枝！！！
        dfs(num*10+i);
    }
}
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);


    int t;
    cin>>t;
    while(t--)
    {
        f=0;
        cin>>n>>k;
        for(int i=1;i<=9;i++)
        {
            dfs(i);
        }
    }
    return 0;
}