本文介绍了快乐数的概念，即只包含7或仅有一个非7的数字。题目要求为给定整数n，计算1到n之间快乐数的个数。输入包含测试用例数t和每个测试用例的整数n，输出每个测试用例的快乐数数量。样例输入和输出展示了具体的操作过程。
Problem Description
Recently, Mr. Xie learn the concept of happy number. A happy number is a number contain all digit 7 or only 1 digit other than 7. For example, 777 is a happy number because 777 contail all digit 7, 7177 and 87777 both happy number because only 1 digit other than 7. Whereas 887,799 9807,12345, all of them are not happy number. Now Mr. xie want to know for a given integer n, how many number among [1,n] are happy numbers, but counting them one by one is slow, can you help him?
Input
First line an integer t indicate there are t testcases(1≤t≤100). Then t lines follow, each line an integer n(1≤n≤106, n don't have leading zero).
最低0.47元/天 解锁文章
2181
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
