<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[blog]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sinat_33397705</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sinat_33397705]]></copyright><item><title><![CDATA[随机数生成]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/80197721</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/80197721</guid><author>sinat_33397705</author><pubDate>Fri, 04 May 2018 17:05:05 +0800</pubDate><description><![CDATA[把MSDN的例子复制过来了// compile with: /EHsc /W4  
#include &amp;lt;random&amp;gt;   
#include &amp;lt;iostream&amp;gt;  
#include &amp;lt;iomanip&amp;gt;  
#include &amp;lt;string&amp;gt;  
#include &amp;lt;map&amp;gt;  
  
void test(const double a...]]></description><category></category></item><item><title><![CDATA[char和wchar_t的一些函数]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/79478221</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/79478221</guid><author>sinat_33397705</author><pubDate>Wed, 07 Mar 2018 22:51:28 +0800</pubDate><description><![CDATA[转载自：http://blog.youkuaiyun.com/wangyouxiang/article/details/169945392.宽字符处理函数函数与普通函数对照表 宽字符函数 普通C函数        函数描述 iswalnum（） isalnum（） 测试字符是否为数字或字母 iswalpha（） isalpha（） 测试字符是否是字母 iswcntrl（） iscntrl（） 测试字符是否是控...]]></description><category></category></item><item><title><![CDATA[ANSI和Unicode互相转换]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/79478205</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/79478205</guid><author>sinat_33397705</author><pubDate>Wed, 07 Mar 2018 22:49:27 +0800</pubDate><description><![CDATA[转载自：http://blog.youkuaiyun.com/k346k346/article/details/50082705
#include &amp;lt;windows.h&amp;gt;
#include &amp;lt;iostream&amp;gt;
using namespace std;

int main(){
    wchar_t* ws=L&quot;测试字符串&quot;;
    char* ss=&quot;ABC我们&quot;;
    in...]]></description><category></category></item><item><title><![CDATA[test]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/78696682</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/78696682</guid><author>sinat_33397705</author><pubDate>Sat, 02 Dec 2017 16:34:29 +0800</pubDate><description><![CDATA[test]]></description><category></category></item><item><title><![CDATA[map的一边遍历一边删除]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/78472099</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/78472099</guid><author>sinat_33397705</author><pubDate>Tue, 07 Nov 2017 20:31:58 +0800</pubDate><description><![CDATA[it_pre=it=m.begin();
it++;
for(;it!=m.end();){
   if((*it).second>(*it_pre).second){
       it_save=it;
       it++;
       m.erase(it_save);
       continue;
    }
    it_pre=it;
    it++;
}]]></description><category></category></item><item><title><![CDATA[原根]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/78260138</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/78260138</guid><author>sinat_33397705</author><pubDate>Tue, 17 Oct 2017 14:35:33 +0800</pubDate><description><![CDATA[转载自：http://blog.youkuaiyun.com/acdreamers/article/details/8883285]]></description><category></category></item><item><title><![CDATA[Polycarp's phone book]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/78022717</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/78022717</guid><author>sinat_33397705</author><pubDate>Mon, 18 Sep 2017 19:24:24 +0800</pubDate><description><![CDATA[对于001，1处理会出问题的情况，再所有的数字前面再加一个1，就变成1001和11，区分开来了，
itoa函数codefoeces上c++14才有





#include
#include
#include
#include
#include
#include
using namespace std;
char str[70000+10][10];
char s[10];
map]]></description><category></category></item><item><title><![CDATA[bitset]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/77932067</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/77932067</guid><author>sinat_33397705</author><pubDate>Mon, 11 Sep 2017 13:16:36 +0800</pubDate><description><![CDATA[http://blog.youkuaiyun.com/iamiman/article/details/53941118]]></description><category></category></item><item><title><![CDATA[二次剩余]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/77779937</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/77779937</guid><author>sinat_33397705</author><pubDate>Fri, 01 Sep 2017 22:35:27 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[poj2417大步小步法]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/77778426</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/77778426</guid><author>sinat_33397705</author><pubDate>Fri, 01 Sep 2017 21:39:22 +0800</pubDate><description><![CDATA[a^x≡b (mod n)
令x=im+j，m=ceil（n）   0

a^j≡b*(a^(-m))^i    mod(n)
用hash表存储a^0,a^1……a^(m-1)，枚举i，找是否存在对应的j，存在即有解
#include
#include
#include
#include
#include
using namespace std;
struct node{
    int]]></description><category></category></item><item><title><![CDATA[训练指南计数问题]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/77678910</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/77678910</guid><author>sinat_33397705</author><pubDate>Tue, 29 Aug 2017 15:47:32 +0800</pubDate><description><![CDATA[统计有n个顶点的连通图有多少个，每个顶点有编号。

设f(n)为所求的答案，g(n)为顶点个数为n的非连通图个数。有f(n)+g(n)=h(n)=2^(n(n-1)/2)。计算g(n),考虑1所在的连通分量，假设该连通分量有k个点，那么这k个点有C（n-1,k-1）种，当点确定之后，1所在的连通分量有f(k)种，与1不在同一个连通分量的有h(n-k)种，所以有g(n)=sigma（C（n-1,]]></description><category></category></item><item><title><![CDATA[hdu1085母函数模板]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/77658827</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/77658827</guid><author>sinat_33397705</author><pubDate>Mon, 28 Aug 2017 22:51:00 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;
const int maxn=8000;
int c1[maxn+10],c2[maxn+10],last,last2;
int main(){
    int money[4]={0,1,2,5},num[4],x;
    while(scanf("%d%d%d",&num[1],&num[2],&]]></description><category></category></item><item><title><![CDATA[知道了内存池的作用...poj3580]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/52490783</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/52490783</guid><author>sinat_33397705</author><pubDate>Fri, 09 Sep 2016 21:52:56 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
using namespace std;
#define Key_value ch[ch[root][1]][0]
const int MAXN=200010;
const int INF=0x3f3f3f3f;
int pre[MAXN],ch[MAXN][2],key[MAXN],size[MAXN],add[MAXN],]]></description><category></category></item><item><title><![CDATA[Splay——kuangbin自己改了一下，比较喜欢]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/52475233</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/52475233</guid><author>sinat_33397705</author><pubDate>Thu, 08 Sep 2016 21:25:09 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
using namespace std;
const int MAXN=100010;
int pre[MAXN],ch[MAXN][2],size[MAXN],root;//父结点、左右孩子、子树规模、根结点、结点数量
int key[MAXN];//该点的值
int add[MAXN];//增量的延迟标记
long lon]]></description><category></category></item><item><title><![CDATA[Splay——kuangbin]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/52458682</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/52458682</guid><author>sinat_33397705</author><pubDate>Wed, 07 Sep 2016 13:29:00 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;
#define Key_value ch[ch[root][1]][0]
const int MAXN=100010;
int pre[MAXN],ch[MAXN][2],size[MAXN],root,tot1;//父结点、左右孩子、子树规模、根结点、结点数量
int key]]></description><category></category></item><item><title><![CDATA[Splay——kuangnin的模版]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/52452894</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/52452894</guid><author>sinat_33397705</author><pubDate>Tue, 06 Sep 2016 19:39:51 +0800</pubDate><description><![CDATA[bzoj1588
#include 
#include 
#include 
#include 
using namespace std;
const int INF=0x3f3f3f3f;
const int MAXN=1000010;
int pre[MAXN],ch[MAXN][2],key[MAXN];
int root,tot1;

void NewNode(int &r,int fa]]></description><category></category></item><item><title><![CDATA[AVL树模版]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/52445290</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/52445290</guid><author>sinat_33397705</author><pubDate>Tue, 06 Sep 2016 00:05:24 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;
struct AVL_tree_node
{
    char name[31];
    int cnt,height;
    AVL_tree_node *pleft;
    AVL_tree_node *pright;
};
int n=0,W=0;
int Height(AVL_tree_n]]></description><category></category></item><item><title><![CDATA[同余方程的合并——codeforces338D]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/52401798</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/52401798</guid><author>sinat_33397705</author><pubDate>Thu, 01 Sep 2016 17:18:05 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
using namespace std;
long long m[10002],n,M,lcm;
int k;
long long gcd(long long a,long long b)
{
    return b?gcd(b,a%b):a;
}
long long egcd(long long a,long long b]]></description><category></category></item><item><title><![CDATA[高斯消元枚举自由元——poj1222]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/52348848</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/52348848</guid><author>sinat_33397705</author><pubDate>Sun, 28 Aug 2016 23:10:58 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
using namespace std;
int a[230][230],x[230],free_x[230],free_num,r,c;
int Gauss()
{
    int k,col,max_r,i,j;
    for(free_num=k=col=0;k<r&&col<c;col++)  //枚举行，列从0开始]]></description><category></category></item><item><title><![CDATA[高斯消元]]></title><link>https://blog.youkuaiyun.com/sinat_33397705/article/details/52346473</link><guid>https://blog.youkuaiyun.com/sinat_33397705/article/details/52346473</guid><author>sinat_33397705</author><pubDate>Sun, 28 Aug 2016 16:34:02 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
using namespace std;
int a[72][72],x[72],r,c,mod;
int gcd(int a,int b)
{
    return b?gcd(b,a%b):a;
}
int lcm(int a,int b)
{
    return a/gcd(a,b)*b;
}
int]]></description><category></category></item></channel></rss>