11may and 12 may

vijay bissa/11 may/q1.py

@@ -0,0 +1,13 @@
+def findSingle( ar, n): 
+
+    res = ar[0] 
+
+    for i in range(1,n): 
+        res = res ^ ar[i] 
+
+    return res 
+
+
+print("Enter The Numbers:-  ")
+ar= list(map(int,input().split()))
+print ("Element occuring once is", findSingle(ar, len(ar))) 

vijay bissa/11 may/q4.py

@@ -0,0 +1,10 @@
+A=int(input("Enter the size of Grid:- "))
+if A<0:
+    print(1)
+else:
+    arr=[0 for i in range(A+2)]
+    arr[0]=arr[1]=1
+    for i in range(2,A+1):
+        for j in range(i+1):
+            arr[i]=(arr[i]+arr[j]*arr[i-j-1])%(10**9+7)
+    print(arr[A-1])

vijay bissa/11 may/q5.py

@@ -0,0 +1,18 @@
+num=int(input("Enter the number to find Square Root:-"))
+f=0
+if(num==0 or num==1):
+	print(num)
+st=1
+end=num
+while(st<=end):
+	mid=(st+end)//2
+	if(mid**2==num):
+		print(mid)
+		f=1
+	if(mid**2<num):
+		st=mid+1
+		ans = mid
+	else:
+		end=mid-1
+if(f==0):
+	print(ans)

vijay bissa/12 may/q1.cpp

@@ -0,0 +1,70 @@
+#include<bits/stdc++.h>
+using namespace std;
+bool prime(int n)
+{
+	int f=0;
+	for(int i=2;i<=(n/2);i++)
+	{
+		if(n%i==0)
+		{
+			f=1;
+			break;
+		}
+	}
+	if(f==1)
+	{
+		return false;
+	}
+	else
+	{
+		return true;
+	}
+}
+
+
+int main()
+{
+	int r,c,count=0,i,j;
+	cout<<"\nEnter number of rows : ";
+	cin>>r;
+	cout<<"\nEnter number of columns : ";
+	cin>>c;
+	int arr[r][c];
+	for(i=0;i<r;i++)
+	{
+		for(j=0;j<c;j++)
+		{
+			cout<<"\n Enter element : "<<i+1<<j+1<<" : ";
+			cin>>arr[i][j];
+		}
+	}
+	for(i=0;i<r;i++)
+	{
+		for(j=0;j<c;j++)
+		{
+			int sum=0;
+			if(i+1<r)
+			{
+				sum += arr[i+1][j];
+			}
+			if(i-1>=0)
+			{
+				sum += arr[i-1][j];
+			}
+			if(j+1<c)
+			{
+				sum += arr[i][j+1];
+			}
+			if(j-1>=0)
+			{
+				sum += arr[i][j-1];
+			}
+			if(prime(sum))
+			{
+				count++;
+			}
+
+		}
+	}
+	cout<<"Result = "<<count<<endl;
+}

vijay bissa/12 may/q2.cpp

@@ -0,0 +1,44 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+	int r,count=0,i,j;
+	cout<<"\nEnter size of nxn matrix : ";
+	cin>>r;
+	int arr[r][r];
+	for(i=0;i<r;i++)
+	{
+		for(j=0;j<r;j++)
+		{
+			cout<<"\n Enter element : "<<i+1<<j+1<<" : ";
+			cin>>arr[i][j];
+		}
+	}
+	int n;
+	cout<<"Enter number for search : ";
+	cin>>n;
+	i=0;
+	j=0;
+	int f=0;
+	while(i<r && j<r)
+	{
+		if(arr[i][j]==n)
+		{
+			cout<<"Number found at position ("<<i<<" , "<<j<<")"<<endl;
+			f=1;
+			break;
+		}
+		if(arr[i][j+1]<n && j+1<r)
+		{
+			j=j+1;
+		}
+		else
+		{
+			i=i+1;
+		}
+	}
+	if(f==0)
+	{
+		cout<<"Number not found"<<endl;
+	}
+}

vijay bissa/12 may/q3.cpp

@@ -0,0 +1,47 @@
+#include<bits/stdc++.h>
+using namespace std;
+bool odd(int n)
+{
+	if (n%2==0)
+	{
+		return false;
+	}
+	else
+	{
+		return true;
+	}
+}
+int main()
+{
+	int r,c,count=0,i,j;
+	cout<<"\nEnter number of rows : ";
+	cin>>r;
+	cout<<"\nEnter number of columns : ";
+	cin>>c;
+	int arr[r][c];
+	for(i=0;i<r;i++)
+	{
+		for(j=0;j<c;j++)
+		{
+			cout<<"\n Enter element : "<<i+1<<j+1<<" : ";
+			cin>>arr[i][j];
+		}
+	}
+	for(i=0;i<c;i++)
+	{
+		int c=0;
+		for(j=0;j<r;j++)
+		{
+			if(arr[j][i]==1)
+			{
+				c++;
+			}
+		}
+		if(odd(c))
+		{
+			count++;
+		}
+	}
+	cout<<"Total number of columns having odd number of 1's is : "<<count<<endl;
+}
+