zoukankan      html  css  js  c++  java
  • 【B ECJTU_ACM 11级队员2012年暑假训练赛(2)】

    B - B
    Time Limit:1000MS     Memory Limit:1000KB     64bit IO Format:%I64d & %I64u

    Description

    Recently kiki has nothing to do. While she is bored, an idea appears in his mind, she just playes the checkerboard game.The size of the chesserboard is n*m.First of all, a coin is placed in the top right corner(1,m). Each time one people can move the coin into the left, the underneath or the left-underneath blank space.The person who can't make a move will lose the game. kiki plays it with ZZ.The game always starts with kiki. If both play perfectly, who will win the game?
     

    Input

    Input contains multiple test cases. Each line contains two integer n, m (0<n,m<=2000). The input is terminated when n=0 and m=0.

     

    Output

    If kiki wins the game printf "Wonderful!", else "What a pity!".
     

    Sample Input

    5 3 5 4 6 6 0 0
     

    Sample Output

    What a pity! Wonderful! Wonderful!
     
     1 // Project name : B
     2 // File name    : main.cpp
     3 // Author       : Izumu
     4 // Date & Time  : Tue Jul 10 12:31:04 2012
     5 
     6 
     7 #include <iostream>
     8 #include <stdio.h>
     9 #include <string>
    10 #include <cmath>
    11 using namespace std;
    12 
    13 int main()
    14 {
    15     int n, m;
    16     while (scanf("%d%d", &n, &m) != EOF && n + m)
    17     {
    18         if(n % 2 == 0 || m % 2 == 0)
    19         {
    20             printf("Wonderful!\n");
    21         }
    22         else
    23         {
    24             printf("What a pity!\n");
    25         }
    26     }
    27     return 0;
    28 }
    29 
    30 
    31 // end 
    32 // ism 
  • 相关阅读:
    Inception V1-V4
    NDCG的理解
    进程与线程
    Java中的接口和抽象类
    HashMap的工作原理
    基于比较排序的算法复杂度的下界
    数据库-left join,right join,inner join,full join
    外排序 External sorting
    数据流中的中位数 Find Median from Data Stream
    Codeforces Round #272 (Div. 2)
  • 原文地址:https://www.cnblogs.com/ismdeep/p/2584775.html
Copyright © 2011-2022 走看看