UVA 11892-enimen (Inference)

Source: Internet
Author: User

Topic Link: UVA 11892-enimen

The main topic: Given the number of stones in the N heap, the two take turns to choose stones to heap stones, until they can not be taken as a failure, additional conditions, assuming the previous operation, that is, the operation of the team hand, not the selected stone heap in the stone to take, then the current operator must be in the heap to take stones.

Problem-solving ideas: only to have a stone heap number is greater than 2, then the initiator will win the state, controllable. The parity is inferred for all 1 cases.

#include <cstdio>#include <cstring>#include <algorithm>using namespace STD;BOOLJudge () {intn, X;BOOLFlag =false;scanf("%d", &n); for(inti =0; I < n; i++) {scanf("%d", &x);if(X >1) flag =true; }returnFlag | | (n&1);}intMain () {intCAsscanf("%d", &cas); while(cas--) {BOOLFlag = judge ();printf("%s\n", Flag?"Poopi":"Piloop"); }return 0;}

UVA 11892-enimen (Inference)

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.