C++

[Cpp]Description: divide the coin into two portions, and you can find the smallest difference with the average.# Include # Include Bool s [50010];Int num [110];Int main (){Int n, t, sum, flag, p, m;// Freopen ("a.txt", "r", stdin );Scanf ("% d", & t

[Cpp]/* DescriptionUse the string comparison function to compare the two strings and output the comparison results as required. The string cannot exceed 15 characters.Enter two strings str1 and str2. If the first string is equal to the second string,

Question: enter two integer sequences. One sequence represents the push sequence of the stack and determines whether the other sequence may be in the pop sequence. For the sake of simplicity, we assume that any two integers in the push sequence are

[Cpp]/*************************************** **************************\For example,Input:31 2 3Output:1 2 31 3 22 1 32 3 13 1 23 2 1\*************************************** **************************/# Include # Include # Include  Const int maxn =

No bit operations (&, |, ^, ,~), Implement a function to obtain the ninth digit of the int type (counting starts from the first digit)     [Cpp]Int check (){Union utype{Int I;Char c;};Utype u;U. I = 1;Return u. c = 1;} Int getbit (int val){Char * p

[Cpp is a little busy recently, so I don't want to write my ideas or something, so I can directly go to the code. [Cpp] # include # include struct edge {int u, v, w, flag;} p [4952]; int n, m; int f [101]; int used [101]; int cmp (const void * aa,

Question: Implement int sqrt (int x ). compute and return the square root of x. an1_1: bipartite [cpp] class Solution {public: int sqrt (int x) {if (x = 0 ); long x2 = (long) x; long left = 0; long right = x2; long mid = 0; while (left x2) {return

[Cpp] Description: n cuboids are provided. There are countless cuboids. The height of these cuboids is increased in sequence by decreasing the length and width, what is the maximum height? # include # include int n, m, t, sum; int arr [100] [3];

The Code was compiled on linux for a long time. Recently, the experiment behind this paper must be completed in linux, so you have to pick up the programming on linux again. As before, write [Cpp]# Include Using namespace std; # Include Using

[Cpp]# Include # Include # Include # Include   Int myStrlen (const char * strDest){Assert (NULL! = StrDest );Const char * p = strDest;Int len = 0;While (* p )! = '\ 0 '){Len ++;P ++;}Return len;} Int itrStrlen (const char * strDest){Assert (NULL! =

[Cpp]# Include # Include # Include  Unsigned int hashTable [256];Char queue [256]; Char solve (char * str){Unsigned int I = 0;Memset (hashTable, 0, sizeof (hashTable ));Memset (queue, '0', sizeof (queue ));Int index = 0;For (I = 0; I {Int loc = (int)

I recently wrote an MFC program, and I feel that it has been developing for many years and should be well-developed. The specific manifestation is that the relevant documentation is comprehensive, the Demo of related functions can be easily accessed

/* Basic Minimum Spanning Tree problem, but the conditions for special determination are insufficient */ # Include # Include # Define INF 1 Int n, m, vis [110], low [110];Int map [110] [110]; Int init (){For (int I = 1; I For (int j = 1; j Map [I] [

When implicit type conversion is performed, the error message "user-defined conversion must be converted to a closed type or from a closed type" is returned ": The statement is roughly as follows: There are two classes: A and B, where Class A and

Problem DescriptionConversion between the metric and English measurement systems is relatively simple. Often, it involves either multiplying or dividing by a constant. You must write a program that converts between the following units:     InputThe

1. Find the K-th node in the linked list [Cpp]ListNode * FindKthToTail (ListNode * pListHead, unsigned int k){If (pListHead = NULL | k = 0)Return NULL;ListNode * pAhead = pListHead;ListNode * pBehind = NULL;For (unsigned int I = 0; I {PAhead =

Insert sorting for algorithm sortingBasic Ideas In general, insert sorting is implemented on the array using in-place. The specific algorithm is described as follows: Starting from the first element, this element can be considered to have been

[Cpp]# Include // Mainly finds the relationship between the number to be ranked and the number to be ranked.Int swap (int m, int n){If (n = 1)Return m-n + 1;Return m * swap (m-1, n-1 ); }Int main (){Int m = 5, n = 4;Printf ("% d", swap (5, 4 )); } #

The introduction to algorithms explains the second typical example of the divide and conquer algorithm. Find the largest sub-array in an array. That is, find the continuous addition and the largest part in this array!First, we can analyze the

Print?# Include # Include # Include # Define base 100000000# Define ds 5Int powD [10] [ds];Int sum [ds];Int num [10];Int N;Struct timeval start, end;Void init (void){Int I, j, k;For (I = 0; I For (j = 0; j PowD [I] [j] = 0;For (I = 0; I Num [I] =