Thread: Input into array.

I have to do this assignment, and its really weird and complicated, so ill save you that. But I need to read multiple lines of input into an array, the first line of input gives me the number of lines that will follow it, so I dont count that. I have code set up, but it doesnt seem to get all of the lines. Its missing one. Not really sure whats wrong with it.

import java.util.*;
public class Mastermind
{
   public static void main(String [] args)
   {
       Scanner in = new Scanner(System.in); 
       System.out.println("Please enter a number followed by that number of guesses: ");
       int numL = Integer.parseInt(in.next());       
       String [] guess = new String [numL];
       //guess [0] = in.nextLine();
 
       int c = 0;
       while (in.hasNextLine() && c < numL)
        {
            guess[c] = in.nextLine();
            c++;
        }
 
        for (int i = 0; i < numL; i++)
        {
            System.out.println(guess[i]);
        }
    }
}

Thanks for the help!

I didnt think of that before javapenguin, its changed now. Thanks! But if I do what norm suggested, I get this:

 

Please enter a number followed by that number of guesses: 

3

1

2

3

i=0 <

i=1 1<

i=2 2<

So its not that its missing the last line, its just taking in guess[0] as "" for some reason, therefore it runs out of room for the last line.
I shall go examine further to figure out why, post if you know the answer plox

Ahhh. Well i'm using nextInt() now, I think what ill do is make some bogus String that I dont use to take up the newline character. That sounds easiest!

Got it working now, thanks guys Will post on this again if I have another issue.

So the program I have to write deals with a Mastermind game, which some of you may be familiar with. I have to take input of the format:
2
BYOG 3 0
BGOY 3 0

and tell whether it is a valid problem or not. Obviously this one is not, because 3 of them were supposed to be correct, 2 were switched and it still said 3.

But a problem like:
3
GROW 2 1
BROW 1 2
GOBW 4 0

is valid. What I am trying to think of, is the correct algorithms to check these.

I guess, regarding the first input, I could compare each letter and count how many are different and if at least one less than the "correct" number is different, and the number doesnt change, it is invalid. But that opens the door for a lot of options on which way to go after that and what to expect. I'm just looking for some input on this I guess. If you dont want to comment on it, thats fine, I'm going to keep trying.

If I used a statement like

        int count = 0;
       if(num1[0] == num1 [1])
       {
       for (int i = 0; i < 3; i++)
       {
           if(guess[0].compareTo(guess[1]) != 0)
           {
               if (guess[0].charAt(i).compareTo(guess[1].charAt(i)) != 0)
               count++;
 
            }
 
            if (count >= (num[1] - 2))
            System.out.println("Invalid Feedback");
        }        
    }

It wouldnt work because you cant use compareTo with a char, but I think i'm on the right track. How would I set that up so I can use a String?

Well what do you mean by that? You can't just type (String) in front of it. That doesn't work.

Lol I think so.

Thanks!

You know, ive been trying to find ways to test and see if the input was invalid, but what if I just find one way to see if it is valid, and then else print invalid?

I'm trying of think how to test it though.

3
GROW 2 1
BROW 1 2
GOBW 4 0

is correct.

But how to test that and put it into code....

I guess something along the lines of saying that if it changes less than than one less of the correct number (without the correct number changing), that the numbers changing equals no less than the correct and wrong place numbers added together, but possibly more. Something like that. I'll get working.

Nah the second number is how many are right, but in the wrong place.

So they got rid of the R completely, added a G, and moved the B and O.

the first number is how many are correct completely.

and I'm glad you pointed this out, because it might have cause me a problem while coding.

Yeah no problem, ill paste the whole assignment.

 

Mastermind is a logic game for two players. In each round, one player plays the part

of codemaker, and the other plays codebreaker. The codemaker secretly creates a

sequence of four (4) colored pegs, selected from among six (6) different colors. In

our case we will not use duplicate colors. The codebreaker then creates guesses in

the same way, and receives feedback regarding each guess. The feedback consists

of two numbers. The first number specifies how many pegs in the guess are both

the correct color and position. The other number represents correct colors that are

in the wrong position. Using this feedback and comparing the results of several

guesses, the codebreaker should be able to deduce the codemaker’s actual

sequence. (See the examples to help clarify the rules.)

Ryan enjoys the game, but he sometimes suspects that the codemaker may be

cheating by giving false feedback. In fact, it sometimes seems that there is no

possible sequence consistent with all of the feedback he has received. But Ryan

doesn’t want to go to the trouble of proving this himself, and he has asked you to

write a program to find out.

You will be given a set of guesses with their corresponding feedback, and your task

is to answer whether there is any possible sequence that is consistent with all the

feedback.

Input Format:

The input will begin with a single integer N, which will be followed by N lines, each

describing a guess and its feedback in the following format:

XXXX A B

where XXXX are four uppercase characters identifying the colors in the guess, A is

the number of correct pegs in the guess, and B is the number of pegs of correct

color but incorrect position. The list of possible colors is Red, Green, Blue, Yellow,

Orange, White, each identified in the input by its first letter.

Output Format:

Your output should be either “Valid Feedback” or “Invalid Feedback”, depending

on whether any possible sequence of colors could have produced the given

feedback for all the guesses.



Input:

2

BYOG 3 0

BGOY 3 0



Output:

Invalid Feedback



Input:

3

GROW 2 1

BROW 1 2

GOBW 4 0



Output:

Valid Feedback