PAT
冰镇nn
这个作者很懒,什么都没留下…
展开
-
PAT: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.InputEach input file contains one test case. Each case starts with原创 2014-09-11 17:14:32 · 467 阅读 · 0 评论 -
1006. Sign In and Sign Out (25)
1006. Sign In and Sign Out (25)时间限制400 ms内存限制32000 kB代码长度限制16000 B判题程序Standard作者CHEN, YueAt the beginning of every day, the fi原创 2014-09-12 12:21:48 · 420 阅读 · 0 评论 -
Maximum Subsequence Sum (25)
//1007. Maximum Subsequence Sum #include#includeusing namespace std;int input[10001];int main(){ int n,i,j,sum,l,h,start,end; bool flag=0; sum=l=h=j=0; cin>>n; for(i=0;i<n;i++) { cin>>原创 2014-09-12 15:28:04 · 374 阅读 · 0 评论 -
1003. Emergency (25)
#includeusing namespace std;#define MAX 100000int visited[501],map[1000][1000],d[501],team[501],path[501],call[501];int n,m,c1,c2,i;void shortestPath(int s,int t){ int j; path[s]=1; call[s]原创 2014-09-07 16:11:42 · 389 阅读 · 0 评论 -
1002. A+B for 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 occupies 2 lines, and each line contains the inf原创 2014-09-12 20:30:10 · 373 阅读 · 0 评论 -
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 occupies 2 lines, and each line contains the inf原创 2014-09-14 19:37:24 · 382 阅读 · 0 评论