first commit

shrox · shrox · commit 890573e49e5f · 2014-10-20T11:39:40.000+05:30
diff --git a/binarysearch.c b/binarysearch.c
@@ -0,0 +1,30 @@
+#include<stdio.h>
+int main()
+{
+	int A[1000],n,number,x,t,last,first,middle;
+	
+	scanf("%d",&t);
+	
+	for (x=0;x<t;x++)
+	{
+		scanf("%d",&n);
+		A[x] = n;
+	}
+	
+	scanf("%d",&number);
+	
+	first=0;last=t-1;
+	middle=(first+last)/2;
+	
+	while (A[middle] != number)
+	{
+		if (number < A[middle])
+			last = middle;
+		if (number > A[middle])
+			first = middle;
+		middle=(first+last)/2;
+	}
+	printf("%d\n",middle);
+	return 0;
+}
+	
diff --git a/codeforces1.py b/codeforces1.py
@@ -0,0 +1,26 @@
+a = raw_input()
+b = raw_input()
+c = raw_input()
+
+a = int(a)
+b = int(b)
+c = int(c)
+
+listz = []
+
+sumpro = a + (b*c)
+listz.append(sumpro)
+
+prosum = a*(b+c)
+listz.append(prosum)
+
+propro = a*b*c
+listz.append(propro)
+
+sumpro2 = (a+b)*c
+listz.append(sumpro2)
+
+sumsum = a+b+c;
+listz.append(sumsum)
+
+print max(listz)
diff --git a/daddandsocks.c b/daddandsocks.c
@@ -0,0 +1,48 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<math.h>
+
+int main()
+{
+	int N,x,series[1000000]={0},number1=0,number2=0;
+	char colour[10];
+	scanf("%d",&N);
+	
+	for(x=0; x<N; x++)
+	{
+		scanf("%s",colour);
+		colour[5] = '\0';
+		//printf("%C\n",colour[3]);
+		
+		if(colour[2] == 'U')
+		{
+		//	printf("U");
+			series[x] = 1;
+		//	printf("x %d and series[x] %d\n",x,series[x]);
+		}
+		else if (colour[2] == 'A')
+		{
+			series[x] = 2;
+		//	printf("x %d and series[x] %d\n",x,series[x]);
+		}
+	}
+	series[N] = '\0';
+	
+	for(x=0;x<N;x++)
+	{
+		if(series[x] == 1)
+			number1++;
+		else if (series[x] == 2)
+			number2++;
+	}
+	
+	if(number1%2 == 0 && number2%2 == 0)
+		printf("YEs\n");
+	else
+	printf("NO\n");
+		
+	
+	printf("%d %d %d %d\n",number1/2,number2/2,number1%2,number2%2);
+	
+	return 0;
+}
diff --git a/factoroialpractice.c b/factoroialpractice.c
@@ -0,0 +1,31 @@
+#include<stdio.h>
+#include<math.h>
+int main()
+{
+	int n,x,y,z;
+	short int A[500];
+	scanf("%d",&n);
+	for(x=0;x<500;x++)
+		A[x] = -2;
+	A[0]=1;
+	
+	int carry=0;
+	for(x=2;x<=n;x++)
+	{
+		for(y=0;A[y]!=-2 || carry!=0;y++)
+		{
+			printf("A %d y %d\n",A[y],y);
+			if(A[y]==-2)
+				A[y]=0;
+			z = A[y]*x+carry;
+			A[y] = z%10;
+			carry = z/10;
+		}
+	}
+	
+	for(x=y-1;x>=0;x--)
+	{
+		printf("%hd",A[x]);
+	}
+	return 0;
+}
diff --git a/pascaltriangle.c b/pascaltriangle.c
@@ -0,0 +1,39 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<math.h>
+
+long long int factorial(int n);
+
+int main()
+{
+	int rows,x,y;
+	scanf("%d",&rows);
+	
+	for(x=0;x<rows;x++)
+	{
+		for (y=0;y<=(rows-x-2);y++ )
+			{
+				printf(" ");
+				printf("%d and %dz",rows-x-2,y);
+			}
+		for(y=0;y<=x;y++)
+			printf("%lld ",factorial(x)/(factorial(y) * factorial(x-y)));
+		printf("\n");
+	}
+	
+	return 0;
+}
+
+long long int factorial(int n)
+{
+   int c;
+   long long result = 1;
+ 
+   for( c = 1 ; c <= n ; c++ )
+         result = result*c;
+ 
+   return ( result );
+}
+	
+			
+		
diff --git a/printnewlineusingeof.c b/printnewlineusingeof.c
@@ -0,0 +1,14 @@
+include <stdio.h>
+int main()
+{
+	int var;
+	while((var = getchar()) != EOF)
+	{
+		if(var != ' ')
+		printf("%c" ,var);
+	else
+		printf("\n");
+	}
+	return 0;
+}
+
