zoukankan      html  css  js  c++  java
  • Codeforces Round #439 (Div. 2) Problem A (Codeforces 869A)

    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.

    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 = yji ≠ j and xi = xji ≠ 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赢,否则是Koyomi赢。

      暴力for,开个数组去check。完事。

    Code

     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 }

     

  • 相关阅读:
    单选框和复选框(radiobox、checkbox)
    三种alertconfirmprompt弹窗的处理方法
    iframe的切换
    python的class(类)中的object是什么意思?
    loadrunner12自带的机票预订服务,解决httpd: Could not reliably determine the server's fully qualified domain name 问题
    使用错误的用户名和密码也能运行通过
    win10删除IE某些文件导致不可用恢复的方法
    win10系统删除需要Trustedlnstaller权限的文件
    loadrunner各版本对应的ie浏览器版本
    vue之vue-router加深印象
  • 原文地址:https://www.cnblogs.com/yyf0309/p/7635442.html
Copyright © 2011-2022 走看看