The Balance （母函数）

最新推荐文章于 2024-03-30 12:18:43 发布

zzcblogs

最新推荐文章于 2024-03-30 12:18:43 发布

阅读量365

点赞数

分类专栏：简单数论文章标签：母函数 acm

本文链接：https://blog.csdn.net/zzcblogs/article/details/71703292

版权

简单数论专栏收录该内容

7 篇文章 0 订阅

订阅专栏

The Balance

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 137 Accepted Submission(s): 90

Problem Description

Now you are asked to measure a dose of medicine with a balance and a number of weights. Certainly it is not always achievable. So you should find out the qualities which cannot be measured from the range [1,S]. S is the total quality of all the weights.

Input

The input consists of multiple test cases, and each case begins with a single positive integer N (1<=N<=100) on a line by itself indicating the number of weights you have. Followed by N integers Ai (1<=i<=N), indicating the quality of each weight where 1<=Ai<=100.

Output

For each input set, you should first print a line specifying the number of qualities which cannot be measured. Then print another line which consists all the irrealizable qualities if the number is not zero.

Sample Input

Sample Output

0
2
4 5

题意，给你几个砝码，总和以内，什么质量称不出来。

首先要理解母函数的定义。

//freopen("/Users/zhangzhichao/Documents/HDOJ/HDOJ/1.txt", "r", stdin);
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <string.h>
#include <memory>
#include <queue>
using namespace std;
const int MAXN = 12000;
vector<int> ans;
int a[MAXN];
int c[MAXN];
int temp[MAXN];
int main() {
    int n;
    int sum;
    while (scanf("%d", &n) != EOF) {
        for (int i = 0; i <= MAXN; ++i)
            c[i] = 0;
        ans.clear();
        sum = 0;
        for (int i = 0; i < n; ++i) {
            scanf("%d", a + i);
        }
        sum = a[0];
        c[0] = c[sum] = 1;
        for (int i = 1; i < n; ++i) {
            for (int j = 0; j <= sum; ++j) {
                for (int k = 0; k <= a[i]; k += a[i]) {
                    temp[k + j] += c[j];
                    temp[abs(k - j)] += c[j];
                }
            }
            sum += a[I];  //简单优化一下
            for (int j = 0; j <= sum; ++j) {
                c[j] = temp[j];
                temp[j] = 0;
            }
        }
        for (int i = 0; i <= sum; ++i) {
            if (!c[i])
                ans.push_back(i);
        }
        cout << ans.size() << endl;
        if (!ans.empty()) {
            for (int i = 0; i < ans.size(); ++i) {
                if (i)
                    printf(" %d", ans[i]);
                else
                    printf("%d", ans[i]);
            }
            printf("\n");
        }
        
    }
}