【Codeforces Round #439 (Div. 2) A】The Artful Expedient
2017-10-07 00:20
441 查看
【链接】 链接
【题意】
【题解】
暴力
【错的次数】
在这里输入错的次数
【反思】
在这里输入反思
【代码】
#include <bits/stdc++.h> using namespace std; const int INF = 2e6; const int N = 2e3; bool bo[INF+10]; int x[N+10],y[N+10],n; int main() { //freopen("F:\\rush.txt","r",stdin); scanf("%d",&n); for (int i = 1;i <= n;i++){ scanf("%d",&x[i]); bo[x[i]] = 1; } for (int i = 1;i <= n;i++){ scanf("%d",&y[i]); bo[y[i]] = 1; } int cnt = 0; for (int i = 1;i <= n;i++) for (int j = 1;j <= n;j++) { int temp = x[i]^y[j]; if (temp<=INF) { if (bo[temp]) cnt++; } } if (cnt&1) puts("Koyomi"); else puts("Karen"); return 0; }
相关文章推荐
- Codeforces Round #439 (Div. 2) A. The Artful Expedient
- Codeforces Round #439 (Div. 2) The Artful Expedient
- 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) A. The Artful Expedient
- codeforces—— 869A —— The Artful Expedient
- A. The Artful Expedient
- Codeforces869A The Artful Expedient
- A. The Artful Expedient
- CF 869 A. The Artful Expedient(异或)
- Codeforces Round #358 (Div. 2) -- C. Alyona and the Tree (树上的DFS)
- #426 (Div. 2) B. The Festive Evening
- [Codeforces Round #354 DIV2E (CF676E)] The Last Fight Between Human and AI
- CF - 286 - div2 - C - Mr. Kitayuta, the Treasure Hunter (DP)
- Codeforces Round #400 (Div. 1 + Div. 2, combined)D. The Door Problem【2-sat Tarjan+思维建图】
- Codeforces Round #190 (Div. 2) E. Ciel the Commander 题目与题解翻译
- Codeforces Round #466 (Div. 2) A. Points on the line
- Codeforces Round #430 (Div. 2) 842C Ilya And The Tree(暴力)
- B. Amr and The Large Array(Codeforces Round #312 (Div. 2)+找出现次数最多且区间最小)