<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[secant007的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/secant007</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; secant007]]></copyright><item><title><![CDATA[stl学习]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/115227018</link><guid>https://blog.youkuaiyun.com/secant007/article/details/115227018</guid><author>secant007</author><pubDate>Fri, 15 Jul 2022 15:18:31 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;string&gt;
#include &lt;queue&gt;
using namespace std;

int main(){
    queue&lt;string&gt;q;

    q.push("123");
    q.push("456");
    q.push("789");

    cout&lt;&lt;q.size()&lt;&lt;endl;

    cout&lt;&lt;q.front()]]></description><category></category></item><item><title><![CDATA[conda基本操作]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/123215514</link><guid>https://blog.youkuaiyun.com/secant007/article/details/123215514</guid><author>secant007</author><pubDate>Tue, 01 Mar 2022 20:42:37 +0800</pubDate><description><![CDATA[conda管理
Conda管理包
# 安装命令
conda install package_name
# 安装numpy,输入
conda install numpy
# 安装 matplotlib
conda install matplotlib
# 查看已安装的包
conda list
# 搜索安装包
conda search search_term
# 同时安装多个包
conda install numpy scipy pandas
# 安装指定版本的包
conda install numpy=1.1]]></description><category></category></item><item><title><![CDATA[一只小蜜蜂...]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/120217110</link><guid>https://blog.youkuaiyun.com/secant007/article/details/120217110</guid><author>secant007</author><pubDate>Fri, 10 Sep 2021 10:45:53 +0800</pubDate><description><![CDATA[Problem Description
有一只经过训练的蜜蜂只能爬向右侧相邻的蜂房，不能反向爬行。请编程计算蜜蜂从蜂房a爬到蜂房b的可能路线数。
其中，蜂房的结构如下所示。
Input
输入数据的第一行是一个整数N,表示测试实例的个数，然后是N 行数据，每行包含两个整数a和b(0&lt;a&lt;b&lt;50)。
Output
对于每个测试实例，请输出蜜蜂从蜂房a爬到蜂房b的可能路线数，每个实例的输出占一行。
Sample Input
2
1 2
3 6
Sample Output
1
3
#includ]]></description><category></category></item><item><title><![CDATA[hdu母牛的故事]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/120215840</link><guid>https://blog.youkuaiyun.com/secant007/article/details/120215840</guid><author>secant007</author><pubDate>Fri, 10 Sep 2021 10:11:05 +0800</pubDate><description><![CDATA[Problem Description
有一头母牛，它每年年初生一头小母牛。每头小母牛从第四个年头开始，每年年初也生一头小母牛。请编程实现在第n年的时候，共有多少头母牛？
Input
输入数据由多个测试实例组成，每个测试实例占一行，包括一个整数n(0&lt;n&lt;55)，n的含义如题目中描述。
n=0表示输入数据的结束，不做处理。
Output
对于每个测试实例，输出在第n年的时候母牛的数量。
每个输出占一行。
Sample Input
2
4
5
0
Sample Output
2
4
6

在第5年]]></description><category></category></item><item><title><![CDATA[c++文件组织]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/118874618</link><guid>https://blog.youkuaiyun.com/secant007/article/details/118874618</guid><author>secant007</author><pubDate>Sun, 18 Jul 2021 11:41:45 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[c++之重载函数和函数模板]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/118822749</link><guid>https://blog.youkuaiyun.com/secant007/article/details/118822749</guid><author>secant007</author><pubDate>Fri, 16 Jul 2021 20:52:28 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
using namespace std;

int max_(int a,int b){
	return (a&gt;b?a:b);
}
double max_(double a,double b){
	return (a&gt;b?a:b);
}
long max_(long a,long b){
	return (a&gt;b?a:b);
}

int main(){
	int a=1,b=0; 
	cout&lt;&lt;max_(a,b);
	
	d]]></description><category></category></item><item><title><![CDATA[关于函数传参的再理解（含引用）]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/117479593</link><guid>https://blog.youkuaiyun.com/secant007/article/details/117479593</guid><author>secant007</author><pubDate>Wed, 02 Jun 2021 22:32:16 +0800</pubDate><description><![CDATA[情景引入—小小日记
6/1的我开开心心的度过儿童节，复习一哈数据结构课上的内容。

but！，这红红的一条让我心慌。
下面是当时的源码（二叉排序树）
#include &lt;iostream&gt;
using namespace std;
typedef int datatype;
struct  Node{
    datatype data =0;
    Node *lchild = NULL, *rchild = NULL;
};


void Insert(Node *root,datatyp]]></description><category></category></item><item><title><![CDATA[如何理解最小生成树]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/117091554</link><guid>https://blog.youkuaiyun.com/secant007/article/details/117091554</guid><author>secant007</author><pubDate>Thu, 20 May 2021 20:57:41 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
using namespace std;
#define MaxSise 10
#define positive_infinity 1000
int visited[MaxSise]={0};
typedef char datatype;
typedef struct {
    datatype vertex[MaxSise];
    int edge[MaxSise][MaxSise];
    int vertexnum,edgenum;
}MGr]]></description><category></category></item><item><title><![CDATA[并查集]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/116764643</link><guid>https://blog.youkuaiyun.com/secant007/article/details/116764643</guid><author>secant007</author><pubDate>Thu, 13 May 2021 20:22:28 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
using namespace std;
const int M=1000;
int n,m,p[M];
int find(int x){
   int r=x;
   while(p[r]!=r){//寻找根节点
       r=p[r];
   }
   int i=x,t;
   while(i!=r){//路径压缩
       t=p[i];
       p[i]=r;
       i=t;
   }
   return r;
}
void]]></description><category></category></item><item><title><![CDATA[洛谷P1238 走迷宫]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/116636100</link><guid>https://blog.youkuaiyun.com/secant007/article/details/116636100</guid><author>secant007</author><pubDate>Tue, 11 May 2021 07:52:31 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;vector&gt;
using namespace std;
int m,n,a[15][15],book[15][15],startx,starty,dx,dy,flag=1;
vector&lt;pair&lt;int ,int &gt; &gt;v;
void dfs(int x,int y){
    int tx=0,ty=0,k;
    int next[4][2]={{0,-1},{-1,0},{0,1},{1,]]></description><category></category></item><item><title><![CDATA[洛谷P2241 统计方形]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/116526467</link><guid>https://blog.youkuaiyun.com/secant007/article/details/116526467</guid><author>secant007</author><pubDate>Sat, 08 May 2021 14:27:28 +0800</pubDate><description><![CDATA[此题需要公式如下：
矩形=正方形+长方形


#include &lt;iostream&gt;
using namespace std;

int main(){
    int n,m,retangle=0,square=0,i,j;
    cin&gt;&gt;n&gt;&gt;m;
    retangle=n*(n+1)*m*(m+1)/4;//计算矩形个数
    i=min(n,m);j=max(n,m);
    while(i){//计算正方形个数
        square+=(i-]]></description><category></category></item><item><title><![CDATA[P3613 【深基15.例2】寄包柜]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/116242535</link><guid>https://blog.youkuaiyun.com/secant007/article/details/116242535</guid><author>secant007</author><pubDate>Wed, 28 Apr 2021 20:27:23 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;map&gt;
using namespace std;
map&lt;int ,map&lt;int ,int &gt; &gt;data;
int main(){

    int n,m,q,x,y,k,z;
    cin&gt;&gt;n&gt;&gt;q;
    for(int i=1;i&lt;=q;i++){
        scanf("%d%d%d",&amp;]]></description><category></category></item><item><title><![CDATA[stl map]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/116241888</link><guid>https://blog.youkuaiyun.com/secant007/article/details/116241888</guid><author>secant007</author><pubDate>Wed, 28 Apr 2021 20:14:45 +0800</pubDate><description><![CDATA[map集合以键与值组合为元素，每个元素拥有一个键和一个值，集合以键作为排序标准。集合中各元素的键是唯一的，不重复。map可以看做是一种能使用任意下表的关联式容器。
eg：从字符串中删除字符串
#include &lt;iostream&gt;
#include &lt;map&gt;
#include &lt;string&gt;
using namespace std;

void print(map&lt;string,int&gt;t){
    map&lt;string,int&gt;::iter]]></description><category></category></item><item><title><![CDATA[不区分大小写的字符串查找]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/116031235</link><guid>https://blog.youkuaiyun.com/secant007/article/details/116031235</guid><author>secant007</author><pubDate>Thu, 22 Apr 2021 20:44:18 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;string&gt;
using namespace std;
int main(){
    int count=0;
    string str1,str2;
    cin&gt;&gt;str1;
    getchar();
    getline(cin,str2);
    //大写转小写
    for(int i=0;i&lt;str1.size();i++){
        if((str1[i]&gt;=]]></description><category></category></item><item><title><![CDATA[洛谷P4715 【深基16.例1】淘汰赛]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/115919125</link><guid>https://blog.youkuaiyun.com/secant007/article/details/115919125</guid><author>secant007</author><pubDate>Tue, 20 Apr 2021 21:11:42 +0800</pubDate><description><![CDATA[使用队列
#include &lt;iostream&gt;
#include&lt;queue&gt;

using namespace std;
int main(){

    int n,l,x;
    cin&gt;&gt;n;
    l=1&lt;&lt;n;
    queue&lt;pair&lt; int ,int &gt; &gt;q;
    for(int i=1;i&lt;=l;i++){
        cin&gt;&gt;x;
        q.push(make_pa]]></description><category></category></item><item><title><![CDATA[顺序表的实现]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/115837208</link><guid>https://blog.youkuaiyun.com/secant007/article/details/115837208</guid><author>secant007</author><pubDate>Sun, 18 Apr 2021 18:16:29 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;
#include &lt;cstdlib&gt;
#define max_size 10
typedef int datatype;

typedef struct {
    datatype data[max_size];
    int length;
}seqlist;

int Creatlist(seqlist *L,const datatype a[],int n){
    if(n&gt;max_size){
        printf("n]]></description><category></category></item><item><title><![CDATA[关于递归]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/115407031</link><guid>https://blog.youkuaiyun.com/secant007/article/details/115407031</guid><author>secant007</author><pubDate>Fri, 02 Apr 2021 20:10:06 +0800</pubDate><description><![CDATA[计算n的阶乘
#include &lt;iostream&gt;
using namespace std;
int factorial(int n){
    if(n==1)return 1;
    else return n*factorial(n-1);
}
int main(){
    cout&lt;&lt;factorial(5);
    return 0;
}


]]></description><category></category></item><item><title><![CDATA[lower_bound的使用]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/115371649</link><guid>https://blog.youkuaiyun.com/secant007/article/details/115371649</guid><author>secant007</author><pubDate>Thu, 01 Apr 2021 13:08:16 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;algorithm&gt;
using namespace std;
int main(){
    
    int a[5]={1,2,3,4,5};
    int b[5]={1,3,4,5,2};
    int *pos;
    pos=lower_bound(a,a+5,2);//lower_bound取的是第一个不小于‘2’（指定值）的元素的地址
    int idx=distance(a,pos);//用dist]]></description><category></category></item><item><title><![CDATA[二分搜索]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/115367420</link><guid>https://blog.youkuaiyun.com/secant007/article/details/115367420</guid><author>secant007</author><pubDate>Thu, 01 Apr 2021 10:00:03 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
using namespace std;
int search(int a[],int n,int key);
int main(){
    int n,key;
    cin&gt;&gt;n&gt;&gt;key;
    int a[n];
    for(int i=0;i&lt;n;i++){
        cin&gt;&gt;a[i];
    }
    cout&lt;&lt;search(a,n,key);

    return ]]></description><category></category></item><item><title><![CDATA[vector]]></title><link>https://blog.youkuaiyun.com/secant007/article/details/115217477</link><guid>https://blog.youkuaiyun.com/secant007/article/details/115217477</guid><author>secant007</author><pubDate>Fri, 26 Mar 2021 09:15:05 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;vector&gt;
using namespace std;

int main(){
    vector&lt;int&gt;v;
    v.push_back(444);
    v.push_back(666);
    v.push_back(233);

    v.pop_back();//删除最后一个元素（233）
    v[1]=777;
    for(size_t i=0;i&lt;v.size();i]]></description><category></category></item></channel></rss>