题解
Khasehemwy
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #672 (Div. 2) B. Rock and Lever
题意:对于任意的 a[i],a[j] (i!=j),求 a[i]&a[j]>=a[i]^a[j] 的数量。 t组数据,每组n个a[i]。 显然1&1(=1)>1^1(=0),所以只要两个数的二进制位数相同,就满足。反之一定不满足。那只需要比较每两个数的二进制位数即可。 例如 在 [ pow(2,4),pow(2,5) )区间内的数一定位数相同,所以按从小到大排序a[i],当a[i]与a[i-1]满足时,说明其位数相同,记录mk++,当下一个数仍然满足时就相当于 a[i],a[i-原创 2020-09-25 11:26:19 · 149 阅读 · 0 评论 -
Codeforces Round #654,C. A Cookie for You
C. A Cookie for You 题目: Anna is a girl so brave that she is loved by everyone in the city and citizens love her cookies. She is planning to hold a party with cookies. Now she has a vanilla cookies and b chocolate cookies for the party. She invited n guests原创 2020-07-02 10:56:10 · 301 阅读 · 0 评论