Search found 1078 matches

by little joey
Fri Dec 28, 2007 7:58 am
Forum: Volume 113 (11300-11399)
Topic: 11366 - Circle of Debt
Replies: 1
Views: 1890

11366 - Circle of Debt

If the judge data is the same as the original contest data, I think it is wrong: The forth case is: 1 5 0 1 0 0 0 0 0 0 1 1 1 2 10 0 0 5 0 0 5 This means that before the exchange Alice has 100, Bob has 100 and Cynthia has 25 crowns. Since Alice has to pay Bob 1 crown, and Bob has to pay Cynthia 5 cr...
by little joey
Wed Nov 28, 2007 10:10 am
Forum: Bugs and suggestions
Topic: Infinit Redirect - Please Fix It!
Replies: 1
Views: 1606

Infinit Redirect - Please Fix It!

The previous thread on this bug is locked, probably because it's considered fixed with the given work-around. Indeed, clearing the private data from Firefox enables you to get into the OJ, but that is really annoying! I use my browser for several other sites where I need to log in (gmail, for exampl...
by little joey
Sun Nov 25, 2007 11:52 pm
Forum: Volume 113 (11300-11399)
Topic: 11358 - Faster Processing Feasibility
Replies: 8
Views: 4180

You're right, my greedy gives "NO WAY" :(
by little joey
Sun Nov 25, 2007 10:31 am
Forum: Volume 113 (11300-11399)
Topic: 11358 - Faster Processing Feasibility
Replies: 8
Views: 4180

You base your greedy on earliest deadline, but that's not the correct criterion. My greedy answers "FEASIBLE" for your input. Can't remember all the details of the monkeys problem, but I think greedy is correct for this problem.
by little joey
Sun Nov 18, 2007 8:52 pm
Forum: Off topic (General chit-chat)
Topic: Cyclone in Bangladesh
Replies: 0
Views: 30686

Cyclone in Bangladesh

As we could hear in the news, a terrible disaster hit Bangladesh on Friday, taking thousands of lives, and many more to come.
Lots of programmers from this country are frequently using this site, so I like to wish them and their loved ones my sincere sympathy if they were in any way involved.
by little joey
Fri Nov 16, 2007 11:12 am
Forum: Off topic (General chit-chat)
Topic: Where is little joey?
Replies: 2
Views: 32479

Hi Sohel, thanks for the interest! I guess I fell into a kind of 'UVA-blackhole' the last few of months. While things where not going so great in my personal life lately, I found myself having less and less motivation to solve problems, set problems (I contributed none to the last Warm Up contest, t...
by little joey
Sat Aug 25, 2007 11:30 am
Forum: Volume 106 (10600-10699)
Topic: 10636 - Stretching Geometry
Replies: 10
Views: 6783

Amazing how insight can strike suddenly. I must have looked at this problem over 20 times in the past 3 years, without any idea of how to solve it.
This must be the most obfuscated problem in the problemset, which is a big credit for its setter :).
by little joey
Tue Aug 21, 2007 12:55 am
Forum: Volume 112 (11200-11299)
Topic: 11249 - Game
Replies: 32
Views: 13072

It is a lot of work to completely write it out. You could write a brute force program, as Adrian suggested, and verify it for yourself. In pseudo code: function evaluate(a,b,k): /* returns 'winning'or 'losing'; a and b are the pile sizes */ if a==0 and b==0 return 'losing'. for all positions (a',b')...
by little joey
Mon Aug 20, 2007 10:18 am
Forum: Volume 111 (11100-11199)
Topic: 11176 - Winning Streak
Replies: 18
Views: 12582

Yes, my polynomials are wrong. Thanks for pointing that out.
by little joey
Mon Aug 20, 2007 10:07 am
Forum: Volume 112 (11200-11299)
Topic: 11249 - Game
Replies: 32
Views: 13072

For this input

Code: Select all

1
1 1
64 26
your program replies "WINNING", but it's a losing position.
by little joey
Sat Aug 18, 2007 9:45 am
Forum: Volume 111 (11100-11199)
Topic: 11176 - Winning Streak
Replies: 18
Views: 12582

Yes, I think you are right in that it's unlikely that there is a better way then O(n^3) to calculate the coefficients, and it's not worthwhile to do so for so few queries. Precalculation and hardcoding is no option because there's not enough room in a 32k program (and would be considered cheating by...
by little joey
Sun Aug 12, 2007 12:41 pm
Forum: Volume 112 (11200-11299)
Topic: 11257 - New Marketing Plan
Replies: 23
Views: 8189

OK, I see. This won't happen in my method, because after determining the minimum radius in a certain step, I remove _all_ the sides for which the intersection of the angle bisectors lie at that minimum radius in one action. This means that in case of a square, the minimum radius is determined once a...
by little joey
Sun Aug 12, 2007 11:31 am
Forum: Volume 112 (11200-11299)
Topic: 11257 - New Marketing Plan
Replies: 23
Views: 8189

Thanks mf and sclo for their descriptions. I have one question for Simon: More about my method: I treated the case there're 2 adjacent sides parallel as special cases. The sample input doesn't have that case. It is possible that 2 adjacent sides are parallel if we keep removing sides. Can you give a...
by little joey
Thu Aug 09, 2007 7:28 pm
Forum: Volume 109 (10900-10999)
Topic: 10929 - You can say 11
Replies: 69
Views: 26436

A string doesn't have to be zero-terminated. If you replace

Code: Select all

if(line[0]=='0' && line[1]=='\0') break; 
by

Code: Select all

if((line.size()==1)&&(line[0]=='0')) break;
you'll get accepted. Then, please, remove your code.
by little joey
Thu Aug 09, 2007 2:04 pm
Forum: Volume 103 (10300-10399)
Topic: 10351 - Cutting Diamonds
Replies: 10
Views: 5257

Quite strange indeed. I created an exhaustive test file containing all possible legal cases this way: #include <stdio.h> int main(){ int i1,i2,i3,j1,j2,j3; for(j1=1;j1<20;j1++){ for(j2=1;j2<20;j2++){ for(j3=1;j3<20;j3++){ for(i1=1;i1<=j1;i1++) printf("%d %d %d %d %d %d\n",i1,j2,j3,j1,j2,j3); for(i2=...

Go to advanced search