HDU 3699 A hard Aoshu Problem （水题）

题目

http://acm.hdu.edu.cn/showproblem.php?pid=3699

题意

给三个只含有{'A' ... 'E'}的字符串是s1, s2, s3，对不同的字符取不同的值(0-9)，求满足等式s1 (+-*/) s2 = s3的种类数

解法

暴力枚举，用set标记种类数

代码

#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <set>
using namespace std;
set<pair<pair<pair<int, int>, int>, int> >s;
int a[10];
int shu1, shu2, shu3;
char s1[10], s2[10], s3[10];
int get(char* s) {
    int n = strlen(s);
    if(n != 1 && a[s[0] - 'A'] == 0) return -1;
    else {
        int sum = 0;
        for(int i = 0; i < n; i++)
            sum = sum * 10 + a[s[i] - 'A'];
        return sum;
    }
}
int main() {
    int T;
    scanf("%d", &T);
    while(T--) {
        scanf("%s %s %s", s1, s2, s3);
        s.clear();
        for(int i = 0; i < 10; i++) {
            for(int j = 0; j < 10; j++) {
                if(j == i) continue;
                for(int k = 0; k < 10; k++) {
                    if(k == j || k == i) continue;
                    for(int m = 0; m < 10; m++) {
                        if(m == k || m == j || m == i) continue;
                        for(int l = 0; l < 10; l++) {
                            if(l == m || l == k || l == j || l == i) continue;
                            a[0] = i; a[1] = j; a[2] = k; a[3] = m; a[4] = l;
                            shu1 = get(s1); shu2 = get(s2); shu3 = get(s3);
                            if(shu1 != -1 && shu2 != -1 && shu3 != -1) {
                                if(shu1 + shu2 == shu3) 
                                    s.insert(make_pair(make_pair(make_pair(shu1, shu2), shu3), 1));
                                if(shu1 - shu2 == shu3) 
                                    s.insert(make_pair(make_pair(make_pair(shu1, shu2), shu3), 2));
                                if(shu1 * shu2 == shu3) 
                                    s.insert(make_pair(make_pair(make_pair(shu1, shu2), shu3), 3));
                                if(shu2 != 0 && shu1 == shu2 * shu3) 
                                    s.insert(make_pair(make_pair(make_pair(shu1, shu2), shu3), 4));
                            }
                        }
                    }
                }
            }
        }
        printf("%d\n", s.size());
    }
    return 0;
}

Source

2010 Asia Fuzhou Regional Contest

转载于:https://www.cnblogs.com/acm_record/p/4725990.html