HDU 1850 Being A good boy in Spring Festival (NIM game)

Source: Internet
Author: User

#include <iostream> #include <algorithm> #define SS (a)  scanf ("%d", &a) #define SS64 (a)  scanf (" %i64d ", &a) using namespace Std;int main () {int a[100],i,n,m,sum,cnt,j;while (~SS (n), N) {cnt=0;for (i=0,sum=0;i<n ; i++)        {SS (A[i]);            Sum ^=a[i];} if (sum==0) {cout<< "0" <<ENDL;} Else{for (i=0;i<n;i++) {sum=0;for (j=0;j<n;j++) {if (i==j) continue;sum ^=a[j];} if (a[i]>=sum) cnt++;} Cout<<cnt<<endl;}}    return 0;}

A typical NIM game.

For all the number of different or, if 0, then the initiator is a must lose, the direct output of 0 end;

If not 0, then the calculation has several scenarios, such as input things 5 7 8 9 10 (5 stacks of Poker)

So what about (5 7 8 9 10)?
1. Cannot be taken from 5, because 7^8^9^10=12
2. Cannot be taken from 7, because 5^8^9^10=10
3.1 (5,7,7,9,10) can be taken from 8
4.0 can be removed from 9 (5, 7, 8, 9, 10)
5.3 (5,7,8,9,7) can be removed from 10

Being a good boy in Spring Festival Time limit:1000/1000 MS (java/others) Memory limit:32768/32768 K (java/others)
Total submission (s): 5371 Accepted Submission (s): 3210

Problem description A year outside parents time
Spring Festival Home Can you do a few days good boy?
Try to do the following things in winter vacation

Spend time with mom on the vegetable
Quietly buy a little gift for dad
Take the initiative to ask for a bowl wash once and for all
One day get up early and give mom and dad a heart for breakfast.

You can talk to Mom and dad if you want.
Let's play a little game. ACM Class to School ~

Here is a two-person mini-game: There are m stacks of poker on the table, and the number of cards per pile is ni (i=1 ... M); The two take turns, and each step can be arbitrarily selected and taken away from any of the cards; the poker on the table is all out, then the game is over; the last person to pick the card is the winner.
Now we do not want to study whether to win or negative, I just want to ask you:
-"If the initiator wants to win, the first step has several options?" ”

The input data contains multiple test cases, each with 2 rows, and the first line contains an integer m (1<m<=100), which represents the number of stacks of poker, followed by a line containing M-integers Ni (1<=ni<=1000000,i=1 ... m), representing the number of M-Heap poker, respectively. An M of 0 indicates the end of the input data.

Output if the initiator can win, please export his first feasible number of scenarios, otherwise please output 0, the output of each instance takes up one row.

Sample Input
35 7 90

Sample Output

HDU 1850 Being A good boy in Spring Festival (NIM game)

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.