0
Your rating: None

CodeChef submission 857905 (C++ 4.3.2)

CodeChef submission 857905 (C++ 4.3.2) plaintext list. Status: WA, problem DAILY, contest COOK19. By Still-InBeta (Still-InBeta), 2012-02-19 23:59:43.
  1. #include <stdio.h>
  2. //#include<conio.h>
  3.  
  4. int nCr(int n, int r)
  5. {
  6. 	int fac=1,i;
  7. 	for(i=1;i<=n;i++)
  8. 		fac*=i;
  9. 	for(i=1;i<=r;i++)
  10. 		fac/=i;
  11. 	for(i=1;i<=n-r;i++)
  12. 		fac/=i;
  13. 	return fac;
  14. }
  15. 	
  16. int main()
  17. {
  18. 	int i,j,k,l,m,T;
  19. 	int X,N;
  20. 	char bearth[55];
  21. 	int comp[][6]={{1,2,3,4,53,54},
  22. 				  {5,6,7,8,51,52},
  23. 				  {9,10,11,12,49,50},
  24. 				  {13,14,15,16,47,48},
  25. 				  {17,18,19,20,45,46},
  26. 				  {21,22,23,24,43,44},
  27. 				  {25,26,27,28,41,42},
  28. 				  {29,30,31,32,39,40},
  29. 				  {33,34,35,36,37,38}};
  30. 				  
  31.     scanf("%d %d",&X,&N);
  32. 	int count=0,free;
  33. 	for(j=0;j<N;j++)
  34. 	{
  35. 		fflush(stdin);
  36. 		gets(bearth);
  37. 		for(k=0;k<9;k++)
  38. 		{
  39. 			free=0;
  40. 			for(l=0;l<6;l++)
  41. 			{
  42. 				if(bearth[comp[k][l]-1]=='0')
  43. 					free++;
  44. 			}
  45. 			if(free>=X)
  46. 				count+=nCr(free,X);
  47. 		}
  48. 	}
  49. 	printf("%d\n",count);
  50.  
  51. 	//getch();				
  52.    	return 0;
  53. }
  54.

Comments