Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include "cave.h"
- #pragma warning(disable:4996)
- const int MAXN = 5001;
- int doorsOpened[MAXN];
- int placement[MAXN];
- int state[MAXN];
- int N;
- int numTries = 0;
- void answer(int S[], int D[]) {
- for (int a = 0; a < N; a++) {
- if (S[a] != state[a] || D[a] != placement[a]) {
- printf("INCORRECT TRY USING %i TRIES\n", numTries);
- exit(0);
- }
- }
- printf("ANSWER CORRECT USING %i TRIES\n", numTries);
- exit(0);
- }
- int tryCombination(int S[]) {
- std::fill(doorsOpened, doorsOpened + MAXN, 0);
- for (int a = 0; a < N; a++) {
- //printf("%i ", S[a]);
- doorsOpened[placement[a]] = (S[a] == state[a]);
- }
- //printf("\n");
- for (int a = 0; a < N; a++) {
- //printf("%i ", doorsOpened[a]);
- }
- //printf("\n");
- numTries++;
- for (int a = 0; a < N; a++) {
- if (!doorsOpened[a]) {
- //printf("ret @ %i\n", a);
- return a;
- }
- }
- //printf("ret >%i\n", N);
- return -1;
- }
- int main() {
- scanf("%i", &N);
- for (int a = 0; a < N; a++) {
- scanf("%i", &placement[a]); //enter order of switches from 0...N - 1
- }
- for (int a = 0; a < N; a++) {
- scanf("%i", &state[a]); //please only enter 1 or 0 here, otherwise you screw yourself up
- }
- exploreCave(N);
- printf("Your program forgot to call answer(int S[], int D[])");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement