Added solution to the problem Largest Prime Number

Solutions/Largest_prime_factor.cpp

@@ -0,0 +1,33 @@
+#include <iostream> 
+#include<bits/stdc++.h> 
+using namespace std; 
+long long LargestPrimeNumber(long long n) 
+{ 
+    long long maxPrime = -1; 
+    while (n % 2 == 0) { 
+        maxPrime = 2; 
+        n >>= 1; 
+    } 
+      for (int i = 3; i <= sqrt(n); i += 2) { 
+        while (n % i == 0) { 
+            maxPrime = i; 
+            n = n / i; 
+        } 
+    } 
+    if (n > 2) 
+        maxPrime = n; 
+
+    return maxPrime; 
+} 
+int main() 
+{ 
+    int t;
+    cin>>t;
+    while(t--)
+    {
+        long long n;
+        cin>>n;
+        cout << LargestPrimeNumber(n) << endl;
+    }
+ return 0;
+} 

Solutions/Smallest_multiple_(II).cpp

@@ -0,0 +1,45 @@
+#include<bits/stdc++.h> 
+using namespace std; 
+
+typedef long long int ll; 
+
+int hcf(int a, int b) 
+{ 
+	if (b == 0) 
+		return a; 
+	return hcf(b, a % b); 
+} 
+
+ll lcm(int arr[], int n) 
+{ 
+
+	ll ans = arr[0]; 
+
+
+	for (int i = 1; i < n; i++) 
+		ans = (((arr[i] * ans)) / 
+				(hcf(arr[i], ans))); 
+
+	return ans; 
+} 
+
+
+int main() 
+{ 
+    int t;
+    scanf("%d",&t);
+
+    while(t--)
+    {
+        int endterm;
+
+        cin>>endterm;
+         int arr[endterm];
+        for(int i=1;i<=endterm;i++)
+         arr[i-1]=i;
+
+	int n = sizeof(arr) / sizeof(arr[0]); 
+	printf("%lld", lcm(arr, n)); 
+	} 
+return 0; 
+}

_config.yml

@@ -0,0 +1 @@
+theme: jekyll-theme-architect