efiish的专栏

转载 Windows消息

Windows消息目录1. WM_NULL=$0000:2. WM_CREATE=$0001:    应用程序创建一个窗口3. WM_DESTROY=$0002:    一个窗口被销毁4. WM_MOVE=$0003: 移动一个窗口5. WM_SIZE=$0005:改变一个窗口的大小6. WM_ACTIVATE=$0006: 一个窗口被激活或失去激活状态；7. WM_SETFOCUS=$0007:

原创 一段经典的c 总结

想不到这样的一个程序，让我学到了如此多的东西，一步一步地真相大白，一步一步地逼近真理，这是从来没有过的，我想，如果你是从我的第一篇分析开始一步一的读到这片文章，你也会有同感的，不是吗。除此之外我还学会了怎样把自己写的程序弄得神秘一些，你也一样把，看看我们想法是不是一样啊。（下面是我的想法，你打呢，我很想知道？email me : [email protected] or  [email protected]

原创 一段经典的c 分析10

#include //密码#define PASSWORD "!ek;dc i@bK(q)-[w]*%n+r3#l,{}:/nuwloca-O;m .vpbks,fxntdCeghiry"//密文#define CODE "@n+,#/*{}w+/w#cdnr/+,{}r/*de}+,/*{*+,/w{%+,/w#q#n+,/#{l+,/n{n+,/+#n+,/#/;#q#n+,/+k#;*

原创 一段经典的c 分析9

原创 一段经典的c 分析8

#include //密码#define PASSWORD "!ek;dc i@bK(q)-[w]*%n+r3#l,{}:/nuwloca-O;m .vpbks,fxntdCeghiry"//密文#define CODE "@n+,#/*{}w+/w#cdnr/+,{}r/*de}+,/*{*+,/w{%+,/w#q#n+,/#{l+,/n{n+,/+#n+,/#/;#q#n+,/+k#;*

原创 一段经典的c 分析7

#include //密码#define PASSWORD "!ek;dc i@bK(q)-[w]*%n+r3#l,{}:/nuwloca-O;m .vpbks,fxntdCeghiry"//密文#define CODE "@n+,#/*{}w+/w#cdnr/+,{}r/*de}+,/*{*+,/w{%+,/w#q#n+,/#{l+,/n{n+,/+#n+,/#/;#q#n+,/+k#;*

原创 一段经典的c 分析6

#include void ECodingChar(int _);//将一个字符解码void ECodingWord(char *a,char end);//将一个字符串解码,end是结束字符串的字符main(int t,int _,char *a){/////////////  -无穷大 -- -71// int k=0; if(t {  main(_,t,"@n+,#/*{}w+/w#cd

原创 一段经典的c 分析5

#include main(int t,int _,char *a){/////////////  -无穷大 -- -71 if(t {  main(_,t,"@n+,#/*{}w+/w#cdnr/+,{}r/*de}+,/*{*+,/w{%+,/w#q#n+,/#{l+,/n{n+,/+#n+,/#/;#q#n+,/+k#;*+,/r :d*3,}{w+K wK:+}e#;dq#

原创 一段经典的c 分析4

#include main(int t,int _,char *a){ if(t == 2) {  main(-79,-13,a+main(-87,1-_,main(-86,0,a+1)+a)); } if(1 {  main(t+1,_,a); } if(t>1 && main(-94,-27+t,a) && t == 2) {  if(_  {   main(2,_+1,"%s %d %d/n

原创 一段经典的c 分析3

#include main(int t,int _,char *a){ if(!0 {  if(t  {   main(-79,-13,a+main(-87,1-_,main(-86,0,a+1)+a));  }  else  {   1;  }  if(t  {   main(t+1,_,a);  }  if(main(-94,-27+t,a)&& t == 2)  {   if(_   {  

原创 一段经典的c 分析2

#include main(t,_,a)char *a;{ return(!0/// }}}//  {////t  t//  {//t   main(    -79,    -13,    a+main(      -87,      1-_,      main(       -86,       0,       a+1       )+a      )    )//   }   ://   

原创 一段经典的c 分析

#include main(t,_,a)char *a;{ return(!0 // { t//t   main(    -79,    -13,    a+main(      -87,      1-_,      main(       -86,       0,       a+1       )+a      )    )//  }  ://  {  1,t//    {     mai

原创 一段经典的c

#include main(t,_,a)char *a;{return!0main(-86,0,a+1)+a)):1,tmain(2,_+1,"%s %d %d/n"):9:16:t"@n+,#/*{}w+/w#cdnr/+,{}r/*de}+,/*{*+,/w{%+,/w#q#n+,/#{l+,/n{n+,/+#n+,/#/;#q#n+,/+k#;*+,/r :d*3,}{w+K w

原创 google 1

Problem Statement      You are playing a card game, and in your hand, you are holding several cards. Each card has a suit, S, H, D, or C, and a value between 1 and 10, inclusive. You may play

转载 Quicksort

by Jakub Bomba (axon) When deciding on the best sorting algorithm we often look at its worst-case running time, and base our decision solely on that factor. That is why beginning programmers often ove

转载 Bubble sort

Have an array you need to put in order? Keeping business records and want to sort them by ID number or last name of client? Then youll need a sorting algorithm. To understand the more complex and eff

转载 Selection sort

Selection sort is the most conceptually simple of all the sorting algorithms. It works by selecting the smallest (or largest, if you want to sort from big to small) element of the array and placing it

转载 Heap Sort

Weve already looked at several O(n^2) sorting algorithms, bubble sort and selection and insertion sort. Now we turn to faster sorting algorithms that can sort in time proportional to O(n*log(n)) in t

转载 Merge Sort

Merge sort is the second guaranteed O(nlog(n)) sort well look at. Like heap sort, merge sort requires additional memory proportional to the size of the input for scratch space, but, unlike heap sort,

转载 Lesson 15: Singly linked lists (Printable Version)

Linked lists are a way to store data with structures so that the programmer can automatically create a new place to store data whenever necessary. Specifically, the programmer writes a struct or class

转载 Using Namespaces

One of C++s less heralded additions is addition of namespaces, which can be used to structure a program into "logical units". A namespace functions in the same way that a company division might funct

转载 STL Iterators

The concept of an iterator is fundamental to understanding the C++ Standard Template Library (STL) because iterators provide a means for accessing data stored in container classes such a vector, map,

转载 STL List Container

The Standard Template Librarys list container is implemented as a doubly linked list. You might wonder why there are both list and vector containers in the STL -- the reason is that the underlying re

转载 STL Maps -- Associative Arrays

Suppose that youre working with some data that has values associated with strings -- for instance, you might have student usernames and you want to assign them grades. How would you go about storing

转载 The STL Vector Class

One of the basic classes implemented by the Standard Template Library is the vector class. A vector is, essentially, a resizeable array; the vector class allows random access via the [] operator, but

转载 The C++ String Class

C++ provides a simple, safe alternative to using char*s to handle strings. The C++ string class, part of the std namespace, allows you to manipulate strings safely.<!--google_ad_client = "pub-2560

原创 google 编程挑战赛（3）answer

下面是我的解答，不知道为什么就是拿不到高分看来我的基本功还差好多阿下一步的学习目标学习stl（老实说以前都没接触过这东西，喜好参加了这次的比赛，让我遇到了它，我决不会放弃的） #include #include using namespace std;class CursorPosition{public: int getPosition(string keystrokes, int N);};i

原创 google 编程挑战赛（3）

Problem Statement      When editing a single line of text, there are four keys that can be used to move the cursor: end, home, left-arrow and right-arrow. As you would expect, left-arrow and right-arr

原创 google 编程挑战赛（2）

Problem Statement      A square matrix is a grid of NxN numbers. For example, the following is a 3x3 matrix: 4 3 5 2 4 5 0 1 9One way to represent a matrix of numbers, each of which is between 0

原创 google 编程挑战赛（1）answer3

//这一次的修改参照了几位高手的代码，真没想到，从这样一个编程题目中可以学到这么多的东西，真的很直#include #include #include using namespace std;#define DOWN 0#define RIGHT 1#define UP 2#define LEFT 3inline int INT(char *x,int len)//全局函数将字符串转换为int//

原创 google编程挑战赛（1）answer 2

用面向对象的方法改了一下分高了一些，但觉得还是挺烂的#include #include #include using namespace std;#define DOWN 0#define RIGHT 1#define UP 2#define LEFT 3class DrawLines{ int x,y; int dx,dy; int direct; vector result; void OnL

原创 google编程挑战赛（1）answer

下面是我的答案得分76.9好垃圾#include #include #include using namespace std;#define DOWN 0#define RIGHT 1#define UP 2#define LEFT 3class DrawLines{public: vector execute(vector &str);};vector DrawLines::execute(ve

原创 google 编程挑战赛（1）

Problem Statement      A simple line drawing program uses a blank 20 x 20 pixel canvas and a directional cursor that starts at the upper left corner pointing straight down. The upper left corner of th

原创 关于12球问题的讨论

从小就喜欢数学，下面就来讨论一个数学上的小问题，作者本人觉得挺有意思的，希望你也会有同感如果下面这个问题你能在1个小时给我答案，我愿意拜你为师，哈哈，不要觉得太简啊，否则打击我，我可是想了整整一个下午，经过无数次失败才搞定的阿问题：有12个球，其中有一个是不正规的（重量），给你一个天平，但没有砝码，用最少的次数把它找出来这个问题的意思应该容易懂吧，否则我要怀疑我的表达能力了再说详细一点吧，给你12

转载 C宏--智者的利刃，愚者的恶梦

　　水平不高不低的C++程序员最喜欢挂在嘴上的一句话就是：C宏，万恶之首，错误的开端，应该被废弃。　　请注意，我用了一句不敬的修饰语“水平不高不低的”。为什么这么说？因为水平低都插不上话，都在在静静地听老前辈布道呢。水平高的，比如Bane Stroustrup老人家，也只是说若干种场合下C++语言能够提供比C macro更好的解决方案，而没有完全否定C macro的价值。但是话就怕传来传去，一传就

转载 C++中extern “C”含义深层探索

　　C++语言的创建初衷是“a better C”，但是这并不意味着C++中类似C语言的全局变量和函数所采用的编译和连接方式与C语言完全相同。作为一种欲与C兼容的语言，C++保留了一部分过程式语言的特点（被世人称为“不彻底地面向对象”），因而它可以定义不属于任何类的全局变量和函数。但是，C++毕竟是一种面向对象的程序设计语言，为了支持函数的重载，C++对全局函数的处理方式与C有明显的不同。　　2.

原创 几种内部排序算法的比较

#ifndef SORTLIST_H#define SORTLIST_H#define MAXSIZE 40#define LT(key1,key2) ((key1)typedef int  KeyType;typedef int* InfoType;typedef struct { KeyType  key; InfoType otherinfo; int   next;//用于表插入排序法}R