\u60f3\u5230\u524d\u51e0\u5929 uoj \u51fa\u7684\u90a3\u4e2a gcd \u6570\u8bba\u9898\u3002\u3002\u3002<\/p>\n
Humble Number?
\n\u7ed3\u679c\u5c45\u7136\u66b4\u529b\u5c31\u8fc7\u4e86\u3002\u3002\u3002<\/p>\n
\r\n#include <lastweapon\/io>\r\nusing namespace lastweapon;\r\nconst int N = int(1e2) + 9;\r\n\r\nint n, k, a[N];\r\n\r\nint main() {\r\n#ifndef ONLINE_JUDGE\r\n freopen("in.txt", "r", stdin);\r\n \/\/freopen("out.txt", "w", stdout);\r\n#endif\r\n \r\n RD(n, k); REP(i, n) RD(a[i]);\r\n set<LL> s; s.insert(0);\r\n\r\n DO(k) {\r\n LL x = *s.begin(); s.erase(s.begin());\r\n REP(i, n) {\r\n LL t = x + a[i];\r\n s.insert(t);\r\n }\r\n }\r\n cout << *s.begin() << endl;\r\n}\r\n<\/pre>\nProblem F. Minimum Bounding Box 2<\/h1>\n
\u5bb9\u65a5\u539f\u7406\u3002<\/p>\n
\u4e00\u79cd\u505a\u6cd5\u662f\u76f4\u63a5\u679a\u4e3e Bounding Box\uff0c\u7136\u540e\u5bb9\u65a5\u6389\u81f3\u5c11\u5c0f\u4e00\u5708\u7684\u60c5\u51b5\u3002
\n\u8fd9\u79cd\u505a\u6cd5\u8981\u5bf9\u56db\u4e2a\u8fb9\u754c\u7684 2^4 \u79cd\u5b58\u5728\u60c5\u51b5\u5206\u522b\u8fdb\u884c\u5bb9\u65a5\u3002<\/p>\n
\r\n#include <lastweapon\/io>\r\n#include <lastweapon\/bitwise>\r\n#include <lastweapon\/number>\r\nusing namespace lastweapon;\r\nconst int N = int(1e6) + 9;\r\nInt Fact[N], iFact[N];\r\nint n, m, k;\r\n\r\nInt Binom(int n, int m) {\r\n if (m < 0 || m > n) return 0;\r\n return Fact[n] * iFact[m] * iFact[n-m];\r\n}\r\n\r\nInt f(int n, int m) {\r\n Int z = 0; REP(s, _1(4)) {\r\n int a = n - _1(s, 0) - _1(s, 1); if (a <= 0) continue;\r\n int b = m - _1(s, 2) - _1(s, 3); if (b <= 0) continue;\r\n Int d = Binom(a*b, k);\r\n if (count_bits(s) & 1) z -= d; else z += d;\r\n }\r\n return z;\r\n}\r\n\r\nint main() {\r\n#ifndef ONLINE_JUDGE\r\n freopen("in.txt", "r", stdin);\r\n#endif\r\n\r\n MOD = 998244353;\r\n\r\n RD(n, m, k); Fact[0] = 1; REP_1(i, n*m) Fact[i] = Fact[i-1] * i; iFact[n*m] = _I(Fact[n*m]);\r\n DWN_1(i, n*m, 1) iFact[i-1] = iFact[i] * i;\r\n\r\n Int z = 0; REP_1(i, n) REP_1(j, m) z += f(i, j)*i*j*(n+1-i)*(m+1-j);\r\n z \/= Binom(n*m, k);\r\n cout << z << endl;\r\n}\r\n<\/pre>\n\u66f4\u597d\u7684\u505a\u6cd5\u662f\u5229\u7528\u671f\u671b\u7684\u7ebf\u6027\u6027\u3002\u3002\u5355\u72ec\u8003\u5bdf\u6bcf\u4e2a\u683c\u5b50\u3002\u3002\u7edf\u8ba1\u5b83\u5bf9\u7b54\u6848\u7684\u5f71\u54cd\u3002\u3002\u3002
\n\u53ea\u8981\u5bb9\u65a5\u6389\u56db\u4e2a\u89d2\u5373\u53ef\u3002<\/p>\n
\r\n#include <lastweapon\/io>\r\n#include <lastweapon\/bitwise>\r\n#include <lastweapon\/number>\r\nusing namespace lastweapon;\r\nconst int N = int(1e6) + 9;\r\nInt Fact[N], iFact[N];\r\nint n, m, k;\r\n\r\nInt Binom(int n, int m) {\r\n if (m < 0 || m > n) return 0;\r\n return Fact[n] * iFact[m] * iFact[n-m];\r\n}\r\n\r\nInt f(int x, int y) {\r\n Int z = Binom(n*m, k);\r\n z -= Binom((x-1)*m, k) + Binom((n-x)*m, k) + Binom(n*(y-1), k) + Binom(n*(m-y), k);\r\n z += Binom((x-1)*(y-1), k) + Binom((x-1)*(m-y), k) + Binom((n-x)*(y-1), k) + Binom((n-x)*(m-y), k);\r\n return z;\r\n}\r\n\r\nint main() {\r\n#ifndef ONLINE_JUDGE\r\n freopen("in.txt", "r", stdin);\r\n#endif\r\n\r\n MOD = 998244353;\r\n\r\n RD(n, m, k); Fact[0] = 1; REP_1(i, n*m) Fact[i] = Fact[i-1] * i; iFact[n*m] = _I(Fact[n*m]);\r\n DWN_1(i, n*m, 1) iFact[i-1] = iFact[i] * i;\r\n\r\n Int z = 0; REP_1(i, n) REP_1(j, m) z += f(i, j);\r\n z \/= Binom(n*m, k);\r\n cout << z << endl;\r\n}\r\n\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"Problem D. Count Subtractions \u60f3\u5230\u524d\u51e0\u5929 uoj \u51fa\u7684\u90a3\u4e2a gcd \u6570\u8bba\u9898\u3002\u3002\u3002 Problem E. Kth Takoyaki Set Humble Number? \u7ed3\u679c\u5c45\u7136\u66b4\u529b\u5c31\u8fc7\u4e86\u3002\u3002\u3002 #include <lastweapon\/io> using namespace lastweapon; const int N = int(1e2) + 9; int n, k, a[N]; int main() { #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); \/\/freopen("out.txt", "w", stdout); #endif RD(n, k); REP(i, n) RD(a[i]); set<LL> s; s.insert(0); DO(k) { […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[1],"tags":[],"class_list":["post-2606","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-G2","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/2606","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/comments?post=2606"}],"version-history":[{"count":8,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/2606\/revisions"}],"predecessor-version":[{"id":2679,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/2606\/revisions\/2679"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=2606"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=2606"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=2606"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}