Search found 325 matches

by yiuyuho
Thu Dec 11, 2008 4:08 pm
Forum: Bugs and suggestions
Topic: You are not authorised to view this resource.
Replies: 10
Views: 10397

Re: You are not authorised to view this resource.

That's weird, but very cool! I'll just use that if I need to extract authors information ;)

Thanks for your tools Felix!!
by yiuyuho
Thu Dec 04, 2008 7:02 am
Forum: Bugs and suggestions
Topic: You are not authorised to view this resource.
Replies: 10
Views: 10397

Re: You are not authorised to view this resource.

I am having the same problem. In addition, I get the same error message when I try to look up the statistic of a different author, I could access them before, but not anymore. I believe this is a problem on the UVa Judge side.
by yiuyuho
Mon Oct 06, 2008 6:30 pm
Forum: FAQ
Topic: NEW JUDGE is sucks
Replies: 8
Views: 9324

Re: NEW JUDGE is sucks

Wow, only 3 people? I must say you guys are doing an awesome job here.

Thanks, you've been of great help to many people around the world.
by yiuyuho
Thu Sep 25, 2008 3:07 pm
Forum: FAQ
Topic: Outbox vs Sent Message
Replies: 1
Views: 3992

Outbox vs Sent Message

What's the difference between Outbox and Sent Messages in the PM?
by yiuyuho
Mon Aug 11, 2008 5:21 pm
Forum: Volume 103 (10300-10399)
Topic: 10313 - Pay the Price
Replies: 42
Views: 19372

Re: 10313 - Pay the Price

If you are trying to get the value 4 with at most 3 coins, what you should call is A(4-3,3), which will give you A(1,3) = 1.
by yiuyuho
Fri Aug 08, 2008 5:28 pm
Forum: Volume 9 (900-999)
Topic: 999 - Book signatures
Replies: 3
Views: 3653

Re: 999 - Book Signatures

The fastest way to print will be fprintf, if that's not fast enough you can use fwrite. Or, an even better way is to first store the output in a buffer (char array) and use less print statements (since flushing buffer takes time, I think). But I am not an expert at I/O.
by yiuyuho
Fri Jun 13, 2008 9:49 pm
Forum: Volume 1 (100-199)
Topic: 176 - City Navigation
Replies: 20
Views: 7849

Re: 176 - City Navigation

Well, I am sorry. It seems I made a mistake and swapped the source and destination. The route on your map seems correct. Here's the calculation on the driveways to get 213: Starting from S16 1288: 1288 --> 1252: excluding 1288 this gives 18 driveways 1253 --> 1299: inclusive, this gives 24 driveways...
by yiuyuho
Fri Jun 13, 2008 8:24 pm
Forum: Volume 1 (100-199)
Topic: 176 - City Navigation
Replies: 20
Views: 7849

Re: 176 - City Navigation

You may not cross a lane of traffic except at an intersection, that is you must turn right when entering or leaving a driveway. That is you may not turn left when you leave the source location. Also you are driving on the right hand side of the road, so you wont have the U-turn at the end, instead y...
by yiuyuho
Fri May 23, 2008 5:41 pm
Forum: Volume 2 (200-299)
Topic: 234 - Switching Channels
Replies: 0
Views: 1059

234 - Switching Channels

Strange Thing: I looked at the specification here: http://icpcres.ecs.baylor.edu/onlinejudge/external/2/234.html Note that "Data set 1" is indented by 2 spaces and "Data set 2" is not, so in my initial submission I decided to indent all Data set...instead of getting Presentation Error, I got WA........
by yiuyuho
Mon May 19, 2008 4:46 pm
Forum: Volume 113 (11300-11399)
Topic: 11345 - Rectangles
Replies: 27
Views: 8895

Re: 11345 - Rectangles

See your breaking statement there? You'll end up not reading part of the input for the current test case and mess up the next test case. Anyway, if x1[j]>=x2[j] or y1[j]>=y2[j], then you just skip the current rectangle, but not all of them. At least I believe that's how it's done.
by yiuyuho
Thu May 15, 2008 10:27 pm
Forum: Algorithms
Topic: 2-SAT problem
Replies: 3
Views: 3006

Re: 2-SAT problem

The express (a or b) is equivalent to ~a --> b and also ~b --> a, and in fact the 2 equations together capture all there is in the expression a or b. Thus build a graph of size 2n (where n is the number of variables), then for each expression (a or b) construct two directed edges accordingly. There ...
by yiuyuho
Sat May 10, 2008 9:36 pm
Forum: Volume 113 (11300-11399)
Topic: 11384 - Help is needed for Dexter
Replies: 8
Views: 4670

Re: 11384 - Help is needed for Dexter

Hi. Can anyone proof for me that the optimal solution always only subtracts powers of 2 from the set of selected numbers?
by yiuyuho
Sat May 10, 2008 9:15 pm
Forum: Bugs and suggestions
Topic: Broken Link 11384
Replies: 1
Views: 1498

Broken Link 11384

I tried to access the problem statement of problem 11384 "Help is needed for Dexter" from the navigation panel and it gives me a broken link: The requested URL /onlinejudge/external/30/3000.html was not found on this server. The problem is available on external link: http://icpcres.ecs.baylor.edu/on...
by yiuyuho
Sun Apr 27, 2008 8:08 pm
Forum: Volume 113 (11300-11399)
Topic: 11345 - Rectangles
Replies: 27
Views: 8895

Re: Error in statement or data?

Anders wrote:I think there is an error in this problem. .... Nevertheless, if you sort the input you will get WA.

Or have I misunderstood something?

I believe you are right. This seems to be an error of input, which we have to deal with. But that's fine because this post has clarified things.
by yiuyuho
Sun Apr 20, 2008 6:48 am
Forum: Volume 113 (11300-11399)
Topic: 11317 - GCD+LCM
Replies: 16
Views: 5966

Re:

My solution is little different. You can see that, for all i's <= N/2 there are S[N/i] pairs where gcd=i. where, S[k] means the total number of relatively prime pairs less than or equal to k. Or it can be written: S[k]= phi(2] + phi(3) + ......+ phi(k) phi(n) = the number of reltively primes less t...

Go to advanced search