sduuntion的专栏

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.InputEach input file contains one test case. Each case starts with

水题#include using namespace std;int main(){ //freopen("F:/CppProject/data/1019.txt","r",stdin); long long n,b; cin>>n>>b; int num[50]; if(n==0 || n==1) { cout<<"Yes"<<endl<<n<<endl; re

1，输入的数最长有20位，即使用long long 类型 的数也不够，所以用字符串处理2，zhu

题目地址：http://pat.zju.edu.cn/contests/pat-a-practise/1011

1013：直接使用bfs计算连通分支数，注意在开始bfs时将被占领的城市表示已访问过的点，visited[p]=1#include #include #include using namespace std;int map[1005][1005],temp[1005][1005],visited[1005];int n,m,k;void dfs(int s){

这一题几个注意的地方：1，n的最大长度为10的10次方，k最大

没什么好说的，注意输入为0的时候的输出吧

很简单的一个题，但是一直卡在最后一个

注意n2>n1和n3.#include #include #include using namespace std;char str[90];int main(){ scanf("%s",str); int len =strlen(str); int n2=(len+2)/3>=3?(len+2)/3:3; int n3=(len-n2)/2,n1=n3; i

水题，熟悉一下cin的getline方法和

这题比较简单，我的思路是1，从任意点开始一次bfs找到最远的jie

注意有并列的时候的名次，比如两个第一名则为1,1,3而不是1,1,2

The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 sec

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 occupies 2 lines, and each line contains the inf

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:Each input file contains one test case.

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 records of signing in's and out's, you

This time, you are supposed to find A+B where A and B are two polynomials.InputEach input file contains one test case. Each case occupies 2 lines, and each line contains the information of a p

Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 Maximum Subsequence is the continuous subsequence which has the largest su

#include #include #include using namespace std;int main(){ int a,b; scanf("%d%d",&a,&b); int sum=a+b; char result[15]; int p=0; if(sum0) { //strcat(result,"-"); result[p]

将这个数（1）转为D进制数（2）将这个D进制数反转（3）将反转后的数再转为十进制数，这个十进制数依然是素数。 这样我们就输出“Yes”。

1，当队列长度n为偶数是，median是第n/2个数，当n为基数是，是第n/2+1个数2，