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

#include <stdio.h>
#include <stdlib.h>

int count=0;
void src(int i ,int a[][4],int b[])
{
	if(i>=11)
	{
		if(b[0]==1&&b[1]==4&&b[2]==3&&b[3]==3)
		{
			count++;
		}
		
	}
	else
		{
			int j=0;
			for(j;j<4;j++)
			{
				if(a[i][j]==1)
				{
					b[j]++;
					src(i+1,a,b);
					b[j]--;
				}
			}
		}
}
int main(int argc, char *argv[]) {
	int any[11][4];
	int num[4];
	int i,temp;
	for(i=0;i<4;i++)
	{
		num[i]=0;
	}
	for(i=0;i<11;i++)
	{
		scanf("%d",&temp);
		any[i][0]=temp/1000;
		temp-=any[i][0]*1000;
		any[i][1]=temp/100;
		temp-=any[i][1]*100;
		any[i][2]=temp/10;
		temp-=any[i][2]*10;
		any[i][3]=temp;
	}
	src(0,any,num);
	printf("%d",count);
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
string a[12];
bool vis[12];
int b[4];//1433
int checkb[4] = { 1,4,3,3 };
int c[5];
int ans;
void dfs(int step)
{
	if (step == 12)
	{
		ans++;
		return;
	}
	for (int i = 0; i < 4; i++)
	{
		if (a[step][i] == '1' && c[i] < checkb[i])
		{
			c[i]++;
			dfs(step + 1);
			c[i]--;
		}
	}
}
int main()
{
	for (int i = 1; i <= 11; i++)
	{
		cin >> a[i];
		for (int j = 0; j < 4; j++)
		{
			if (a[i][j] == '1')
			{
				b[j]++;
			}
		}
	}
	for (int i = 0; i < 4; i++)
	{
		if (b[i] < checkb[i])
		{
			cout << "0" << endl;
			return 0;
		}
	}
	dfs(1);
	cout << ans << endl;
	return 0;
}

import java.util.Scanner;

public class Main {
	public static int count=0;
	public static int[] ans=new int[20];
	public static char[][] a=new char[20][20];
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		for(int i=0;i<11;i++)
		{
			String s=sc.next().trim();
			for(int j=0;j<4;j++)
				a[i][j]=s.charAt(j);	
		}
		dfs(0);
		System.out.println(count);
	}

	private static void dfs(int step) {
		if(step==11) {
			if(ans[0]==1&&ans[1]==4&&ans[2]==3&&ans[3]==3)
				count++;
			return;
		}
		for(int i=0;i<4;i++) {
			if(a[step][i]=='1') {
				ans[i]++;
				dfs(step+1);
				ans[i]--;
			}
				
		}
		
	}
}

s=0
def dfs(order):
    global s    #声明引用的是全局变量
    if order==11:
        s+=1
        return
    for i in range(4):
        if plan[i]>0 and team[order][i]=='1':
            plan[i]-=1
            dfs(order+1)
            plan[i]+=1
plan=[1,4,3,3]
team=[]
for i in range(11):
    team.append(input(""))
dfs(0)
print(s)