链接:https://ac.nowcoder.com/acm/contest/881/H
来源:牛客网
题目描述
Bobo has a set A of n n n integers a 1 , a 2 , … , a n a_1,a_2,…,a_n a1,a2,…,an.
He wants to know the sum of sizes for all subsets of A whose xor sum is zero modulo ( 1 0 9 + 7 ) (10^9+7) (109+7).
Formally, find ( ∑ S ⊆ A , ⊕ x ∈ S x = 0 ∣ S ∣ ) m o d ( 1 0 9 + 7 ) (∑S⊆A,⊕x∈Sx=0|S|)mod(10^9+7) (∑S⊆A,⊕x∈Sx=0∣S∣)mod(109+7