异或
天夏123
这个作者很懒,什么都没留下…
展开
-
Educational Codeforces Round 12-E. Beautiful Subarrays
维护一个异或的前缀数组sum(),并把数组中的数挂在字典树上,寻找在sum(0)..sum(i-1)中和sum(i)异或值大于等于K的数的数目.累加#include <bits/stdc++.h>#define maxn 205#define INF 1e9using namespace std;typedef long long ll;typedef struct Node{ i原创 2016-04-24 19:02:53 · 313 阅读 · 0 评论 -
HDU-4825 Xor Sum
原题链接Xor SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 1189 Accepted Submission(s): 497Problem DescriptionZeus原创 2016-06-19 10:58:06 · 224 阅读 · 0 评论 -
8VC Venture Cup 2016 - Final Round (Div. 2 Edition) C. XOR Equation
原题链接C. XOR Equationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo positive integers a and b hav原创 2016-07-09 14:43:48 · 236 阅读 · 0 评论