B. Perfect Number

最新推荐文章于 2021-01-29 17:42:24 发布

Felven

最新推荐文章于 2021-01-29 17:42:24 发布

阅读量535

点赞数

分类专栏： AC路漫漫

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.csdn.net/zhaoxinfan/article/details/79301543

版权

AC路漫漫专栏收录该内容

1761 篇文章 29 订阅

订阅专栏

We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.

Input

A single line with a positive integer k (1 ≤ k ≤ 10 000).

Output

A single number, denoting the k-th smallest perfect integer.

   Examples 
 
     input 
   
1

     output 
   
19

     input 
   
2

     output 
   
28

Note

The first perfect integer is 19 and the second one is 28.

解题说明：此题是一道数学题，暴力枚举即可。

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
using namespace std;

int main()
{
	long k, n = 19, x = 0, m;
	scanf("%ld", &k);
	while (k - 1>0)
	{
		x = 0;
		n++;
		m = n;
		while (m>0)
		{
			x += m % 10;
			m /= 10;
		}
		if (x == 10)
		{
			k--;
		}
	}
	printf("%ld\n", n);
}