C++

There is a class of reflection in the java/c#, and C does not exist.In java/c#, tables can be designed into classes, while C can only be designed as structural forms.There is hibernate in Java to manipulate the database, but how to design it under C?

WinForm gets a collection of methods for the current path of the application, as follows, which is worth collecting//gets the full path of the current process, including the file name (process name). stringstr = This. GetType ().

? 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79

webservices (http://www.webxml.com.cn/WebServices/WeatherWebService.asmx) to implement the weather forecast, the weather forecast Web service, Data from the China Meteorological Bureau http://www.cma.gov.cn/ , the data is automatically updated every

Video Surveillance Time Limit:1000 MS   Memory Limit:10000 K Total Submissions:3145   Accepted:1391 DescriptionA friend of yours has taken the job of security officer at the Star-Buy Company, a famous depart-ment

Link: SCUT 2014 Judging whether the given string is a correct scientific notation A + 1.5Be + 8C, which can be A real number or A real number containing an exponent. Three parts of ABC indicate spaces, which can be dispensable, and positive and

Public class category list {Node head = null;Node tail = null;Int length = 0;Public void add (Object object ){Node node = new Node (object, null );If (head = null ){Head = tail = node;}Tail. setNext (node );Tail = node;Length ++;}Public int length ()

N, m, and k indicate that there are n pairs of k kinds of shoes, and you have m capacity; Each pair of shoes has capacity p and value v. If you want to buy all k types of shoes, the maximum value of the shoes can be bought if the capacity is

Question: Find the nth sequence in the 1-k arrangement. The question shows the n calculation method: N = si * (k-1) + s2 * (K-2)... + sk * 0 !; And give you s1-sk Train of Thought: first, we should make it clear that, for example, 321 is the largest

Question: 1372-Log Jumping the start position and length of n boards. Overlapping boards can jump to each other to obtain the maximum number of rings. Train of Thought: first sort by the starting position, and then judge whether he and the previous

S-NimTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 4091 Accepted Submission (s): 1760Problem DescriptionArthur and his sister Caroll have been playing a game called Nim for some time now. Nim

Also see the interception missile time limit: 3000 MS | memory limit: 65535 KB difficulty: 3 Description You should be familiar with the topic of Missile interception. I would like to explain another question: a country has developed a

To fight the monotonous queue, and strive to finish the competition before the provincial games .... This is a bare monotonous queue. Stl cannot be used to make people suffer .... It is to use a queue to save the information of the current team. If

Description: Description Furik loves math lessons very much, so he doesn't attend them, unlike Rubik. but now Furik wants to get a good mark for math. for that Ms. ivanova, his math teacher, gave him a new task. furik solved the task immediately.

Hdu 1163 Eddy's digital Roots Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. if the resulting value is a single digit then that digit is the digital root. if the resulting value contains two

 Question: 1. Each book has only one in the library. 2. It takes one day for everyone to read a book. 3. When a person reads a book, his/her social happiness increases. 4. Naturally, when a good child returns the library early in the morning after

In the previous article "boost: serialization", the base class pointer is used to store the derived class (a lot of errors, a wave of twists and turns). In this article, we use the serialize function to implement serialization. The code format is as

Link: hdu 4725 The Shortest Path in Nya Graph The cost of moving between n vertices, m edges, and adjacent layers c. Number of layers where each vertex is located, and m edges. Each edge has u, v, val, which indicates the price val for moving from

Virtual functions of C ++ Primer Plus learning notes There are two types of C ++ polymorphism: static polymorphism and dynamic polymorphism. Function overloading and operator overloading are the specific manifestations of static polymorphism.

  Analysis: Simple simulation, but I learned how to use the ceil (double x) function (math. h) Double ceil (double x) (ceiling function) Returns the smallest integer greater than or equal to the specified expression.    The Return Value of the