标签：tor mes second family 方案 否则 none stream inpu
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 xormeans 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.
3
1 2 3
4 5 6
Karen
5
2 4 6 8 10
9 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 since 6 is an even number.
In the second example, there are 16 such pairs, and Karen wins again.
题目大意 给定两组数，每组中各选一个数异或得到后的结果在这两组数中出现过的方案数如果是偶数就是Karen赢，否则是Koyomi赢。
暴力for，开个数组去check。完事。
1 /** 2 * Codeforces 3 * Problem#869A 4 * Accepted 5 * Time: 280ms 6 * Memory: 100k 7 */ 8 #include <bits/stdc++.h> 9 using namespace std; 10 11 int n; 12 int *x, *y; 13 set<int> been; 14 15 inline void init() { 16 scanf("%d", &n); 17 x = new int[(n + 1)]; 18 y = new int[(n + 1)]; 19 for(int i = 1; i <= n; i++) 20 scanf("%d", x + i), been.insert(x[i]); 21 for(int i = 1; i <= n; i++) 22 scanf("%d", y + i), been.insert(y[i]); 23 } 24 25 int counter = 0; 26 inline void solve() { 27 for(int i = 1; i <= n; i++) 28 for(int j = 1; j <= n; j++) 29 if(been.count(x[i] ^ y[j])) { 30 counter++; 31 } 32 if(counter & 1) puts("Koyomi"); 33 else puts("Karen"); 34 } 35 36 int main() { 37 init(); 38 solve(); 39 return 0; 40 }
Codeforces Round #439 (Div. 2) Problem A (Codeforces 869A) - 暴力
标签：tor mes second family 方案 否则 none stream inpu
原文地址：http://www.cnblogs.com/yyf0309/p/7635442.html
