记录编程结果,方便回顾。
附上课程连接:Python语言基础与应用
s = str(input())
n = int(input())
first_part = s[:n]
second_part = s[n:]
new_n = second_part + first_part
print(new_n)
a = int(input())
b = int(input())
square = a*b
c = (a**2 + b**2)**0.5
h = square/c
print(round(h, 2))
s = str(input())
words = s.split()
print(len(words[-1]))
s = str(input())
ch = s[-1].lower()
words = s[:-2].lower()
i = 0
for word in words:
if word == ch:
i += 1
print(i)
n_1 = int(input())
n_2 = int(input())
sum = n_1 + n_2
print(sum)
n = int(input())
pi = 3.14159
square = round((pi*n**2), 4)
round = round((2*pi*n), 4)
print(round, square)
a = int(input())
b = int(input())
c = int(input())
p = (a+b+c)/2
s = (p*(p-a)*(p-b)*(p-c))**0.5
print('%.2f'%s)
a1 = int(input())
a2 = int(input())
n = int(input())
mines = a2 - a1
result = a1 + mines*(n-1)
print(result)
alist=list(map(int, input().split()))
blist=list(map(int, input().split()))
aset = set((alist + blist))
print(sorted(list(aset)))
alist=list(map(int, input().split()))
dic = {}
lenth = len(alist)
mid = lenth//2
dic['1'] = list(alist[:mid])
dic['2'] = list(alist[mid:])
print(dic)
alist=list(map(int, input().split()))
alist.reverse()
print(alist)
alist=list(map(int, input().split()))
alist.sort(key=abs)
print(alist)
max = int(input())
num = 100
while num <= max:
n = len(str(num))
x_list = list(str(num))
sumnum = 0
for x in x_list:
xn = int(x)**n
sumnum += xn
if sumnum == num:
print(num)
num += 1
else:
num += 1
aset = input()
bset = input()
alist = list(aset)
blist = list(bset)
print(sorted(set(alist+blist)))
max = int(input())
sum = 0
for num in range(1,max+1):
if num%7 != 0 and ('7' not in list(str(num))):
sum += num**2
print(sum)
num = int(input())
result = []
for i in range(1,num+1):
lis = []
for x in range(1,i):
if i%x == 0:
lis.append(x)
if sum(lis) == i:
print(i)
max = int(input())
n = 1
while n <= max:
space = max - n
print(' '*space + '+'*(2*n-1))
n += 1
num = int(input())
x = list(str(num))
if x[0] == x[4] and x[1] == x[3]:
print('yes')
else:
print('no')
alist=list(map(int,input().split()))
result = []
for i in alist:
if int(i)%2 == 0:
result.append(int(i)//2)
else:
result.append(int(i)**2)
print(sorted(result))
max = int(input())
num = []
i=2
for i in range(2,max):
j=2
for j in range(2,i):
if(i%j==0):
break
else:
num.append(i)
print(num)
day = int(input())
all = 1
for i in range(1,day):
all = (all + 1)*2
print(all)
n=int(input(""))
print(fbnq(n))
n=int(input(""))
def fbnq(x):
if x <= 2:
result = 1
return result
else:
list = [1,1]
i = 1
while i <= n-2:
next = list[-1] + list[-2]
list.append(next)
i += 1
return list[-1]
print(fbnq(n))
num1=int(input(""))
num2=int(input(""))
print(hcf(num1,num2))
num1=int(input(""))
num2=int(input(""))
def hcf(x,y):
list = []
for i in range(min(x,y)):
if x%(i+1) == 0 and y%(i+1) == 0:
list.append(i+1)
else:
pass
return max(list)
print(hcf(num1,num2))
num1=int(input(""))
num2=int(input(""))
print(lcm(num1,num2))
num1=int(input(""))
num2=int(input(""))
def lcm(x,y):
num = max(x,y)
while num>0:
if num%x == 0 and num%y == 0:
return num
else:
num += 1
print(lcm(num1,num2))
n=int(input(""))
print(fact(n))
n=int(input(""))
def fact(x):
fc = x
result = 1
while fc > 0:
result *= fc
fc -= 1
return result
print(fact(n))
alist=list(map(int,input().split()))
print(bubbleSort(alist))
alist=list(map(int,input().split()))
def bubbleSort(x):
count = 1
while count != 0:
count = 0
for i in range(len(x)-1):
if x[i] <= x[i+1]:
pass
else:
x[i], x[i+1] = x[i+1], x[i]
count += 1
return x
print(bubbleSort(alist))
alist=list(map(int,input().split()))
print(foo(alist))
alist=list(map(int,input().split()))
def foo(x):
result = []
for i in range(len(x)):
if i%2 == 0:
pass
else:
result.append(x[i])
return result
print(foo(alist))
import datetime
y, m, d = map(int,input().split('/'))
today = datetime.date(y, m, d)
count = today - datetime.date(y-1, 12, 31)
print(count.days)
import math, cmath
x = int(input())
a = math.sin(math.radians(15))
b = cmath.exp(x) - 5*x
b1 = math.pow(x, 2) + 1
b2 = math.pow(b1, 0.5)
c = math.log(3*x, math.e)
result = a + b.real/b2 - c
print(round(result, 10))
x = 0
while True:
x += 1
y1 = x + 150
sqrt1 = y1 ** 0.5
y2 = y1 + 136
sqrt2 = y2 ** 0.5
if y1%sqrt1 == 0 and y2%sqrt2 == 0:
print(x)
break
else:
pass
n = int(input())
for i in range(0,2 * n -1):
for m in range(0,2 * n -1):
if m == i or m == 2 * n - 1 - 1 - i:
print('X',end='')
else:
print('+',end='')
print()
n=int(input())
m=int(input())
lst=list(range(n))
result=[]
for i in range(n):
for j in range(m-1):
lst.append(lst.pop(0))
result.append(lst.pop(0))
print(result)
class Student:
def __init__(self,a1,a2,a3,a4):
self.name = a1
self.math = a2
self.che = a3
self.eng = a4
def firstinfo(self):
stu_list = []
j=0
for i in self.name:
stu_list.append([i, self.math[j], self.che[j], self.eng[j]])
j += 1
total_points = []
for i in stu_list:
total_points.append(sum(i[1:]))
pos = total_points.index(max(total_points))
print(' '.join(list(map(str, stu_list[pos]))))
name = input().split()
math = list(map(int, input().split()))
che = list(map(int, input().split()))
eng = list(map(int, input().split()))
Student(name, math, che, eng).firstinfo()
from math import log
class DeliNum:
def __init__(self,x,y,n):
self.x = x
self.y = y
self.n = n
def delinum(self):
# 根据 x^i+y^j <= n(整数i>=0且j>=0),求出i,j的可能的最大值
# i的最大值:以x为底的n的对数;j同理
if self.x > 1:
i_max = int(log(self.n, self.x))
else:
i_max = 1
if self.y > 1:
j_max = int(log(self.n, self.y))
else:
j_max = 1
# 创建所有可能的精致的数的列表
deli_list = []
for i in range(i_max + 1):
for j in range(j_max + 1):
num = self.x ** i + self.y ** j
if num <= self.n:
deli_list.append(num)
# 不重复且排序的num_list
result = sorted(list(set(deli_list)))
print(result)
x = int(input())
y = int(input())
n = int(input())
DeliNum(x,y,n).delinum()
class MaxRound:
def __init__(self,lst):
self.lst = lst
def maxround(self):
for i in range(len(self.lst)-2):
if self.lst[i] < self.lst[i+1] + self.lst[i+2]:
print(self.lst[i] + self.lst[i+1] + self.lst[i+2])
break
else:
print(0)
a=list(map(int,input().split()))
a.sort(reverse=True)
MaxRound(a).maxround()