PAT甲级1049. Counting Ones (30)
来源:互联网 发布:c语言最大公约数英文 编辑:程序博客网 时间:2024/06/08 09:47
The task is simple: given any positive integer N, you are supposed to count the total number of ones in the decimal form of the integers from 1 to N. For example, given N being 12, there are five ones in 1, 10, 11, and 12.
Input Specification:
Each input file contains one test case which gives the positive N (<=
Output Specification:
For each test case, print the number of 1’s in one line.
Sample Input:
12
Sample Output:
5
//看了别人的才知道。很巧妙的方法 #include <iostream>using namespace std;int main(){ int N; cin>>N; int count=0; int x=1; while(N/x>0){ int current=(N/x)%10; int left=N/(10*x); int right=N%x; if(current<1) count+=left*x; else if(current==1) count+=(left*x+right+1); else count+=(left+1)*x; x*=10; } cout<<count<<endl; return 0;}
0 0
- 【PAT甲级】1049. Counting Ones (30)
- 1049. Counting Ones (30) PAT甲级
- PAT甲级.1049. Counting Ones (30)
- PAT甲级练习1049. Counting Ones (30)
- PAT甲级1049. Counting Ones (30)
- PAT 甲级 1049. Counting Ones (30)
- PAT甲级 1049. Counting Ones (30)
- 1049. Counting Ones (30)-PAT甲级真题
- 1049. Counting Ones (30)-PAT
- pat 1049. Counting Ones (30)
- PAT 1049. Counting Ones (30)
- PAT 1049. Counting Ones (30)
- PAT 1049. Counting Ones (30)
- 【PAT】1049. Counting Ones (30)
- PAT.1049. Counting Ones (30)
- PAT 1049. Counting Ones (30)
- 1049. Counting Ones (30)-PAT甲级真题(数学问题)
- PAT 1049. Counting Ones
- JAVA-C-课程设计-20161228-BUG修复
- JAVA-进度汇报-20161228
- 区域填充
- JAVA课程设计-20161229-字符串转换
- MySQL常用指令(备查)
- PAT甲级1049. Counting Ones (30)
- Ubunru 12.04 下Node.js开发环境的安装配置
- JAVA课程设计-20161229-键盘事件
- JAVA课程设计-打包图片路径-FatJar打包-结题
- 移动APP测试方案及流程
- JAVA课程设计手稿
- h5 canvas学习笔记
- C++/C-const常量-20170105
- Java细节