多校第七场

HDU 4671 Backup Plan

spj.................所以各种构造正解就行了.......签到题

#include<cstdio>
#include<cstring>
#include <iostream>
using namespace std;
int n,m;
int ord[100][2];
int cnt[100];


int main() {
    while(scanf("%d %d",&n,&m) != EOF) {
        for(int i=1; i<=n; ++i) {
            cnt[i]=m/n;
            if(m % n >= i) ++ cnt[i];
        }

        int tmp=1;
        for(int i=1; i<=n; ++i)
            for(int j=1,k=n; j<=cnt[i]; ++j,--k) {
                while(i==k || k==0) {
                    if(i == k) --k;
                    if(k == 0) k = n;
                }
                ord[tmp][0] = i;
                ord[tmp][1] = k;
                ++tmp;
            }

        for(int i=1; i<=m; ++i) {
            printf("%d %d",ord[i][0],ord[i][1]);
            for(int j=1; j<=n; ++j) if(j != ord[i][0] && j != ord[i][1])
                    printf(" %d",j);
            printf("\n");
        }
    }
    return 0;
}

剩下的有待更新.................