UVa OJ Board

The ferry is initially on the left bank where it broke and it took quite some time to fix it. In the meantime, lines of cars formed on both banks that await to cross the river. In other words, cars on left side never have to wait on cars on the right side and vice verca. Two seperate waiting lines....

If there is a thread about your problem, please use it.
This question has already been asked in this thread:
http://online-judge.uva.es/board/viewtopic.php?t=6581

I think you need to read the input/output specifications of the problem more carefully. Your program needs to handle more than one case (more than one line of input). That is, you should not have to restart your program for every new case, it should keep reading input until there is no more input to...

No problem.

You should probably remove your code now (it's custom to remove ones code after getting AC).

Two things that might cause you problems:

char c,snum[5];
5 might be too low. Try changing it to 10 (you want to be able to read numbers that would fit into a 32-bit int).

Also, you print an extra blank line after the last case, which might cause a presentation error.

I don't know why you'd get WA, I would have expected you to get TLE though. You definately want to use ints instead of long ints.

Besides this, there are very simple means by which your solution can be made more efficient.

Try this input and see if you can spot your error (and don't forget to remove your code after you get AC).

input:

C++ is smart enough to realize there's only one sensible way to combine a char and a string and that's to treat the char as a string of size 1
Thus the two are equivalent, but I'm lazy so I prefer the shorter way of writing it.

As for the basic idea of biginteger multiplication. There are of course several methods and it all depends on how efficient you want it to be and how big numbers you have as well as what you want to use it for. But as a basic idea, you should represent your numbers as arrays of words, where each wor...

As time reference. I used the same bigint implementation for 10106 as I did for 623.

My program solved 10106 in 0.027 while it took 2.713 to solve problem 623.

With this reference it's perhaps not surprising that your implementation resulted in a TLE.

The judge is using an older version of g++ (version 2.95.3).
Your error is on the line:

if(res!=0) r=string(1,res+'0')+r;

You might try replacing it with

if(res!=0) r=(char)(res+'0')+r;

At first glance your code looks fine to me. The only input I can come up with, which your program would fail on, is one that contains pieces of 0 height. Such as: 3 1 1 1 0 1 1 0 0 0 As I read the problem statement, the total height h is equal or greater to 1, but no such guarantee is made for the i...

jjtse wrote:That's a good idea, but where are you going to find an array big enough to hold a bazillion prime numbers?

By sqrt(10000^2+10000+41), I mean the square root of (10000^2+10000+41). Which is 10001. And in the range from 2 to 10001 there are only 1229 prime numbers.

I ran a full search on your outputs, and you fail to strip a leading zero from one of your bignums before you print it.

input: Otherwise all your outputs look ok.

CodeJerk wrote:

Code: Select all

do{
    ...
  } while (true);

I think it's the endless loop that gives you TLE.