From 6340be4ecc80c2ea39fffadca7bb9e879dcd2522 Mon Sep 17 00:00:00 2001
From: Archit286 <agupta28_be19@thapar.edu>
Date: Thu, 10 Oct 2019 17:36:04 +0530
Subject: [PATCH] Solved the largest prime factor question

---
 Solutions/Largest_prime_factor.cpp | 43 ++++++++++++++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 Solutions/Largest_prime_factor.cpp

diff --git a/Solutions/Largest_prime_factor.cpp b/Solutions/Largest_prime_factor.cpp
new file mode 100644
index 0000000..a7c4e16
--- /dev/null
+++ b/Solutions/Largest_prime_factor.cpp
@@ -0,0 +1,43 @@
+#include<iostream>
+
+using namespace std;
+
+int isPrime(int num)
+{
+	int flag=1;
+	for(int i=2;i<num;i++)
+	{
+		if(num%i==0)
+		{
+			flag=0;
+			break;
+		}	
+	}
+	return flag;
+}
+
+int largestFactor(int num)
+{
+	for(int i=num;i>1;i--)
+	{
+		if(num%i==0 && isPrime(i))
+		{
+			return i;
+		}
+	}
+	
+	return 0;
+}
+
+int main()
+{
+	int t;
+	cin>>t;
+	for(int i=0;i<t;i++)
+	{
+		int num;
+		cin>>num;
+		cout<<largestFactor(num)<<endl;				
+	}
+return 0;	
+}