<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Licker的博客]]></title><description><![CDATA[道道的 博客]]></description><link>https://blog.youkuaiyun.com/hfdjfd</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hfdjfd]]></copyright><item><title><![CDATA[汇编语言 王爽 第三章 答案 解析]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/102902699</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/102902699</guid><author>hfdjfd</author><pubDate>Mon, 04 Nov 2019 18:34:08 +0800</pubDate><description><![CDATA[检测点3.1

(1) 在DEBUG中,用 "D 0:0 lf" 查看内存,结果如下:

0000:0000 70 80 F0 30 EF 60 30 E2-00 80 80 12 66 20 22 60

0000:0010 62 26 E6 D6 CC 2E 3C 3B-AB BA 00 00 26 06 66 88

下面的程序执行前,AX=0,BX=0,写出每条汇编指令执行完后相关...]]></description><category></category></item><item><title><![CDATA[汇编语言 第二章 课后习题]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/102840776</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/102840776</guid><author>hfdjfd</author><pubDate>Fri, 01 Nov 2019 14:28:43 +0800</pubDate><description><![CDATA[检测点2.1

(1)

mov ax,62627 ax = F4A3H  十进制的62627=十六进制的F4A3H

mov ah,31H ax=31A3H  高位变为31H

mov al,23H ax=3123H 低位变为23H

add ax,ax AX=6246H 高位相加

mov bx,826CH BX=826CH

mov cx,ax CX=6246H...]]></description><category></category></item><item><title><![CDATA[kafka 常用命令]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/102834407</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/102834407</guid><author>hfdjfd</author><pubDate>Thu, 31 Oct 2019 16:01:25 +0800</pubDate><description><![CDATA[启动zookeeper和kafkasever服务


bin/zookeeper-server-start.sh config/zookeeper.properties
bin/kafka-sevrver-start.sh config/server.properties


创建一个名为test的主题，副本数为1，分区为1


bin/kafka-topics.sh --create --zoo...]]></description><category></category></item><item><title><![CDATA[汇编语言 第一章 课后习题]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/102825253</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/102825253</guid><author>hfdjfd</author><pubDate>Wed, 30 Oct 2019 19:28:13 +0800</pubDate><description><![CDATA[检测点1.1

(1)一个CPU的寻址能力为8KB，那么它的地址总线的宽度为 13

解析：每根地址总线的状态只有两种，0和1，所以N根地址总线可以表示2^N个不同的数，所以它的的寻址能力为2^N，1KB=2^10，所以8KB为2^13，所以地址总线的宽度为13

(2)1KB的存储器有 1024个存储单元，存储单元的编号从 0 到 1023

解析：存储器被划分为若干个存储单元，存储单...]]></description><category></category></item><item><title><![CDATA[ElasticSearch 常用查询语句]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/102682868</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/102682868</guid><author>hfdjfd</author><pubDate>Thu, 24 Oct 2019 17:30:58 +0800</pubDate><description><![CDATA[# 查看指定index、type和id的文档,返回结构如下，found字段表示是否找到对应的文档


curl -XGET http://localhost:9200/_index/_type/_id?pretty

# 返回
{
  "_index": "_index",
  "_type": "_type",
  "_id": "_id",
  "_version": 1,
  "found"...]]></description><category></category></item><item><title><![CDATA[ElasticSearch 集群状态]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/102669113</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/102669113</guid><author>hfdjfd</author><pubDate>Tue, 22 Oct 2019 11:42:54 +0800</pubDate><description><![CDATA[ElasticSearch集群的健康状态分为三种，分别是green(所有主要分片和复制分片都可用),yellow(所有主要分片可用，但不是所有复制分片都可用)和red(不是所有的主要分片都可用)

green为健康状态，所有分片都是正常，yellow为部分故障，主分片是正常的，但是有复制分片故障，red为严重故障，有主分片不可用

我们可以通过


GET /_cluster/health

这个...]]></description><category></category></item><item><title><![CDATA[IOS开发中的KeyWindow]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/60143163</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/60143163</guid><author>hfdjfd</author><pubDate>Fri, 03 Mar 2017 17:19:39 +0800</pubDate><description><![CDATA[KeyWindow 即指在IOS开发中活跃窗口,即能接到键盘和非触摸事件的一个窗口,一次只能有一个KeyWindow,在IOS 开发中,我们可以通过设置UIWindowLevel的数值来设置最前端的窗口为哪个,Level数值越高的窗口越靠前,如果两个窗口的Level等级相同,则我们可以通过makeKeyAndVisible来显示KeyWindow
UIWindow是可以重叠的,每一个Window]]></description><category></category></item><item><title><![CDATA[HDU 2016数据的交换输出]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/50976305</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/50976305</guid><author>hfdjfd</author><pubDate>Fri, 25 Mar 2016 00:07:53 +0800</pubDate><description><![CDATA[Problem Description
输入n(n

 

Input
输入数据有多组，每组占一行，每行的开始是一个整数n，表示这个测试实例的数值的个数，跟着就是n个整数。n=0表示输入的结束，不做处理。
 

Output
对于每组输入数据，输出交换后的数列，每组输出占一行。
 

Sample Input

4 2 1 3 4
5 5 4 3 2 1
0

 ]]></description><category></category></item><item><title><![CDATA[HDU 2015 偶数求和]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/50976244</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/50976244</guid><author>hfdjfd</author><pubDate>Thu, 24 Mar 2016 23:54:48 +0800</pubDate><description><![CDATA[Problem Description
有一个长度为n(n
 

Input
输入数据有多组，每组占一行，包含两个正整数n和m，n和m的含义如上所述。

 

Output
对于每组输入数据，输出一个平均值序列，每组输出占一行。

 

Sample Input

3 2
4 2

 

Sample Output

3 6
3 7

import ]]></description><category></category></item><item><title><![CDATA[HDU 2014 青年歌手大奖赛_评委会打分]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/50945867</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/50945867</guid><author>hfdjfd</author><pubDate>Mon, 21 Mar 2016 13:45:52 +0800</pubDate><description><![CDATA[Problem Description
青年歌手大奖赛中，评委会给参赛选手打分。选手得分规则为去掉一个最高分和一个最低分，然后计算平均得分，请编程输出某选手的得分。
 

Input
输入数据有多组，每组占一行，每行的第一个数是n(2
 

Output
对于每组输入数据，输出选手的得分，结果保留2位小数，每组输出占一行。
 

Sample Input

3 99 9]]></description><category></category></item><item><title><![CDATA[c# 中的只读属性]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/50904855</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/50904855</guid><author>hfdjfd</author><pubDate>Wed, 16 Mar 2016 14:33:31 +0800</pubDate><description><![CDATA[当你想把一个属性设置为只读属性，
你只需要把set去掉，只设置get即可
ex;
private bool hot;
pblic bool Hot{get{return hot;}}


即可]]></description><category></category></item><item><title><![CDATA[HDU 2011 多项式求和]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/50896539</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/50896539</guid><author>hfdjfd</author><pubDate>Tue, 15 Mar 2016 14:59:09 +0800</pubDate><description><![CDATA[Problem Description
多项式的描述如下：
1 - 1/2 + 1/3 - 1/4 + 1/5 - 1/6 + ...
现在请你求出该多项式的前n项的和。
 

Input
输入数据由2行组成，首先是一个正整数m（m
 

Output
对于每个测试实例n，要求输出多项式前n项的和。每个测试实例的输出占一行，结果保留2位小数。
 

Sample Inp]]></description><category></category></item><item><title><![CDATA[HDU 2010 水仙花数]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/50896002</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/50896002</guid><author>hfdjfd</author><pubDate>Tue, 15 Mar 2016 14:05:44 +0800</pubDate><description><![CDATA[水仙花数
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 154127    Accepted Submission(s): 44493
#include
 int main()
 {
	int n,m,i,a1,a2,a3;
	w]]></description><category></category></item><item><title><![CDATA[HDU 2009 求数列的和]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/50895981</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/50895981</guid><author>hfdjfd</author><pubDate>Tue, 15 Mar 2016 14:03:51 +0800</pubDate><description><![CDATA[求数列的和
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 66376    Accepted Submission(s): 40499


Problem Description
数列的定义如下：
数列的第一项为n，以后各]]></description><category></category></item><item><title><![CDATA[HDU 1161Eddy's mistakes]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/50868610</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/50868610</guid><author>hfdjfd</author><pubDate>Sun, 13 Mar 2016 00:40:36 +0800</pubDate><description><![CDATA[Problem Description
Eddy usually writes articles ,but he likes mixing the English letter uses, for example "computer science" is written frequently "coMpUtEr scIeNce" by him, this mistakes lets Eddy']]></description><category></category></item><item><title><![CDATA[HDU 1425 sort]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/50868583</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/50868583</guid><author>hfdjfd</author><pubDate>Sun, 13 Mar 2016 00:29:31 +0800</pubDate><description><![CDATA[Problem Description
给你n个整数，请按从大到小的顺序输出其中前m大的数。

 

Input
每组测试数据有两行，第一行有两个数n,m(0

 

Output
对每组测试数据按从大到小的顺序输出前m大的数。

 

Sample Input

5 3
3 -35 92 213 -644

 

Sample Output

213]]></description><category></category></item><item><title><![CDATA[HDU 1061  Rightmost Digit]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/50867431</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/50867431</guid><author>hfdjfd</author><pubDate>Sat, 12 Mar 2016 20:38:09 +0800</pubDate><description><![CDATA[Problem Description
Given a positive integer N, you should output the most right digit of N^N.

 

Input
The input contains several test cases. The first line of the input is a single integer T ]]></description><category></category></item><item><title><![CDATA[HDU 1097 a hard puzzle]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/50867350</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/50867350</guid><author>hfdjfd</author><pubDate>Sat, 12 Mar 2016 20:23:55 +0800</pubDate><description><![CDATA[Problem Description
lcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin.
]]></description><category></category></item><item><title><![CDATA[HDU 1170 Balloon Comes!]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/50867333</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/50867333</guid><author>hfdjfd</author><pubDate>Sat, 12 Mar 2016 20:22:07 +0800</pubDate><description><![CDATA[Problem Description
The contest starts now! How excited it is to see balloons floating around. You, one of the best programmers in HDU, can get a very beautiful balloon if only you have solved the ve]]></description><category></category></item><item><title><![CDATA[HDU 1076An Easy Task]]></title><link>https://blog.youkuaiyun.com/hfdjfd/article/details/50865451</link><guid>https://blog.youkuaiyun.com/hfdjfd/article/details/50865451</guid><author>hfdjfd</author><pubDate>Sat, 12 Mar 2016 14:36:37 +0800</pubDate><description><![CDATA[Problem Description
Ignatius was born in a leap year, so he want to know when he could hold his birthday party. Can you tell him?

Given a positive integers Y which indicate the start year, and a p]]></description><category></category></item></channel></rss>