james/holiday
james/holiday
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

8.19早上

Browse Source
This commit is contained in:
ljcjames 2022-08-19 08:25:19 +08:00
parent a455799695
commit f2839a4120
1 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
8.16/M-PairsFormingLCM/Readme.md
View File

@ -1,9 +1,11 @@
# ﾌ籠ｿ # M - Pairs Forming LCM
* ﾁｴｽﾓ * https://vjudge.net/contest/509210#problem/M
### 题意 ### 题意
给n,lcm(i, j) = n and (i ≤ j).
### 做法 ### 做法
质因数分解n=p1^k1*p2^k2
ans*=(2k[i]+1);(i=0~k,j=0~k,去掉重复的k,k)
ans=ans/2+1;(i<=j,补上k,k)
### 关键词 ### 关键词
### 易错点 ### 易错点