## Search found 131 matches

Mon Sep 20, 2004 1:30 pm
Forum: Volume 105 (10500-10599)
Topic: 10506 - The Ouroboros problem
Replies: 6
Views: 2550
that must be very nice
i have solved this problem now with the FKM algorithm.
really your backtrack must be very efficient as the FKM algorithm will give the answer bit by bit.
bye
abi
Sun Sep 12, 2004 12:41 pm
Forum: Volume 106 (10600-10699)
Topic: 10694 - Combinatorial Summation
Replies: 24
Views: 8303
there is a simple recurrence relation relating a[n] to a[n-1], a[n-2] and some simple function f(n).
so a[n]=g(a[n-1], a[n-2], f(n))
the functions f, g are very simple, so i don't want to give them away.
bye
abi
Wed Sep 08, 2004 6:36 pm
Forum: Volume 107 (10700-10799)
Topic: 10710 - Chinese Shuffle
Replies: 19
Views: 4662
well all i did was to observe the examples given there. They contain the clue i think to solve the problem. try writing a few more of the longer ones and see what happens to each number by writing out some 3-5 steps. You should get an idea. The problem is very easy and I think anything more will be ...
Fri Sep 03, 2004 9:12 am
Forum: Volume 107 (10700-10799)
Topic: 10705 - The Fun Number System
Replies: 14
Views: 4170
hi kriger,
i also first thought of those problems.
i handle them like this
n>>1; if the bit is a posibit
n>>1; n++; if the bit is a negabit
this will avoid all overflows
bye
abi
Thu Sep 02, 2004 1:56 pm
Forum: Other words
Replies: 1
Views: 769
when you set your user preferences, there are options regarding from which hosts you can send the submissions to the judge. I think you should see if there is anything wrong with those options. You can edit them here

http://acm.uva.es/cgi-bin/OnlineJudge?UsersMgr:EditUser
Tue Aug 31, 2004 6:21 pm
Forum: Volume 107 (10700-10799)
Topic: 10705 - The Fun Number System
Replies: 14
Views: 4170
hi,
i solved this problem. but i don't know what is "excess code". Can you give me some links to that? I'd like to learn that technique too.
bye
abi
Tue Aug 31, 2004 2:32 pm
Forum: Volume 107 (10700-10799)
Topic: 10705 - The Fun Number System
Replies: 14
Views: 4170
yes there is a very good algo.
think like they were just ordinary binary numbers.
just do a small modification for the negative ones.
bye
Tue Aug 31, 2004 7:53 am
Forum: Volume 107 (10700-10799)
Topic: 10709 - Intersection is Not that Easy
Replies: 41
Views: 9406
consider the case when the Line segments are the parallel sides of a trapezium.
i think that will give a test case where maniacs idea will fail.
Tue Aug 31, 2004 7:31 am
Forum: Volume 107 (10700-10799)
Topic: 10709 - Intersection is Not that Easy
Replies: 41
Views: 9406
i think the idea of maniac is wrong for the LS LS case.
the line segments may have a perpendicular distance, less than the distance between the end points.
as i have not yet solved this problem, i got this idea reading the board, i will try and tell you if i get AC
abi
Thu Aug 26, 2004 1:24 am
Forum: Volume 102 (10200-10299)
Topic: 10201 - Adventures in Moving - Part IV
Replies: 23
Views: 11638
I use the following algorithm and get WA. can anyone help? :( 1. For each station I store the minimum cost with which i can reach that station with a fuel of 0---->200 2. Then i print the output is mincost[100] at the final destination. 3. If it is not possible to reach any of the intermediate stati...
Thu Aug 26, 2004 12:12 am
Forum: Other words
Replies: 2
Views: 861

There is no empty spots. Hi, I got a WA in the contest in this problem because i submitted a code that printed There are no empty spots. I understand that the mistake was mine. But I just request the problemsetters to be more lenient by not deviating from common language practices. It would clearly...
Mon Aug 23, 2004 9:51 pm
Forum: Volume 105 (10500-10599)
Topic: 10598 - Find the Latitude
Replies: 4
Views: 2777
actually my program outputs 10 lines for everything
Mon Aug 23, 2004 9:48 pm
Forum: Volume 105 (10500-10599)
Topic: 10598 - Find the Latitude
Replies: 4
Views: 2777
my AC program gives same output
Wed Aug 18, 2004 5:39 pm
Forum: Volume 105 (10500-10599)
Topic: 10559 - Blocks
Replies: 37
Views: 12343
0:00.219 1708 Ulan Degenbaev C++ 2003/10/30-13:19:59.766 2036487 (H0) 2 0:00.236 16448 Lou TianCheng C++ 2003/10/25-02:50:03.341 2020364 (H0) 3 0:00.469 4300 Der-Johng Sun C++ 2003/12/09-04:18:17.965 2131251 (H0) 4 0:00.582 1024 Gebrochenes Herz C++ 2003/10/08-14:49:17.315 1965002 (H0) 5 0:00.863 1...
Tue Aug 17, 2004 9:32 pm
Forum: Volume 105 (10500-10599)
Topic: 10559 - Blocks
Replies: 37
Views: 12343
i use the following idea to fill this two dimensional table we can see that in the a [j] for j>length of the ith segment, the increase in the segment size came from some other previous segment of the same colour as the segment i. so what i do is i go back and see a segment of the same color as the s...