<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Ashen1_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Ashen1_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Ashen1_]]></copyright><item><title><![CDATA[【随便写写】数据结构——二叉树的基本操作]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/110098405</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/110098405</guid><author>Ashen1_</author><pubDate>Tue, 24 Nov 2020 22:41:45 +0800</pubDate><description><![CDATA[一、二叉树树的遍历
1）递归方法
void PreOrder(BiNode *root)
    {
        if(root==NULL)
            return;
        else
        {
            cout&lt;&lt;root-&gt;data;
            PreOrder(root-&gt;lchild);
            PreOrder(root-&gt;rchild);
        }

    }

2）非递]]></description><category></category></item><item><title><![CDATA[【随便写写】数据结构——树的存储]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/109985656</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/109985656</guid><author>Ashen1_</author><pubDate>Tue, 24 Nov 2020 21:40:57 +0800</pubDate><description><![CDATA[一、树的顺序结构储存
1）将二叉树按完全二叉树编号。
2）将二叉树的结点按照编号顺序存储到一维数组中
//前序遍历
void Preorder(int root, char data[]){
	if(data[root]!='\0'){
		cout&lt;&lt;data[root] ;			
		Preorder(2*root,data);
		Preorder(2*root+1,data);
	}
	return;
}

//中序遍历
void InOrder(int root, char data[]]></description><category></category></item><item><title><![CDATA[【随便写写】数据结构——树基本概念]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/109970359</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/109970359</guid><author>Ashen1_</author><pubDate>Tue, 24 Nov 2020 21:40:37 +0800</pubDate><description><![CDATA[一、树的定义
树：n（n≥0）个结点的有限集合。
当n=0的时候称为空树
任意一棵非空树满足以下条件:
⑴ 有且仅有一个特定的称为根的结点；
⑵ 当n＞1时，除根结点之外的其余结点被分成m（m&gt;0）个互不相交的有限集合T1,T2,… ,Tm，其中每个集合又是一棵树，并称为这个根结点的子树。
易见树的定义采用了递归方法
二、树的基本术语
结点的度:结点所拥有的子树的个数
树的度:树中结点度的最大值
孩子、双亲： 树中某结点子树的根结点称为这个结点的孩子结点，这个结点称为它孩子结点的双亲结点;
兄弟: 具]]></description><category></category></item><item><title><![CDATA[ACM课程总结]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/106753430</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/106753430</guid><author>Ashen1_</author><pubDate>Mon, 15 Jun 2020 00:48:01 +0800</pubDate><description><![CDATA[时间飞逝，这个学期已经到了结尾，我们的acm课程也即将结束。这些天里，我有因为老师课上困难的题目而感到沮丧，也有因为作业中一些题目卡壳而懊恼，但是我也在一些题目的思考中发现了自己的改变，自己的进步。
第一次接触ACM是在一次社团讲座，我看到台上的几位学长，一字一句的讲解着这个ACM社团，听到了很多比赛的名称，也听到同学说了，这是最有含金量的一个社团，于是我对此感起兴趣了。后来我加入了社团，在一个空旷的教室里，我看到那位讲座的学长微笑着向我打招呼，我坚定的交上报名表开始了自己的求知路。学长的课程讲解十分的粗略]]></description><category></category></item><item><title><![CDATA[Educational Codeforces Round 87 (Rated for Div. 2)A. Alarm Clock]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/106180077</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/106180077</guid><author>Ashen1_</author><pubDate>Sun, 17 May 2020 20:24:52 +0800</pubDate><description><![CDATA[题目链接:http://codeforces.com/contest/1354/problem/A

problom description
Polycarp has spent the entire day preparing problems for you. Now he has to sleep for at least a
minutes to feel refreshed.
Polycarp can only wake up by hearing the sound of his alarm. ]]></description><category></category></item><item><title><![CDATA[5.10第十一周]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/106040897</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/106040897</guid><author>Ashen1_</author><pubDate>Sun, 10 May 2020 19:48:21 +0800</pubDate><description><![CDATA[本周进行了div2和div4的比赛，div2的那一场由于网络原因没能好好的完成，但是还是发现自己每次都只能在A、B题中做出AC答案。另外进行的一场div4算是难度很低的比赛，前三个题都是纯数学的题目，可是我没能很快的做出来甚至没做出来，觉得自己水平真的挺低的，没有涉及算法的题目就有些吃力，后面的长篇大论的题目更是看不进去。其实前几个题目大多都是找数学规律的题目，甚至有一些通过暴力枚举都可以做出来，但是自己的思路来的太慢了，其实还是对比赛的不重视，脑袋并不能迅速的转起来。另外自己学习的一些算法知识，在比赛中根]]></description><category></category></item><item><title><![CDATA[Codeforces Round #640 (Div. 4)C. K-th Not Divisible by n]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/106038914</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/106038914</guid><author>Ashen1_</author><pubDate>Sun, 10 May 2020 17:39:46 +0800</pubDate><description><![CDATA[Problem description
You are given two positive integers n and k. Print the k-th positive integer that is not divisible by n.
For example, if n=3, and k=7, then all numbers that are not divisible by 3 are: 1,2,4,5,7,8,10,11,13…. The 7-th number among them .]]></description><category></category></item><item><title><![CDATA[Codeforces Round #640 (Div. 4)B. Same Parity Summands]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/106038789</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/106038789</guid><author>Ashen1_</author><pubDate>Sun, 10 May 2020 17:17:45 +0800</pubDate><description><![CDATA[Problem description
You are given two positive integers n (1≤n≤109) and k (1≤k≤100). Represent the number n as the sum of k positive integers of the same parity (have the same remainder when divided by 2).
In other words, find a1,a2,…,ak such that all ai&.]]></description><category></category></item><item><title><![CDATA[Codeforces Round #640 (Div. 4)A. Sum of Round Numbers]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/106036994</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/106036994</guid><author>Ashen1_</author><pubDate>Sun, 10 May 2020 16:15:30 +0800</pubDate><description><![CDATA[problem description
A positive (strictly greater than zero) integer is called round if it is of the form d00…0. In other words, a positive integer is round if all its digits except the leftmost (most significant) are equal to zero. In particular, all numb.]]></description><category></category></item><item><title><![CDATA[Codeforces Round #639 (Div. 2) B. Card Constructions]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/105989416</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/105989416</guid><author>Ashen1_</author><pubDate>Sun, 10 May 2020 16:13:53 +0800</pubDate><description><![CDATA[题目链接:http://codeforces.com/contest/1345/problem/B

problem description
A card pyramid of height 1 is constructed by resting two cards against each other. For h&gt;1, a card pyramid of height h is cons...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #639 (Div. 2) A. Puzzle Pieces]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/105989043</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/105989043</guid><author>Ashen1_</author><pubDate>Fri, 08 May 2020 10:04:00 +0800</pubDate><description><![CDATA[题目链接:http://codeforces.com/contest/1345/problem/A

problem description
You are given a special jigsaw puzzle consisting of n⋅m identical pieces. Every piece has three tabs and one blank, as pictured b...]]></description><category></category></item><item><title><![CDATA[5.5]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/105938063</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/105938063</guid><author>Ashen1_</author><pubDate>Tue, 05 May 2020 20:39:41 +0800</pubDate><description><![CDATA[二分的学习进行了一段时间，题目也做了一些，对他也有了一些理解，下一步就是多刷题，熟练的掌握，把他当作一种技能。
最近参加了很多场cf比赛了，但是每一次都只做出一个题就得到了满足感，后来的时间就有些浪费了。我发现我的同学们在比赛前都会进行心态的调整，而我则非常随便，我不会在比赛前进行什么准备，都是迷迷糊糊的进入比赛，以至于比赛开始一段时间进入不了状态，所以我觉得我应该像同学一样在赛前做几个简单的题目...]]></description><category></category></item><item><title><![CDATA[The Sum of 0 for four numbers]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/105937727</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/105937727</guid><author>Ashen1_</author><pubDate>Tue, 05 May 2020 20:00:24 +0800</pubDate><description><![CDATA[problem description
The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) ∈ A x B x C x D are such that a + b + c + d ...]]></description><category></category></item><item><title><![CDATA[A. Phoenix and Balance]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/105929579</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/105929579</guid><author>Ashen1_</author><pubDate>Tue, 05 May 2020 11:13:40 +0800</pubDate><description><![CDATA[problem description
Phoenix has n coins with weights 21,22,…,2n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n2
coins and the difference of wei...]]></description><category></category></item><item><title><![CDATA[A. Road To Zero]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/105929505</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/105929505</guid><author>Ashen1_</author><pubDate>Tue, 05 May 2020 11:10:53 +0800</pubDate><description><![CDATA[problem description
You are given two integers x and y. You can perform two types of operations:
Pay a dollars and increase or decrease any of these integers by 1. For example, if x=0 and y=7 there a...]]></description><category></category></item><item><title><![CDATA[4.26]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/105775733</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/105775733</guid><author>Ashen1_</author><pubDate>Sun, 26 Apr 2020 20:15:06 +0800</pubDate><description><![CDATA[本周开始学习二分了，今天老师也将二分的题目上传了，之前的dp的题目做的非常差，也是因为之前的态度不端正，没有好好完成，老师也对我们很不满意，我也感到了自己的差劲，只解决了个位数的问题。二分算法的学习又是新的开始，老师也在群里发了题目完成数目对应的成绩，所以我要力争做到最优。有10天的时间，也只有十多道题，每天一道题也能将近把题目做完，所以我更要去弄清楚每一个问题。虽然自己之前懈怠了很久，别的科目也...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #637 (Div. 2) A. Nastya and Rice]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/105765548</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/105765548</guid><author>Ashen1_</author><pubDate>Sun, 26 Apr 2020 11:46:17 +0800</pubDate><description><![CDATA[Problem Description
Nastya just made a huge mistake and dropped a whole package of rice on the floor. Mom will come soon. If she sees this, then Nastya will be punished.
In total, Nastya dropped n
gr...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #636 (Div. 3) B. Balanced Array]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/105703997</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/105703997</guid><author>Ashen1_</author><pubDate>Sun, 26 Apr 2020 11:38:26 +0800</pubDate><description><![CDATA[A. Candies

Problem Description
Recently Vova found n candy wrappers. He remembers that he bought x candies during the first day, 2x candies during the second day, 4x candies during the third day, …, ...]]></description><category></category></item><item><title><![CDATA[4.19]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/105613020</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/105613020</guid><author>Ashen1_</author><pubDate>Sun, 19 Apr 2020 23:05:23 +0800</pubDate><description><![CDATA[浑浑噩噩又是一周转眼间学期已经过去一半
学长给我们上了一堂关于cf的课，同时也讲了自己cf的经历，我早早注册了cf账号，却没进行过几场比赛

]]></description><category></category></item><item><title><![CDATA[4.5总结]]></title><link>https://blog.youkuaiyun.com/Ashen1_/article/details/105331468</link><guid>https://blog.youkuaiyun.com/Ashen1_/article/details/105331468</guid><author>Ashen1_</author><pubDate>Sun, 05 Apr 2020 22:14:42 +0800</pubDate><description><![CDATA[1.
Given a set of n integers: A={a1, a2,…, an}, we define a function d(A) as below:
Your task is to calculate d(A).

input
The input consists of T(&lt;=30) test cases. The number of test cases (T) is...]]></description><category></category></item></channel></rss>