C++学习笔记4

正解：暴力模拟。

代码：

#include <bits/stdc++.h>
#define int long long
using namespace std;

int n,a[110],asum; 
int vis[100000];

void solve()
{
	cin >> n;
	for (int i = 1;i <= n;i++) cin >> a[i],vis[a[i]] = 1,asum += a[i];
	for (int i = 1;i <= n;i++)
	{
        for (int j = 1;j+i-1 <= n;j++)
        {
            int sum = 0;
            for (int k = j;k <= j+i-1;k++)
            {
                sum += a[k];
                vis[sum] = 1;
            }
        }
    }
	for (int i = 1;i <= asum;i++)
		if (!vis[i])
		{
			cout << "No";
			return ;
		}
	cout << "Yes";
}

signed main()
{
	solve();
	return 0;
}

正解：不难发现答案就是矩阵大小。证明：

代码：

#include <bits/stdc++.h>
#define int long long
using namespace std;

int T;
int xa,xb,ya,yb;

void solve()
{
	cin >> T;
	while (T--)
	{
		cin >> xa >> xb >> ya >> yb;
		cout << (ya-xa+1) * (yb-xb+1) << '\n';
	}
}

signed main()
{
	solve();
	return 0;
}

正解：看看A队全进&B队全不进，和A队全不进&B队全进，如果最终有两种情况，就是 NO。

代码：

#include <bits/stdc++.h>
//#define int long long
using namespace std;

string s,t;

void solve()
{
	cin >> s >> t;
	int ns = 0,nt = 0,sl = s.size(),tl = t.size();
	for (int i = 0;i < sl;i++)
		if (s[i] == 'O') ns++;
	for (int i = 0;i < tl;i++)
		if (t[i] == 'O') nt++;
	int flag = 0,r = max(sl,5);
	int ts = ns+r-sl,tt = nt+r-tl;
	if (ts >= nt) flag++;
	if (tt >= ns) flag--;
	if (flag < 0) cout << 'B';
	if (flag == 0) cout << "NO";
	if (flag > 0) cout << 'A';
}

signed main()
{
	solve();
	return 0;
}

正解：暴力模拟。

代码：

#include <bits/stdc++.h>
//#define int long long
using namespace std;

int T;
map <string,int> num;
string str[10][5];
string a[5],ans[5];
int ansa[100];

void init()
{
	num["###.#.#.#.#.#.#.###."] = 0;
	num["..#...#...#...#...#."] = 1;
	num["###...#.###.#...###."] = 2;
	num["###...#.###...#.###."] = 3;
	num["#.#.#.#.###...#...#."] = 4;
	num["###.#...###...#.###."] = 5;
	num["###.#...###.#.#.###."] = 6;
	num["###.#.#.#.#...#...#."] = 7;
	num["###.#.#.###.#.#.###."] = 8;
	num["###.#.#.###...#.###."] = 9;
	num[".....#..###..#......"] = -1;
	str[0][0] = "###.";
	str[0][1] = "#.#.";
	str[0][2] = "#.#.";
	str[0][3] = "#.#.";
	str[0][4] = "###.";
	str[1][0] = "..#.";
	str[1][1] = "..#.";
	str[1][2] = "..#.";
	str[1][3] = "..#.";
	str[1][4] = "..#.";
	str[2][0] = "###.";
	str[2][1] = "..#.";
	str[2][2] = "###.";
	str[2][3] = "#...";
	str[2][4] = "###.";
	str[3][0] = "###.";
	str[3][1] = "..#.";
	str[3][2] = "###.";
	str[3][3] = "..#.";
	str[3][4] = "###.";
	str[4][0] = "#.#.";
	str[4][1] = "#.#.";
	str[4][2] = "###.";
	str[4][3] = "..#.";
	str[4][4] = "..#.";
	str[5][0] = "###.";
	str[5][1] = "#...";
	str[5][2] = "###.";
	str[5][3] = "..#.";
	str[5][4] = "###.";
	str[6][0] = "###.";
	str[6][1] = "#...";
	str[6][2] = "###.";
	str[6][3] = "#.#.";
	str[6][4] = "###.";
	str[7][0] = "###.";
	str[7][1] = "#.#.";
	str[7][2] = "#.#.";
	str[7][3] = "..#.";
	str[7][4] = "..#.";
	str[8][0] = "###.";
	str[8][1] = "#.#.";
	str[8][2] = "###.";
	str[8][3] = "#.#.";
	str[8][4] = "###.";
	str[9][0] = "###.";
	str[9][1] = "#.#.";
	str[9][2] = "###.";
	str[9][3] = "..#.";
	str[9][4] = "###.";
}

void print(int num)
{
	int yuan = num,tot = 0;
	while (yuan)
	{
		ansa[++tot] = yuan % 10;
		yuan /= 10;
	}
	for (int i = tot;i >= 1;i--)
	{
		int now = ansa[i];
		for (int j = 0;j < 5;j++)
			ans[j] += str[now][j];
	}
	for (int i = 0;i < 5;i++)
		cout << ans[i].substr(0,ans[i].size()-1) << '\n',ans[i] = "";
}

void solve()
{
	init();
	cin >> T;
	while (T--)
	{
		for (int i = 0;i < 5;i++) cin >> a[i],a[i] += '.';
		int sum = 0,now = 0;
		for (int i = 0;i < a[0].size();i += 4)
		{
			string nows = "";
			for (int j = 0;j < 5;j++)
				for (int k = i;k < i+4;k++) 
					nows += a[j][k];
			if (num[nows] == -1) sum += now,now = 0;
			else now = now * 10 + num[nows];
		}
		sum += now;
		print(sum);
		cout << '\n';
	}
}

signed main()
{
	solve();
	return 0;
}

代码：

#include <bits/stdc++.h>
//#define int long long
using namespace std;

int dp[20010];
int a[10010];
int n;

void solve()
{
	dp[0] = 1;
	for (int i = 1;i <= 10000;i++)
	{
		for (int j = 1;j <= i*2;j++)
			dp[j] = (dp[j] + dp[j-1]) % 10000;
		a[i] = dp[i*2];
	}
	while (cin >> n)
	{
		if (!n) break;
		printf(n>7 ? "%04d\n" : "%d\n",a[n]);
	}
}

signed main()
{
	solve();
	return 0;
}