<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Dai]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_40540973</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_40540973]]></copyright><item><title><![CDATA[1046 Shortest Distance (20)（20 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81941686</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81941686</guid><author>qq_40540973</author><pubDate>Wed, 22 Aug 2018 12:01:28 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;algorithm&amp;gt;
using namespace std;
const int maxn = 1e5 + 10;
int a[maxn], n;
int main()
{
	scanf(&quot;%d&quot;, &amp;amp;n);
	int x, tot = 0;
	for (int i = 1; i &amp;lt;= n; i++)...]]></description><category></category></item><item><title><![CDATA[1042 Shuffling Machine (20)（20 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81941489</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81941489</guid><author>qq_40540973</author><pubDate>Wed, 22 Aug 2018 11:49:38 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;string&amp;gt;
#include&amp;lt;cstring&amp;gt;
using namespace std;
const int maxn = 1e3 + 10;
int num[maxn], temp[maxn],shuff[maxn], k;
void show(int n)
{
	if (n &amp;lt;= 13)pr...]]></description><category></category></item><item><title><![CDATA[1018 锤子剪刀布（20 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81941279</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81941279</guid><author>qq_40540973</author><pubDate>Wed, 22 Aug 2018 11:39:21 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;map&amp;gt;
using namespace std;
char num[3] = { 'B','C','J' };
int a[3], b[3];
int n;
int as, ap, af, bs, bp, bf;
void show(int a[])
{
	int...]]></description><category></category></item><item><title><![CDATA[1012 数字分类 (20)（20 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81940875</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81940875</guid><author>qq_40540973</author><pubDate>Wed, 22 Aug 2018 11:21:41 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;vector&amp;gt;
using namespace std;
int n, x;
vector&amp;lt;int&amp;gt;a[6];
int main()
{
	scanf(&quot;%d&quot;, &amp;amp;n);
	while (n--)
	{
		scanf(&quot;%d&quot;, &amp;a]]></description><category></category></item><item><title><![CDATA[1008 数组元素循环右移问题 (20)（20 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81940604</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81940604</guid><author>qq_40540973</author><pubDate>Wed, 22 Aug 2018 11:11:37 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;algorithm&amp;gt;
using namespace std;
const int maxn = 1e4 + 10;
int n, m;
int a[maxn];
int main()
{
	scanf(&quot;%d%d&quot;, &amp;amp;n, &amp;amp;m);
	for (int i = 0; i &amp;lt; n; i++)s...]]></description><category></category></item><item><title><![CDATA[1046 划拳（15 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81940422</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81940422</guid><author>qq_40540973</author><pubDate>Wed, 22 Aug 2018 11:04:37 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;algorithm&amp;gt;
using namespace std;
int n;
int main()
{
	scanf(&quot;%d&quot;, &amp;amp;n);
	int acount = 0, bcount = 0;
	while (n--)
	{
		int a, ax, b, bx;
		scanf(&quot;%d%d%d%d&quot;, ...]]></description><category></category></item><item><title><![CDATA[1026 程序运行时间（15 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81940252</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81940252</guid><author>qq_40540973</author><pubDate>Wed, 22 Aug 2018 10:58:54 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;cmath&amp;gt;
#include&amp;lt;algorithm&amp;gt;
using namespace std;
const int CLK_TCK = 100;
int c1, c2;
int main()
{
	scanf(&quot;%d%d&quot;, &amp;amp;c1, &amp;amp;c2);
	int t = round((c2 - ...]]></description><category></category></item><item><title><![CDATA[1016 部分A+B（15 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81940107</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81940107</guid><author>qq_40540973</author><pubDate>Wed, 22 Aug 2018 10:53:50 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;string&amp;gt;
#include&amp;lt;cstring&amp;gt;
using namespace std;
string a, b;
int da, db;
typedef long long LL;
LL getnum(string s, int d)
{
	int ans = 0;
	for (int i = 0;...]]></description><category></category></item><item><title><![CDATA[1011 A+B和C (15)（15 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81940003</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81940003</guid><author>qq_40540973</author><pubDate>Wed, 22 Aug 2018 10:49:10 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
typedef long long LL;
LL a, b, c;
int t;
int main()
{
	scanf(&quot;%d&quot;, &amp;amp;t);
	for(int i=1;i&amp;lt;=t;i++)
	{
		printf(&quot;Case #%d: &quot;, i);
		scanf(&quot;%lld%lld%lld&quot;, &amp;amp;a, &amp;amp;b, &amp]]></description><category></category></item><item><title><![CDATA[1001 害死人不偿命的(3n+1)猜想 (15)（15 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81939856</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81939856</guid><author>qq_40540973</author><pubDate>Wed, 22 Aug 2018 10:42:50 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
using namespace std;
int main()
{
	int n, ans = 0;
	cin &amp;gt;&amp;gt; n;
	while (n != 1)
	{
		if (n % 2 == 0)n /= 2;
		else n = (3 * n + 1) / 2;
		ans++;
	}
	cout &amp;lt;&amp;lt; ans;
	r...]]></description><category></category></item><item><title><![CDATA[搬家啦]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81452668</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81452668</guid><author>qq_40540973</author><pubDate>Mon, 06 Aug 2018 13:24:56 +0800</pubDate><description><![CDATA[https://www.jianshu.com/u/c241bdd0abae

已搬家到简书]]></description><category></category></item><item><title><![CDATA[Tensorflow、keras、pytorch、cuda（GPU加速）在Windows10下的配置]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81452306</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81452306</guid><author>qq_40540973</author><pubDate>Mon, 06 Aug 2018 13:07:09 +0800</pubDate><description><![CDATA[之前这些装过好多次，踩了挺多坑的，这次帮同学装，顺手记录一下配置过程

目录

anaconda安装

安装

更换源

TensorFlow（GPU）

GPU

CPU(不建议安装CPU版)

cuda配置GPU加速

cuda

cudnn

建议大家安装anaconda，有挺多同学自己在linux里面自己下载需要的模块，这样也可以，但是不如直接anaconda比较方便，里面有好多库都包含进...]]></description><category></category></item><item><title><![CDATA[1079 Total Sales of Supply Chain (25)（25 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81452191</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81452191</guid><author>qq_40540973</author><pubDate>Mon, 06 Aug 2018 12:34:29 +0800</pubDate><description><![CDATA[DFS:递归终点为叶子结点，此时计算乘积


#include&amp;lt;iostream&amp;gt;
#include&amp;lt;queue&amp;gt;
#include&amp;lt;vector&amp;gt;
using namespace std;
const int maxn = 1e5 + 10;
struct node {
	double p, product;
	vector&amp;lt;int&amp;gt;child;
...]]></description><category></category></item><item><title><![CDATA[1102 Invert a Binary Tree（25 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81449809</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81449809</guid><author>qq_40540973</author><pubDate>Mon, 06 Aug 2018 10:38:10 +0800</pubDate><description><![CDATA[静态树存储，找一下根节点，遍历的时候左右节点换一下就可以了

算法笔记上给的方法是：后序遍历时交换左右子树，重建二叉树，再进行遍历


#include&amp;lt;iostream&amp;gt;
#include&amp;lt;cstring&amp;gt;
#include&amp;lt;queue&amp;gt;
#include&amp;lt;vector&amp;gt;
using namespace std;
int n;
const int ...]]></description><category></category></item><item><title><![CDATA[二叉树、BST、并查集、堆、哈夫曼树]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81416629</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81416629</guid><author>qq_40540973</author><pubDate>Sat, 04 Aug 2018 23:15:13 +0800</pubDate><description><![CDATA[ 二叉树操作，二叉搜索树操作，先序层序等遍历，树的旋转，并查集，最大堆建立，插入，删除，堆排序、哈弗曼树WPL（带权路径和最大）

程序来源于“算法笔记”，复习的时候手写了一遍，基础还是很有用的，这些常用的记一记感觉确实做题的时候顺畅一些


#include&amp;lt;iostream&amp;gt;
#include&amp;lt;vector&amp;gt;
#include&amp;lt;queue&amp;gt;
using na...]]></description><category></category></item><item><title><![CDATA[1043 Is It a Binary Search Tree (25)（25 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81389603</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81389603</guid><author>qq_40540973</author><pubDate>Fri, 03 Aug 2018 16:10:08 +0800</pubDate><description><![CDATA[模板题目：树的创建（插入节点，新建节点），树的遍历（前中后遍历都是DFS）


#include&amp;lt;iostream&amp;gt;
#include&amp;lt;vector&amp;gt;
using namespace std;
struct node {
	int data;
	node* lchild;
	node* rchild;
};
int num[10000], n;
node* Newnode(...]]></description><category></category></item><item><title><![CDATA[1053 Path of Equal Weight (30)（30 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81386450</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81386450</guid><author>qq_40540973</author><pubDate>Fri, 03 Aug 2018 14:01:00 +0800</pubDate><description><![CDATA[典型题目：静态树存储，DFS遍历


#include&amp;lt;iostream&amp;gt;
#include&amp;lt;vector&amp;gt;
#include&amp;lt;algorithm&amp;gt;
using namespace std;
int n, m, s;
const int maxn = 110;
struct node {
	int weight;
	vector&amp;lt;int&amp;gt;child;...]]></description><category></category></item><item><title><![CDATA[1074 Reversing Linked List (25)（25 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81211655</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81211655</guid><author>qq_40540973</author><pubDate>Wed, 25 Jul 2018 22:46:28 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;vector&amp;gt;
using namespace std;
const int maxn = 1e5 + 10;
struct Node 
{
	int add, data, next;
}node[maxn];
void init()
{
	for (int i =...]]></description><category></category></item><item><title><![CDATA[1022 Digital Library (30)（30 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/81116890</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/81116890</guid><author>qq_40540973</author><pubDate>Thu, 19 Jul 2018 15:52:46 +0800</pubDate><description><![CDATA[要气疯了，，，最后发现是没写%07d，emmmm


#include&amp;lt;iostream&amp;gt;
#include&amp;lt;string&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;vector&amp;gt;
using namespace std;
const int maxn = 1e4 + 10, maxnm = 1e3 + 10;
struct boo...]]></description><category></category></item><item><title><![CDATA[1080 Graduate Admission (30)（30 分）]]></title><link>https://blog.youkuaiyun.com/qq_40540973/article/details/80740457</link><guid>https://blog.youkuaiyun.com/qq_40540973/article/details/80740457</guid><author>qq_40540973</author><pubDate>Tue, 19 Jun 2018 23:41:15 +0800</pubDate><description><![CDATA[emmm好久没来写过了，写了一个思路比较清晰的解法，仅供参考#include&amp;lt;iostream&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;vector&amp;gt;
using namespace std;
const int maxn = 4e4 + 10;
const int maxm = 110;
const int maxk = 5;
struct...]]></description><category></category></item></channel></rss>