用户:
飞熊jSrt查看:115 回复:11 评论:115 创建时间:2023-06-30T16:22:00
py/c/c++:报错处理、bug处理、加注释、功能实现
k4:bug处理、你问我答(可协作,发不了积木)
box3:代码全包
大家也可以互相帮助!
# import time
# import random
# import copy
# from itertools import permutations
# jieguo = []
# list_o = []
# def jisuan():
# template_list = [
# ["(", "x", "+", "x", ")", "+", "x", "+", "x"], ["(", "x", "+", "x", "+", "x", ")", "+", "x"]
# , ["x", "+", "(", "x", "+", "x", "+", "x", ")"], ["x", "+", "(", "x", "+", "x", ")", "+", "x"]
# , ["x", "+", "(", "(", "x", "+", "x", ")", "+", "x", ")"],
# ["(", "(", "x", "+", "x", ")", "+", "x", ")", "+", "x"]
# , ["x", "+", "(", "x", "+", "(", "x", "+", "x", ")", ")"],
# ["(", "x", "+", "(", "x", "+", "x", ")", ")", "+", "x"]
# , ["x", "+", "x", "+", "x", "+", "x"],
# ["(", "x", "+", "x", ")", "+", "(", "x", "+", "x", ")"]
# ]
# num_input_list = input("请输入4个数,每个用英文逗号(,)隔开。例如4,4,4,4——————>>>>")
# user_input = num_input_list.split(",")
# numbers_list = [i for i in permutations(user_input)]
# fuhao_list = [i for i in permutations([1, 2, 3, 4])]
# for l in range(len(template_list)):
# for k in range(len(numbers_list)):
# for c in range(len(fuhao_list)):
# jieguo = []
# seenum1 = seenum2 = -1
# for i in "".join(template_list[l]):
# if i == "(":
# jieguo.append("(")
# elif i == "x":
# seenum1 += 1
# jieguo.append(numbers_list[k][seenum1])
# elif i == ")":
# jieguo.append(")")
# if i == "+":
# seenum2+= 1
# if str(fuhao_list[c][seenum2]) == "1":
# jieguo.append("+")
# elif str(fuhao_list[c][seenum2]) == "2":
# jieguo.append("-")
# elif str(fuhao_list[c][seenum2]) == "3":
# jieguo.append("*")
# elif str(fuhao_list[c][seenum2]) == "4":
# jieguo.append("/")
# else:
# raise Exception
# list_o.append("".join(jieguo))
# try:
# # print("".join(jieguo))
# if eval("".join(jieguo)) == 24 or eval("".join(jieguo)) == 24.0 :
# print("".join(jieguo))
# except ZeroDivisionError:
# pass
# time_jisuan = time.time()
# jisuan()
# if "2+(2*(9+2))" in list_o:
# print("yes")
# print("程序用时",time.time()-time_jisuan)
大佬帮忙看看为什么不能输出2+(2*(9+2))
点赞0
评论
橘生淮北则为枳list1 = []
ju = True
for i in range(101):
list1.append(i)
list1.remove(1)
def fc(m):
for i2 in range(len(list1)):
n = i2 * m
if n > list1[len(list1)-1]:
break
else:
list1.remove(n)
return list1
print(fc(2))
这东西有问题
list1 = []
ju = True
for i in range(101):
list1.append(i)
list1.remove(1)
for i2 in range(len(list1)):
n = i2 * 2
if n > list1[len(list1)-1]:
break
else:
list1.remove(n)
print(list1)
但只要不定义函数就没问题
点赞1
评论
飞熊jSrtlim=100
import math as ms
def fc(ls,m):
global lim
for i2 in range(m,lim+1,m):
if i2==m:
continue
print(i2)
try:
ls.remove(i2)
except:
pass#被筛过了QWQ
# ①歧途代码但是舍不得删
if m>lim//2+1:
return ls
return fc(ls,m+1)
print(fc(list(range(2,lim+1)),2))
# ①:
"""
# for i in range(1,lim//2):
# p = m+i
# b=1
# for i2 in range(2,int(ms.sqrt(p))+1):
# if p%i2==0:
# b=0
# if b:
# print(p)
# return fc(ls,p)
# if p>lim//2:
# break
"""点赞0
评论
飞熊jSrtimport math as ms
n=24
az=[]
for i in range(2,n):
if n%i==0:
b=1
for i2 in range(2,int(ms.sqrt(n)+1)):
if i%i2==0 and i!=i2:
b=0
break
if b:
az.append([i,int(ms.log(n,i))-1])
print(az)点赞1
评论
飞熊jSrt#第二版#
import math as ms
n=int(input())
az=[]
for i in range(2,n+1):
if n%i==0:
b=1
for i2 in range(2,int(ms.sqrt(n)+1)):
if i%i2==0 and i!=i2:
b=0
break
if b:
lg=int(ms.log(n,i))
while n%(i**lg)>0:
lg-=1
az.append([i,lg])
def turn(s):
ln='⁰¹²³⁴⁵⁶⁷⁸⁹'
return ''.join([ln[int(i)] for i in str(s)])
def plg(ls,s='×'):
print(f'{s}{ls[0]}{turn(ls[1])}',end='')
print(f'{n}=',end='')
try:
plg(az[0],s='')
for i in az[1:]:
plg(i)
print()
except:
plg(az,s='')
将来有空闲用万能的c做一个
点赞1
评论
飞熊jSrt#include <stdio.h>
#include <math.h>
void fen(n){
int l=5,az[l][2],a=0,i,i2,i3;
for(i=2;i<=n;i+=(i%2==0)+(i%2==1)*2){
if(n%i==0){
int b=1;
for(i2=2;i2<sqrt(i)+1;i2++){
if(i%i2==0 && i!=i2){
b=0;break;
}
}
if(b){
for(i3=1;i3<=log(n)/log(i);i3++){
if(n%(int)(pow(i,i3))!=0){
i3--;break;
}
}printf("%d^%d*",i,i3);
}
}
}
}
int main(){
int n;
scanf("%d",&n);
fen(n);
return 0;
}
点赞0
评论