zoukankan      html  css  js  c++  java
  • poj1285 Combinations, Once Again(泛化背包)

    Combinations, Once Again
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 1897   Accepted: 636

    Description

    Given n objects you'd have to tell how many different groups can be chosen if r objects are taken at a time.

    Input

    Input consists of less than 100 test cases. Each test case begins with two integers n (0 < n <= 50), m (0 <= m <= n). The next line will contain the labels (numbers in the range 1 to n) of the n objects you are to choose from. Two objects with the same label are considered equivalent. Then in the last line for that test case, you'd have m values for r. There will be a single space separating two consecutive numbers in a line. Input is terminated by a test case where n=0, you must not process this test case.

    Output

    For each test case, print the test case number. And for each query number r, print the number of different groups that can be formed if r objects are taken from the given n objects. You can assume that for all input cases, the output will always fit in a 64-bit unsigned integer and (0<=r<=n).

    Sample Input

    5 2
    1 2 3 4 5
    2 1
    
    4 1
    1 2 3 4 
    2
    
    0 0
    

    Sample Output

    Case 1:
    10
    5
    Case 2:
    6
    

    Source

    题意:给你n个数,求取r个的方案数
    题解:搜题解时博客上有人说这是泛化背包,说实话,这个东西看了很久都没理解,
    只有等以后再来弄懂了………
    代码:
    #include<cstdio>
    #include<iostream>
    #include<cstdlib>
    #include<cstring>
    #include<string>
    #include<algorithm>
    #include<map>
    #include<queue>
    using namespace std;
    
    typedef long long LL;
    const int N = 1000;
    int num[N], que[N], n, m;
    LL f[N];
    int main(){
        freopen("1285.txt", "r", stdin);
        int cas = 0;
        while(~scanf("%d %d", &n, &m ) && n){
            memset(num, 0, sizeof(num));
            int tp;
            for(int i  = 0; i < n ;i++){
                scanf("%d", &tp);
                tp--;
                num[tp]++;
            }
            for(int i = 0; i < m; i++){
                scanf("%d", &que[i]);
            }
            memset(f, 0, sizeof(f));
            for(int i  = 0 ;i <= num[0]; i++){
                f[i] = 1;
            }
            for(int i = 1; i < n; i++){
                for(int j = n; j >= 1; j--){
                    for(int k = max(j - num[i], 0);  k < j ; k ++){
                            f[j] += f[k];
                    }
                }
            }
            cas++;
            printf("Case %d:
    ", cas);
            for(int i = 0; i < m; i++){
                printf("%I64d
    ", f[que[i]]);
            }
        }
        return 0;
    }
    
     
  • 相关阅读:
    Ceph中的容量计算与管理
    Ceph Monitor基础架构与模块详解
    Ceph:pg peering过程分析
    API调用过程
    Windows内核—保护模式
    逆向笔记——C、C++对应的汇编结构(一)
    2020年内网渗透培训:红队攻防
    2020年 初级渗透工程师【Web安全方向】
    渗透测试【网络安全】入门指南【20190607】
    渗透学习问题【一】遇到坑需要停下来补吗
  • 原文地址:https://www.cnblogs.com/zhgyki/p/9601286.html
Copyright © 2011-2022 走看看