Logo
(追記) (追記ここまで)

24768번 - Left Beehind 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 1024 MB72555052076.358%

문제

Beekeeper Bill is ready to go to the annual beekeeper's convention with his friends. Bill packed his honey in jars, but unfortunately the honey in some of the jars has turned sour. Bill's friends are mean, and if too much of Bill's honey is sour they will go to the convention without him.

If Bill has more jars of sour honey than sweet, he will be left “beehind”. If Bill has more jars of sweet honey than sour he will go to the convention. If Bill has the same number of sweet and sour jars, his friends are undecided. Lastly, Bill's friends are superstitious, if he has exactly 13 jars they will never speak to him again. Bill needs new friends.

입력

Input consists of multiple cases, each on its own line. Each case consists of two numbers x and y (0 ≤ x, y ≤ 1000), which are the number of sweet and sour jars Bill has, respectively. Input is terminated by a line containing two zeros.

출력

For each case, output one of the following results on its own line (without quotes).

  • “Left beehind.” (note the spelling, those punsters)
  • “Undecided.”
  • “To the convention.”
  • “Never speak again.”

If Bill's friends will never speak to him again, that is most important and should be the only output.

제한

예제 입력 1

17 3
13 14
8 5
44 44
0 0

예제 출력 1

To the convention.
Left beehind.
Never speak again.
Undecided.

힌트

출처

School > Virginia Tech High School Programming Contest > 2014 Virginia Tech High School Programming Contest D번

  • 문제를 만든 사람: Nicholas Sharp
(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /