当前位置:网站首页>[weekly pit] information encryption + [answer] positive integer factorization prime factor
[weekly pit] information encryption + [answer] positive integer factorization prime factor
2022-07-06 20:19:00 【Crossin's programming classroom】
Zero basis python Introductory tutorial :python666.cn
Hello everyone , Welcome to Crossin Programming classroom of !
Today, I'll give you one of my favorite topics : Information encryption
Of course , This problem is the fur of information encryption .
Please listen to :
A yuan and Qiqi pass notes in class , But I don't want to be found by others . So they agreed on an encryption method :
Only for English or Pinyin in the information content ( That's the letter ) To encrypt , Other symbols remain intact
Each letter moves backward 5 position , Become ciphertext , such as a->f,k->p
If backward 5 More than z, Just fold back to the beginning of the letter , such as x->c
Please complete the encryption and decryption of this rule with a piece of code .
The reference sample :
【 encryption 】
Input :there is a vegetable in your teeth
Output :ymjwj nx f ajljyfgqj ns dtzw yjjym
【 Decrypt 】
Input :onz sn mzf izt
Output :jiu ni hua duo
Additional questions
Can you decrypt this text :
ild gdpsh sxktgvts xc p ldds, pcs x--
x iddz iwt dct athh igpktats qn,
pcs iwpi wph bpst paa iwt sxuutgtcrt.
Detailed answers and reference codes will be given in the next column , You can also refer to the code in the message of other students .
I look forward to your answers , I hope you can complete the whole series .
Simple code can be submitted directly in the message , Long code is recommended paste.ubuntu.com or
codeshare.io And other code sharing sites , Just copy the code and save it , You can get a share address , Very convenient .
For past questions, click the collection at the beginning of the article “ Every Monday ” Enter the view .
【 answer 】 Positive integer factorization prime factor
The original title is :【 Every Monday 】 Positive integer factorization prime factor
One idea of this question is :
from 2 Start trying to divide the original number N
If you can divide , The original number is updated to N//i, And the output i; If you can't divide it, keep trying , until N Divide by itself
If there is a prime factor before , The last remaining i Is the last prime factor ; without , It shows that the original number is a prime number
The reason why there is no need to judge the divisor i Is it a prime number , Because i It's from 2 Start trying one by one , If it can be divided by a smaller number , Then it has been dealt with before . So what can be calculated i It must be the prime factor .
In addition, here is a small optimization point : Every time you try, you don't have to start from 2 Start , You can start with the previous prime factor .
Reference code :
n = input(' Enter the positive integer to be decomposed :')
start = 2
is_prime = True
while n > 1: # Keep breaking down n, Until it breaks down into 1
for index in range(start, n + 1) :
if n % index == 0: # n Can be index to be divisible by
n //= index # n=n//index
if n == 1:
if is_prime:
print(f'{index} Prime number ')
else:
print(index)
else: # index It must be prime
print(f'{index} * ', end='')
is_prime = False
break
start = index
_ Previous articles are recommended _
If you need to know Paid premium courses And Teaching Q & a service
Please be there. Crossin Programming classroom of Internal reply : 666
边栏推荐
- Enumeration gets values based on parameters
- 使用ssh连接被拒
- 【云小课】EI第47课 MRS离线数据分析-通过Flink作业处理OBS数据
- RT-Thread 组件 FinSH 使用时遇到的问题
- Period compression filter
- Synchronization of data create trigger synchronization table for each site
- Number of schemes from the upper left corner to the lower right corner of the chessboard (2)
- HDU 1026 search pruning problem within the labyrinth of Ignatius and the prince I
- Notes on beagleboneblack
- Boder radius has four values, and boder radius exceeds four values
猜你喜欢
随机推荐
设计你的安全架构OKR
RT-Thread 组件 FinSH 使用时遇到的问题
持续测试(CT)实战经验分享
In line elements are transformed into block level elements, and display transformation and implicit transformation
New generation garbage collector ZGC
腾讯字节阿里小米京东大厂Offer拿到手软,老师讲的真棒
BUUCTF---Reverse---easyre
AddressSanitizer 技术初体验
Special topic of rotor position estimation of permanent magnet synchronous motor -- Summary of position estimation of fundamental wave model
Groovy基础语法整理
Wonderful coding [hexadecimal conversion]
Synchronization of data create trigger synchronization table for each site
腾讯云数据库公有云市场稳居TOP 2!
Cesium 点击绘制圆形(动态绘制圆形)
Basic knowledge of lists
【每周一坑】计算100以内质数之和 +【解答】输出三角形
22-07-05 upload of qiniu cloud storage pictures and user avatars
【每周一坑】信息加密 +【解答】正整数分解质因数
小微企业难做账?智能代账小工具快用起来
爬虫(14) - Scrapy-Redis分布式爬虫(1) | 详解