原文:Codeforces Round #599 (Div. 1) B. 0-1 MST 图论

D. MST Ujan has a lot of useless stuff in his drawers, a considerable part of which are his math notebooks: it is time to sort them out. This time he found an old dusty graph theory notebook with a de ...

2019-11-07 17:08 0 389 推荐指数:

查看详情

Codeforces Round #694 (Div. 2) B. Strange List

B. Strange List 题目分析 题意:给你一个长度为n的数组和一个数字x,从第一个元素开始,如果改元素q能被x整除,那么将就在数组后面新增x个(q / x),直到遇到的元素不能被x整除,求最后数组的元素之和 让我们从样例开始入手分析:样例中的第一个情况数组a为[12],x为2,数组 ...

Wed Jan 06 16:04:00 CST 2021 2 354
Codeforces Round #626 (Div. 2) B. Count Subrectangles

题目连接:https://codeforces.com/contest/1323/problem/B 题意:给一个大小为n的a数组,一个大小为m的b数组,c数组是二维数组c[i][j]=a[i]*b[j],问面积为k的矩形有几个。 题解:先把k的所有因子存入一个数组里,然后遍历因子,表示 ...

Sun Mar 08 03:36:00 CST 2020 6 807
 
粤ICP备18138465号  © 2018-2025 CODEPRJ.COM