QOJ.ac

QOJ

时间限制: 1.0 s 内存限制: 1024 MB 总分: 100 可 Hack ✓

#11260. 奇偶游戏

统计

LittleV 和 LittleA 是数学王国里最好的朋友。他们经常一起研究各种有趣的数学问题。今天,他们遇到了一个关于奇数和偶数的有趣问题。

LittleV 特别喜欢偶数,而 LittleA 则对奇数有着特殊的偏爱。他们决定通过一个简单的游戏来决定谁更胜一筹:每个人选择一个自己喜欢的数字,然后比较这两个数字的大小。

给定两个整数 $a$ 和 $b$,保证其中一个是奇数,另一个是偶数。你需要根据以下规则输出结果:

  • 如果奇数大于偶数,输出 1;
  • 如果偶数大于奇数,输出 2。

输入格式

输入包含两个整数 $a$ 和 $b$ ($1 \le a, b \le 10^9$)。

输出格式

输出一个整数,表示比较结果。

样例

样例输入 1

1 2

样例输出 1

2

样例输入 2

3 2

样例输出 2

1

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.