Codeforces Round #439 A

The Artful Expedient

题意：给出a b 2个数组，求ai^bj在a 或者 b中出现过的i j有多少对，如果是偶数对输出Karen

思路：a^b=c -> c^b=a, c^a=b，所以一定有偶数对，直接输出karen即可

AC代码：

#include "iostream"
#include "iomanip"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#pragma comment(linker, "/STACK:102400000,102400000")
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a,x) memset(a,x,sizeof(a))
#define step(x) fixed<< setprecision(x)<<
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define ll long long
#define endl ("\n")
#define ft first
#define sd second
#define lrt (rt<<1)
#define rrt (rt<<1|1)
using namespace std;
const ll mod=998244353;
const ll INF = 1e18+1LL;
const int inf = 1e9+1e8;
const double PI=acos(-1.0);
const int N=1e5+100;

int x,y,n;
int main(){
    //ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n;
    for(int i=1; i<=n; ++i){
        cin>>x;
    }
    for(int i=1; i<=n; ++i){
        cin>>y;
    }
    cout<<"Karen";
    return 0;
}