CF 869 A. The Artful Expedient【异或】
来源:互联网 发布:游戏寻路算法 编辑:程序博客网 时间:2024/06/10 00:19
A. The Artful Expedient
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Rock… Paper!
After Karen have found the deterministic winning (losing?) strategy for rock-paper-scissors, her brother, Koyomi, comes up with a new game as a substitute. The game works as follows.
A positive integer n is decided first. Both Koyomi and Karen independently choose n distinct positive integers, denoted by x1, x2, …, xn and y1, y2, …, yn respectively. They reveal their sequences, and repeat until all of 2n integers become distinct, which is the only final state to be kept and considered.
Then they count the number of ordered pairs (i, j) (1 ≤ i, j ≤ n) such that the value xi xor yj equals to one of the 2n integers. Here xor means the bitwise exclusive or operation on two integers, and is denoted by operators ^ and/or xor in most programming languages.
Karen claims a win if the number of such pairs is even, and Koyomi does otherwise. And you’re here to help determine the winner of their latest game.
Input
The first line of input contains a positive integer n (1 ≤ n ≤ 2 000) — the length of both sequences.
The second line contains n space-separated integers x1, x2, …, xn (1 ≤ xi ≤ 2·106) — the integers finally chosen by Koyomi.
The third line contains n space-separated integers y1, y2, …, yn (1 ≤ yi ≤ 2·106) — the integers finally chosen by Karen.
Input guarantees that the given 2n integers are pairwise distinct, that is, no pair (i, j) (1 ≤ i, j ≤ n) exists such that one of the following holds: xi = yj; i ≠ j and xi = xj; i ≠ j and yi = yj.
Output
Output one line — the name of the winner, that is, “Koyomi” or “Karen” (without quotes). Please be aware of the capitalization.
Examples
input
3
1 2 3
4 5 6
output
Karen
input
5
2 4 6 8 10
9 7 5 3 1
output
Karen
Note
In the first example, there are 6 pairs satisfying the constraint: (1, 1), (1, 2), (2, 1), (2, 3), (3, 2) and (3, 3). Thus, Karen wins since 6 is an even number.
In the second example, there are 16 such pairs, and Karen wins again.
Karen 必胜
一直输出就可以了。。。
- CF 869 A. The Artful Expedient【异或】
- CF 869 A. The Artful Expedient(异或)
- A. The Artful Expedient
- A. The Artful Expedient
- codeforces 869A The Artful Expedient
- Codeforces 869A. The Artful Expedient
- Codeforces 869A The Artful Expedient
- CodeForces 869A The Artful Expedient
- codeforces—— 869A —— The Artful Expedient
- Codeforces869A The Artful Expedient
- 【codeforces869A】The Artful Expedient
- Codeforces Round #439 (Div. 2) A. The Artful Expedient
- Codeforces Round #439 (Div. 2) A. The Artful Expedient
- Codeforces Round #439 (Div. 2) A. The Artful Expedient
- Codeforces Round #439 A The Artful Expedient 博弈解释 +暴力写法
- Codeforces Round #439 (Div. 2) The Artful Expedient
- codeforces The Artful Expedient(数学思维题)
- Codeforces Round #439 (Div. 2) The Artful Expedient
- python-opencv:ImportError: numpy.core.multiarray failed to import
- 使用集合实现注册登陆功能,第一步: 提示用户选择功能, A(注册) B(登陆) 。 要求: 功能选择 的时候要忽略大小写。
- r入门练习(一)
- 最小的k个数和multiset\reverse_iterator\const_iterator用法
- 6. 单件模式
- CF 869 A. The Artful Expedient【异或】
- 浅谈分布式服务协调技术 Zookeeper
- CF 869 B. The Eternal Immortality【数学】
- GiD初步使用
- Java工程师路线规划
- sql语句汇总
- Qt5美化界面1——标签设置图片(含GIF)
- 实数系与实数定理
- 为大家分享daloradius+freeradius+openvpn的安装脚本