首页 > 试题广场 >

Counting Ones (30)

[编程题]Counting Ones (30)
  • 热度指数：1555 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 64M，其他语言128M
  • 算法知识视频讲解
The task is simple: given any positive integer N, you are supposed to count the total number of 1's in the decimal form of the integers from 1 to N. For example, given N being 12, there are five 1's in 1, 10, 11, and 12.

输入描述:
Each input file contains one test case which gives the positive N (<=230).


输出描述:
For each test case, print the number of 1's in one line.
示例1

输入

12

输出

5
算法知识视频讲解
开通博客

暂无题解

问题信息

动态规划
难度：
21条回答 8099浏览

热门推荐

通过挑战的用户

相关试题

Counting Ones (30)

扫一扫，把题目装进口袋

求职之前，先上牛客

扫描二维码，进入QQ群

扫描二维码，关注牛客公众号