cham_3

Problem Description:If a machine can save only 3 significant digits, the float numbers 12300 and 12358.9 are considered equal since they are both saved as 0.123*105 with simple chopping. Now given t

题目的目的是很简单明了的，就是给定一棵二叉树的后序序列和中序序列,要求我们给出层次遍历的序列。本题的关键点在于二叉树的重建和层次遍历。本题是利用后序序列和中序序列来进行二叉树的重建,参考函数如下:Node * rebuild(int *post,int *in,int len ){ if(len == 0) return NULL; //判断是否为空树

最近刚开始做PAT的练习题,太久没敲题目,手和脑袋都生锈了.本题的题意就是要我们在family tree族谱上找出同一辈(与根节点距离相等的节点)没有child的节点个数.博主在做这道题时用的是广搜+连接表;主要注意的地方在于:输入的节点编号不一定是连续的;父节点的编号不一定小于子节点的编号;参考代码如下,大牛勿喷:#includeint main(){ int n,m,l[110]={0}

The task is simple: given any positive integer N, you are supposed to count the total number of 1's in the decimal form of the integers from 1 to N. For example, given N being 12, there are five 1's i

#include#includeint main(){    int i,j,cnt=0,sum=0,len;    char num[100000],temp[100000],sign_n,sign_e,neg='-';    scanf("%s",num);len=strlen(num);    sign_n=num[0];    for(i=1,j=0;i

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the l

Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is "yes", if 6 is a decimal number and 110 is a binary number.Now for any pair of positive

Given a string, you are supposed to output the length of the longest symmetric sub-string. For example, given "Is PAT&TAP symmetric?", the longest symmetric sub-string is "s PAT&TAP s", hence you must