stu240107

UID: 2956, 注册于 2024-8-20 21:18:42, 最后登录于 2025-9-11 9:30:15, 目前离线.

解决了 2 道题目，RP: 8 (No. 606)

♂

个人简介

a=list(map(int,input().split())) n=len(a) left=0 right=n-1 keven=int(input()) while left<=right : m=(left+right)//2 if keven==a[m]: break elif keven<a[m]: left=m+1 else : right=m-1 if
最近活动

This person is lazy and didn't join any contests or homework.