Dikea's Blog

#include #include #include #include #include using namespace std; const int M = 26; int n; #define maxn 1005 char S[maxn][21]; struct Node { int v; Node *next[M]; }*root; void Creat(

统计难题Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 21814    Accepted Submission(s): 9297 Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写

ZYB loves Xor I    Accepts: 142    Submissions: 696  Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) 问题描述 ZYB喜欢研究Xor，现在他得到了一个长度为n的数组A。于是他想知道：对于所有数对

第一题： Remember the Word Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Description Neal is very curious about combinato

区域赛第一场：水题 #include #include #include #include using namespace std; #define INF 0x3f3f3f3f #define N 1000 + 10 #define M 40000 + 10 int n, a[N], top, tree[M][3], digit[M], val[M]; void init() {