Search found 151 matches

by stubbscroll
Wed Apr 12, 2006 10:16 am
Forum: Volume 104 (10400-10499)
Topic: 10420 - List of Conquests
Replies: 68
Views: 26523

Volume CIV (104) is the correct thread for this problem.
by stubbscroll
Sun Mar 19, 2006 11:06 am
Forum: Off topic (General chit-chat)
Topic: What`s your accupation?
Replies: 4
Views: 2632

Many people have other jobs than programming.
by stubbscroll
Mon Feb 06, 2006 8:18 pm
Forum: Other words
Topic: Can you give me numbers of some max-flow problems in UVA?
Replies: 2
Views: 1823

Here's a list of some problems where maxflow can be used:

http://online-judge.uva.es/board/viewto ... ight=10779
by stubbscroll
Thu Dec 01, 2005 6:31 pm
Forum: Off topic (General chit-chat)
Topic: CSE course
Replies: 10
Views: 3700

There should have been an "other" alternative in the poll, some people may learn algoriths later than 4th semester, and some learn on their spare time, without attending an university. I solved 900 problems on this site before I began to study computer science, because one of my hobbies is programmi...
by stubbscroll
Tue Nov 01, 2005 6:28 pm
Forum: Volume 2 (200-299)
Topic: 207 - PGA Tour Prize Money
Replies: 30
Views: 7228

I submitted my solution with this line added: if(fabs(p[i].m*1e2 - floor(p[i].m*1e2) - 0.5)<1e-8) return 1/0; (where p .m is the amount of money to be printed). My program didn't terminate with SIGFPE, so there are no "money won" amounts terribly close to x.xx5, so rounding shouldn't be a problem. A...
by stubbscroll
Sat Oct 29, 2005 1:29 pm
Forum: Volume 2 (200-299)
Topic: 207 - PGA Tour Prize Money
Replies: 30
Views: 7228

I ran my program against your 1000 test cases, my program gives different output in 5 of the cases. All of them are in the "money won" column, where my program outputs a number 0.01 lower than your program. All of the amounts are exactly x.xx5. It seems your program always rounds them up, and my pro...
by stubbscroll
Sat Oct 29, 2005 11:48 am
Forum: Volume 2 (200-299)
Topic: 207 - PGA Tour Prize Money
Replies: 30
Views: 7228

Here is the output from my AC(P.E.) program. It seems our outputs differ a lot in the prizes column. Player Name Place RD1 RD2 RD3 RD4 TOTAL Money Won ----------------------------------------------------------------------- Leinkof 1 60 60 60 71 251 $ 7388.53 Lvybwxtg 2 62 70 60 61 253 $ 7245.28 Pymq...
by stubbscroll
Sat Jul 30, 2005 4:44 pm
Forum: Volume 108 (10800-10899)
Topic: 10814 - Simplifying Fractions
Replies: 30
Views: 16877

Isn't the C++ type unsigned long long enough for this problem. If I am not completely wrong then unsigned long long can hold values up to 2 ^ 128 - 1 which is much more than 10 ^ 30. [snip] As noone here it talking about using built-in C++ types I guess I am fundamentally wrong about that. But ... ...
by stubbscroll
Fri Jun 24, 2005 6:05 pm
Forum: Algorithms
Topic: Bigint problems
Replies: 7
Views: 11277

This is a list I made by searching through my hard disk for calls to bigint *, /, % and pow operations. Some problems might be possible to solve using only +, - or long long (or maybe I missed the correct way to solve it, without big numbers). 239 Tempus et mobilius, time and motion 254 Towers of Ha...
by stubbscroll
Thu Jun 23, 2005 5:17 pm
Forum: Other words
Topic: The Euler Project
Replies: 11
Views: 10025

Thanks for posting this link! You were right, it's highly addictive :D. The last couple of days I've enjoyed solving problems from this site. I found this an excellent way to train myself in number theory, as I'm somewhat weak in this area. I liked the submission system a lot, including the fact tha...
by stubbscroll
Sun Jun 19, 2005 4:07 pm
Forum: Volume 5 (500-599)
Topic: 569 - Horse Shoe Scoring
Replies: 7
Views: 2912

I don't think you have to worry about precision in this problem. As far as my asserts found out (if they were bug-free), there are no cases where the center of the post was exactly on the imaginary line between the ends of the horseshow, or cases where the post touches (but don't intersect) the hors...
by stubbscroll
Tue Jun 14, 2005 5:07 pm
Forum: Volume 2 (200-299)
Topic: 293 - Bits
Replies: 8
Views: 2613

Here are the i/o I used for this problem: input: 12 year : [1970..2030] team : { name : string(14) members : array [1..3] of { sex : ( male, female ) name : string(20) age : [16..30] } position : [1..40] } jurynames : array [1..3] of string(20) fish : array [1..2] of array [1..1] of array [63..66] o...
by stubbscroll
Tue Jun 14, 2005 3:38 am
Forum: Volume 6 (600-699)
Topic: 690 - Pipeline Scheduling
Replies: 4
Views: 2512

Your program gives the wrong answer on this test case: 11 X.......... ........... ........... X.......... .X.......XX 0 Correct answer is 38, your program outputs 40. By the way, here's the schedule that my program found (for the bottom two lines:) 0123456789012345678901234567890123456789 ----------...
by stubbscroll
Tue Jun 07, 2005 3:50 pm
Forum: Volume 108 (10800-10899)
Topic: 10860 - Many a Little makes a Mickle
Replies: 7
Views: 2834

From the problem statement: c. Each use of a short string or its reverse would be counted as one occurance of that short string You are not checking the reverse of the strings. I didn't see this bug in your code earlier. Try this test case: 1 ab 1 ba Answer should be 1, your code outputs "Not possib...
by stubbscroll
Tue Jun 07, 2005 1:59 am
Forum: C
Topic: hypot vs sqrt
Replies: 1
Views: 2045

hypot vs sqrt

Which function do you use to calculate Euclidian distance between two points, hypot(dx,dy) or sqrt(dx*dx+dy*dy)? I read somewhere (can't recall where right now) that hypot() is preferred because it reduces the chance of overflow error. On problem 609 (metal cutting), my experiences are the opposite....

Go to advanced search