CODECHEF PROBLEM

Author: spdpiyush

CODECHEF/CODECHEF_ERROR.c

@@ -0,0 +1,28 @@
+//CodeChef Problem : Chef and FeedBack(Easy)
+//Problem Code : ERROR
+//Author : Piyush
+#include<stdio.h>
+int main()
+{
+	int t,i,count;
+	char str[100006];
+	scanf("%d",&t);
+	while(t--)
+	{
+		scanf("%s",str);
+		count=0;
+		for(i=0;str[i]!='\0';i++)
+		{
+			if((str[i]=='0' && str[i+1]=='1' && str[i+2]=='0') ||(str[i]=='1' && str[i+1]=='0' && str[i+2]=='1'))
+			{
+				count=1;
+				break;
+			}
+		}
+		if(count==1)
+		printf("Good\n");
+		else
+		printf("Bad\n");
+	}
+	return 0;
+}

CODECHEF/CODECHEF_LAPIN.c

@@ -0,0 +1,47 @@
+//CodeChef Problems: Lapindromes (Easy)
+//Problem Code : LAPIN
+//Author : Piyush
+#include<stdio.h>
+#include<string.h>
+int main()
+{
+	int t,l,l1,no[150],no1[150],i,count;
+	char str[1002];
+	scanf("%d",&t);
+	while(t--)
+	{
+		scanf("%s",str);
+		l=strlen(str);
+		if(l%2!=0)
+		l1=(l/2)+1;
+		else
+		l1=(l/2);
+		for(i=97;i<=122;i++)
+		{
+			no[i]=0;
+			no1[i]=0;
+		}
+		for(i=0;i<l/2;i++)
+		{
+			++no[str[i]];
+		}
+		for(i=l1;i<l;i++)
+		{
+			++no1[str[i]];
+		}
+		count=0;
+		for(i=97;i<=122;i++)
+		{
+			if(no[i]!=no1[i])
+			{
+				count++;
+				break;
+			}
+		}
+		if(count!=0)
+		printf("No\n");
+		else
+		printf("Yes\n");
+	}
+	return 0;
+}

CODECHEF/CODECHEF_LCOLLIS.c

@@ -0,0 +1,43 @@
+//CodeChef Problem : Collisions (Beginner)
+//Problem Code : LCOLLIS
+//Author : Piyush
+#include<stdio.h>
+int main()
+{
+	int t,n,m,no[100],i,j,k,sum,count;
+	scanf("%d",&t);
+	while(t--)
+	{
+		scanf("%d%d",&n,&m);
+		for(i=0;i<100;i++)
+		{
+			no[i]=0;
+		}
+		i=0;
+		j=n;
+		while(j--)
+		{
+			for(k=1;k<=m;k++)
+			{
+				scanf("%d",&no[i]);
+				++i;
+			}
+			i+=10;
+		}
+		sum=0;
+		for(i=0;i<n;i++)
+		{
+			count=0;
+			for(j=i;j<100;j+=10)
+			{
+				if(no[j] == 1)
+				count++;
+			}
+			if(count>0)
+			sum+=sum+(count-1);
+			
+		}
+		printf("%d\n",sum);
+	}
+	return 0;
+}

CODECHEF/CODECHEF_LECANDY.c

@@ -0,0 +1,24 @@
+//CodeChef Problem : Little Elephant and Candy(Peer)
+//Problem Code : LECANDY
+//Author : Piyush
+#include<stdio.h>
+int main()
+{
+	int t,n,c,no,i,sum;
+	scanf("%d",&t);
+	while(t--)
+	{
+		sum=0;
+		scanf("%d%d",&n,&c);
+		while(n--)
+		{
+			scanf("%d",&no);
+			c=c-no;
+		}
+		if(c>=0)
+		printf("Yes\n");
+		else
+		printf("No\n");
+	}
+	return 0;
+}

CODECHEF/CODECHEF_MXMEDIAN.c

@@ -0,0 +1,52 @@
+//CodeChef Problem : Median of adjacent (MAY17)
+//Problem Code : MXMEDIAN
+//Author : Piyush
+#include<stdio.h>
+void swap(int [],int,int);
+int main()
+{
+	int t,n,no[100001],i,j,temp;
+	scanf("%d",&t);
+	while(t--)
+	{
+		scanf("%d",&n);
+		for(i=1;i<2*n+1;i++)
+		{
+			scanf("%d",&no[i]);
+		}
+		for(i=1;i<2*n;i++)
+		{
+			for(j=i+1;j<2*n+1;j++)
+			{
+				if(no[i]>no[j])
+				{
+					temp=no[i];
+					no[i]=no[j];
+					no[j]=temp;
+				}
+			}
+		}
+		printf("%d\n",no[n+n/2+1]);
+		swap(no,2,n+1);
+		for(i=1;i<2*n+1;i++)
+		{
+			printf("%d ",no[i]);
+		}
+		printf("\n");
+	}
+	return 0;
+}
+void swap(int no[],int l,int h)
+{
+	int ne=h,tmp;
+	while(l<ne)
+	{
+		tmp=no[l];
+		no[l]=no[h];
+		no[h]=tmp;
+		l+=2;
+		h++;
+	}
+	if(l<h)
+	swap(no,l,h);
+}

CODECHEF/CODECHEF_VOTERS.c

@@ -0,0 +1,53 @@
+//CodeChef Problem : Disprepancies in the Voter List (Easy)
+//Problem Code : VOTERS
+//Author : Piyush
+#include<stdio.h>
+int main()
+{
+	int n1,n2,n3,no[50000]={0},i,s,l,n,count;
+	scanf("%d%d%d",&n1,&n2,&n3);
+	count=0;
+	scanf("%d",&n);
+	s=n;
+	l=n;
+	for(i=2;i<=n1;i++)
+	{
+		scanf("%d",&n);
+		if(n>l)
+		l=n;
+		if(n<s)
+		s=n;
+		++no[n-1];
+	}
+	for(i=1;i<=n2;i++)
+	{
+		scanf("%d",&n);
+		if(n>l)
+		l=n;
+		if(n<s)
+		s=n;
+		++no[n-1];
+	}
+	for(i=1;i<=n3;i++)
+	{
+		scanf("%d",&n);
+		if(n>l)
+		l=n;
+		if(n<s)
+		s=n;
+		++no[n-1];
+	}
+	for(i=s-1;i<=l-1;i++)
+	{
+		if(no[i]>=2)
+		count++;
+	}
+	printf("%d\n",count);
+	for(i=s-1;i<=l-1;i++)
+	{
+		if(no[i]>=2)
+		printf("%d\n",i+1);
+	}
+	printf("\n");
+	return 0;
+}