C++

Describe:China's national standard GB 11643-1999〗: The citizenship number is a 18-bit feature combination code, consisting of 17-bit digital body code and a digit check code. The sorting order is from left to right: six-digit address code,

#include #include using namespace Std;Class Base{Publicvirtual void Funca (){cout }};Class derived:p ublic base{Publicvirtual void FUNCB (){cout } };void FUNCC (base* p){Derived *DP = dynamic_cast (p);if (DP! = NULL){DP->FUNCB ();}Else{P->funca ()

Today in the 7th chapter of C + + primer, an exercise is to write two classes, one is the screen class, and the Window_mgr class, where the Window_mgr class contains a member of a vector type and a clear function, To manipulate the screen class, you

Deserialization (path is an XML file)1 Public StaticList Getxmldata (stringpath)2 {3 if(file.exists (path))4 {5XmlSerializer XML =NewXmlSerializer (typeof(list));6 using(StreamReader w

Advanced statement:(1) int *f , G;This only declares an F pointer. * are all immediately followed.(2) int *f ();F is a function whose return value is a pointer to an integral type.(3) Int (*f) ();F is a function pointer, and the return value of this

Linux c ++ cyclic buffer template class, linux Buffer I. Overview In actual learning and work, we often encounter the situation of reading and writing a large amount of data. At this time, we may use a circular buffer. The circular buffer zone has

Hdu2524 (calculate the number of rectangles, questions ...), Hdu2524 rectangle  Hdu 2524N-brute force solution and table Creation Time Limit:1000 MS Memory Limit:32768KB 64bit IO Format:% I64d & % I64u DescriptionA grid with a height of n and a

HDU-1799 (combination recurrence formula), hdu-1799 Recurrence FormulaHDOJ-1799-Fighting_Dream  M-brute force solution and table Creation Time Limit:1000 MS Memory Limit:32768KB 64bit IO Format:% I64d & % I64u DescriptionWe know that in programming,

Interesting question: whether to buy or not. Interesting question: whether to buy or not Description: Xiaohong wants to buy some beads to make a string of his favorite beads. The vendors selling beads have a lot of colorful beads, but they are not

UV 524, uva524 Description  A ring is composed of n (even number) circles as shown in digoal. Put natural numbers into each circle separately, and the sum of numbers in two adjacent circles shocould be a prime.     Note:The number of first circle

UV 11059, uva11059 Given a sequence of integers S = {S1, S2,..., Sn}, you shoshould determine what is the value ofMaximum positive product involving consecutive terms of S. If you cannot find a positive sequence,You shoshould consider 0 as the value

Hdu oj 5317 RGCDQ (2015 + School Joint Training 3rd) brute force + tips, hdu5317 Question connection: timeme Find the largest gcd (f [I], f [j]) in a [L, R], where L Analysis: it is easy to calculate f [x] first. Here, x is the maximum 1e6, and f

C ++ String constant and String constant  C ++ String constant When a String constant appears in an expression, its value is a pointer constant. The compiler stores a copy of the specified character at a location in the memory (global), and stores

HDOJ question 4276 The Ghost Blows Light (SPFA + tree DP)The Ghost Blows LightTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 2549 Accepted Submission (s): 795Problem DescriptionMy name is Hu

Hdu 5225 Tom and permutation (backtracking)     #include #include #include using namespace std;typedef long long ll;const int maxn = 100;const int mod = 1e9+7;int N, ans, V[maxn + 5], A[maxn + 5];ll S[maxn + 5], L[maxn + 5];int query(int

Hdu 1394 Minimum Inversion Number (line segment tree)Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission (s): 13797 Accepted Submission (s): 8423Problem Description The inversion

Hdu 2082 find a word (primary function)Search for wordsTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 4971 Accepted Submission (s): 3537Problem Description assume there are x1 letters A and x2

LeetCode (52): Add Binary Given two binary strings, return their sum (also a binary string ). For example,A ="11"B ="1" Return"100". The questions are not complex. The following is my program, followed by other people's programs. It's really easy!  

Ultraviolet A -- 1368 (greedy, string simulation)     This is a string simulation question with a greedy idea. Given m strings with a length of n, you can find a string with a length of n, the number and minimum number of characters corresponding to

Hdu4800_joseph Phina and RPG (two-dimensional dp)   Question: The dp state is set to Use Role j to pass the maximum percentage of I (dp [I] [j]) Start with the last field:Dp [I] [j] = rate [j] [AI [I] * max (dp [I + 1] [j], dp [I + 1] [a [I]); That