L1-049 ladder race seat allocation (20 points)

There are a large number of players in the ladder race every year , Make sure that all members of the same school are not adjacent , The allocation of seats becomes a more troublesome thing . So we have the following strategies ： Suppose that there is N Schools compete , The first i Schools have M[i] team , Every team 10 Contestants . Line up the players of each school , The first i+1 The players of the team are in i After the team . From 1 Schools start , The first of each school 1 Members of the team were seated in sequence , And then there's the number 2 Team members …… And so on . If there is only 1 The school team has not allocated seats yet , They need to arrange their team members to sit in separate seats . This question asks you to write a program , Automatically generate the seat number of the team members for each school , from 1 Numbered starting .

Input format ：

Enter the number of colleges and universities in a row N （ No more than 100 The positive integer ）; The second line gives N No more than one. 10 The positive integer , Among them the first i The number corresponds to the i The number of participating teams in Universities , Numbers are separated by spaces .

Output format ：

From 1 The number of colleges and universities 1 Team start , Output the seat number of the team member in sequence . Each team has a line , Between seat numbers 1 Space separation , There must be no extra space at the beginning and end of the line . in addition , Press... On the first line of each university “#X” Output the number of the school X, from 1 Start .

sample input ：

3
3 4 2

sample output ：

#1
1 4 7 10 13 16 19 22 25 28
31 34 37 40 43 46 49 52 55 58
61 63 65 67 69 71 73 75 77 79
#2
2 5 8 11 14 17 20 23 26 29
32 35 38 41 44 47 50 53 56 59
62 64 66 68 70 72 74 76 78 80
82 84 86 88 90 92 94 96 98 100
#3
3 6 9 12 15 18 21 24 27 30
33 36 39 42 45 48 51 54 57 60

Code ：

#include <iostream>

using namespace std;

const int N = 110;

int n, x, rest_cnt;  // rest_cnt  For the number of schools with unassigned students 

//  The number of students in each school   Seat numbers of all students   Number of students assigned seat numbers in each school 
int stu_cnt[N],all_no[N][N], cnts[N];

int main(){
    cin >> n;
    rest_cnt = n;
    for(int i = 1; i <= n; i ++){
        cin >> x;
        stu_cnt[i] = x * 10;
    }
    int no = 1;
    while(rest_cnt){
        for(int i = 1; i <= n; i ++){
            int & cnt = cnts[i];
            if(stu_cnt[i] > cnt){
                all_no[i][cnt ++] = no;
                if(rest_cnt == 1)no += 2;
                else no ++;
                if(cnt == stu_cnt[i]) rest_cnt --;
            }
        }
    }
    // Output 
    for(int i = 1; i <= n; i ++){
        cout << "#" << i << endl;
        for(int j = 0; j < stu_cnt[i]; j ++){
            if(j != 0 && j % 10 == 0) cout << endl;
            if(j % 10 != 0) cout << " ";
            cout << all_no[i][j];
        }
        cout << endl;
    }
}