OJ Board

Special thanks to the 100+ teams who took part in the 7th Contest of Newbies! The six problems are now available on the 24h Online Judge, with number 12397-12402. For your reference, here are the last-hour hints (slightly modified) given on the clarification board: " A-C are easier - just go th...

https://lh6.googleusercontent.com/-Sct9w-FWgcA/Ttj9tkjfrjI/AAAAAAAAAKw/_gTaZUyqFWI/s398/newbies.gif 7th Contest of Newbies Date: December 31st, 2011 (Saturday) Time: 12:00 - 16:00 (UTC) URL: http://uva.onlinejudge.org Hello, everyone! We are happy to announce that the 7th Contest of Newbies is to b...

Why guess 26 in the first case? The distance between 1 and 26 is the SAME as that between 36 and 26, so it is rejected after first two guesses.

Here are the "Last-minute hints" given on the Clarification Board (not many contestants have read it though......): A: Think what happens when the angle is "large". B: The input numbers are automatically in the correct format. C: Yes the statement is long... but this may be the e...

Just to remind you that the Sixth Contest of Newbies will be held this Saturday!

The UVa site does seem a bit slow so... good luck~

Oh wait I've found my old account (Ob_z) at Topcoder Forums... I've put an invitation post there (before I forget about it). Thanks! :wink: Ah yes, for a taste of what our problems are like, here are some highlights of our old tasks: Easier : 10976 - Fractions Again?! 11152 - Colourful Flowers Harde...

sohel wrote:Good to see you back!
About promoting: You can also post the link in TopCoder Forums. It'd be best if you do that 2/3 days before the start of the contest.

Hi thanks for your support!!

I don't have a TopCoder account, so...

http://img269.imageshack.us/img269/1237/newbies.gif Sixth Contest of Newbies Date : January 29th, 2011 (Saturday) Time : 12:00 - 16:00 (UTC) URL : http://uva.onlinejudge.org Time flies, and it has been two whole years since the last contest of newbies. I am happy to announce that six new programmin...

I didn't run your code, but I see a very suspicious line: Any mistake here?

Problem, indeed, has quite a tricky statement :) I got AC, but I still do not understand about "(to within one dollar)" :) :roll: Oh for that part, I just copied from the problem statement of 10137 - The Trip ... The problem statement wasn't meant to be confusing. The tea charge and servi...

Artincuno is right. The input numbers are all in the specified range. In fact the largest number in the input file is a bit less than 10000.

Hi, 1) Does bumping into mean robot and person cannot be in *adjacent" squares? Or just that they cannot be in same square? 2) Can robots see through each other? 3) What's wrong with NNWXNWWSW for my 3rd example? why a longer path is required? I simulate this and it looks perfectly fine to me. ...

Long time no see, everyone~ [Advertisement] http://img211.imageshack.us/img211/9355/newbiespa9.gif Hosted by UVa Online Judge 2008-12-27 12:00-16:00 UTC It's the "Newbie Problemsetters" again. As usual, we are having our online programming contest on the last Saturday of the year, and we l...

For example, 1000 = 324 + 676 = 18*18 + 26*26.

Ha, so after two years I look at this problem description again and solve it within 20 minutes!

Cho wrote:Your A[a][c] will always be equal to A[0][b-a][c-a]. Thus you can reduce one dimension.

This is the key to the problem. With this in mind one can come up with a very short solution easily.