Advertisement
Guest User

Untitled

a guest
Apr 16th, 2015
498
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.26 KB | None | 0 0
  1. #include <iostream>
  2. #include "cave.h"
  3. #pragma warning(disable:4996)
  4.  
  5. const int MAXN = 5001;
  6. int doorsOpened[MAXN];
  7. int placement[MAXN];
  8. int state[MAXN];
  9. int N;
  10. int numTries = 0;
  11.  
  12. void answer(int S[], int D[]) {
  13.     for (int a = 0; a < N; a++) {
  14.         if (S[a] != state[a] || D[a] != placement[a]) {
  15.             printf("INCORRECT TRY USING %i TRIES\n", numTries);
  16.             exit(0);
  17.         }
  18.     }
  19.     printf("ANSWER CORRECT USING %i TRIES\n", numTries);
  20.     exit(0);
  21. }
  22.  
  23.  
  24. int tryCombination(int S[]) {
  25.     std::fill(doorsOpened, doorsOpened + MAXN, 0);
  26.  
  27.     for (int a = 0; a < N; a++) {
  28.         //printf("%i ", S[a]);
  29.         doorsOpened[placement[a]] = (S[a] == state[a]);
  30.     }
  31.     //printf("\n");
  32.     for (int a = 0; a < N; a++) {
  33.         //printf("%i ", doorsOpened[a]);
  34.     }
  35.     //printf("\n");
  36.  
  37.     numTries++;
  38.     for (int a = 0; a < N; a++) {
  39.         if (!doorsOpened[a]) {
  40.             //printf("ret @ %i\n", a);
  41.             return a;
  42.         }
  43.     }
  44.     //printf("ret >%i\n", N);
  45.     return -1;
  46. }
  47.  
  48. int main() {
  49.     scanf("%i", &N);
  50.     for (int a = 0; a < N; a++) {
  51.         scanf("%i", &placement[a]); //enter order of switches from 0...N - 1
  52.     }
  53.     for (int a = 0; a < N; a++) {
  54.         scanf("%i", &state[a]); //please only enter 1 or 0 here, otherwise you screw yourself up
  55.     }
  56.     exploreCave(N);
  57.     printf("Your program forgot to call answer(int S[], int D[])");
  58. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement