CARLJOSEPHLEE

分类

题解(26)

/ 注册

全部文章（共216篇）

题解 | Sudoku

l = [[int(i) for i in input().split()] for _ in range(9)] lnumber = [1,2,3,4,5,6,7,8,9] def yu(): global l for i in range(9): if len(...

2025-03-04

0 61

题解 | 尼科彻斯定理

n = int(input()) x = n*(n-1)//2+1 x = 2*x-1 l = [x+2*i for i in range(n)] print("+".join(map(str,l)))

2025-03-04

0 49

题解 | 截取字符串

a = input() b = int(input()) print(a[:b])

2025-03-03

0 57

题解 | 蛇形矩阵

n = int(input()) l = [[""]*n for _ in range(n)] start = 1 for i in range(n): for j in range(i+1): l[i-j][j] = start star...

2025-03-03

0 62

题解 | 删除字符串中出现次数最少的字符

from collections import Counter a = input() temp = Counter(a) min1 = min(temp.values()) l = [] for i in temp: if temp[i] == min1: l.append...

2025-03-03

0 55

题解 | 输入n个整数，输出其中最小的k个

from heapq import * n,k = map(int,input().split()) l = [-1*int(i) for i in input().split()] l1 = l[:k] heapify(l1) for i in range(k,n): heappush(l...

2025-03-02

0 52

题解 | 小红的“质数”寻找

from sys import stdin,stdout input = lambda:stdin.readline().strip() for _ in range(int(input())): x = input() len1 = len(x)-1 s = int(x[0...

2025-03-02

0 52

题解 | 质数因子

def euler_sieve(x): isprime = [True]*(x+2) primes = [] for i in range(2,x+1): if isprime[i]: primes.append(i) ...

2025-03-02

0 57

题解 | 挑7

n = int(input()) cnt = 0 for i in range(1,n+1): if "7" in str(i) or i%7 == 0: cnt += 1 print(cnt)

2025-03-02

0 46

题解 | 完全数计算

n = int(input()) def f(x): sum1 = 0 for i in range(1,x//2+1): if x%i == 0: sum1 += i return x == sum1 cnt = 0 for i in...

2025-03-02

0 49