fork download 
  1. #include <stdio.h>
  2. #include <string.h>
  3.  
  4. #define SIZE 16
  5. int answer = 0;
  6. // define your logic functions here as necessary
  7. void dfs(int v, int a[][SIZE], int reach[])
  8. {
  9.  int i;
  10.  int n = SIZE;
  11.  reach[v]=1;
  12.  for(i=0;i<n;i++)
  13.  {
  14.  
  15.  if(a[v][i]==3)
  16.  {  
  17.  	answer = 1;
  18.     //return 1;
  19.  }
  20.  else if(a[v][i]!=1 && !reach[i])
  21.   {
  22.    printf("\n %d->%d",v,i);
  23.   /* if (a[v][i]==3)
  24.    { 
  25.    	printf("AT #3");
  26.    	 answer=1;
  27.      return;
  28.     } 
  29.     */
  30.   dfs(i, a, reach);
  31.  
  32.   }
  33.  
  34. }}
  35. /*
  36. int computeResult(int a[][SIZE]){
  37.  
  38. 	int reach[SIZE] = {0};
  39. 	return dfs(1, a, reach);
  40.  
  41. }
  42. */
  43. int main()
  44. {
  45. 	int tcLen;
  46. 	int i, j, k;
  47. //	int answer;
  48. 	char temp;
  49. 	int grid[SIZE][SIZE];
  50.  
  51. 	for (i=0; i<10; i++){
  52.  
  53. 		answer = 0;
  54.  
  55. 		scanf("%d\n", &tcLen);
  56.  
  57. 		for (j=0; j<SIZE; j++){
  58. 			for (k=0; k<SIZE; k++){
  59. 				scanf("%c", &temp);
  60. 				grid[j][k] = atoi(&temp);
  61. 			}
  62. 			scanf("\n");
  63. 		}
  64.  
  65. 		//calculate and print answer here
  66. 	int reach[SIZE] = {0};
  67. 	 dfs(1, grid, reach);
  68.  
  69. 		//answer =  computeResult(grid);
  70. 		printf("#%d %d\n",i+1, answer);
  71. 	}	
  72.  
  73. 	return 0;
  74. }
  75.  
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin 
1
1111111111111111
1210000000100011
1010101110101111
1000100010100011
1111111010101011
1000000010101011
1011111110111011
1010000010001011
1010101111101011
1010100010001011
1010111010111011
1010001000100011
1011101111101011
1000100000001311
1111111111111111
1111111111111111
2
1111111111111111
1200000010000011
1011111011111011
1000001010000011
1110101010111011
1010101010100011
1011111010111111
1000001010000011
1011101011111011
1010101010000011
1010101010111111
1010100000130011
1010111111111011
1000000000000011
1111111111111111
1111111111111111
3
1111111111111111
1210001000100011
1010101010101011
1000100010101011
1011111110101011
1000001010101011
1111101010101011
1010001000001011
1010111111111011
1010000000100011
1011111110101111
1000001010100011
1011101010111011
1000100000130011
1111111111111111
1111111111111111
4
1111111111111111
1200100000000011
1011101110111011
1000001010101011
1111111011101011
1000100010000011
1010101010111111
1010001010001011
1011111011101011
1000100010100011
1110101110111111
1010100000130011
1010111111111011
1000000000000011
1111111111111111
1111111111111111
5
1111111111111111
1210000000100011
1010111011101011
1010100010001011
1011101010111011
1000001010001011
1111111011111011
1000100010000011
1011101010111011
1010001000001011
1010101011111111
1010101000000011
1010101110111011
1000100010001311
1111111111111111
1111111111111111
6
1111111111111111
1210001010000011
1010101010111111
1010100000100011
1010111111101011
1000100000001011
1110101111111011
1000100000001011
1011101111101011
1000101000101011
1110101010111011
1010100010100011
1010111110101111
1000000000100311
1111111111111111
1111111111111111
7
1111111111111111
1210000000000011
1011101111111011
1000101010000011
1110101010111011
1000001000101011
1010111111101111
1010100000100011
1011101110101111
1000001000100011
1111111011111011
1000100010001011
1010101110111011
1010001300000011
1111111111111111
1111111111111111
8
1111111111111111
1200000010000011
1111111010111011
1000000010001011
1011111111111011
1010000000000011
1010111111101011
1010000000001011
1010111011111011
1000100010001011
1111111011101011
1000001000100011
1110111110101011
1000000000101311
1111111111111111
1111111111111111
9
1111111111111111
1200000000001011
1011111111101011
1000000010001011
1111111010111011
1000100010000011
1011101111111011
1010001000001011
1010111011101011
1010000010101311
1011111110101111
1000100000100011
1011101011111011
1000001000000011
1111111111111111
1111111111111111
10
1111111111111111
1200001000100011
1111101110101011
1000100010001011
1011101111101111
1000100000000011
1110111111101011
1000000010001011
1110111011101011
1010001000001011
1010101111111011
1000101010000011
1010101010101111
1010100000100311
1111111111111111
1111111111111111
stdout 
 1->3
 3->2
 2->5
 5->4
 4->7
 7->6
 6->9
 9->10
 10->13
 13->8
 8->11
 11->12#1 1

 1->2
 2->7
 7->3
 3->4
 4->5
 5->9
 9->10
 9->11
 11->6
 11->8
 8->13
 13->12#2 1

 1->3
 3->2
 2->5
 5->4
 4->9
 9->6
 6->7
 7->8
 8->13
 13->12
 7->10
 10->11#3 1

 1->2
 2->5
 5->3
 3->4
 4->7
 7->9
 9->6
 9->11
 11->8
 8->13
 13->10
 13->12#4 1

 1->3
 3->5
 5->2
 2->7
 7->6
 6->13
 13->9
 9->4
 9->8
 9->10
 9->11
 11->12#5 1

 1->3
 3->5
 5->2
 2->7
 7->6
 6->13
 13->4
 4->11
 11->9
 9->8
 11->12
 7->10#6 1

 1->3
 3->2
 2->5
 5->4
 4->7
 7->6
 6->11
 11->9
 9->8
 9->12
 12->13
 13->10#7 1

 1->2
 2->7
 7->3
 3->4
 4->13
 13->5
 5->6
 6->11
 11->8
 11->9
 9->10
 11->12#8 1

 1->2
 2->11
 11->3
 3->4
 4->7
 7->5
 5->6
 6->13
 13->8
 13->9
 13->10
 13->12#9 1

 1->2
 2->5
 5->3
 3->6
 6->11
 11->7
 7->4
 7->9
 9->8
 8->13
 13->12
 9->10#10 1
https://ideone.com/NriojK
1010001000001011
language:
C (gcc 8.3)
created:
8 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!