From a455799695ece6f360c98b73b077b68b3e530150 Mon Sep 17 00:00:00 2001
From: ljcjames <ljcjames@qq.com>
Date: Thu, 18 Aug 2022 22:57:16 +0800
Subject: [PATCH] =?UTF-8?q?8.18=E6=99=9A?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 8.16/M-PairsFormingLCM/Readme.md     | 12 +++++
 8.16/M-PairsFormingLCM/doc/Readme.md |  1 +
 8.16/M-PairsFormingLCM/main.cpp      | 65 ++++++++++++++++++++++++++++
 8.16/M-PairsFormingLCM/test/in.txt   |  0
 8.16/M-PairsFormingLCM/test/in2.txt  | 16 +++++++
 8.16/M-PairsFormingLCM/test/in3.txt  |  0
 8.16/M-PairsFormingLCM/test/out.txt  |  7 +++
 Template/main.cpp                    |  2 +-
 8 files changed, 102 insertions(+), 1 deletion(-)
 create mode 100644 8.16/M-PairsFormingLCM/Readme.md
 create mode 100644 8.16/M-PairsFormingLCM/doc/Readme.md
 create mode 100644 8.16/M-PairsFormingLCM/main.cpp
 create mode 100644 8.16/M-PairsFormingLCM/test/in.txt
 create mode 100644 8.16/M-PairsFormingLCM/test/in2.txt
 create mode 100644 8.16/M-PairsFormingLCM/test/in3.txt
 create mode 100644 8.16/M-PairsFormingLCM/test/out.txt

diff --git a/8.16/M-PairsFormingLCM/Readme.md b/8.16/M-PairsFormingLCM/Readme.md
new file mode 100644
index 0000000..cc02b16
--- /dev/null
+++ b/8.16/M-PairsFormingLCM/Readme.md
@@ -0,0 +1,12 @@
+# 题目
+* 链接
+### 题意
+
+### 做法
+
+### 关键词
+
+### 易错点
+* 
+### 工具箱
+* 
\ No newline at end of file
diff --git a/8.16/M-PairsFormingLCM/doc/Readme.md b/8.16/M-PairsFormingLCM/doc/Readme.md
new file mode 100644
index 0000000..4e768b5
--- /dev/null
+++ b/8.16/M-PairsFormingLCM/doc/Readme.md
@@ -0,0 +1 @@
+# 
\ No newline at end of file
diff --git a/8.16/M-PairsFormingLCM/main.cpp b/8.16/M-PairsFormingLCM/main.cpp
new file mode 100644
index 0000000..dc1efa5
--- /dev/null
+++ b/8.16/M-PairsFormingLCM/main.cpp
@@ -0,0 +1,65 @@
+#include <iostream>
+#include <cstdio>
+#include <algorithm>
+#include <cmath>
+using namespace std;
+const int N=1e7+5,M=7e5+5;
+int pr[M];//存质数
+bool b[N];//是不是质数 
+int cnt=0;
+inline void prime()
+{
+	for(int i=2;i<N;i++)
+	{
+		if(!b[i])
+		{
+			pr[++cnt]=i;
+		}
+		for(int j=1;j<=cnt&&pr[j]*i<N;j++)
+		{
+			b[pr[j]*i]=1;
+			if(i%pr[j]==0)
+			{
+				break;
+			}
+		}
+	} 
+}
+int main()
+{
+    int t;
+    int t1 = 0;
+    long long n;
+    int len;
+    int now;
+    int ans;
+    prime();
+    scanf("%d", &t);
+    while (t--)
+    {
+        ans = 1;
+        scanf("%lld", &n);
+        len = sqrt(n);
+        for (int i = 1; pr[i] <= len&&pr[i]; i++)//re
+        {
+            
+            if (n % pr[i] == 0)
+            {
+                now = 0;
+                while (n % pr[i] == 0)
+                {
+                    n /= pr[i];
+                    now++;
+                }
+                ans *= (2*now+1);
+            }
+        }
+        if (n > 1)
+        {
+            ans *= 3;
+        } 
+        ans=ans/2+1;
+        printf("Case %d: %d\n", ++t1, ans);
+    }
+    return 0;
+}
diff --git a/8.16/M-PairsFormingLCM/test/in.txt b/8.16/M-PairsFormingLCM/test/in.txt
new file mode 100644
index 0000000..e69de29
diff --git a/8.16/M-PairsFormingLCM/test/in2.txt b/8.16/M-PairsFormingLCM/test/in2.txt
new file mode 100644
index 0000000..b27e303
--- /dev/null
+++ b/8.16/M-PairsFormingLCM/test/in2.txt
@@ -0,0 +1,16 @@
+15
+2
+3
+4
+6
+8
+10
+12
+15
+18
+20
+21
+24
+25
+27
+29
diff --git a/8.16/M-PairsFormingLCM/test/in3.txt b/8.16/M-PairsFormingLCM/test/in3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/8.16/M-PairsFormingLCM/test/out.txt b/8.16/M-PairsFormingLCM/test/out.txt
new file mode 100644
index 0000000..01ba092
--- /dev/null
+++ b/8.16/M-PairsFormingLCM/test/out.txt
@@ -0,0 +1,7 @@
+## z:\Chao\src\Template\test\in.txt 
+2020/03/14 周六 11:41:28.68 
+Hello Easy C++ project!
+
+-----------------------------------------------
+Process exited after 200 ms with return value 0
+
diff --git a/Template/main.cpp b/Template/main.cpp
index fd3b938..2135d14 100644
--- a/Template/main.cpp
+++ b/Template/main.cpp
@@ -17,7 +17,7 @@ int main()
         {
 
         }
-        printf("Case %d: %d",++t1,n);
+        printf("Case %d: %d\n",++t1,n);
     }
     return 0;
 }