Python实现Pat 1049. Counting Ones (30)
2017-12-09 10:44
357 查看
题目
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.Input Specification:
Each input file contains one test case which gives the positive N (<=230).
Output Specification:
For each test case, print the number of 1’s in one line.
Sample Input:
12
Sample Output:
5
解答,会超时
#直接检查每一个数值中1的个数 N=int(input()) sum=0 for i in range(N+1): si=str(i) sir=si.replace('1','') sum+=len(si)-len(sir) print (sum)
相关文章推荐
- PAT (Advanced Level) Practise 1049 Counting Ones (30)
- pat 甲级 1049. Counting Ones (30)
- PAT 1049. Counting Ones (30)
- 1049. Counting Ones (30)【计算1 的个数】——PAT (Advanced Level) Practise
- 【PAT (Advanced Level)】1049. Counting Ones (30)
- PAT 1049. Counting Ones (30)
- pat 1049. Counting Ones (30)
- PAT (Advanced Level) Practise 1049 Counting Ones (30)
- PAT (Advanced Level) 1049. Counting Ones (30)
- 【PAT】【Advanced Level】1049. Counting Ones (30)
- PAT 甲级 1049. Counting Ones (30)
- 【PAT】1049. Counting Ones (30)
- PAT_A 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)(计算1到N,这些数字中1出现的个数,before i after,归纳)
- PAT甲级.1049. Counting Ones (30)