diff --git a/12-5-20/Q1.cpp b/12-5-20/Q1.cpp
new file mode 100644
index 0000000..9f08c0d
--- /dev/null
+++ b/12-5-20/Q1.cpp
@@ -0,0 +1,26 @@
+#include<stdio.h>
+//Q1. Divisor Game
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+	int A,B,C;
+	int count=0;
+	cout<<"enter A"<<endl;
+	cin>>A;
+	cout<<"enter B"<<endl;
+	cin>>B;
+	cout<<"enter C"<<endl;
+	cin>>C;
+	
+	int ar[]={A,B,C};
+	
+	for(int i=1;i<=A;i++)
+	{
+		if(i%B==0 && i%C==0 )
+		{
+			count++;
+		}
+	}
+	cout<<"output:- "<<count<<endl;
+}
diff --git a/12-5-20/Q1.exe b/12-5-20/Q1.exe
new file mode 100644
index 0000000..4bb1054
Binary files /dev/null and b/12-5-20/Q1.exe differ
diff --git a/12-5-20/Q2.cpp b/12-5-20/Q2.cpp
new file mode 100644
index 0000000..5ca75fc
--- /dev/null
+++ b/12-5-20/Q2.cpp
@@ -0,0 +1,28 @@
+//Q.2 Enumerating GCD
+//solving using recursion
+#include<stdio.h>
+#include<bits/stdc++.h>
+using namespace std;
+//Function to return gcd of a and b
+int gcd(int a,int b)
+{
+	if(a==0)
+	  return b;
+	return gcd(b%a,a);
+}
+
+int main()
+{
+	int A,B,D;
+	cout<<"enter A"<<endl;
+	cin>>A;
+	cout<<"enter B"<<endl;
+	cin>>B;
+	int a=A;
+	int b=B;
+	
+	cout<<"The GCD between A and B is :-"<<gcd(a,b)<<"   "<<endl;
+	return 0;
+}
+
+  
diff --git a/12-5-20/Q2.exe b/12-5-20/Q2.exe
new file mode 100644
index 0000000..aef609b
Binary files /dev/null and b/12-5-20/Q2.exe differ
diff --git a/12-5-20/gmon.out b/12-5-20/gmon.out
new file mode 100644
index 0000000..55ba2f3
Binary files /dev/null and b/12-5-20/gmon.out differ
diff --git a/12-5-20/output1.jpg b/12-5-20/output1.jpg
new file mode 100644
index 0000000..529ec06
Binary files /dev/null and b/12-5-20/output1.jpg differ
diff --git a/12-5-20/output2.jpg b/12-5-20/output2.jpg
new file mode 100644
index 0000000..beb0ee3
Binary files /dev/null and b/12-5-20/output2.jpg differ