CODECHEF SNACKDOWN 2017

Author: spdpiyush

CODECHEF/CODECHEF_SNAKPROC.c

@@ -0,0 +1,59 @@
+//CodeChef problem : Temple Land(SNAKQL17)
+//Problem Code : SNAKPROC
+//Author : Piyush
+#include<stdio.h>
+#include<string.h>
+int main()
+{
+	int t,no,i,j,k,l,count;
+	char str[502],str1[502];
+	scanf("%d",&t);
+	while(t--)
+	{
+		scanf("%d",&no);
+		scanf("%s",str);
+		i=0;
+		k=0;
+		for(i=0;i<no;i++)
+		{
+			str1[i]=='.';
+		}
+		for(i=0;i<no;i++)
+		{
+			if(str[i]!='.')
+			{
+				str1[k]=str[i];
+				k++;
+			}
+		}
+		count=0;
+		if(k%2 == 0)
+		{
+			if(k==0)
+			printf("Valid\n");
+			else
+			{
+				for(i=0;i<k;i=i+2)
+		        {
+			  
+			      if(str1[i]=='H' && str1[i+1]=='T')
+			      count++;
+			      else
+			      {
+			  	     count=-1;
+			  	     break;
+			      }
+		        }
+		        if(count==(k/2))
+		        printf("Valid\n");
+		        else
+		        printf("Invalid\n");
+			}
+		}
+		else
+		{
+			printf("Invalid\n");
+		}
+	}
+	return 0;
+}

CODECHEF/CODECHEF_TEMPLELA.c

@@ -0,0 +1,64 @@
+//CodeChef Problem : Temple Land(SNCKQL17)
+//Problem Code : TEMPLELA
+//Author : Piyush
+#include<stdio.h>
+int main()
+{
+	int t,l,no[100],i,count;
+	scanf("%d",&t);
+	while(t--)
+	{
+		scanf("%d",&l);
+		for(i=0;i<l;i++)
+		{
+			scanf("%d",&no[i]);
+		}
+		if(l%2 == 0)
+		printf("no\n");
+		else
+		{
+			if(no[0]!=1)
+			printf("no\n");
+			else
+			{
+				count=0;
+				for(i=1;i<l/2;i++)
+				{
+					if(no[i]==(no[i-1]+1))
+					count++;
+					else
+					{
+						count=-1;
+						break;
+					}
+				}
+				if(count==-1)
+				printf("no\n");
+				else
+				{
+					if(no[l/2]>no[(l/2)-1])
+					{
+						count=0;
+						for(i=l/2+1;i<l;i++)
+						{
+							if(no[i]==(no[i-1]-1))
+							count++;
+							else
+							{
+								count=-1;
+								break;
+							}
+						}
+						if(count==-1)
+						printf("no\n");
+						else
+						printf("yes\n");
+					}
+					else
+					printf("no\n");
+				}
+			}
+		}
+	}
+	return 0;
+}