Neekity的博客

第一次做这种自己要读取输入的题 泪崩！本来能十几分钟做完的题目，结果用了一小时import bisectnum=int(input())l1=list(input().split())dict1={}for i in range(num): c=l1[i] if c in dict1: dict1[c].append(i+1) else: ...

leetcode上一样的 忘记是哪个了n=int(input())num=list(map(int,input().split()))num.sort()miss=0for i in range(n): if num[i]>miss+1: break miss+=num[i]print(miss+1)

n=int(input())f1=0f2=1while f2<n: f1,f2=f2,f1+f2print(min(f2-n,n-f1))

这里可以用正则匹配这样的骚方法s=input()import repattern1 = re.compile(r"[^A-Z]+")pattern2 = re.compile(r"([A-Z])\1")pattern3 = re.compile(r"([A-Z])[A-Z]*([A-Z])[A-Z]*\1[A-Z]*\2")if pattern1.search(s) or patter...

n=int(input())list1=[]i=0curl=1f1=Truewhile i<n: s1=input() if f1: if len(s1)<curl: f1=False curl=len(s1) list1.append(s1) i+=1f2=Truefor i in ...

数学题 1.fg=gf 2.fff=ggstart=int(input())count1=0count2=1count3=2m=1000000007start1=start%mstart2=(4*start1+3)%mstart3=(4*start2+3)%mwhile count1<100000 and start1!=0: start1=(8*start1+7)...

s=input()t=input()def judge(s): ls=len(s) for i in range(ls//2): if s[i] != s[ls-1-i]: return False return True cnt=0for i in range(len(s)+1): if judge(s[:i]+t...

n=int(input())x=list(map(int,input().split()))y=list(map(int,input().split()))mymin=float('inf')for i in range(n): mymin=min(mymin,x[i]+y[i]-2)print(mymin)

num=input().split()n=int(num[0])m=int(num[1])if m%4==2: m,n=n,mtmp1=(m+1)//2tmp2=m-tmp1mysum=0for i in range(n): if i%4==0 or i%4==1: mysum+=tmp1 else: mysum+=tmp2p...

DFS,需要剪枝n=int(input())num=list(map(int,input().split()))num.sort()def dfs(num,mysum,mymul): count=0 for i in range(len(num)): if i>0 and num[i]==num[i-1]: continue ...

一道很赞的题目。遵循这样一个最基本的思路，最大的数肯定不能通过异或生成，所以必须要取。遵循这个思路：除了这个最大的数其他所有与其位数相同的数都可以通过异或生成。再看异或这个操作本身的特殊性（不同为1，相同为0）即意味着如果最大的数的位数为4，那么肯定要取到位数为3的最大数。n=int(input())num=[int(c) for c in list(input().split())]def...

考察全排列？nk=list(input().split())n=int(nk[0])k=int(nk[1])num=[int(c) for c in list(input().split())]m=[0]*(n+1)index=[]for i in range(n): if num[i]==0: index.append(i) else: m[num[i]]=1a=...

s=input()t=input()l1=len(s)l2=len(t)i,j=0,0while i<l1 and j<l2: if s[i]==t[j]: i+=1 j+=1 else: i+=1if j==l2: print('Yes')else: print('No')

num=int(input())import mathprint(int((math.sqrt(1+4*num)-1)/2))

改成 只能往相邻移动的话难度会增加n=int(input())num=[int(c) for c in input().split()]if sum(num)%n !=0: print(-1)else: target=sum(num)//n flag =0 if target%2==0 else 1 count=0 for n in nu...

二分贪心查找nm=list(input().split())n=int(nm[0])m=int(nm[1])board=[[0]*m for _ in range(n)]count=0while count<n: num=input() for j in range(m): board[count][j]=int(num[j]) count...

count=0s=''try: while True: s=s+input()+' 'except: passprint(len(set(s.split())))

n=int(input())performance=list(input().split())kd=list(input().split())k=int(kd[0])d=int(kd[1])dp=[[0]*n for _ in range(k)]dp1=[[0]*n for _ in range(k)]for j in range(n): performance[j]=int...

n=int(input())num=list(map(int,input().split()))cnt=0p=0q=n-1lft=num[0]rht=num[n-1]while p<q: if lft==rht: p+=1 q-=1 lft=num[p] rht=num[q] elif lft&lt...