hsl-beat的blog

9dabb3870e1e1d62e2cfdc2d3dc2aa93ead7ec87eacc5371fc397332bcdee5059c7510127967807d024a5f58a209a99bf9d71461673352ec79503cd6622c1a5592b3577e3824535fa4fa771589c37e71 你这么想看啊

Codeforces-837D Round Subset 题解 题目链接 题面 我们把10进制下数末尾0的个数称为这个数的圆度。比如100010的圆度就是1。 给你一个长度为nnn的正整数数组，你要选择恰好kkk个数的子集，使这些数的乘积的圆度尽可能大。 1≤n≤2001 \leq n \leq 2001≤n≤200 1≤k≤n1 \leq k \leq n1≤k≤n 1≤ai≤10181 \leq a_i \leq 10^{18}1≤ai​≤1018 不开long long见祖宗！别忘了！ ...

免责声明：本文章仅供娱乐！并非代表个人观点！请勿自作多情！ 行为1：freopen写挂 killer: CE (compile easily） 123456freopen("joker,in","r",stdin);freopen(joker.in,r,stdin);freopen("joker.in","w",stdin);fre open("joker.in","r","stdin");freopen("joker.in","r",stdin);freopen("joker.in","w",stdin); 行为2：锟斤拷 killer：WA（wonderful answer） 1cout<<"鎴戣涓猴紝 瑕佹兂娓呮锛屽ソ濂藉涔狅紝鍒板簳鏄竴绉嶆€"; 行为3：尝试贿赂 killer：CCF 123456789101112131415161718192021222324puts ("I can't solve this problem. :(");puts ("But I think it uses an algorithm called mo...