zoukankan      html  css  js  c++  java
  • A. The Artful Expedient

    A. The Artful Expedient
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard 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.

    比赛的时候居然没看懂A题。

    这就是位运算,两组遍历异或运^。

     1 #include <iostream>
     2 #define N 2005
     3 #define M 5000005
     4 using namespace std;
     5 int n;
     6 int a[N],b[N],vis[M];
     7 int main(){
     8   cin>>n;
     9   int cnt=0;
    10   for(int i=0;i<n;i++){
    11     cin>>a[i];
    12     vis[a[i]]++;
    13   }
    14 
    15   for(int i=0;i<n;i++){
    16     cin>>b[i];
    17     vis[b[i]]++;
    18   }
    19   for(int i=0;i<n;i++){
    20     for(int j=0;j<n;j++){
    21       int x=a[i]^b[j];
    22       if(vis[x]){
    23         cnt++;
    24       }
    25     }
    26   }
    27   if(cnt%2==0){
    28     cout<<"Karen"<<endl;
    29   }else{
    30     cout<<"Koyomi"<<endl;
    31   }
    32   return 0;
    33 }
  • 相关阅读:
    django关闭调试信息,打开内置错误视图
    django 配置URLconf和获取值
    django模版中配置和使用静态文件方法
    django的模型类管理器-----------数据库操作的封装
    美团校招的算法题:灯泡游戏
    ccTouchBegan
    特效effects(二)
    特效effects
    CCProgressTo和CCProgressTimer
    TransitionsTest
  • 原文地址:https://www.cnblogs.com/zllwxm123/p/7647787.html
Copyright © 2011-2022 走看看