OnlineJudge | Ver 1

You're using C++ style comments in your code, i.e. //.

Many C compilers will allow these types of comments as an extension, however strict ANSI C does not. You'll need to use C style comments /* ... */.

So instead of this:

You can override the definition of the input() function to return values from your TestCase class.

I think I see what your input structure is all about. The 1 at the beginning defines how many sets of data are in the test case, and the remaining values are lists containing that many items. Since the first value is 1, you only have one value in each secondary list. It is the first value from each list that you want to return for each call to input after the first one.

The "output" you show is, I'm guessing, actually user input except for the last line. So when reading from your data set instead of taking user input, printing each value returned by your input() function will verify what's going on and give you the output that you show.

Here's an extended version of your code that I think does what you want. I added a method to your TestCase class to return the input data for that test case, one value at a time. I put the main body of your code in a main() function that accepts a TestCase object. In main(), I overload input() to point to that new method inside TestCase to return input from the test case instead of getting it from the user. I didn't have to change the main body of your code at all. Here's what I did:

Here is the solution code. Notes:

1. You have to use if (a == 0 && b == 0 && c == 0) instead of if (a == b == c == 0).
2. You have to use lower case ex: right not Right.

Given your code actually does generate the correct results for the given samples, it's a safe bet you're not handling the input data correctly. And, in fact, the problem statement states (my emphasis):

The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0.

You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j.

Hence, your code that gets only one pair will not be sufficient. The reason it only processes one pair has to do with a misunderstanding that the code:

It seems captivating riddle, so if you want to solve it in C++ have two way. The hard way is implementing a small math parser using some algorithms like Shunting-yard algorithm. Or instead of, if you are familiar with library linking in C++, it is better to use a mathematical expression parser libraries. There are many libraries on Internet. Here, I suggest one of them as below.

mathematical expression library I personalty have tested it and obviously is fast. you can clone source code in GitHub

Anyway, you can not solve this case with lambda functions because, the input is a mathematical expression you should parse and calculate it runtime.

if you use python see this post.

Not sure is your input method ok for uva solution...

Try with this:

Turning on -fsanitize=undefined, I got a warning in hasConflict about an index out of bounds.

Indeed, it seems that hasConflict is sometimes passed strings containing *, in which case used[*iter - 'a'] is outside the bounds of bool used[26].

Not sure if that's the bug causing your failure, but it's certainly a bug.

First, there is no floating-point arithmetic going on here: everything is done in integers (specifically, long long ints).

This means that when y is between 1000000 and 1999999, inclusive, the result of the division y / 1000000 is going to be 1. Hence, subtracting 1 from it would lead to zero denominator, and a division by zero exception.

Your second expression will produce the same result only when y is equal to 1000000, but the program is going to crash with the same exception.

The trick to solving problems of this kind is keeping numerator and denominator separate, and performing your math entirely in integers, i.e. without floating point numbers. Constructing a simple class for representing rational numbers should help simplifying your code.

Solved the problem :

Program run without any errors with runtime : 0.330s

The runtime error was solved when I replaced the stoi() function with input formatting.

Finally there was an output error because I was flipping k and j to prevent undefined behavior when j < k, which I solved by formatting the output accordingly.