蓝桥杯备赛打卡Day11

蓝桥杯每日一题
1.有序分数（简单）
2.带分数

以下是代码

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<string>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#include<math.h>
#include<set>
#include<map>
#include<string.h>
#include<deque>
using namespace std;


//有序分数
int n, cnt;
map<double, int> mp;
struct P
{
	double res;
	int n1, n2;
}p[40000];

int main()
{
	ios::sync_with_stdio(false);
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= i - 1; j++)
		{
			if (j!=1 && i % j == 0) continue;
			double res = (double)j / i;
			if (!mp.count(res))
			{
				p[cnt++] = { res,j,i };
				mp[res] = 1;
			}
		}
	}

	sort(p, p + cnt, [&](P x, P y) {
		return x.res < y.res;
		});

	printf("0/1\n");
	for (int i = 0; i < cnt; i++)
	{
		printf("%d/%d\n", p[i].n1, p[i].n2);
	}
	printf("1/1\n");
	return 0;
}

//带分数
//全排列+把数组分成三段拼接成三个数字
int a[10], n, cnt;

int main()
{
	ios::sync_with_stdio(false);
	cin >> n;
	for (int i = 1; i <= 9; i++) a[i] = i;
	do
	{
		for (int i = 2; i <= 7; i++)
		{
			for (int j = i; j <= 8; j++)
			{
				int n1 = 0, n2 = 0, n3 = 0;
				for (int k = 1; k < i; k++) n1 = n1 * 10 + a[k];
				for (int k = i; k <= j; k++) n2 = n2 * 10 + a[k];
				for (int k = j + 1; k <= 9; k++) n3 = n3 * 10 + a[k];
				if (n2 % n3 == 0 && n1 + n2 / n3 == n) cnt++;
			}
		}
	} while (next_permutation(a + 1, a + 10));

	cout << cnt << endl;

	return 0;
}