{"id":117,"date":"2022-12-24T20:39:34","date_gmt":"2022-12-24T12:39:34","guid":{"rendered":"https:\/\/www.vcoco.top\/?p=117"},"modified":"2022-12-28T14:21:00","modified_gmt":"2022-12-28T06:21:00","slug":"%e7%89%9b%e5%ae%a2%e7%bb%83%e4%b9%a0%e8%b5%9b107","status":"publish","type":"post","link":"https:\/\/www.vcoco.top\/index.php\/2022\/12\/24\/%e7%89%9b%e5%ae%a2%e7%bb%83%e4%b9%a0%e8%b5%9b107\/","title":{"rendered":"\u725b\u5ba2\u7ec3\u4e60\u8d5b107"},"content":{"rendered":"\n

\u9898\u76ee\u94fe\u63a5\uff1ahttps:\/\/ac.nowcoder.com\/acm\/contest\/49035<\/p>\n\n\n\n

A<\/h3>\n\n\n\n

\u5f53 $n!<=m$ \u65f6\uff0c$(n!)!$ \u76f4\u63a5\u4ee3\u5165\u6c42\u89e3<\/p>\n\n\n\n

\u5f53 $n!>m$ \u65f6\uff0c$(n!)!\\%m=0$<\/p>\n\n\n\n

#include <bits\/stdc++.h>\n#define x first\n#define y second\n#define all(x) x.begin(),x.end()\n#define rep(i, l, r) for (int i = l; i <= r; i++)\n#define nep(i, r, l) for (int i = r; i >= l; i--)\nusing namespace std;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef pair<int,int> PII;\ntypedef pair<LL,int> PLI;\nconst int INF=0x3f3f3f3f,MOD=1000000007,P=131,N=1000010,M=2*N;\n\nint n,m;\nLL fact[N];\n\nint main()\n{\n    int T; cin>>T>>m;\n    fact[0]=1;\n    int k=0;\n    rep(i,1,1000000)\n    {\n        fact[i]=fact[i-1]*i%m;\n        if(k==0 && fact[i-1]*i>m) k=i;\n    }\n\n    while(T--)\n    {\n        int x; cin>>x;\n        if(x>=k) cout<<0<<endl; \/\/fact[x]>m\n        else cout<<fact[fact[x]]<<endl;\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
B<\/h3>\n\n\n\n
$Q$ \u6570\u5217\u7b2c\u4e00\u4e2a\u5143\u7d20\u53ea\u80fd\u662f1\u62162\uff0c\u5269\u4e0b\u7684\u76f4\u63a5\u6784\u9020<\/p>\n\n\n\n
#include <bits\/stdc++.h>\n#define x first\n#define y second\n#define all(x) x.begin(),x.end()\n#define rep(i, l, r) for (int i = l; i <= r; i++)\n#define nep(i, r, l) for (int i = r; i >= l; i--)\nusing namespace std;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef pair<int,int> PII;\ntypedef pair<LL,int> PLI;\nconst int INF=0x3f3f3f3f,MOD=1000000007,P=131,N=1500010,M=2*N;\n\nint n, p[N];\n\nint main()\n{\n    int T; cin>>T;\n    while(T--)\n    {\n        scanf(\"%d\", &n);\n        vector<int> res(n+10, 0);\n        rep(i,1,n) {\n            scanf(\"%d\",&p[i]);\n        }\n        res[p[1]]=1;\n        if(p[1]!=1) res[1]=2;\n        for(int i=1, k=res[1]+1;i<=n;i++) {\n            if(res[i]) continue;\n            res[i]=k++;\n        }\n        \n        rep(i,1,n) printf(\"%d \", res[i]);\n        puts(\"\");\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
D<\/h3>\n\n\n\n
\u53ef\u4ee5\u53d1\u73b0\u65e0\u8bba\u600e\u4e48\u64cd\u4f5c\u4e24\u5143\u7d20\u548c\u4e0d\u53d8\u3002\u7edf\u8ba1\u6240\u6709\u5143\u7d20\u6bcf\u4e2a\u4e8c\u8fdb\u5236\u4f4d\u4e2a\u6570\uff0c\u628a\u5927\u7684\u6570\u5206\u914d\u5728\u540e\u9762\u5c31\u884c<\/p>\n\n\n\n
#include <bits\/stdc++.h>\n#define x first\n#define y second\n#define all(x) x.begin(),x.end()\n#define rep(i, l, r) for (int i = l; i <= r; i++)\n#define nep(i, r, l) for (int i = r; i >= l; i--)\nusing namespace std;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef pair<int,int> PII;\ntypedef pair<LL,int> PLI;\nconst int INF=0x3f3f3f3f,MOD=1000000007,P=131,N=1500010,M=2*N;\n\nint n;\nint a[N], cnt[35];\n\nint main()\n{\n    int T; cin>>T;\n    while(T--)\n    {\n        memset(cnt, 0, sizeof cnt);\n        scanf(\"%d\", &n);\n        rep(i,1,n){\n            scanf(\"%d\", &a[i]);\n            rep(j,0,30)\n            {\n                if(a[i]>>j&1) cnt[j]++;\n            }\n        }\n\n        vector<int> res;\n        nep(i,n,1){\n            int sum=0;\n            rep(j,0,30){\n                if(cnt[j]) {\n                    sum+=1<<j;\n                    cnt[j]--;\n                }\n            }\n            res.push_back(sum);\n        }\n        \n        for(int i=res.size()-1;i>=0;i--) printf(\"%d \", res[i]);\n        puts(\"\");\n    }\n    return 0;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u9898\u76ee\u94fe\u63a5\uff1ahttps:\/\/ac.nowcoder.com\/acm\/contest\/49035 A \u5f53 $n!& […]<\/p>\n","protected":false},"author":1,"featured_media":180,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[13],"tags":[72,25,74,73],"class_list":["post-117","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-mess","tag-72","tag-thinking","tag-nowcoder","tag-73"],"_links":{"self":[{"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/posts\/117","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/comments?post=117"}],"version-history":[{"count":10,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/posts\/117\/revisions"}],"predecessor-version":[{"id":175,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/posts\/117\/revisions\/175"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/media\/180"}],"wp:attachment":[{"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/media?parent=117"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/categories?post=117"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.vcoco.top\/index.php\/wp-json\/wp\/v2\/tags?post=117"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}