Advertisement
Guest User

Untitled

a guest
Mar 23rd, 2017
70
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.16 KB | None | 0 0
  1. #include "simpletools.h"
  2. #include "abdrive.h"
  3. #include "ping.h"
  4. #include <stdbool.h>
  5. #include "final.h"
  6.  
  7. #define MAZE_X 4
  8. #define MAZE_Y 4
  9. #define MAZE_XY = MAZE_X * MAZE_Y
  10.  
  11. typedef struct {
  12. int x;
  13. int y;
  14. } Coor;
  15.  
  16. bool state[MAZE_XY][MAZE_XY];
  17.  
  18. Coor stupidToClever(int stupid) {
  19. int x = (stupid - (stupid % MAZE_Y)) / MAZE_X;
  20. int y = (stupid % MAZE_X);
  21. return Coor{x, y};
  22. } // pour chaque case , elle prend le num de la case et ns donne les coordonnes
  23.  
  24. int cleverToStupid(Coor clever) {
  25. return clever->x * MAZE_X + clever->y; //pour chak coordonnes elle donne le num de la case
  26. }
  27.  
  28. int main() {
  29. bool left = false, right = false, top = false, bottom = false;
  30.  
  31. dac_ctr(26, 0, 32);
  32. freqout(11, 1, 38000);
  33. if(input(10) == 1) left = true;
  34.  
  35. dac_ctr(27, 1, dacVal);
  36. freqout(1, 1, 38000);
  37. if(input(2) == 1) right = true;
  38.  
  39. drive_goto(51, 0);
  40.  
  41. dac_ctr(26, 0, 32);
  42. freqout(11, 1, 38000);
  43. if(input(10) == 1) top = true;
  44.  
  45. dac_ctr(27, 1, dacVal);
  46. freqout(1, 1, 38000);
  47. if(input(2) == 1) bottom = true;
  48.  
  49.  
  50.  
  51.  
  52.  
  53.  
  54. return 0;
  55. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement