Brillianman
Brillianman
全部文章
分类
归档
标签
去牛客网
登录
/
注册
Brillianman的博客
全部文章
(共43篇)
题解 | #密码验证合格程序#
def A(s: str): if len(s) >= 8: return 1 else: return 0 def B(s: str): tag1, tag2, tag3, tag4 = 0, 0, 0, 0 for i i...
2023-07-14
0
196
题解 | #计算字符串的编辑距离#
s1 = input() s2 = input() global l l = list() for i in range(1001): l.append([]) for j in range(1001): l[i].append(0) def f(s1: str,...
2023-07-14
0
427
题解 | #删除字符串中出现次数最少的字符#
l = list(input()) s = set(l) d = dict() for i in s: d[i] = l.count(i) n = min(d.values()) for i in d.keys(): while i in l and d[i] == n: ...
2023-07-10
0
245
题解 | #使用字典计数#
s = input() a = list(s) b = dict() for i in a: if i not in b.keys(): b[i] = s.count(i) print(b)
2023-07-08
0
265
题解 | #班级管理#
class Student: def __init__(self, name, number, grade, times, level): self.name = name self.number = number self.grade = g...
2023-07-05
0
344
题解 | #数字序列第n位的值#
n = int(input()) a = 1 sum = 1 while sum < n: a += 1 sum += a print(a)
2023-07-04
0
306
题解 | #输出前三同学的成绩#
print(tuple(input().split(' '))[:3]);
2023-07-03
0
278
题解 | #简单密码#
#include<stdio.h> #include<string.h> void decode(char*S,int n) { int i; char code[]="VWXYZABCDEFGHIJKLMNOPQRSTU"; for(i=0;i<...
2023-02-23
0
246
题解 | #字符串排序#
#include<stdio.h> #include<string.h> #define MaxSize 105 int partition(int* len, int* tag, int low, int high) { int pivot = len[low]; ...
2023-02-23
0
322
题解 | #加减乘除#
#include<stdio.h> #include<string.h> int main() { char S[100],op='0'; gets(S); int flag=0,i,n=strlen(S),num1,num2=1,ans; f...
2023-02-14
0
387
首页
上一页
1
2
3
4
5
下一页
末页