Codeforces Round #439 (Div. 2) The Artful Expedient
来源:互联网 发布:监听软件 编辑:程序博客网 时间:2024/06/08 01:36
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 byx1, 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. Herexor 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.
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 one line — the name of the winner, that is, "Koyomi" or "Karen" (without quotes). Please be aware of the capitalization.
31 2 34 5 6
Karen
52 4 6 8 109 7 5 3 1
Karen
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 since6 is an even number.
In the second example, there are 16 such pairs, and Karen wins again.
这道题题意就是给你两串数字,让你记录上面一行的任意数字与下面一行任意数字进行异或操作的结果依然在所给数组中的个数。
根据个数的奇偶性来输出不同的结果。
#include<iostream>#include<algorithm>#include<cstring>#include<map>using namespace std;int a[2020];int b[2020];bool v[2222222];int main(){ int n; while(cin>>n) { memset(v,0,sizeof(v)); for(int i=0;i<n;i++) { cin>>a[i]; v[a[i]]=1; } for(int i=0;i<n;i++) { cin>>b[i]; v[b[i]]=1; } int res=0; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { if(v[a[i]^b[j]]) res++; } } if(res%2==1) cout<<"Koyomi"<<endl; else cout<<"Karen"<<endl; } return 0;}
- Codeforces Round #439 (Div. 2) 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) The Artful Expedient
- Codeforces Round #439 (Div. 2) A. The Artful Expedient
- Codeforces Round #439 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 Round #439 (Div. 2) A题 he Artful Expedien
- A. The Artful Expedient
- Codeforces869A The Artful Expedient
- A. The Artful Expedient
- 【codeforces869A】The Artful Expedient
- codeforces The Artful Expedient(数学思维题)
- codeforces—— 869A —— The Artful Expedient
- CF 869 A. The Artful Expedient【异或】
- 2017.10.15
- angular的过滤器
- Socke的TCP与UDP的区别及其用法
- ViewPager+Fragment
- 【BZOJ1012】【JSOI2008】最大数
- Codeforces Round #439 (Div. 2) The Artful Expedient
- angular制作简易购物车
- XListView
- 深度学习及其在语音处理中的应用综述
- Gmapping从开始到放弃—写一个TF 广播
- RecyclerView 的添加分割线
- 指针与引用
- Linux操作系统 第二章Linux的安装 问答题
- JS中变量和函数的提升机制(hoisting)