OJ Board

Hi everyone.

I was not able to recover my old UVA account (WhiteShadow), so I will write in this new one.

I invite you all to participate on the online version of MIUP'2008, the Portuguese National ACM Programming Contest.

URL to participate: http://miup-external.dei.uc.pt/~miup2008 (you will be ...

Hi everyone!

I know that there will be an online contest on UVA, but still I invite you all to participate on the online version of MIUP'2005, the Portuguese National ACM Programming Contest .

URL to participate : http://miup02.cpct.ua.pt/~mooshak/
Contest: MIUP'2005
Number of Problems: 9
Date ...

Hi everyone.

As always, Portugal will have it's National ACM Programming Contest, which we call MIUP (Maratona Inter-Universit

I think it would be really great if we could have a recover option on UVA, where we could send them a submission number, and they would send us the code we submitted. For example, I had a problem on my hard disk a couple of years ago and I lost the code for lots of problems, and it would be very ...

So, can anyone confirm that these problem will not be counted in the ranklist ?

If this is false, can anyone confirm that the problems will count, and say when will they be available with more "publicity" from the main ACM UVA Problemset page, and not only on http://online-judge.uva.es/archive ...

Well, on another thread (about acm solve site), Dominik Michniewsk raised an interesting question, that was not answered:


Some people (maybe I don't have right ...) creates more than one account - one for submitting all solutions for test only, second for submitting only good solutions .... It's ...

Well, IMHO, like most of the people that posted here, solutions should not be posted (except for maybe a couple selected problems).

We learn a lot more if we do things by ourselves... We should focus on learning how to fish, like Rui said. Posting solutions will only make some people try the ...

I still don't understand why I have to read the complete input.
If I got error in reading left branch, do I have to read the
right branch? Is it necessary?

Well, don't forget that this problem has multiple input, ie, more than one mobile may be present in the input. Therefore, it is necessary ...

Well, you made me wanna look at the problem again, to optimize a little bit more, and now my solution is again the first one (it took 2.15 s on UVA judge). If you wanna exchange ideas, or just want to know what I did, mail me (pribeiro@dcc.online.pt)

Hi!

My program solves the "23 1" case in 4.23s on my AMD Athlon 700Mhz, giving 88 solutions (as your solution did), using gcc without optimization (if I use the option -O3 in the compiler the program takes 1.13s)

"23 3" is even a worst case (152 solutions) and my program takes 5.77s to do that (1 ...