zsrinivas’s gists

zsrinivas / maxnextmax.c

Created May 24, 2014 04:58

	#include <stdio.h>
	#include <stdlib.h>
	#include <math.h>
	#include <string.h>
	#include <strings.h>
	#define MAXnMAX 10000
	int main(int argc, char const *argv[])
	{
	int maxlosers[MAXnMAX],pint,temp,max,nextmax;
	int n,k=1,i;

zsrinivas / uthopiantree.c

Created May 26, 2014 07:37

https://www.hackerrank.com/submissions/code/1543024

	#include <stdio.h>
	#include <string.h>
	#include <stdlib.h>
	#include <math.h>
	#include <assert.h>
	#include <ctype.h>
	int main(int argc, char const *argv[])
	{
	int testc,ans,t,years,extrac;
	scanf("%d", &testc);

zsrinivas / servicelane.c

Created May 26, 2014 08:22

https://www.hackerrank.com/challenges/service-lane

	#include <stdio.h>
	#include <string.h>
	#include <stdlib.h>
	#include <math.h>
	#include <assert.h>
	#include <ctype.h>
	int lane[100010];
	int min(int pint, int pont);
	int main(int argc, char const *argv[])
	{

zsrinivas / gemstones.c

Created May 26, 2014 09:57

https://www.hackerrank.com/challenges/gem-stones

	#include <stdio.h>
	#include <string.h>
	#include <stdlib.h>
	#include <math.h>
	#include <assert.h>
	#include <ctype.h>
	int main(int argc, char const *argv[])
	{
	int n,i,len,pint,ref[27][2]={0},elementcount=0;
	char a[111];

zsrinivas / halloweenparty.c

Created May 26, 2014 10:02

https://www.hackerrank.com/challenges/halloween-party

	#include <stdio.h>
	#include <string.h>
	#include <stdlib.h>
	#include <math.h>
	#include <assert.h>
	#include <ctype.h>
	int main(int argc, char const *argv[])
	{
	int testc;
	long long int n;

zsrinivas / flowers.c

Created May 26, 2014 12:56

https://www.hackerrank.com/challenges/flowers

	#include <stdio.h>
	#include <string.h>
	#include <stdlib.h>
	#include <math.h>
	#include <assert.h>
	#include <ctype.h>
	#define MAX_LENGTH 100000
	int fact(int num);
	long long int mergedivide(long long int a[], long long int low, long long int high);
	long long int mergeconquer(long long int a[], long long int low, long long int mid, long long int high);

zsrinivas / Quicksort.c

Last active August 29, 2015 14:01

A lame implementaion of Quick Sort

	/Test Program/
	#include <stdio.h>
	#include <string.h>
	#include <stdlib.h>
	#include <math.h>
	#include <assert.h>
	#include <ctype.h>
	#include "quicksort.h"
	#define MAXSIZ 100000
	int main(int argc, char const *argv[])

zsrinivas / choclatefest.c

Created May 27, 2014 06:28

	#include <stdio.h>
	#include <string.h>
	#include <stdlib.h>
	#include <math.h>
	#include <assert.h>
	#include <ctype.h>
	int main(int argc, char const *argv[])
	{
	int n,c,m,choc=0,upchoc=0;
	int testc,*pint=&upchoc,wrappers;

zsrinivas / choclatefest.c

Created May 27, 2014 06:28

https://www.hackerrank.com/challenges/chocolate-feast

	#include <stdio.h>
	#include <string.h>
	#include <stdlib.h>
	#include <math.h>
	#include <assert.h>
	#include <ctype.h>
	int main(int argc, char const *argv[])
	{
	int n,c,m,choc=0,upchoc=0;
	int testc,*pint=&upchoc,wrappers;

zsrinivas / ctype-eightnoteight.h

Created May 27, 2014 09:57

My Implementation of ctype.h

	/*
	Author : eightnoteight
	website : eightnoteight.wordpress.com
	*/
	int isalnum(char a){
	return (a>='A'&&a<='Z')\|\|(a>='a'&&a<='z')\|\|(a>='0'&&a<='9');
	}
	int isalpha(char a){
	return (a>='A'&&a<='Z')\|\|(a>='a'&&a<='z');
	}

Srinivas Devaki zsrinivas