2020-2021:teams:hotpot:2020nowcoder7
差别
这里会显示出您选择的修订版和当前版本之间的差别。
| 两侧同时换到之前的修订记录 前一修订版 | |||
|
2020-2021:teams:hotpot:2020nowcoder7 [2020/08/07 15:59] lotk |
2020-2021:teams:hotpot:2020nowcoder7 [2020/08/07 16:26] (当前版本) 喝西北风 |
||
|---|---|---|---|
| 行 19: | 行 19: | ||
| ===题解=== | ===题解=== | ||
| - | ====B - ==== | + | ====B - Mask Allocation==== |
| - | ===solved by === | + | ===solved by gyp=== |
| ===题意=== | ===题意=== | ||
| + | |||
| + | 给定n,m。将$n\times m$拆成若干个数，使得可以凑成n个m或m个n。输出字典序最大的一种方案 | ||
| ===数据范围=== | ===数据范围=== | ||
| + | |||
| + | $n,m\le 10^4$ | ||
| ===题解=== | ===题解=== | ||
| + | |||
| + | 设$n\ge m$。先输出n/m*m个m，然后将问题转化为求$m\times (n%m)$ | ||
| ====C - A National Pandemic==== | ====C - A National Pandemic==== | ||
| 行 91: | 行 97: | ||
| ===题解=== | ===题解=== | ||
| - | ====H - Harmony Pairs==== | + | ====H - Dividing==== |
| - | ===solved by === | + | ===solved by gyp=== |
| ===题意=== | ===题意=== | ||
| + | |||
| + | 定义传奇二元组。(1,k)是传奇二元组，若(n,k)是传奇二元组，则(n+k,k)，(nk,k)是传奇二元组。给定n,k，求$1\le a\le n,1\le b\le k$的传奇二元组(a,b)个数。 | ||
| ===数据范围=== | ===数据范围=== | ||
| + | |||
| + | $1\le n,k\le 10^{12}$ | ||
| ===题解=== | ===题解=== | ||
| + | |||
| + | 所有第一个数模第二个数为0或1的均满足要求。数论分块计算个数即可。 | ||
| + | |||
| ====I - ==== | ====I - ==== | ||
2020-2021/teams/hotpot/2020nowcoder7.1596787153.txt.gz · 最后更改: 2020/08/07 15:59 由 lotk
