0
Your rating: None
CodeChef submission 136772 (C) 

CodeChef submission 136772 (C) plaintext list. Status: RE, problem SNCK01, contest SNACKDWN. By Rebels (Rebels), 2009-11-21 23:56:13.
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3. #include<string.h>
  4. int main()
  5. {
  6.    int *a,m,n,count,winner=0,cur_column=0,sum=0,flag,i,j,test,z;
  7.    char *s[1000];
  8.    for(i=0;i<1000;i++)
  9. 	   s[i]=(char *)malloc(sizeof(char)*10);
  10.    printf("enter test cases");
  11.    scanf("%d",&test);
  12.    for(z=0;z<test;z++)
  13.    {
  14. 			   printf("enter rows,columns");
  15. 			   scanf("%d%d",&n,&m);
  16. 			 
  17. 			   count=n*m;
  18.  
  19. 			   a=(int *)malloc(m*n*sizeof(int)) ;
  20. 			   if(a==NULL) printf("memory alloc failed");
  21. 			   
  22. 			   printf("enter matrix");
  23. 			   for(i=0;i<n;i++)
  24. 					for(j=0;j<m;j++)
  25. 					 {  
  26. 						scanf("%d",&a[i*m+j]); 
  27. 					 }
  28. 			   while(count>0)   
  29. 			   {   sum=0;
  30. 				   flag=1;  
  31. 				   if(count%2==0)
  32. 						 {
  33. 							for(i=0;i<n;i++)
  34. 								 if (a[i*m+cur_column]>1) {flag=0;break;}
  35. 							if(flag==0)  {a[i*m+cur_column]=1;goto next_turn;}
  36. 							else
  37. 							{     
  38. 			                      
  39. 								  for(i=0;i<n;i++)
  40. 									 sum=sum+a[i*m+cur_column]  ;
  41. 			                       
  42. 								  if(sum<=n) {
  43. 								for(i=0;i<n;i++)  
  44. 								{ 
  45. 									if(a[i*m+cur_column]==1)
  46. 										{
  47. 										a[i*m+cur_column]==0;count--;break;
  48. 										} 
  49. 								}
  50. 								goto next_turn;
  51. 							   }       
  52. 							}              
  53. 						 }
  54. 					 else
  55. 					{
  56. 							   for(i=0;i<n;i++)
  57. 								 if (a[i*m+cur_column]>0) {a[i*m+cur_column]=0;count--;break; }
  58. 							}
  59. 				  next_turn: winner++;  
  60. 				  for(i=0;i<n;i++)
  61. 									 sum=sum+a[i*m+cur_column]  ;
  62. 				  if(sum==0) cur_column++;
  63. 			   } 
  64. 			  
  65. 			   if(winner%2==0) {strcpy(s[z],"second");}
  66. 			   else {strcpy(s[z],"first");}
  67.    }
  68.    for(i=0;i<z;i++)
  69.    {
  70. 	   printf("%s\n",s[i]);
  71.    }
  72.    return 0;  
  73. }
  74.  
  75.

Comments