当前位置:网站首页>7-9 make house number 3.0 (PTA program design)
7-9 make house number 3.0 (PTA program design)
2022-07-06 13:56:00 【Programming Lindaiyu】
We want to number the residents in a street , from 1 From serial number , The total number of households up to this street .
The method of making house number is to make 0 To 9 These ten numeric characters , Then paste the characters on the doorplate as needed , For example, the house number 808 The number is used to paste characters 8,0,8. This requires 2 Characters 8, A character 0.
Please make all the house numbers , from 0 To 9 How many of these ten numeric characters are needed ?
Input format :
Enter the positive integer of the total number of households in this street A.
Output format :
For every positive integer A, Output two lines , First act 0 To 9 These ten numeric characters , The second line is the number of these ten numeric characters .
sample input 1:
Here's a set of inputs . for example :
1
sample output 1:
Here is the corresponding output . for example :
0 1 2 3 4 5 6 7 8 9
0 1 0 0 0 0 0 0 0 0
sample input 2:
Here's a set of inputs . for example :
2022
sample output 2:
Here is the corresponding output . for example :
0 1 2 3 4 5 6 7 8 9
525 1613 629 602 602 602 602 602 602 602
Code (Python):
n=int(input()) # Enter the positive integer of the total number of households in this street n
list1=[0,0,0,0,0,0,0,0,0,0] # Because all the numbers are 0~9 this 9 Numbers make up , So first declare a length of 0 A list of , And initialize to 0, Used to store the number of times each number appears
while n>0: # from n Start judging , Judge until 0
m=n # Save one first n Value , Hereunder while Use... In circulation m, So as not to destroy n Value
while m>0:
i=m%10 # Take the last digit of the number
list1[i]+=1 # Finding the remainder means that the end is , Add 1
m=m//10 # Will last 1 Bit removal , In order to make the penultimate place become the penultimate place and continue to judge
n-=1 # Exiting the loop means that the record has been completed n Every number in the , Then judge the next number
print("0 1 2 3 4 5 6 7 8 9") # Because all the numbers are 0~9 this 9 Numbers make up , So first output this 9 A digital , That is, the first line in the output sample
for i in range(len(list1)): # Output corresponding times
if i!=9: # Not the last number , Output the number , And end with a space
print(list1[i],end=' ')
else: # There is no space at the end of the last number output , Line break directly
print(list1[i])
The above program gives more detailed comments , For novice Xiaobai's reference . The idea of program design or code implementation is not optimal , You are welcome to correct your mistakes or give better ideas .
I am a rookie who wants to be Kunpeng , Everyone's encouragement is my driving force , Welcome to like collection comments !
边栏推荐
- C language Getting Started Guide
- 7-1 输出2到n之间的全部素数(PTA程序设计)
- C language Getting Started Guide
- 强化学习基础记录
- About the parental delegation mechanism and the process of class loading
- Wechat applet
- canvas基础1 - 画直线(通俗易懂)
- [insert, modify and delete data in the headsong educator data table]
- 优先队列PriorityQueue (大根堆/小根堆/TopK问题)
- 实验九 输入输出流(节选)
猜你喜欢
2022 Teddy cup data mining challenge question C idea and post game summary
1. First knowledge of C language (1)
Attach the simplified sample database to the SQLSERVER database instance
.Xmind文件如何上传金山文档共享在线编辑?
强化学习基础记录
canvas基础1 - 画直线(通俗易懂)
甲、乙机之间采用方式 1 双向串行通信,具体要求如下: (1)甲机的 k1 按键可通过串行口控制乙机的 LEDI 点亮、LED2 灭,甲机的 k2 按键控制 乙机的 LED1
优先队列PriorityQueue (大根堆/小根堆/TopK问题)
Canvas foundation 1 - draw a straight line (easy to understand)
FAQs and answers to the imitation Niuke technology blog project (I)
随机推荐
Have you encountered ABA problems? Let's talk about the following in detail, how to avoid ABA problems
Miscellaneous talk on May 27
编写程序,模拟现实生活中的交通信号灯。
. How to upload XMIND files to Jinshan document sharing online editing?
7-9 制作门牌号3.0(PTA程序设计)
这次,彻底搞清楚MySQL索引
Simply understand the promise of ES6
Beautified table style
[modern Chinese history] Chapter V test
杂谈0516
仿牛客技术博客项目常见问题及解答(一)
Detailed explanation of redis' distributed lock principle
Strengthen basic learning records
1143_ SiCp learning notes_ Tree recursion
强化学习基础记录
PriorityQueue (large root heap / small root heap /topk problem)
Experiment 7 use of common classes (correction post)
Redis实现分布式锁原理详解
SRC mining ideas and methods
优先队列PriorityQueue (大根堆/小根堆/TopK问题)