<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[chen_安仔]]></title><description><![CDATA[成功只属于努力奋斗的人！！！]]></description><link>https://blog.youkuaiyun.com/chenanzai</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chenanzai]]></copyright><item><title><![CDATA[欢迎使用优快云-markdown编辑器]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/52515923</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/52515923</guid><author>chenanzai</author><pubDate>Mon, 12 Sep 2016 18:30:22 +0800</pubDate><description><![CDATA[CentOS7安装iptables防火墙CentOS7默认的防火墙不是iptables,而是firewalle.安装iptable iptable-service复制代码先检查是否安装了iptablesservice iptables status安装iptablesyum install -y iptables升级iptablesyum update iptables 安装iptables-ser]]></description><category></category></item><item><title><![CDATA[Duilib中各个类的简单介绍]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/47356225</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/47356225</guid><author>chenanzai</author><pubDate>Sat, 08 Aug 2015 10:47:11 +0800</pubDate><description><![CDATA[DirectUI产品网站www.directui.com，做的很专业；另一家是UIEASY，网址www.uieasy.com，一个轻量级皮肤库DSkinLite。但是，网上关于DirectUI的技术文章却很少；早在 6/26/2005，一个国外的程序员就已经写了一个开源的DirectUI例子，应该算是国内所有directui界面库的起源了，网址http://www.viksoe.dk/code/w]]></description><category></category></item><item><title><![CDATA[【Github教程】史上最全github使用方法：github入门到精通]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/47159915</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/47159915</guid><author>chenanzai</author><pubDate>Thu, 30 Jul 2015 23:50:25 +0800</pubDate><description><![CDATA[原文 http://www.eoeandroid.com/thread-274556-1-1.html

【初识Github】
首先让我们大家一起喊一句“Hello Github”。YEAH!就是这样。

Git是一个分布式的版本控制系统，最初由Linus Torvalds编写，用作Linux内核代码的管理。在推出后，Git在其它项目中也取得了很大成功，尤其是在Ruby社区中。目前，包括]]></description><category></category></item><item><title><![CDATA[匈牙利命名法]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/45333523</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/45333523</guid><author>chenanzai</author><pubDate>Tue, 28 Apr 2015 11:21:25 +0800</pubDate><description><![CDATA[匈牙利命名法是一种编程时的命名规范。基本原则是：变量名＝属性＋类型＋对象描述，其中每一对象的名称都要求有明确含义，可以取对象名字全称或名字的一部分。命名要基于容易记忆容易理解的原则。保证名字的连贯性是非常重要的。

举例来说，表单的名称为form，那么在匈牙利命名法中可以简写为frm，则当表单变量名称为Switchboard时，变量全称应该为frmSwitchboard。这样可以很容易从变量名]]></description><category></category></item><item><title><![CDATA[windows程序设计之添加菜单]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/45317923</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/45317923</guid><author>chenanzai</author><pubDate>Mon, 27 Apr 2015 22:28:05 +0800</pubDate><description><![CDATA[﻿﻿
﻿﻿




加载菜单有三种方法  首先你要先添加一个资源文件（Menu）加入ID号为IDR_MENU1

第一种方法：
HEMENU hmenu;
wndclass.lpszMenuName = (LPCSTR)IDR_MENU1；

第二种方法：
HEMENU hmenu;
hmenu=loadMenu(hInstance,(LPCSTR)IDR_MENU1);]]></description><category></category></item><item><title><![CDATA[FZU 2138 久违的月赛之一]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/40428935</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/40428935</guid><author>chenanzai</author><pubDate>Fri, 24 Oct 2014 16:02:06 +0800</pubDate><description><![CDATA[Problem 2138 久违的月赛之一

Accept: 172    Submit: 365
Time Limit: 1000 mSec    Memory Limit : 32768 KB


 Problem Description

好久没举月赛了，这次lqw给大家出了5道题，因为hsy学长宣传的很到位，吸引了n个DDMM们来做，另一位kk学长说，全做对的要给金奖，做对4]]></description><category></category></item><item><title><![CDATA[FZU 2110 Star]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/40428905</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/40428905</guid><author>chenanzai</author><pubDate>Fri, 24 Oct 2014 16:00:38 +0800</pubDate><description><![CDATA[Problem 2110 Star

Accept: 477    Submit: 1422
Time Limit: 1000 mSec    Memory Limit : 32768 KB


 Problem Description
Overpower often go to the playground with classmates. They play and chat o]]></description><category></category></item><item><title><![CDATA[FOJ 1005 Fast Food]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/40383989</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/40383989</guid><author>chenanzai</author><pubDate>Wed, 22 Oct 2014 22:02:00 +0800</pubDate><description><![CDATA[Problem 1005 Fast Food

Accept: 730    Submit: 2020
Time Limit: 1000 mSec    Memory Limit : 32768 KB


 Problem Description

The fastfood chain McBurger owns several restaurants along a highwa]]></description><category></category></item><item><title><![CDATA[POJ 1050 To the Max]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/40193893</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/40193893</guid><author>chenanzai</author><pubDate>Fri, 17 Oct 2014 23:16:40 +0800</pubDate><description><![CDATA[To the Max




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 41100
 
Accepted: 21795




Description

Given a two-dimensional array of positive and negative integer]]></description><category></category></item><item><title><![CDATA[POJ 1068 Parencodings]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/40193967</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/40193967</guid><author>chenanzai</author><pubDate>Fri, 17 Oct 2014 23:15:05 +0800</pubDate><description><![CDATA[Parencodings




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 19983
 
Accepted: 12059




Description

Let S = s1 s2...s2n be a well-formed string of parentheses. ]]></description><category></category></item><item><title><![CDATA[POJ 1001 Exponentiation]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/40193833</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/40193833</guid><author>chenanzai</author><pubDate>Fri, 17 Oct 2014 23:11:00 +0800</pubDate><description><![CDATA[Exponentiation




Time Limit: 500MS
 
Memory Limit: 10000K


Total Submissions: 137198
 
Accepted: 33557




Description

Problems involving the computation of exact values of very]]></description><category></category></item><item><title><![CDATA[POJ 1013 Counterfeit Dollar]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/40193685</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/40193685</guid><author>chenanzai</author><pubDate>Fri, 17 Oct 2014 23:04:53 +0800</pubDate><description><![CDATA[Counterfeit Dollar




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 40006
 
Accepted: 12747




Description

Sally Jones has a dozen Voyageur silver dollars. Howev]]></description><category></category></item><item><title><![CDATA[POJ 1731 Orders（全排列）]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/40154061</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/40154061</guid><author>chenanzai</author><pubDate>Thu, 16 Oct 2014 19:41:49 +0800</pubDate><description><![CDATA[Orders




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 9494
 
Accepted: 5796




Description

The stores manager has sorted all kinds of goods in an alphabetical ]]></description><category></category></item><item><title><![CDATA[POJ 1067 取石子游戏]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/40151115</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/40151115</guid><author>chenanzai</author><pubDate>Thu, 16 Oct 2014 16:53:33 +0800</pubDate><description><![CDATA[取石子游戏




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 34817
 
Accepted: 11667




Description

有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二]]></description><category></category></item><item><title><![CDATA[POJ 1012 Joseph]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/40150447</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/40150447</guid><author>chenanzai</author><pubDate>Thu, 16 Oct 2014 16:28:06 +0800</pubDate><description><![CDATA[Joseph




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 48332
 
Accepted: 18244




Description

The Joseph's problem is notoriously known. For those who are not f]]></description><category></category></item><item><title><![CDATA[NYOJ 952 最大四边形]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/39938615</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/39938615</guid><author>chenanzai</author><pubDate>Thu, 09 Oct 2014 20:59:18 +0800</pubDate><description><![CDATA[最大四边形
时间限制：1000 ms  |  内存限制：65535 KB



描述平面坐标上有n个点，你知道能组成四边形中面积最大的是多少吗？


输入
有多组测试数据
第一行整数n，表示有n个点，( 4
然后n行，每行x，y表示点的坐标。(没有重复的点)
输出
最大四边形的面积.(保留六位小数)
样例输入
5
0 0
0 4
4 0
4 4
2 3

样例输出]]></description><category></category></item><item><title><![CDATA[POJ 3061 Subsequence]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/39937723</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/39937723</guid><author>chenanzai</author><pubDate>Thu, 09 Oct 2014 20:25:58 +0800</pubDate><description><![CDATA[Subsequence




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 8695
 
Accepted: 3441




Description

A sequence of N positive integers (10 < N < 100 000), each of t]]></description><category></category></item><item><title><![CDATA[POJ 2318 TOYS(叉积+二分查找)]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/39881837</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/39881837</guid><author>chenanzai</author><pubDate>Wed, 08 Oct 2014 01:14:33 +0800</pubDate><description><![CDATA[TOYS




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 10641
 
Accepted: 5116




Description

Calculate the number of toys that land in each bin of a partitioned t]]></description><category></category></item><item><title><![CDATA[poj 2653 Pick-up sticks]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/39721619</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/39721619</guid><author>chenanzai</author><pubDate>Wed, 01 Oct 2014 21:35:05 +0800</pubDate><description><![CDATA[Pick-up sticks




Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 9884
 
Accepted: 3668




Description

Stan has n sticks of various length. He throws them one at a]]></description><category></category></item><item><title><![CDATA[POJ题目分类]]></title><link>https://blog.youkuaiyun.com/chenanzai/article/details/39673091</link><guid>https://blog.youkuaiyun.com/chenanzai/article/details/39673091</guid><author>chenanzai</author><pubDate>Mon, 29 Sep 2014 17:36:17 +0800</pubDate><description><![CDATA[初期:
一.基本算法:
     (1)枚举. (poj1753,poj2965)
     (2)贪心(poj1328,poj2109,poj2586)
     (3)递归和分治法.
     (4)递推.
     (5)构造法.(poj3295)
     (6)模拟法.(poj1068,poj2632,poj1573,poj2993,poj2996)
二.图算法:
  ]]></description><category></category></item></channel></rss>