codeforces 869A The Artful Expedient
2017-10-07 20:24
267 查看
题目链接:
http://codeforces.com/problemset/problem/869/A题解:
直接map,炸了时间。以后还是老老实实写个find的函数。心碎。
代码:
#include <map> #include <cmath> #include <vector> #include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; #define inf 0x3f3f3f3f #define met(a,b) memset(a,b,sizeof(a)) typedef long long ll; const int maxn = 2000+10; int num1[maxn],num2[maxn]; map<int,int> mp; int main() { int n; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d",&num1[i]); mp[num1[i]]++; } for(int i=0;i<n;i++) { scanf("%d",&num2[i]); mp[num2[i]]++; } int cnt=0; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { int x=num1[i]^num2[j]; if(mp.find(x)!=mp.end()) cnt++; } } if(cnt%2==0) printf("Karen\n"); else printf("Koyomi\n"); }
相关文章推荐
- CodeForces - 672D Robin Hood (二分)好题
- CodeForces 586D Phillip and Trains (基础搜索 -- DFS)
- CodeForces 137A
- Codeforces 549F Yura and Developers
- CodeForces 429B
- codeforces 413E 线段树
- Codeforces_465Div_2
- CodeForces 66BPetya and Countryside
- Codeforces 180C Letter【dp】
- codeforces 330A 330B 329A 分别是7月20DIV2的前三题
- Codeforces 551C GukiZ hates Boxes(二分)
- Codeforces 584E Anton and Ira【思维+贪心】好题~
- CodeForces 86C AC自动机
- Codeforces 918D - MADMAX 【记忆化搜索+博弈】
- [Codeforces] Round #353 (Div. 2)
- 【CodeForces 208D】Prizes, Prizes, more Prizes
- CodeForces 154B——Colliders——筛选素数,模拟标记
- Codeforces 552E - Vanya and Brackets【表达式求值】
- Problem--339A--Codeforces-- A. Helpful Maths
- Codeforces 106D Treasure Island【思维+二维前缀和】