12 May

12 May/Q1/divisor_game.cpp

@@ -0,0 +1,23 @@
+#include<bits/stdc++.h>
+using namespace std;
+ int lcm(int a,int b)
+ {
+ 	int large = max(a,b);
+ 	int small = min(a,b);
+ 	int i;
+ 	for(i=large;;i += large)
+ 	{
+ 		if (i % small ==0)
+ 		    return i;
+	 }
+ }
+
+int main(){
+ int A=12,B=3,C=2;
+ int spec_int;
+ spec_int = A/lcm(B,C);
+ cout<<"the special integers "<<spec_int;
+
+
+
+}

12 May/Q2/enumerating_gcd.cpp

@@ -0,0 +1,15 @@
+#include<bits/stdc++.h>
+using namespace std;
+gcd(int a,int b)
+{
+	if (a == b)
+	   return a;
+	else
+	 return 1;   
+}
+
+int main(){
+
+	int A = 12, B= 60;
+	cout<<"the gcd is "<<gcd(A,B);
+}

13 May/Q1/divisor_game.cpp

@@ -0,0 +1,23 @@
+#include<bits/stdc++.h>
+using namespace std;
+ int lcm(int a,int b)
+ {
+ 	int large = max(a,b);
+ 	int small = min(a,b);
+ 	int i;
+ 	for(i=large;;i += large)
+ 	{
+ 		if (i % small ==0)
+ 		    return i;
+	 }
+ }
+
+int main(){
+ int A=12,B=3,C=2;
+ int spec_int;
+ spec_int = A/lcm(B,C);
+ cout<<"the special integers "<<spec_int;
+
+
+
+}

13 May/Q2/enumerating_gcd.cpp

@@ -0,0 +1,15 @@
+#include<bits/stdc++.h>
+using namespace std;
+gcd(int a,int b)
+{
+	if (a == b)
+	   return a;
+	else
+	 return 1;   
+}
+
+int main(){
+
+	int A = 12, B= 60;
+	cout<<"the gcd is "<<gcd(A,B);
+}