B. Perfect Number

题意： Perfect Number为每位数字和为10；问第k个Perfect Number

思路：想打表，发现不会~；暴力1++到第k个

 

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
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 mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=3e5+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

bool ch(int num)
{
    int ans=0;
    while(num)
    {
        ans=ans+num%10;
        num/=10;
    }
    return ans==10;
}
int main()
{

    int n;
    while(cin>>n)
    {
        int num=1;
        int ans=0;
        while(n)
        {
            if(ch(num)) n--,ans=num;
            num++;
        }
        cout<<ans<<endl;
    }
    return 0;
}