#130. 条件判断求和

    ID: 130 Type: Default 1000ms 256MiB Tried: 0 Accepted: 0 Difficulty: (None) Uploaded By: Tags>codingbatLogic-1gesp1条件结构数学基础

条件判断求和

Sum with Teen Special

Background

Congcong is learning basic arithmetic operations. He discovered that some number combinations lead to unexpected "lucky" results.

Problem Description

Given two integers, aa and bb, return their sum. However, "teen" values in the range 131913 \dots 19 inclusive are considered extra lucky. So, if either value is a teen, just return 1919.

Input Format

Input is given from standard input in the following format.

aa bb

Output Format

Output is printed to standard output in the following format.

result

Sample

3 4
7
10 13
19
13 2
19

Sample Explanation

Sample 11: Neither 33 nor 44 is a teen value, so their sum 3+4=73 + 4 = 7 is returned. Sample 22: 1010 is not a teen value, but 1313 is. Since one value is a teen, 1919 is returned. Sample 33: 1313 is a teen value, and 22 is not. Since one value is a teen, 1919 is returned.

Constraints

Time limit: 11 second per test case. Memory limit: 10241024 KiB per test case.