<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Glynn]]></title><description><![CDATA[work logs]]></description><link>https://blog.youkuaiyun.com/Glynn</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Glynn]]></copyright><item><title><![CDATA[CF1278F Cards]]></title><link>https://blog.youkuaiyun.com/Glynn/article/details/136234154</link><guid>https://blog.youkuaiyun.com/Glynn/article/details/136234154</guid><author>Glynn</author><pubDate>Thu, 22 Feb 2024 14:54:18 +0800</pubDate><description><![CDATA[CF1278F DP]]></description><category></category></item><item><title><![CDATA[计蒜客信息学普及组赛前模拟 #1 D祖先]]></title><link>https://blog.youkuaiyun.com/Glynn/article/details/102760843</link><guid>https://blog.youkuaiyun.com/Glynn/article/details/102760843</guid><author>Glynn</author><pubDate>Sat, 26 Oct 2019 20:36:03 +0800</pubDate><description><![CDATA[计蒜客信息学普及组赛前模拟 #1

D祖先

show me the code.


#include&lt;cstdio&gt;
#include&lt;cctype&gt;

template&lt;typename T&gt;inline void read(T &amp;a){
    char c=getchar();T x=0,f=1;
    while(!isdigit(c)){i...]]></description><category></category></item><item><title><![CDATA[计蒜客信息学普及组赛前模拟 #1 C颜色]]></title><link>https://blog.youkuaiyun.com/Glynn/article/details/102760825</link><guid>https://blog.youkuaiyun.com/Glynn/article/details/102760825</guid><author>Glynn</author><pubDate>Sat, 26 Oct 2019 20:33:32 +0800</pubDate><description><![CDATA[计蒜客信息学普及组赛前模拟 #1

C颜色

不废话，看代码。


#include&lt;queue&gt;
#include&lt;set&gt;
#include&lt;cstdio&gt;
#include&lt;iostream&gt;
#include&lt;algorithm&gt;
using namespace std;

struct node{int x,y;};
const...]]></description><category></category></item><item><title><![CDATA[NOI知识树]]></title><link>https://blog.youkuaiyun.com/Glynn/article/details/102517032</link><guid>https://blog.youkuaiyun.com/Glynn/article/details/102517032</guid><author>Glynn</author><pubDate>Sat, 12 Oct 2019 11:21:39 +0800</pubDate><description><![CDATA[基础算法

枚举
模拟
递推
贪心
递归
分治
NP问题

排序算法

冒泡排序
选择排序
桶排序
插入排序
归并排序
快速排序
堆排序
希尔排序
外部排序

查找算法

顺序查找
二分查找
二分答案

搜索算法

BFS
DFS
剪枝
记忆化搜索
启发式搜索,A*
迭代加深,ID
启发式迭代加深,IDA*
Dancing Links
随机调整
遗传
模拟退火

数论

素数判断,质数,筛法
最大...]]></description><category></category></item><item><title><![CDATA[拥挤 - 最小生成树]]></title><link>https://blog.youkuaiyun.com/Glynn/article/details/102460392</link><guid>https://blog.youkuaiyun.com/Glynn/article/details/102460392</guid><author>Glynn</author><pubDate>Wed, 09 Oct 2019 14:34:20 +0800</pubDate><description><![CDATA[计蒜客 拥挤
本题采用最小生成树。
不多说，上代码。
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#include&lt;set&gt;
#include&lt;vector&gt;
#include&lt;algorithm&gt;
using namespace std;

const int N =  50000+5;
const int M...]]></description><category></category></item><item><title><![CDATA[luogu-1171 售货员的难题]]></title><link>https://blog.youkuaiyun.com/Glynn/article/details/92615905</link><guid>https://blog.youkuaiyun.com/Glynn/article/details/92615905</guid><author>Glynn</author><pubDate>Mon, 17 Jun 2019 14:00:21 +0800</pubDate><description><![CDATA[luogu-1171 售货员的难题
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;

struct x{int i,l;};
x a[40][40];
int z[40],zsum=0;
int d[40][40];
int n,minn=100000;
bool v[40]={0};

void dfs(int k,int l,int s){...]]></description><category></category></item><item><title><![CDATA[luogu-1236 算24点]]></title><link>https://blog.youkuaiyun.com/Glynn/article/details/92610974</link><guid>https://blog.youkuaiyun.com/Glynn/article/details/92610974</guid><author>Glynn</author><pubDate>Mon, 17 Jun 2019 13:34:01 +0800</pubDate><description><![CDATA[luogu-1236 算24点
#include &lt;cstdio&gt;

char op[4]={'+','-','*','/'}; //+0 -1 *2 /3
int  d[3][4],m[3][2],x[3],n[3];
bool v[3][4];
bool found=false;
bool printed=false;

void dfs(int k){
if(k==4){
  i...]]></description><category></category></item><item><title><![CDATA[Tegra TX1 build tensorflow r1.1]]></title><link>https://blog.youkuaiyun.com/Glynn/article/details/72809449</link><guid>https://blog.youkuaiyun.com/Glynn/article/details/72809449</guid><author>Glynn</author><pubDate>Tue, 30 May 2017 12:26:35 +0800</pubDate><description><![CDATA[https://github.com/jetsonhacks/installTensorFlowTX1
https://github.com/rwightman/tensorflow/commits/r1.0-tegra-ugly_hack

https://github.com/rwightman/tensorflow/commit/a1cde1d55f76a1d4eb806ba81d7c]]></description><category></category></item></channel></rss>