暴力法

暴力法

1. 给出n,0-9数字每个使用一次, 组成两个5位数, 使abcde/fghij=n

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

char ans[11] = "0123456789";
char s[11];
int main() {
#ifdef LOCAL
    freopen("E:\\Cpp\\1.in", "r", stdin);
#endif

    int n, pro, m = 0;
    bool flag = false;
    while (~scanf("%d", &n) && n) {
        if (m++)
            printf("\n");
        flag = false;
        for (int i = 1234; i < 49876; i++) {
            // 2<=n<=79
            pro = n * i;
            if (pro > 98765)
                break;
            if (i < 10000)
                sprintf(s, "0%d%d", i, pro);
            else
                sprintf(s, "%d%d", i, pro);
            sort(s, s + 10);
            if (strcmp(s, ans) == 0) {
                printf("%d / %05d = %d\n", pro, i, n);
                flag = true;
            }
        }
        if (!flag)
            printf("There are no solutions for %d.\n", n);
    }
    return 0;
}

2. 给出k, 求满足1/k = 1/x + 1/y的x和y

#include <cstdio>
using namespace std;
const int maxn = 10005;
const double eps = 1e-6;
int ansx[maxn], ansy[maxn];
int main() {
#ifdef LOCAL
    freopen("E:\\Cpp\\1.in", "r", stdin);
#endif
    int k, x, y;
    double tmp;
    while (~scanf("%d", &k)) {
        int cnt = 0;
        for (y = k + 1; y <= 2 * k; y++) {
            tmp = (double)k * y / (y - k);
            x = (int)tmp;
            if (tmp - x < eps) {
                ansx[cnt] = x;
                ansy[cnt] = y;
                cnt++;
            }
        }
        printf("%d\n", cnt);
        for (int i = 0; i < cnt; i++)
            printf("1/%d = 1/%d + 1/%d\n", k, ansx[i], ansy[i]);
    }

    return 0;
}