• [1299] Egg Story

  • 时间限制: 1000 ms 内存限制: 65535 K
  • 问题描述
  • Today Death Moon found a tiny story:

    One of my friends asked us a question during our dinner time, “What if a man has two eggs?” Now we are discussing whether we should tell him the truth.

    And Death Moon imagined the ending:

    N discussers organized K votings. Each one can at most gives M Agrees in one voting.

    We say one voting is an Agree Voting if it maches the formula below:

    ( is everyone’s number of Agree)

    And if there are half and more Agree Voting, then we decide to tell him the truth. Otherwise, we should tell nothing.

  • 输入
  • This problem contains several cases.
    The first line of each case has two integers N, M and K which are mentioned before. (1 <= N <= 100, 1 <= M <= 100, 1 <= K <= 100)
    Next follow K lines. Each line contains N integers A[i]. (0 <= A[i] <= M)
  • 输出
  • For each case, you should output ‘Truth’ if we decide to tell our poor friend. Otherwise, output ‘Nothing’.
  • 样例输入
  • 2 4 2
    1 2
    3 4
  • 样例输出
  • Truth
  • 提示
  • 来源
  • XadillaX
  • 操作