coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/problem/maximize-number-of-nice-divisors.html
View File

@@ -10,7 +10,7 @@
</ul>
<p>Return <em>the number of nice divisors of</em> <code>n</code>. Since that number can be too large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
@@ -20,7 +20,7 @@ It has 5 prime factors: [2,2,2,5,5], and it has 6 nice divisors: [10,20,40,50,10
<p>&nbsp;</p>
<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>