UVa OJ Board

That a problem is a multiple input is never told in any problem description. But if you check http://online-judge.uva.es/cgi-bin/OnlineJudge?Volume:5 Then you'll see a checkmark besides each question. And if you look at the very top you'll see a key for what they mean, and a link to what Multiple In...

There's probably an end-of-line character at the end of the data. You should always make your solution not depend on there being/not being one. So after it reads the last number, there's still that last character, the end-of-line. So the feof() returns false. But the next iteration you don't read a ...

In this problem, you have to find the minimum "jump range" needed by the frog to get from stone #1 to stone #2. Because his goal is to reach the lovely Fiona. So if there are stones kilometers away, it does him no good to reach them if he could just make a short jump to her stone.

Ok, this is kind of confusing, but here is what's happening. The problem is multiple input, so you should first read the number of data sets. Each data set involves a number of cases. The sample input only shows the number of cases, it doesn't show the number of data sets. So you need to read anothe...

Just adding this because the problem description was not very descriptive:

Assume that every team with a number between 1 and T exists, where T is the largest team number in the input case.

If a team has multiple submissions at the same contest time, consider all off the Y's to happen after the N's.

a) Don't sort the words
b) clear the dictionary after each case
c) Do you know it's a multiple input problem?

This is where I double posted and looked goofy.

One thing I noticed is that you have:
I assume 26 is there because there are 26 letters. But this problem says that capital are distinct from lowercase, so this should be 52

From the problem statement:

The plain message can contain any symbol, but only the letters of the substitution alphabet are encrypted.

In particular the message can contain spaces. The encrypted words however don't.

Gadalada, Nope, there are no catches. Mine swapped D & E also, but got AC. Ming, What I did was basically try each permutation of hexagons on every peg and each rotation of all the hexagons. Of course if you just do this then you'll time out. Luckily there are a lot of configurations that don't work...

GPI, I copied your code and put it through my compiler and then ran it against the sample input. The answers all looked correct except the pattern length always seemed to lag a test case behind. For example, the output for test case 2 was case 1's pattern length. I think the cause is: [cpp]cout << n...

Close.

All of those numbers are self-numbers, but you're missing one.

Arm.Turbo,
You are only adding five digits, whereas the numbers can be up to six digits.

The first time I read this problem I thought that triangles could be of any size. For example I thought that if you connect the points in this order then you'd get a triangle:

1-2-4-5-6-3-1

But it seems that only triangles with sides of length one count.

I think this problem is fairly straight forward. A hint would be, for each word, see how good you can do if the message started with just that word. Also remember to satisfy the condition: If there are several ways to format a paragraph with the same badness, use the following algorithm to choose wh...