摘要： #includeint map[11][11];int hang_hash[11][11];int lie_hash[11][11];int box[11][11];int shudu[11][11] = {{0}, {0,1,1,1,2,2,2,3,3,3}, {0,1,1,1,2,2,2,3,3,3}, {0,1,1,1,2,2,2,3,3,3}, {0,4,4,4,5,5,5,6,6,6}, {0,4,4,4,5,5,5,6,6,6}, {0,4,4,4,5,5,5,6,6,6}, {0,7,7,7,8,8,8,9,9,9}, ... 阅读全文

摘要： struct node{ char str[22]; int num; int score;}stu[N];bool cmp(const node &a, const node &b){ if(a.score == b.score) return strcmp(a.str, b.str) b.score;}sort(stu , stu + N, cmp); 阅读全文