2019年第十届蓝桥杯组队题目第一题

Posted 2022-04-04 猪八戒1.0

 20的5次幂百万次，1s不会超时

#include<iostream>
using namespace std;
int one[20] = 97, 92, 0, 0, 89, 82, 0, 0, 0, 95, 0, 0, 94, 0, 0, 0, 98, 93, 0, 0;
int two[20] = 90, 85, 0, 0, 83, 86, 0, 97, 0, 99, 0, 0, 91, 83, 0, 0, 83, 87, 0, 99;
int three[20] = 0, 96, 0, 0, 97, 0, 0, 96, 89, 0, 96, 0, 0, 87, 98, 0, 99, 92, 0, 96;
int four[20] = 0, 0, 0, 80, 0, 0, 87, 0, 0, 0, 97, 93, 0, 0, 97, 93, 98, 96, 89, 95;
int five[20] = 0, 0, 93, 86, 0, 0, 90, 0, 0, 0, 0, 98, 0, 0, 98, 86, 81, 98, 92, 81;
int main()

	int ans=0;
	for(int i=0;i<20;i++)
		for(int j=0;j<20;j++)
			if(i==j)	continue;
			for(int k=0;k<20;k++)
				if(i==k||j==k)	continue;
				for(int m=0;m<20;m++)
					if(i==m||j==m||k==m)	continue;
					for(int n=0;n<20;n++)
						if(i==n||j==n||k==n||m==n)	continue;
						if(one[i]+two[j]+three[k]+four[m]+five[n]>ans)
						ans=one[i]+two[j]+three[k]+four[m]+five[n];
						
					
				
			
	
	cout<<ans;
	return 0;