zoukankan      html  css  js  c++  java
  • luogu_P5020 货币系统

    什么玄学数组大小。。。开了10背才过

    #include<iostream>
    #include<cstdio>
    
    #define ri register int
    #define u int
    
    namespace opt {
    
        inline u in() {
            u x(0),f(1);
            char s(getchar());
            while(s<'0'||s>'9') {
                if(s=='-') f=-1;
                s=getchar();
            }
            while(s>='0'&&s<='9') {
                x=(x<<1)+(x<<3)+s-'0';
                s=getchar();
            }
            return x*f;
        }
    
    }
    
    using opt::in;
    
    #include<algorithm>
    #include<cstring>
    
    #define NN 250005
    
    namespace mainstay {
    
        u kin[NN],a[NN];
    
        inline void solve() {
            u T(in());
            while(T--) {
                std::memset(kin,0,sizeof(kin));
                std::memset(a,0,sizeof(a));
                u N(in());
                for(ri i(1);i<=N;++i){
                    a[i]=in();
                    kin[a[i]]=2;
                }
                std::sort(a+1,a+N+1);
                for(ri i(1);i<=a[N];++i){
                    if(kin[i]){
                        for(ri j(1);j<=N;++j){
                            kin[i+a[j]]=1;
                        }
                    }
                }
                u ans(0);
                for(ri i(1);i<=N;++i) ans+=(kin[a[i]]==2);
                std::cout<<ans<<std::endl;
            }
        }
    
    }
    
    int main() {
    
        //freopen("x.txt","r",stdin);
        std::ios::sync_with_stdio(false);
        mainstay::solve();
    
    }
  • 相关阅读:
    hgoi#20191101
    hgoi#20191031
    hgoi#20191030
    hgoi#20191029-2
    RMQ (Range Minimum/Maximum Query)
    数学浅谈-组合数与数学期望
    重庆NK十日行-知识点汇总
    分块
    STL—algorithm与Map容器
    搜索—迭代加深
  • 原文地址:https://www.cnblogs.com/ling-zhi/p/11787369.html
Copyright © 2011-2022 走看看