Merge pull request #54 from Ayushivam22/day10

feat: easy day 10 solution
OPCODE-Open-Spring-Fest · Apr 9, 2024 · f7329d7 · f7329d7
2 parents 0da133b + 001cd79
commit f7329d7
Show file tree

Hide file tree

Showing 3 changed files with 27 additions and 30 deletions.
diff --git a/Easy/Day10/Solution.cpp b/Easy/Day10/Solution.cpp
@@ -1 +1,27 @@
 // Write Your Code here
+#include <bits/stdc++.h>
+using namespace std;
+long long BinExpo(long long a, long long b, long long m)
+{
+    // basse case
+    if (b == 0)
+        return 1;
+    // recursive case
+    long long res = BinExpo(a, b / 2, m);
+    if (b & 1) // if b is odd
+    {
+        return ((a * (res % m)) % m * (res % m)) % m;
+    }
+    else
+    {
+        return (res * res) % m;
+    }
+}
+int main()
+{
+
+    long long a, b, m;
+    cin >> a >> b >> m;
+
+    cout << BinExpo(a, b, m) << endl;
+}
diff --git a/Easy/Day10/Solution.exe b/Easy/Day10/Solution.exe
diff --git a/Easy/Day8/Solution.cpp b/Easy/Day8/Solution.cpp
@@ -1,30 +1 @@
-#include <bits/stdc++.h>
-using namespace std;
-long long BinExpo(long long a, long long b, long long m)
-{
-    // basse case
-    if (b == 0)
-        return 1;
-    // recursive case
-    long long res = BinExpo(a, b / 2, m);
-    if (b & 1) // if b is odd
-    {
-        return ((a * (res % m)) % m * (res % m)) % m;
-    }
-    else
-    {
-        return (res * res) % m;
-    }
-}
-int main()
-{
-    long long m = 1e9 + 7;
-    int t;
-    cin >> t;
-    while (t--)
-    {
-        long long a, b;
-        cin >> a >> b;
-        cout << BinExpo(a, b, m) << endl;
-    }
-}
+// Write your code here