Source code for submission s729

Go to diff to previous submission

grasshop.c

  1. /*
  2.  * File: grasshop.c
  3.  * Author: cteam066
  4.  *
  5.  * Created on October 27, 2012, 11:41 AM
  6.  */
  7.  
  8. #include <stdio.h>
  9. #include <stdlib.h>
  10. #include <string.h>
  11.  
  12.  
  13. #define GRID_MAX 100
  14. #define GRID_SIDE GRID_MAX + 2
  15.  
  16. int grid[GRID_SIDE][GRID_SIDE];
  17. int x_side;
  18. int y_side;
  19.  
  20. void reset(){
  21. int i = 0;
  22. for ( i = 0; i < GRID_SIDE; ++i )
  23. memset( grid[i], 0, sizeof(int) * GRID_SIDE );
  24. }
  25.  
  26. void traverse( int x, int y, int step ) {
  27. if ( x < 1 || y < 1 || x > x_side || y > y_side )
  28. return;
  29.  
  30. if ( grid[x][y] && step >= grid[x][y] )
  31. return;
  32.  
  33. grid[x][y] = step;
  34.  
  35. int nextStep = step + 1;
  36.  
  37. traverse( x + 2, y + 1, nextStep );
  38. traverse( x + 2, y - 1, nextStep );
  39.  
  40. traverse( x - 2, y + 1, nextStep );
  41. traverse( x - 2, y - 1, nextStep );
  42.  
  43. traverse( x + 1, y + 2, nextStep );
  44. traverse( x + 1, y - 2, nextStep );
  45.  
  46. traverse( x - 1, y + 2, nextStep );
  47. traverse( x - 1, y - 2, nextStep );
  48. }
  49.  
  50.  
  51. /*
  52.  *
  53.  */
  54. int main(int argc, char** argv) {
  55.  
  56. int x_start, y_start;
  57. int x_dest, y_dest;
  58.  
  59. while( scanf("%d %d %d %d %d %d",
  60. &x_side, &y_side, &x_start, &y_start, &x_dest, &y_dest) == 6){
  61.  
  62. reset();
  63. traverse(x_start, y_start, 1);
  64. int result = grid[x_dest][y_dest];
  65. if ( result )
  66. printf("%d\n", result - 1);
  67. else
  68. printf("impossible\n");
  69. }
  70.  
  71. return (EXIT_SUCCESS);
  72. }
  73.  
  74.  

Diff to submission s715

grasshop.c

--- c4.s715.cteam066.grasshop.c.0.grasshop.c
+++ c4.s729.cteam066.grasshop.c.0.grasshop.c
@@ -28,5 +28,5 @@
         return;
     
-    if ( grid[x][y] && step > grid[x][y] )
+    if ( grid[x][y] && step >= grid[x][y] )
         return;