https://blog.youkuaiyun.com/LWD_Dzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/LWD_D/article/details/119948945https://blog.youkuaiyun.com/LWD_D/article/details/119948945LWD_DFri, 27 Aug 2021 14:42:04 +0800https://blog.youkuaiyun.com/LWD_D/article/details/119821962https://blog.youkuaiyun.com/LWD_D/article/details/119821962LWD_DFri, 20 Aug 2021 15:02:23 +0800https://blog.youkuaiyun.com/LWD_D/article/details/106056065https://blog.youkuaiyun.com/LWD_D/article/details/106056065LWD_DMon, 11 May 2020 15:55:40 +0800https://blog.youkuaiyun.com/LWD_D/article/details/78571946https://blog.youkuaiyun.com/LWD_D/article/details/78571946LWD_DSat, 18 Nov 2017 22:52:30 +0800https://blog.youkuaiyun.com/LWD_D/article/details/78492924https://blog.youkuaiyun.com/LWD_D/article/details/78492924LWD_DThu, 09 Nov 2017 19:14:04 +0800 #include using namespace std; char s[1000000+5],ch[1000000+5]; int nxt[1000000+5]; int lenc,lens; void kmp() { nxt[0]=-1;]]>https://blog.youkuaiyun.com/LWD_D/article/details/78492815https://blog.youkuaiyun.com/LWD_D/article/details/78492815LWD_DThu, 09 Nov 2017 18:59:18 +0800 #include #include using namespace std; const int N=11000000+5; ch]]>https://blog.youkuaiyun.com/LWD_D/article/details/78492295https://blog.youkuaiyun.com/LWD_D/article/details/78492295LWD_DThu, 09 Nov 2017 17:49:42 +0800https://blog.youkuaiyun.com/LWD_D/article/details/78483249https://blog.youkuaiyun.com/LWD_D/article/details/78483249LWD_DWed, 08 Nov 2017 21:03:45 +0800 #include #include using namespace std; const int N=10000+5,M=500000+5; int n,m,s; int to[M],head[N],w[M],nxt[M],etot; int dis[N]; void adde(int u,int v,int c)]]>https://blog.youkuaiyun.com/LWD_D/article/details/78482531https://blog.youkuaiyun.com/LWD_D/article/details/78482531LWD_DWed, 08 Nov 2017 19:58:59 +0800 #include #includehttps://blog.youkuaiyun.com/LWD_D/article/details/78480161https://blog.youkuaiyun.com/LWD_D/article/details/78480161LWD_DWed, 08 Nov 2017 16:21:19 +0800 #include using namespace std; #define ll long long const int N=1e5+5; /*ll f]]>https://blog.youkuaiyun.com/LWD_D/article/details/78478949https://blog.youkuaiyun.com/LWD_D/article/details/78478949LWD_DWed, 08 Nov 2017 15:03:48 +0800https://blog.youkuaiyun.com/LWD_D/article/details/78473251https://blog.youkuaiyun.com/LWD_D/article/details/78473251LWD_DTue, 07 Nov 2017 22:17:00 +0800 #include using namespace std; #define ll long long const int N=3e6+5; //o(n)求逆元，要求模数必须为质数，并且所求的数小于模]]>https://blog.youkuaiyun.com/LWD_D/article/details/78472221https://blog.youkuaiyun.com/LWD_D/article/details/78472221LWD_DTue, 07 Nov 2017 20:40:12 +0800 #include using namespace std; const int N=10000000; bool noprime[N+5]; int prime[N+5],size; void euler(int n) { for(int i=2;i<=n;i++){ if(!noprime[i]) prime[++s]]>https://blog.youkuaiyun.com/LWD_D/article/details/78471861https://blog.youkuaiyun.com/LWD_D/article/details/78471861LWD_DTue, 07 Nov 2017 20:10:01 +0800 #include #include using namespace std; #define ll long long const int inf=1e9; void exgcd(int a,int b,int &x,int &y,int &d) { if(!b){ x=1,y=0,d=a;]]>https://blog.youkuaiyun.com/LWD_D/article/details/78471515https://blog.youkuaiyun.com/LWD_D/article/details/78471515LWD_DTue, 07 Nov 2017 19:37:49 +0800 #include #include #include using namespace std; struct Wint:vector{ Wint(int n=0){ push_back(n); check()]]>https://blog.youkuaiyun.com/LWD_D/article/details/78469524https://blog.youkuaiyun.com/LWD_D/article/details/78469524LWD_DTue, 07 Nov 2017 16:42:30 +0800https://blog.youkuaiyun.com/LWD_D/article/details/78435984https://blog.youkuaiyun.com/LWD_D/article/details/78435984LWD_DFri, 03 Nov 2017 15:17:15 +0800https://blog.youkuaiyun.com/LWD_D/article/details/78417549https://blog.youkuaiyun.com/LWD_D/article/details/78417549LWD_DWed, 01 Nov 2017 19:28:34 +0800https://blog.youkuaiyun.com/LWD_D/article/details/78397899https://blog.youkuaiyun.com/LWD_D/article/details/78397899LWD_DMon, 30 Oct 2017 21:56:46 +0800https://blog.youkuaiyun.com/LWD_D/article/details/78335379https://blog.youkuaiyun.com/LWD_D/article/details/78335379LWD_DTue, 24 Oct 2017 22:02:00 +0800