Codeforces Round #719 (Div. 3)B. Ordinary Numbers（我打的不通畅的水题）

小耿要努力变强！

于 2021-06-08 21:53:35 发布

阅读量306

点赞数 1

CC 4.0 BY-SA版权

分类专栏： codeforces

本文链接：https://blog.csdn.net/m0_51344983/article/details/117717050

codeforces 专栏收录该内容

7 篇文章

订阅专栏

本文介绍如何使用编程解决一个数学问题，即给定一个整数n，求从1到n之间的所有普通数（所有位数相同的整数）的数量。通过一个C++程序实现并演示了计数方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Let’s call a positive integer 𝑛 ordinary if in the decimal notation
all its digits are the same. For example, 1, 2 and 99 are ordinary
numbers, but 719 and 2021 are not ordinary numbers.

For a given number 𝑛, find the number of ordinary numbers among the
numbers from 1 to 𝑛.

Input The first line contains one integer 𝑡 (1≤𝑡≤104). Then 𝑡 test
cases follow.

Each test case is characterized by one integer 𝑛 (1≤𝑛≤109).

Output For each test case output the number of ordinary numbers among
numbers from 1 to 𝑛.

Example inputCopy 6 1 2 3 4 5 100 outputCopy 1 2 3 4 5 18

#include<iostream>
using namespace std;
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        int count=0;
        for(int i=1;i<=9;i++)
        {
            long long temp=i;
            while(n>=temp)
            {
                count++;
                temp=temp*10+i;
            }
        }
        printf("%d\n",count);
    }
}