diff --git a/12 may/ass2 q1.cpp b/12 may/ass2 q1.cpp
new file mode 100644
index 0000000..1061862
--- /dev/null
+++ b/12 may/ass2 q1.cpp	
@@ -0,0 +1,23 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	int a, b, c, i,lcm, count=0;
+	cout<<"Integer A:"<<endl;
+	cin>>a;
+	cout<<"Integer B:"<<endl;
+	cin>>b;
+	cout<<"Integer C:"<<endl;
+	cin>>c;
+	cout<<"numbers are:";
+	//brute force approach
+	for(i=1;i<=a;i++)
+	{
+		if(i%b==0 && i%c==0)
+		{
+			count++;
+			cout<<i<<" ";
+		}
+	}
+	cout<<endl<<"total numbers are "<<count;
+	
diff --git a/12 may/ass2 q2.cpp b/12 may/ass2 q2.cpp
new file mode 100644
index 0000000..1e0dd2d
--- /dev/null
+++ b/12 may/ass2 q2.cpp	
@@ -0,0 +1,22 @@
+#include<iostream>
+using namespace std;
+
+
+int gcd(int a,int b)
+{
+	if(b==0)
+	return a;
+	else
+	return gcd(b,a%b);
+}
+
+int main()
+{
+	int a,b,c;
+	cout<<"enter value 1:"<<endl;
+	cin>>a;
+	cout<<"enter value 2:"<<endl;
+	cin>>b;
+	c=gcd(a,b);
+	cout<<"Greatest common divisor is:"<<c;
+}
diff --git a/q1.cpp b/q1.cpp
new file mode 100644
index 0000000..e30ba63
--- /dev/null
+++ b/q1.cpp
@@ -0,0 +1,28 @@
+#include<iostream>
+#include<vector>
+using namespace std;
+int main()
+{
+	vector<int> ar;
+	ar.push_back(2);
+	ar.push_back(4);
+	ar.push_back(7);
+	ar.push_back(2);
+	ar.push_back(7);
+	ar.push_back(2);
+	ar.push_back(4);
+	int p=0,i;
+	cout<<"Array is:"<<endl;
+	for(i=0;i<ar.size();i++)
+	{
+		cout<<ar[i]<<" ";
+	}
+	cout<<endl;
+	for(i=0;i<ar.size();i++)
+	{
+		p=p^ar[i];
+	}
+	cout<<"the answer is "<<p<<endl;
+}
+
+
diff --git a/q2.cpp b/q2.cpp
new file mode 100644
index 0000000..8057b42
--- /dev/null
+++ b/q2.cpp
@@ -0,0 +1,35 @@
+#include<iostream>
+#include<vector>
+#include<algorithm>
+using namespace std;
+int main()
+{
+	vector<int> ar;
+/*	ar.push_back(17);
+	ar.push_back(48);
+	ar.push_back(9);
+	ar.push_back(9);*/
+	ar.push_back(9);
+	ar.push_back(5);
+	ar.push_back(3);
+	int i,j,minx=INT_MAX,b;
+	cout<<"Array is:"<<endl;
+	for(i=0;i<ar.size();i++)
+	{
+		cout<<ar[i]<<" ";
+	}
+	cout<<endl;
+	for(i=0;i<ar.size();i++)
+	{
+		for(j=i+1;j<ar.size();j++)
+		{
+			b=ar[i]^ar[j];
+			
+		if(b<minx)
+			{
+			minx=b;
+			}
+	}
+}
+cout<<"min ans is"<<minx;
+}
diff --git a/q3.cpp b/q3.cpp
new file mode 100644
index 0000000..2e216c1
--- /dev/null
+++ b/q3.cpp
@@ -0,0 +1,11 @@
+#include<iostream>
+#include<math.h>
+using namespace std;
+int main()
+{
+	int n,ans;
+	cout<<"enter number of bricks:"<<endl;
+	cin>>n;
+	ans=(-1+sqrt(1+8*n))/2;
+	cout<<"ans is"<<ans;
+}
diff --git a/q4.cpp b/q4.cpp
new file mode 100644
index 0000000..50b576b
--- /dev/null
+++ b/q4.cpp
@@ -0,0 +1,43 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	int n,i,j;
+	int A[50][50]={0};
+	cout<<"enter range:"<<endl;
+	cin>>n;
+	for(i=0;i<n;i++)
+	
+	{
+		A[i][0]=1;
+	}
+for(i=0;i<n;i++){
+		for(j=0;j<n;j++){
+			cout<<A[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+
+	for(i=1;i<n;i++){
+		for(j=1;j<n;j++){
+			if(i>=j){
+				if(i==j)
+				{
+					A[i][j]=A[i][j-1];
+				}
+				else
+				{
+					A[i][j]=A[i][j-1]+A[i-1][j];
+				}
+			}
+		}
+	}
+	cout<<endl<<"route map"<<endl;
+	for(i=0;i<n;i++){
+		for(j=0;j<n;j++){
+			cout<<A[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+	cout<<"number of routes:"<<A[n-1][n-1];
+}