yming0221

摘要： #include<stdio.h>int grade[7];void pubble(){ int _i,_j; int tmp; for(_i=0;_i<6;_i++) for(_j=_i;_j<6;_j++) if(grade[_i]>grade[_j]) { tmp=grade[_i]; grade[_i]=grade[_j]; grade[_j]=tmp; }}int sum(){ int _j; int max=0; for(_j=1;_j<5;_j++) max+=grade[_j]; return max;}int... 阅读全文

摘要： Is It A Tree?Time Limit:1000MSMemory Limit:10000KTotal Submissions:9821Accepted:3354DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties.There is exac 阅读全文