rebornyp的博客

1002. A+B for Polynomials (25)题目阐述 This time, you are supposed to find A+B where A and B are two polynomials. Input Each input file contains one test case. Each case occupies 2 lines

Is It a Complete AVL Tree题目阐述 An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they d...

C/C++语言学习笔记及简单程序Demo记录1- 判别素数小程序#include <iostream>#include <stdio.h>using namespace std;int isPrime(int);int main() { int a; cin >> a; while (a != -1) {...

Build A Binary Search Tree题目阐述 A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only nodes with k...

Deepest Root题目阐述 A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a h...

Palindromic Number A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers ...

Digital Library题目阐述 A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned ...

Acute Stroke题目阐述 One important factor to identify acute stroke (急性脑卒中) is the volume of the stroke core. Given the results of image analysis in which the core regions are identified in each MR...

Tree Traversals Again题目阐述 An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered f...

题目阐述 Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with followers relations...

Head of a Gang题目描述 One way that the police finds the head of a gang is to check people’s phone calls. If there is a phone call between A and B, we say that A and B is related. The weight of a ...

To Fill or Not to Fill题目描述 With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the ...

First Contact题目阐述 Unlike in nowadays, the way that boys and girls expressing their feelings of love was quite subtle in the early years. When a boy A had a crush on a girl B, he would usually no

1001. A+B Format (20)题目阐述 Calculate a + b and output the sum in standard format – that is, the digits must be separated into groups of three by commas (unless there are less than four digits).

1018. Public Bike Management (30)题目阐述 There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any stati

1004. Counting Leaves (30)题目阐述 A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child. Input Each input file contains one

1006. Sign In and Sign Out题目阐述 At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the r

1007. Maximum Subsequence Sum (25)题目阐述 Given a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to be { Ni, Ni+1, …, Nj } where 1 Now you are supposed to find

1005. Spell It Right (20)题目阐述 Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English. Input Specification:

1009. Product of Polynomials (25)题目阐述 This time, you are supposed to find A*B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each case

All Roads Lead to Rome题目描述 题目描述 Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the mo

Final Grading题目阐述 For a student taking the online course “Data Structures” on China University MOOC (http://www.icourse163.org/), to be qualified for a certificate, he/she must first obtain no

题目描述：某物流派送员p，需要给a、b、c、d4个快递点派送包裹，请问派送员需要选择什么的路线，才能完成最短路程的派送。假设如图派送员的起点坐标(0,0)，派送路线只能沿着图中的方格边行驶，每个小格都是正方形，且边长为1，如p到d的距离就是4。随机输入n个派送点坐标，求输出最短派送路线值（从起点开始完成n个点派送并回到起始点的距离）。题目分析 首先应该想到的是最笨最常见的做法，那就是枚...