- 博客(6)
- 资源 (2)
- 收藏
- 关注
原创 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
原创 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 371
原创 Maximum Subsequence Sum (25)
//1007. Maximum Subsequence Sum #include #include using 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 373
原创 1006. Sign In and Sign Out (25)
1006. Sign In and Sign Out (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue At the beginning of every day, the fi
2014-09-12 12:21:48 420
原创 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. Input Each input file contains one test case. Each case starts with
2014-09-11 17:14:32 465
原创 1003. Emergency (25)
#include using namespace std; #define MAX 100000 int 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
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人