第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-659 比赛安排

#include<stdio.h>
#include<math.h>
#include<string.h>
 
#define SIZE 1 << 6
 
int main () {
	
	int n;
	int a[SIZE+1][SIZE+1];	//下标从1开始，记录队伍一和队伍二是否已经比赛 
	int v[SIZE+1];	// 下标从1开始，记录某队伍该天已经比赛 
	int i,j,k,h;
	int len;
	
	scanf("%d", &n);
	memset(a,0,sizeof(a));
	len = (int)pow(2,n);	//队伍数2^n
 
	for(i = 0; i < len-1; i ++){	//天数 2^n-1 
		printf("<%d>",i+1);
		memset(v,0,sizeof(v));	//重置（该天每个队伍都没被访问） 
		for(j = 0; j < len/2; j ++){	//每天n场 
			for(k = 1; k <= len; k ++){		//队伍一
				if(v[k] == 1)	//该天该队伍是否已经比赛 
					continue;
				int judge = 0;	//判断k，h这两对如果比赛就跳出，今天不再会有他们的比赛 
				for(h = 1; h <= len; h ++){	//队伍一二 
					if(k == h)	  //队伍一等于队伍二跳出 
						continue;
					if(v[h] == 1)	//该天该队伍是否已经比赛
						continue;
					if(a[k][h] == 0 && a[h][k] == 0){	//h，k两队伍该天是否有一起比赛 
						printf("%d-%d ", k, h);
						v[h] = 1;	//标记h队伍今天不再比赛比赛 
						v[k] = 1;	//标记k队伍今天不再比赛比赛 
						a[k][h] = 1;	//标记h和k今天已经比赛 
						judge = 1;	//标记第j场结束，跳到下一场 
						break;
					}
				}
				if(judge == 1)	//第j场结束，跳到下一场  
					break;
			}
		/*	if(j != len/2-1)
				printf(","); */
		}	//多少场 (尾部)
		printf("\n");
	}
	
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
bool is[505][505],vis[505];
int main()
{
    int n;scanf("%d",&n);
    memset(is,0,sizeof(is));
    int T=(1<<n)-1,ans=0;
    while(T--)
    {
        memset(vis,0,sizeof(vis));
        printf("<%d>",++ans);
        bool bb=0;
        for(int i=1;i<=(1<<n);i++)
        {
            if(!vis[i])
            {
                vis[i]=1;
                for(int j=i+1;j<=(1<<n);j++)
                {
                    if(!vis[j]&&!is[i][j])
                    {
                        vis[j]=1;is[i][j]=1;
                        if(bb)printf("\n");
                        printf("%d-%d",i,j);
                        bb=1;break;
                    }
                }
            }
        }
        printf("\n");
    }
    return 0;
}

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public final static int size=1<<6;
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        int a[][]=new int[size+1][size+1];
        int v[]=new int[size+1];
        int n=sc.nextInt();
        int len=(int) Math.pow(2, n);
        for(int i=1;i<=len-1;i++) {
            Arrays.fill(v,0);
            System.out.print("<"+i+">");
            for (int j = 1; j <= len / 2; j++) {
                for (int k = 1; k <= len; k++) {
                    if (v[k] == 1) {
                        continue;
                    }
                    for (int h = 1; h <= len; h++) {
                        if (h == k) {
                            continue;
                        }
                        if (v[h] == 1) {
                            continue;
                        }
                        if (a[h][k] == 0 && a[k][h] == 0) {
                            System.out.print(k + "-" + h + " ");
                            v[k] = 1;
                            v[h] = 1;
                            a[k][h] = 1;
                            a[h][k] = 1;
                            break;
                        }
                    }
                }
            }
            System.out.println();
        }

    }
}

n=int(input())
whole_visit=[[0 for _ in range(2**n)] for _ in range(2**n)]
for i in range(2**n-1):
    print('<'+str(i+1)+'>',end='')
    visit=[0 for _ in range(2**n)]
    for j in range(2**n):
        for k in range(2**n):
            if j==k:
                continue
            if whole_visit[j][k]==0 and visit[j]==0 and visit[k]==0:
                whole_visit[j][k]=1
                whole_visit[k][j]=1
                visit[j]=1
                visit[k]=1
                print(str(j+1)+'-'+str(k+1),end=' ')
    print()