Merge branch 'main' of https://github.com/thepranaygupta/Data-Structures-and-Algorithms

Author: thepranaygupta

CodeChef DSA Learning series Solutions/Easy Problems to get started/Factors Finding/README.md

@@ -0,0 +1,19 @@
+Factors Finding     | Problem Code: DIFACTRS
+You are given a number N and find all the distinct factors of N.
+Input:
+First-line will contain the number N.
+Output:
+In the first line print number of distinct factors of N.
+In the second line print all distinct factors in ascending order separated by space.
+Constraints
+1≤N≤106
+Sample Input 1:
+4
+Sample Output 1:
+3
+1 2 4
+Sample Input 2:
+6
+EXPLANATION:
+In the first example, all factors of 4 are 1, 2, 4.
+In the second example, all factors of 6 are 1, 2, 3, 6.

CodeChef DSA Learning series Solutions/Easy Problems to get started/Factors Finding/Solution.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+	int n;
+	cin>>n;
+	int count = 0;
+	
+	    for(int i=1;i<=n;i++)
+	    {
+	        if(n%i==0){
+	            count++;
+	        }
+	    }
+	    cout<<count<<endl;
+	    
+	    
+	       for(int i=1;i<=n;i++)
+	    {
+	        if(n%i==0){
+	            cout<<i<<" ";
+	        }
+	    }
+	    
+	return 0;
+}