<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[s6ddf的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/s6ddf</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; s6ddf]]></copyright><item><title><![CDATA[2021-07-18]]></title><link>https://blog.youkuaiyun.com/s6ddf/article/details/118878442</link><guid>https://blog.youkuaiyun.com/s6ddf/article/details/118878442</guid><author>s6ddf</author><pubDate>Sun, 18 Jul 2021 15:59:50 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;
#include 
#include
#include&lt;string.h&gt;
using namespace std;
int main(){
string a,t;
getline(cin,a);
map&lt;string,int&gt; mp;
for(int i=0;i&lt;a.length();i++){
if(isalnum(a[i])){
a[i]=tolower(a[i]);
t+=a[i];
}
if(!isalnum]]></description><category></category></item><item><title><![CDATA[顺序表 基本操作]]></title><link>https://blog.youkuaiyun.com/s6ddf/article/details/109728899</link><guid>https://blog.youkuaiyun.com/s6ddf/article/details/109728899</guid><author>s6ddf</author><pubDate>Mon, 16 Nov 2020 20:19:53 +0800</pubDate><description><![CDATA[【属于配套书籍的源代码】
顺序表的基本操作：创建，添加结点，删除结点，输出等
struct SqList
{
ElemType elem; // 存储空间基址
int length; // 当前长度
int listsize; // 当前分配的存储容量(以sizeof(ElemType)为单位)
};
Status InitList(SqList &amp;L) // 算法2.3
{ // 操作结果：构造一个空的顺序线性表
L.elem=(ElemType)malloc(LIST_INIT_SIZE*siz]]></description><category></category></item><item><title><![CDATA[结构体]]></title><link>https://blog.youkuaiyun.com/s6ddf/article/details/109366825</link><guid>https://blog.youkuaiyun.com/s6ddf/article/details/109366825</guid><author>s6ddf</author><pubDate>Thu, 29 Oct 2020 19:09:23 +0800</pubDate><description><![CDATA[结构体构造函数，13行会报错，因为没有相应构造函数，如果不写78行不会报错，系统有个不赋值的默认构造函数，注意。。

]]></description><category></category></item><item><title><![CDATA[三进制模拟]]></title><link>https://blog.youkuaiyun.com/s6ddf/article/details/109366435</link><guid>https://blog.youkuaiyun.com/s6ddf/article/details/109366435</guid><author>s6ddf</author><pubDate>Thu, 29 Oct 2020 18:46:10 +0800</pubDate><description><![CDATA[for(int i=1;i&lt;=m;++i)
tmp*=3;
for(int i=0;i&lt;tmp;++i)
{
int t=i,cnt=0;
ll sum1=0,sum2=0;
while(t)
{
if(t%31)sum1+=b[cnt];
else if(t%32)sum2+=b[cnt];
cnt++,t/=3;
}
大意如此

]]></description><category></category></item><item><title><![CDATA[二进制枚举]]></title><link>https://blog.youkuaiyun.com/s6ddf/article/details/109350297</link><guid>https://blog.youkuaiyun.com/s6ddf/article/details/109350297</guid><author>s6ddf</author><pubDate>Thu, 29 Oct 2020 07:51:07 +0800</pubDate><description><![CDATA[大意 从五个数里面选 能组成素数的个数
二进制枚举，可以用两个状态代表的
#include&lt;stdio.h&gt;
#include&lt;bits/stdc++.h&gt;
using namespace std;
typedef long long int ll;
int check(int x){
if(x&lt;2){return 0;}
int k=1;
for(int i=2; i&lt;x; i++)
{
if(x%i0)
{
k=0;
}
}
if(k1)return 1;
else ]]></description><category></category></item><item><title><![CDATA[快速幂和取余]]></title><link>https://blog.youkuaiyun.com/s6ddf/article/details/109328022</link><guid>https://blog.youkuaiyun.com/s6ddf/article/details/109328022</guid><author>s6ddf</author><pubDate>Wed, 28 Oct 2020 10:43:00 +0800</pubDate><description><![CDATA[poj 1995
需要的知识，
快速幂和取模的运算
1   (a+b)%p=(a%p+b%p)%p


(a – b) % p = (a % p – b % p) % p


(a * b) % p = (a % p * b % p) % p


(a^b) % p = ((a % p)^b) % p


5… ((a+b) % p + c) % p = (a + (b+c) % p) % p


((ab) % p * c)% p = (a * (bc) % p) % p


((a +b)% p * c]]></description><category></category></item><item><title><![CDATA[memset相关]]></title><link>https://blog.youkuaiyun.com/s6ddf/article/details/109274092</link><guid>https://blog.youkuaiyun.com/s6ddf/article/details/109274092</guid><author>s6ddf</author><pubDate>Sun, 25 Oct 2020 15:21:37 +0800</pubDate><description><![CDATA[所以，在memset使用时要千万小心，在给char以外的数组赋值时，只能初始化为0或者-1。

]]></description><category></category></item></channel></rss>