<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[FutureCiyu的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/FutureCiyu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; FutureCiyu]]></copyright><item><title><![CDATA[string]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/104424432</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/104424432</guid><author>FutureCiyu</author><pubDate>Fri, 21 Feb 2020 11:10:44 +0800</pubDate><description><![CDATA[NEFU-194 回文字符串-string
#include &lt;bits/stdc++.h&gt;
using namespace std;
int main()
{
    int n;
    string a,b;
    cin&gt;&gt;n;
    while(n--)
    {
        cin&gt;&gt;a;
        b=a;
        reve...]]></description><category></category></item><item><title><![CDATA[set]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/104369967</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/104369967</guid><author>FutureCiyu</author><pubDate>Thu, 20 Feb 2020 15:09:42 +0800</pubDate><description><![CDATA[set有排序，去重的功能
访问set 迭代器
set&lt;int&gt;::iterator it;
    for(it =a.begin();it!= a.end();++it)
    {
        printf("%d ",*it);
    }


]]></description><category></category></item><item><title><![CDATA[map]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/104410104</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/104410104</guid><author>FutureCiyu</author><pubDate>Thu, 20 Feb 2020 14:35:17 +0800</pubDate><description><![CDATA[map翻译为映射。
map 的用途至少有以下三种情形：
1）需要建立字符（串）与整数之间的映射，使用 map 可以减少代码量。
2）判断大整数（比如几千位）或者其他类型数据是否存在，可以把map当布尔型数组使用（哈希表）。
3）字符串与字符串之间的映射。
NEFU1687- 保龄球
#include &lt;bits/stdc++.h&gt;

using namespace std;
map&l...]]></description><category></category></item><item><title><![CDATA[优先队列]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/104330986</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/104330986</guid><author>FutureCiyu</author><pubDate>Tue, 18 Feb 2020 09:58:32 +0800</pubDate><description><![CDATA[（降序，从大到小）
priority_queue &lt;int,vector,less &gt; q;
（升序，从小到大）
priority_queue &lt;int,vector,greater &gt;q;
模板题 合并果子
#include&lt;bits/stdc++.h&gt;
using namespace std;
int n,x;
int ans;
priority_queue...]]></description><category></category></item><item><title><![CDATA[素数筛]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/104318559</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/104318559</guid><author>FutureCiyu</author><pubDate>Fri, 14 Feb 2020 20:17:40 +0800</pubDate><description><![CDATA[素数判定
#include &lt;iostream&gt;
#include&lt;bits/stdc++.h&gt;
using namespace std;
typedef long long LL;
const int N=1e7+1;
int prime[N];
int b[N];
int cnt=0,m=1e7;
int init()
{
    memset(b,1,sizeof(b...]]></description><category></category></item><item><title><![CDATA[DFS-深度优先搜索]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/104130645</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/104130645</guid><author>FutureCiyu</author><pubDate>Wed, 05 Feb 2020 20:23:02 +0800</pubDate><description><![CDATA[模板题
①迷宫寻路
#include &lt;iostream&gt;
#include&lt;bits/stdc++.h&gt;
using namespace std;
int n,m;
string a[1001];
int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};//定义上下左右四个方向
int beginx,beginy,endx,endy;
int ...]]></description><category></category></item><item><title><![CDATA[队列]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/104099735</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/104099735</guid><author>FutureCiyu</author><pubDate>Tue, 28 Jan 2020 15:20:09 +0800</pubDate><description><![CDATA[初始化 (定义) 队列	queue<int> q;	int 可用其他数据类型替换
入队	q.push(x)	将元素添加到队尾
出队	q.pop()	移除队首元素
返回队首元素	q.front()	不会删除队首元素
获取队尾元素	q.back()	不会删除队尾元素
判断队列是否为空	q.empty();	为空返回 1
获取队列大小	q.size()	返回队列中元素个数]]></description><category></category></item><item><title><![CDATA[②]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/103894763</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/103894763</guid><author>FutureCiyu</author><pubDate>Thu, 09 Jan 2020 10:50:58 +0800</pubDate><description><![CDATA[栈
神奇的事情发生了
#include&lt;bits/stdc++.h&gt;
using namespace std;
char ch[105],a[105];
stack&lt;char&gt;s;
int main()
{
	while(~scanf("%s",ch))
	{
		int len=strlen(ch);
		for(int i=0;i&lt;len;i++)
		{
			...]]></description><category></category></item><item><title><![CDATA[2020.1.6大一寒假集训七 ——栈]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/103858724</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/103858724</guid><author>FutureCiyu</author><pubDate>Wed, 08 Jan 2020 16:46:29 +0800</pubDate><description><![CDATA[栈-程序员输入问题
#include&lt;bits/stdc++.h&gt;
using namespace std;

int main()
{
    stack&lt;char&gt;v1,v2;
    char str[101];
    gets(str);
    int len=strlen(str);
    for(int i=0;i&lt;len;i++)
    {
  ...]]></description><category></category></item><item><title><![CDATA[①]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/103880564</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/103880564</guid><author>FutureCiyu</author><pubDate>Tue, 07 Jan 2020 20:05:42 +0800</pubDate><description><![CDATA[陈老师发奖金
#include &lt;bits/stdc++.h&gt;
using namespace std;
const int N=1e5+10;
struct stu
{
    int num,sum,cnt,c,e,m;

}a[N];
bool cmp(stu a,stu b)
{
    if(a.sum!=b.sum) return a.sum&gt;b.sum;
    e...]]></description><category></category></item><item><title><![CDATA[2020.1.5 大一寒假集训六 二分查找]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/103844295</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/103844295</guid><author>FutureCiyu</author><pubDate>Sun, 05 Jan 2020 16:48:32 +0800</pubDate><description><![CDATA[关于lower_bound( )和upper_bound( )的常见用法
PROBLEM
lower_bound( )和upper_bound( )都是利用二分查找的方法在一个排好序的数组中进行查找的。
lower_bound( begin,end,num)：从数组的begin位置到end-1位置二分查找第一个大于或等于num的数字，找到返回该数字的地址，不存在则返回end。通过返回的地址减去起始...]]></description><category></category></item><item><title><![CDATA[位运算和二进制枚举2020.1.3]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/103835850</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/103835850</guid><author>FutureCiyu</author><pubDate>Sat, 04 Jan 2020 17:47:18 +0800</pubDate><description><![CDATA[A^B
    两数不同才是1。

    通常用于对二进制的特定一位进行取反，可以对两个数进行交换。

    常用性质：A^B^B=A，即B^B=0,可以用作判断一个数出现的次数，0^A=A，并且可以用作字符串的比较。]]></description><category></category></item><item><title><![CDATA[大一寒假训练五（GCD&&快速幂）2020.1.4]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/103835505</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/103835505</guid><author>FutureCiyu</author><pubDate>Sat, 04 Jan 2020 17:24:51 +0800</pubDate><description><![CDATA[最大公约数和最小公倍数
#include &lt;iostream&gt;
#include&lt;bits/stdc++.h&gt;
using namespace std;
long long gcd(long long a,long long b)
{
    return b?gcd(b,a%b):a;

}
long long lcm(long long a,long long b)
{...]]></description><category></category></item><item><title><![CDATA[2020.1.2大一寒假集训三（暴力枚举）]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/103818446</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/103818446</guid><author>FutureCiyu</author><pubDate>Fri, 03 Jan 2020 12:42:19 +0800</pubDate><description><![CDATA[二倍的问题
#include &lt;iostream&gt;
#include&lt;bits/stdc++.h&gt;
using namespace std;

int main()
{
    int i,j,t,n,a[100];
    int ans;
    scanf("%d",&amp;t);
    while(t--)
    {
        n=ans=0;
    ...]]></description><category></category></item><item><title><![CDATA[2020.1.1大一寒假集训二（桶排序与结构体排序）]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/103818276</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/103818276</guid><author>FutureCiyu</author><pubDate>Fri, 03 Jan 2020 12:31:55 +0800</pubDate><description><![CDATA[A题 谁考了第K名

#include &lt;bits/stdc++.h&gt;
using namespace std;
struct stu
{
	int num;
	double x;
};
bool cmp(stu a,stu b)
{

    return a.x&gt;b.x;
}
int main()
{
	stu a[100];
	int n,k;
	int i;
	whil...]]></description><category></category></item><item><title><![CDATA[gcd  lcm]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/103804133</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/103804133</guid><author>FutureCiyu</author><pubDate>Thu, 02 Jan 2020 14:42:55 +0800</pubDate><description><![CDATA[#include &lt;bits/stdc++.h&gt;
using namespace std;
long long gcd(long long a,long long b)
{return b?gcd(b,a%b):a;}
long long lcm(long long a,long long b)
{return a/gcd(a,b)*b;}
int main()
{
long long...]]></description><category></category></item><item><title><![CDATA[快速幂取模算法]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/103793362</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/103793362</guid><author>FutureCiyu</author><pubDate>Wed, 01 Jan 2020 15:44:26 +0800</pubDate><description><![CDATA[http://acm.nefu.edu.cn/problemShow.php?problem_id=601
ab 对mod 取模
long  long f(long long  a,long long  b,long long  mod)
{
int s=1;
while(b&gt;0)	
{
if(b%2==1)
{
s=sa%mod;
b=b-1;
}
a=a*a%mod;
b=b/2;
}
...]]></description><category></category></item><item><title><![CDATA[HDU2045 RPG问题]]></title><link>https://blog.youkuaiyun.com/FutureCiyu/article/details/103674569</link><guid>https://blog.youkuaiyun.com/FutureCiyu/article/details/103674569</guid><author>FutureCiyu</author><pubDate>Mon, 23 Dec 2019 22:25:34 +0800</pubDate><description><![CDATA[HDU2045 RPG问题
#include&lt;stdio.h&gt;
int main()
{
int i,n;
long long f[100];
while(~scanf("%d",&amp;n))
{
f[1]=3;
f[2]=6;
f[3]=6;
for(i=4;i&lt;=50;i++)
{
f[i]=f[i-1]+2*f[i-2];
}
printf("%lld",f[n]);
...]]></description><category></category></item></channel></rss>