枚举专项练习_Uva725(Division)_Uva11059(Maximun Product)

//Uva725
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;

void evalu(int n)
{
    const int maxn = 1024 + 10;
    char num[10];                      //将数字用字符保存
    int flag[10];                      //判断每个数，是否重复 
    char buf[maxn];                    //将出现的字符全部存到里面 
    for (int i = 1234; i <= 5000; i++)
    {
        memset(flag, 0, sizeof(flag));
        memset(num, 0, sizeof(num));
        sprintf(num, "%05d", i);
//        cout << "Debug: " << num << endl;
//        system("pause");
        int digit = 0, rest = 0;
        digit = (num[0]-'0')*10000 + (num[1]-'0')*1000 + (num[2]-'0')*100 + (num[3]-'0')*10 + (num[4]-'0');
//        cout << "Debug:digit: " << digit << endl;
//        system("pause");
        rest = digit * n;
        sprintf(buf, "%05d%05d", rest, digit);
        int len = strlen(buf), j = 0;
        for (j = 0; j < len; j++) {
            if (flag[buf[j] - '0']) {
                break;
            }
            else {
                flag[buf[j] - '0'] = 1;
            }
        }
        if (j == len) {
            cout << rest << " / " << num << " = " << n << endl;
        }
    }    
}


int main()
{
    int num;
    while (cin >> num) {
        evalu(num);
    }    
    return 0;
}

//Uva11059
#include <iostream>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <fstream>
using namespace std;

//ifstream in("in.txt");
//ofstream out("out.txt");

int main()
{
    long long pro = 1, max_pro = 0;
    vector<long long> num;
    long long data;
    int T, kase = 0;
    while (cin >> T) 
    {
        num.clear();
        pro = max_pro = 0;
        while (T--) {
            cin >> data; num.push_back(data);
        }    
        for (unsigned i = 0; i < num.size(); i++) {
            pro = num[i];
            for (unsigned j = i; j < num.size(); j++) {
                if (i != j) {  
                    pro *= num[j];            //pro尽管乘 
                    if (pro > num[i])         //pro > num[i] 
                        num[i] = pro;         //num[i] = pro, 将最大的乘积放到该位置
                }
            }
        }
        for (unsigned i = 0; i < num.size(); i++) {
            if (num[i] > max_pro) {
                max_pro = num[i];
            }
        }
        cout << "Case #" << ++kase << ": The maximum product is " << max_pro << "." << "

";
    } 
    return 0;
}