<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[StringArrow]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Loi_StringArrow</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Loi_StringArrow]]></copyright><item><title><![CDATA[Loi_Cunese|CODEVS|1557|热浪]]></title><link>https://blog.youkuaiyun.com/Loi_StringArrow/article/details/53177242</link><guid>https://blog.youkuaiyun.com/Loi_StringArrow/article/details/53177242</guid><author>Loi_StringArrow</author><pubDate>Tue, 15 Nov 2016 20:59:46 +0800</pubDate><description><![CDATA[#include
#include
#include
#include

using namespace std;
int t,C,S,e,tot=0;

struct hh
{
	int f,t,c;
}a[12500];
int head[6500],jl[6500],ne[12500];
bool bo[6500];
queueq;

void build(int x,int y,int z]]></description><category></category></item><item><title><![CDATA[Loi_Cunese|最小生成树Prim]]></title><link>https://blog.youkuaiyun.com/Loi_StringArrow/article/details/53177220</link><guid>https://blog.youkuaiyun.com/Loi_StringArrow/article/details/53177220</guid><author>Loi_StringArrow</author><pubDate>Tue, 15 Nov 2016 20:56:27 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;
const int inf=0x3f; 
int n,jl[105];
int a[104][105];
bool bo[105];
int cs=1,tot=0;
int main()
{
	memset(bo,0,sizeof(bo));
	cin>>n;
	for(int i=1;i<=n;i++]]></description><category></category></item><item><title><![CDATA[2016.11.15|知识整理]]></title><link>https://blog.youkuaiyun.com/Loi_StringArrow/article/details/53173919</link><guid>https://blog.youkuaiyun.com/Loi_StringArrow/article/details/53173919</guid><author>Loi_StringArrow</author><pubDate>Tue, 15 Nov 2016 18:29:14 +0800</pubDate><description><![CDATA[tape1.取模的运算规则:(a*b)%c=[(a%c)*(b%c)]%c
          可用于加减乘的运算,不能用于除的运算,转化后的式子复杂度更低,一般数据不会爆long long.
tape2.最大公因数: #include
__gcd(a,b);
          最小公倍数: a*b/(__gcd(a,b));
//两数之积除以最大公因数等于最小公倍数.
tape3.]]></description><category></category></item><item><title><![CDATA[CODEVS|1008|数的计算]]></title><link>https://blog.youkuaiyun.com/Loi_StringArrow/article/details/53164440</link><guid>https://blog.youkuaiyun.com/Loi_StringArrow/article/details/53164440</guid><author>Loi_StringArrow</author><pubDate>Mon, 14 Nov 2016 21:00:43 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
int tot=1;
void js(int x)
{
	if(x==1)
	return;
	x=x/2;
	for(int i=1;i<=x;i++)
	{
		tot++;
		js(i);
	}
}
int main()
{
	int n;
	cin>>n;
	js(n);
	cout<<tot;
}]]></description><category></category></item><item><title><![CDATA[CODEVS|1053|笨小猴]]></title><link>https://blog.youkuaiyun.com/Loi_StringArrow/article/details/53164401</link><guid>https://blog.youkuaiyun.com/Loi_StringArrow/article/details/53164401</guid><author>Loi_StringArrow</author><pubDate>Mon, 14 Nov 2016 20:57:36 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
using namespace std;
string w;
char h[110];
int hh[110];
char ch;
int n,m,cs=0;
int jg;
int main()
{
	memset(hh,0,sizeof(hh));
	cin>>w;
	int l=w.length();
	for(int ]]></description><category></category></item></channel></rss>