| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 1024 MB | 29 | 22 | 18 | 78.261% |
You are playing a deck-building game with your friend. There are $N$ cards, numbered from 1ドル$ to $N$. Card $i$ has the value of $A_i$.
You want to build two decks; one for you and one for your friend. A card cannot be inside both decks, and it is allowed to not use all $N$ cards. It is also allowed for a deck to be empty, i.e. does not contain any cards.
The power of a deck is represented as the bitwise XOR of the value of the cards in the deck. The power of an empty deck is 0ドル$.
The game is balanced if both decks have the same power.
Determine the number of ways to build two decks such that the game is balanced. Two ways are considered different if one of the decks contains at least one different card. Since the answer can be very large, calculate the answer modulo 998ドル,円 244,円 353$.
The first line consists of an integer $N$ (2ドル ≤ N ≤ 100,円 000$).
The following line consists of $N$ integers $A_i$ (1ドル ≤ A_i ≤ 100,円 000$).
Output an integer representing the number of ways to build two decks such that the game is balanced. Output the answer modulo 998ドル,円 244,円 353$.
4 16 12 4 8
9
Denote $S$ and $T$ as the set of cards in your deck and your friend’s deck, respectively. There are 9ドル$ ways to build the decks such that the game is balanced.
4 1 2 4 8
1
The only way to make the game balanced is to have both decks empty.
2 1 1
5
There are 5ドル$ ways to build the decks such that the game is balanced.
6 1 1 1 2 2 2
169