subarray_m.c

#include<stdio.h>

int subarray(int **ptr, int,int);

int main() {
	int num_test, array_size;
	int max_size;

	int t_index=0;
	int a_index=0;
	int **ptr;
	num_test=array_size=max_size=0;
	max_size=1000;
	scanf("%d",&num_test);
	ptr=(int**)malloc(sizeof(int)*num_test);
	
	while(t_index <num_test) {
		scanf("%d",&array_size);
		if (array_size >max_size) continue;
	
		ptr[t_index]=(int*)malloc(sizeof(int)*array_size);	
		a_index=0;
		while(a_index <array_size) {
			scanf("%d",&ptr[t_index][a_index]);	
			a_index++;
		}
		printf("Missing number is %d \n",subarray(ptr,array_size,t_index));	
		t_index++;			
	}
#if 0
	for(t_index=0;t_index<num_test;t_index++) {
		for(a_index=0;a_index<array_size;a_index++) {
		//	printf("%d \t",ptr[t_index][a_index]);
		}
		
	//	printf("\n");
	}
#endif	
	free(ptr);
}

int subarray(int** ptr,int index, int t_index) {
	int peek=0;
	int index1=0;
	int sum=0;	
	while (index1<=index) {
		sum+=ptr[t_index][index1];		
		index1++;
	}
	index1=0;
	while(index1<=index) {
		peek+=index1;
		index1++;
	}
	return (peek-sum);

}