Skip to content
Toggle navigation
P
Projects
G
Groups
S
Snippets
Help
bellcode
/
lesson8-5
This project
Loading...
Sign in
Toggle navigation
Go to a project
Project
Repository
Issues
0
Merge Requests
0
Pipelines
Wiki
Snippets
Members
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Commit
9f2fc858
authored
4 years ago
by
BellCodeEditor
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
auto save
parent
3d5aa2a1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
42 additions
and
14 deletions
diy.py
diy.py
View file @
9f2fc858
# 持家小能手 (利用自动更新成绩程序的逻辑完成这个新项目)
# 如果输入的水果价钱比字典中的低,则替换掉,反之则不更新
cost
=
{
'苹果'
:
5.2
,
'山竹'
:
12.9
,
'香蕉'
:
2.4
,
'荔枝'
:
15
,
'葡萄'
:
9.3
,
'桂圆'
:
8
,
'蓝莓'
:
10
,
'李子'
:
8
}
k
=
input
(
'请输入水果名称:'
)
v
=
input
(
'请输入水果价钱:'
)
# ?补充条件判断:
if
# ?:
# ?更新价钱
print
(
k
+
'降价了,现价'
+
v
+
'元'
)
else
:
print
(
k
+
'涨价了,我们不买'
)
else
:
cost
[
k
]
=
float
(
v
)
print
(
k
+
'的价钱'
+
v
+
'元已上传~'
)
import
random
# 私钥
key
=
"abcdefgh使用python实现简单的位移替换加密,制作密码机关真是太好玩了哈哈哈!"
# 要加密语句
message
=
"诺依,周末一起去看动漫展吧!"
# 最终加密后的语句
key_message
=
""
# 干扰字符
noise
=
"port:@#$
%
^&"
for
i
in
message
:
str1
=
i
str2
=
random
.
choice
(
key
)
str3
=
random
.
choice
(
key
)
text
=
str1
+
str2
+
str3
key_message
=
key_message
+
text
list_message
=
list
(
key_message
)
index
=
random
.
randint
(
0
,
len
(
key_message
))
list_message
.
insert
(
index
,
noise
)
result_message
=
""
.
join
(
list_message
)
print
(
result_message
)
#解密
list_message
=
list
(
result_message
)
for
i
in
range
(
len
(
noise
)):
list_message
.
pop
(
index
)
key_message
=
""
.
join
(
list_message
)
print
(
key_message
)
res
=
key_message
[
0
]
i
=
0
# for i in range(len(key_message)):
while
i
<
len
(
key_message
):
i
+=
3
if
i
<
len
(
key_message
):
res
+=
key_message
[
i
]
print
(
res
)
This diff is collapsed.
Click to expand it.
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment