[2021-4-9]BNUZ套题比赛div3

A - Stock Arbitraging
第一题水题就不说了，代码如下：

#include<iostream>
using namespace std;
int main()
{
	int maxnum=0,minnum=1e7,a,n, m, r;
	cin >> n >> m >> r;
	for (int i = 0; i < n; i++) {
		cin >> a;
		minnum = min(a, minnum);
	}
	for (int i = 0; i < m; i++) {
		cin >> a;
		maxnum = max(a, maxnum);
	}
	if (maxnum > minnum)  cout << r / minnum * maxnum + r % minnum << endl;
	else cout << r << endl;
}

B - Tiling Challenge
找十字架，把十字架变成#，检查最后有没有.，如果没有打印YES,否则打印NO.代码如下：

#include<iostream>
using namespace std;
#include<cstring>
#include<string>
char a[100][100];
int n;
int dx[] = { 0,0,-1,1 };
int dy[] = { -1,1,0,0 };
void turn(int x,int y)
{
	int flag = 0;
	for (int i = 0; i < 4; i++) {
		int tx = x + dx[i], ty = y + dy[i];
		if (a[tx][ty] == '.')flag++;
	}
	if (flag == 4) {
		
		a[x][y] = '#';
		for (int i = 0; i < 4; i++) {
			int tx = x + dx[i], ty = y + dy[i];
			a[tx][ty] = '#';
		}
	}
}
int check() {
	int ans = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (a[i][j] != '#')return 0;
		}
	}
	return 1;
}
int main()
{
	 cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (a[i][j] == '.') { turn(i, j); }
		}
	}
	if (check())cout << "YES" << endl;
	else cout << "NO" << endl;
}

C - Prefix Sum Primes CodeForces - 1150C
题意：输入的序列是1或者2组成的，输出打印前缀和为素数最多的序列。
思路：那么一个序列前缀和素数最多，那就是2,3，5,7，11,13
…可以知道一个规律那就是除了2素数都是质数，两个质数的差为2,那么答案就出来了，我们先拼出一个3，即2 1，其余就一直+2就行，即2 1 2 2 2 2 … 1 1 1最后把1放上去。
代码如下：

#include<iostream>
#include<cmath>
using namespace std;
#define ll long long
int main()
{
	int n, temp, pos1 = 0, pos2 = 0, flag = 0;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> temp;
		if (temp == 1)  pos1++; 
		else pos2++;
	}
	for (int i = 0; i < pos2; i++) {
		printf("2 ");
		if (pos1&&!flag) { printf("1 "); pos1--; flag = 1; }
	}
	for (int i = 0; i < pos1; i++) {
		printf("1 ");
	}
	printf("\n");
}

D - City Day CodeForces - 1199A
就是求下标iminnum前x天和后y天的区间里面最小的那个.
代码如下：

#include<iostream>
using namespace std;
const int N = 1e5 + 5;
int a[N];
int main()
{
	int temp, n, x, y, flag = 1;
	cin >> n >> x >> y;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	int sum = 0, maxnum = 0, beginum = 1, endinum = 1;
	for (int i = 1; i <= n; i++) {
		flag = 1;
		if (i - x < 1)beginum = 1;
		else beginum = i - x;
		if (i + y > n)endinum = n;
		else endinum = i + y;
		for (int j = beginum; j <= endinum; j++) {
			if (a[j] < a[i]) { flag = 0; break; }
		}
		if (flag) { cout << i << endl; return 0; }
	}
}

E - Water Lily CodeForces - 1199B
勾股定理.

#include<iostream>
#include<cmath>
using namespace std;
#define ll long long
int main()
{
	double h, l;
	double x;
	cin >> h >> l;
	x = 1.0*(1.0 * l * l -1.0 * h * h) / (2 * h);
	printf("%.13lf\n", x);
}

F - MP3 CodeForces - 1199C（搞不太懂题意)
链接：https://blog.csdn.net/xiji333/article/details/100538413