Codeforces Round #721 (Div. 2)A、B、C题解
不会吧不会吧不会吧不会真的有人520不陪npy去熬夜陪毛子打cf还要掉分被绿吧?顶不住了,本蒟蒻也要肝题解了,蒟蒻上路如有问题请大佬评论区轻喷指教orzA. And Then There Were K传送门:A. And Then There Were K题意:给定t(1 ≤ t ≤ 3⋅104)组数据,每组数据一个正整数n (1 ≤ n ≤ 109),求最大的整数k,使得n & (n−1) & (n−2) & (n−3) & … (k) = 0成
原创
2021-05-21 13:16:13 ·
1318 阅读 ·
11 评论