使用递推式线性求解乘法逆元

Dev-XYS · Jan 13, 2017 · 35bf590 · 35bf590
1 parent 67842d9
commit 35bf590
Showing 1 changed file with 28 additions and 0 deletions.
diff --git a/Modular-Multiplicative-Inverse-Sieve(Linear).cpp b/Modular-Multiplicative-Inverse-Sieve(Linear).cpp
@@ -0,0 +1,28 @@
+#include <cstdio>
+
+#define MOD 1000000007
+#define MAX_ELEMENT 10000000
+
+int rev[MAX_ELEMENT];
+
+void sieve(int n)
+{
+	rev[1] = 1;
+	for (int i = 2; i <= n; i++)
+	{
+		rev[i] = (int)(-(long long)(MOD / i) * (long long)rev[MOD % i] % (long long)MOD);
+		rev[i] = (rev[i] % MOD + MOD) % MOD;
+	}
+}
+
+int main()
+{
+	int n;
+	scanf("%d", &n);
+	sieve(n);
+	for (int i = 1; i <= n; i++)
+	{
+		printf("rev(%d) = %d\n", i, rev[i]);
+	}
+	return 0;
+}