C++

Is Bigger Smarter?The ProblemSome people think that the bigger an elephant is, the smarter it is. to disprove this, you want to take the data on a collection of elephants and put as large a subset of this data as possible into a sequence so that the

I made a few questions in HackerRank, so let's talk about it... Question: Give n and k, then give n numbers, and find the number of k pairs in the array. Where [N 0 and K /* * Author: illuz * Blog:

Question: Given a string S, find the longest palindromic substring in S. you may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. search for and output the longest return string in the string. I

# Include // contains the header file, which generally does not need to be changed. The header file contains the definition of special function registers.# Define uchar unsigned char# Define uint unsigned intStatic unsigned char count;Code unsigned

First look at const int a = 2; the value of a is read-only. The difference between const int * p and int * const p ,. It can be understood as follows: divide the variable into two parts based on the "*" as the demarcation point to see who the const

The question is that a robot starts from 1.1 to reach m.. You can only go to the right or up when you go back. You can only go up or up to the left when you come back, but one point can only go once. Each point along the way has a treasure, ask how

/*************************************** *************************/ Previous content review: C ++ memory management learning notes (4) 2.1-2.2 RAII rule (introduced) 2.3 smart pointer 2.4 auto_ptr class -----------------------------------------------

Given a binary tree, return the bottom-up level order traversal of its nodes 'values. (ie, from left to right, level by level from leaf to root ). For example:Given binary tree {3, 9, 20, #, #, 15, 7 }, 3/\9 20/\15 7 Return its bottom-up level order

  Yes.   # Include # include # define bool int # define false 0 # define true 1 int main () {int nlen1; // len1, length of len1 int len1 [200], sum [200]; int I, j; char a [200]; int bStartOutput = false; // freopen ("in.txt", "r", stdin); memset (

Arithmetic expressions are usually written with the operators in between the two operands (which is called infix notation ). for example, (x + y) * (z-w) is an arithmetic expression in infix notation. however, it is easier to write a program to

Priority queueA priority queue is a set of data elements of the same type. Each data item has a specific priority. It supports insert, findMin, and deleteMin to delete the smallest element with the highest priority. Of course, it may also support

Looking back at the previous article, we implemented a simple factory mode to create different classes of objects. However, because c ++ does not have syntax similar to new "Circle", the CreateShape Function Ifelse needs to constantly judge the

Find the smallest spanning tree after the Deletion Point, n   #include#include#include#include#include#include#include#include#include#include#include#include#include#define FF(i, a, b) for(i=a; ib; i--)#define CLR(a, b) memset(a, b,

Give you a map of l from the start point to the end point, so that the distance is exactly equal to l. You can select a coefficient to stretch or contract the portrait map. For example, if you choose a coefficient of 0.5, that is to say, taking a

Purpose 1: Define a type of Alias, not just a simple macro replacement. It can be used as multiple objects that declare the pointer type at the same time. For example: char * pa, pb; // most of them do not conform to our intention. It only declares

Meal Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission (s): 6756 Accepted Submission (s ): 2264 Problem Description the dining card of the E-Science and Technology Department's canteen has a very

Call External commands if you use the default browser, call ShellExecute (NULL, _ T ("open"), _ T ("assumer.exe"), _ T ("http://www.baidu.com"), NULL, SW_SHOW); if you open it with IE, call ShellExecute (NULL, _ T ("open"), _ T ("iexplore.exe"), _ T

Problem DescriptionMo and Larry have devised a way of encrypting messages. they first decide secretly on the number of columns and write the message (letters only) down the columns, padding with extra random letters so as to make a rectangular array

# Ifndef RB_TREE_H # define RB_TREE_H # include # include # include using namespace std; enum RB_COLOR {BLACK, RED}; // class RB_Tree; // Tree node class TreeNode {friend class RB_Tree; public: TreeNode (): color (BLACK), key (0), parent (NULL),

Meaning: calculate the number of numbers containing only 4 and 7 in a given range and the sum of the numbers in the range after the inversion. Solution: Simulation + mathematics. The code is explained in detail. Please refer to the code. #include #