#113. 判断恰好一个青少年数

    ID: 113 Type: Default 1000ms 256MiB Tried: 0 Accepted: 0 Difficulty: (None) Uploaded By: Tags>codingbatWarmup-1gesp1条件结构

判断恰好一个青少年数

Exactly One Teen Number

Background

Congcong and his friends are playing a number game. They have defined a special category of numbers and want to determine if two given numbers satisfy an interesting condition.

Problem Description

We'll say that a number is "teen" if it is in the range 1313 to 1919 inclusive. Given two integer values, return true if one or the other is teen, but not both.

Input Format

Input is given from standard input in the following format.

a b

Where aa and bb are two integers.

Output Format

Output is printed to standard output in the following format.

result

Where result is a boolean value (true or false).

Sample

13 99
true
21 19
true
13 13
false

Sample Explanation

For Sample 1: 1313 is a teen number, 9999 is not. Exactly one number is teen, so true is returned. For Sample 2: 2121 is not a teen number, 1919 is. Exactly one number is teen, so true is returned. For Sample 3: 1313 is a teen number, and 1313 is also a teen number. Both numbers are teen, which does not satisfy the "exactly one" condition, so false is returned.

Constraints

Time limit for each test case: 11 second. Memory limit for each test case: 10241024 KiB.