摘要：
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <algorithm> 5 6 using namespace std; 7 8 #define MAXN 102 9 10 int N,C;11 char s1[MAXN],s2[MAXN],s12[MAXN<<1],ans[MAXN<<1];12 13 //*****************ELFhash***********14 #define HASH 990115 c 阅读全文
摘要：
（网上找的。。。）构造法公式（序列）：一、当n mod 6 != 2 &&n mod 6 != 3时：[2,4,6,8,...,n],[1,3,5,7,...,n-1] (n为偶数)[2,4,6,8,...,n-1],[1,3,5,7,...,n] (n为奇数)二、当n mod 6 == 2或n mod 6 == 3时(当n为偶数,k=n/2；当n为奇数,k=(n-1)/2)[k,k+2,k+4,...,n],[2,4,...,k-2],[k+3,k+5,...,n-1],[1,3,5,...,k+1](k为偶数,n为偶数)[k,k+2,k+4,...,n-1],[2,4,.. 阅读全文