A1

binary search.c

@@ -0,0 +1,36 @@
+#include<stdio.h>
+
+int binary_search(int a[],int l,int u,int choice)//assumes array is sorted 
+{
+	int m;
+	while(l<u)
+	{
+		m=(l+u)/2;
+
+		if(a[m]==choice)
+			return m;
+
+		if(choice<a[m])
+			u=m-1;
+		else
+			l=m+1;
+	}
+
+	if(a[l]==choice)
+		return l;
+	else
+		return -1;
+}
+
+int main()
+ {
+ 	int a[10]={1,2,2,3,4,5,6,7,8,9};
+
+ 	int c=binary_search(a,0,9,2);
+ 	if(c==-1)
+ 		printf("NON existing\n");
+ 	else
+ 		printf("EXISTING at index %d\n",c);
+
+ 	return 0;
+ }

d_discrete.c

@@ -0,0 +1,28 @@
+	#include<stdio.h>
+
+	int main()
+	{
+		unsigned long long p,test,x,y,m,n;
+
+		scanf("%llu",&test);
+
+		for(;test>0;test--)
+		{
+			scanf("%llu%llu%llu",&x,&y,&m);
+
+			x%=m;
+
+			p=1;
+
+		for(;y>0;y/=2)
+		{
+			if(y & 1)
+				p=(p*x)%m;
+
+			x=(x*x)%m;
+		}
+			printf("%llu ",p);
+		}
+
+		return 0;
+	}