Search found 67 matches

by Erik
Mon Apr 02, 2007 9:55 am
Forum: Volume 111 (11100-11199)
Topic: 11182 - Zeroes III
Replies: 12
Views: 4815

Hello, by calculating the sums on paper you can find a formula to compute the number of occurences of a given prime in F2(n). But for each prime p you have to sum these occurences for p, p^2, p^3, ... (Just as you do to determine the number of occurences of a prime p in n!) These are less then log(n...
by Erik
Mon Apr 02, 2007 7:55 am
Forum: Other words
Topic: Too much on this online judge system
Replies: 5
Views: 3197

by Erik
Sun Apr 01, 2007 8:35 pm
Forum: Other words
Topic: Too much on this online judge system
Replies: 5
Views: 3197

Hello,

I receive emails in reply to every submission. If there was a compile error it tells you the error messages.

Cu, Erik :)
by Erik
Sun Apr 01, 2007 8:08 pm
Forum: Volume 111 (11100-11199)
Topic: 11144 - S.O.S.
Replies: 13
Views: 5038

Hello,

it is possible to avoid all kind of floating-point arithmetics in this task.

Cu, Erik :)
by Erik
Sat Mar 24, 2007 5:18 pm
Forum: Algorithms
Topic: 2D Segment Tree
Replies: 1
Views: 2884

Hello,

segment tree is covered in "Algorithmen und Datenstrukturen" by T. Ottman and P. Widmayer.
Though I have no idea about two-dimensional segment trees.

Cu, Erik :)
by Erik
Tue Mar 20, 2007 1:57 pm
Forum: Volume 7 (700-799)
Topic: 723 - Comment Removal
Replies: 16
Views: 10154

Hello,

i finally got AC. It was a tricky but substantial error in my program.

Cu, Erik :)
by Erik
Mon Mar 19, 2007 2:15 pm
Forum: Volume 111 (11100-11199)
Topic: 11165 - Galactic Travel
Replies: 6
Views: 2638

Hello,

there exists a solution in almost O(n+k).

Cu, Erik :)
by Erik
Mon Mar 19, 2007 8:40 am
Forum: Volume 4 (400-499)
Topic: 449 - Majoring in Scales
Replies: 17
Views: 2797

Hello,

the major scale of Db is

Code: Select all

Db Eb F Gb Ab Bb C Db
Hence D# is not in the scale - for "D# UP THIRD" you have to output

Code: Select all

D#: invalid note for this key
Same goes for Gb in Key of E.

Cu, Erik :)
by Erik
Sun Mar 18, 2007 11:57 pm
Forum: Volume 4 (400-499)
Topic: 449 - Majoring in Scales
Replies: 17
Views: 2797

Hi,

it means that

Code: Select all

C D Fb E# G A B C
is not a valid major scale-notation.
In fact the correct notation is

Code: Select all

C D E F G A B C
Cu, Erik :)
by Erik
Sun Mar 18, 2007 2:47 pm
Forum: Volume 111 (11100-11199)
Topic: 11134 - Fabled Rooks
Replies: 12
Views: 6018

Hello,

there is an almost O(n) solution even better than O(n*log(n)).

Cu, Erik :)
by Erik
Tue Mar 13, 2007 10:14 pm
Forum: Volume 111 (11100-11199)
Topic: 11109 - Rinse
Replies: 8
Views: 3092

Hello,
but is the assumption that from the 2nd uptill the Kth rinse will use the same amount of water correct?
Yes, this is correct.
With some analysis search is not necessary.

Cu, Erik :)
by Erik
Tue Mar 13, 2007 7:23 pm
Forum: Volume 111 (11100-11199)
Topic: 11179 - Bit Stream
Replies: 11
Views: 5234

Hi,

your code looks ok to me. Does it give same result as your program for high chunk lenghts?
Compression OK should be output for

Code: Select all

640000 32 1234567890 1987654320 1671853665
320000 320000 0
Cu, Erik :)
by Erik
Sun Mar 04, 2007 11:47 pm
Forum: Volume 111 (11100-11199)
Topic: 11186 - Circum Triangle
Replies: 18
Views: 7383

Hello,
There is a solution with O(n) too.
Thanks rio!
I found a simple O(n) calculation but it still is O(n*log n) as I have to sort the points by angles.
Did you find a way without sorting?

Cu, Erik :)
by Erik
Sun Mar 04, 2007 1:18 pm
Forum: Volume 111 (11100-11199)
Topic: 11186 - Circum Triangle
Replies: 18
Views: 7383

Hi,

my solution runs in O(n^2) without any precomputation.

Cu, Erik :)
by Erik
Sun Mar 04, 2007 1:11 pm
Forum: Volume 111 (11100-11199)
Topic: 11194 - Stone Grid
Replies: 7
Views: 2794

Hi, I got the same question and sent a clarification request, which is not answered yet. Anyway I solved it now. It's about the interpretation of For the same reason, they do not want the final arrangement to have more stones than the initial grid configuration does. It means that in the end no cell...

Go to advanced search