Search found 66 matches

by Monsoon
Thu Oct 16, 2008 8:41 pm
Forum: Volume 115 (11500-11599)
Topic: 11528 - Switch Grid
Replies: 2
Views: 905

Re: 11528 - Switch Grid

as it turns out Gauss elimination using bitmask also solves this problem in ~1s ;-)
by Monsoon
Sat Oct 11, 2008 7:56 pm
Forum: Bugs and suggestions
Topic: km long judge queue (II.)
Replies: 1
Views: 1516

Re: km long judge queue (II.)

yeah, it's quite annoying when it's happens over and over again....

but on the other hand it's a little bit funny, when you consider this post http://forums.topcoder.com/?module=Mess ... ID=1028297 ;-)
by Monsoon
Sun Sep 14, 2008 11:12 pm
Forum: Volume 114 (11400-11499)
Topic: 11481 - Arrange the Numbers
Replies: 10
Views: 4543

Re: 11481 - Arrange the Numbers

on which elements won't move: first we choose which k elements won't move at first m positions (m choose k) then we want to count how many there are permutations of n' = n - k elements that all of m' = m - k first elements will move we use in/out + all permutations - all permutations that have at le...
by Monsoon
Sun Sep 14, 2008 11:03 pm
Forum: Volume 114 (11400-11499)
Topic: 11487 - Gathering Food
Replies: 11
Views: 3790

Re: 11487 - Gathering food

do bfs starting from 'A', then from 'B', ....
you can easily put counting number of shortest paths in bfs function
by Monsoon
Mon Aug 04, 2008 12:22 pm
Forum: Volume 114 (11400-11499)
Topic: 11473 - Campus Roads
Replies: 9
Views: 1577

11473 - Campus Roads

One question to understand the problem statement, what is answer for this case 1 7 3 0 0 2 0 2 1 1 1 1 -1 4 -1 4 0 i.e. i think this case doesn't have largest gap, because 5 is supremum but you can't achieve that (tree located at intersection), and for each E>0 you can achieve 5-E (move tree from P1...
by Monsoon
Mon Jul 14, 2008 11:59 am
Forum: Volume 114 (11400-11499)
Topic: 11467 - Pythagorean Triangles
Replies: 3
Views: 986

Re: 11467 - Pythagorean Triangles

can anyone verify my output, thx

Code: Select all

1
2
100
500
911
1000
1500
1999
2000
0

Code: Select all

4
44
360484740
302474108252
3667235277376
5400281116712
29018935378348
79411432484400
79574509024528
by Monsoon
Wed Apr 02, 2008 8:33 pm
Forum: Volume 114 (11400-11499)
Topic: 11425 - Collecting Luggage EXTREME!!!
Replies: 1
Views: 998

11425 - Collecting Luggage EXTREME!!!

Could anyone verify my outputs, i keep getting wa over and over again ;-) 13 0 0 10 0 10 2 9 1 8 2 7 1 6 4 5 1 4 9 3 1 2 4 1 10 0 1 5 11 4356 1 8 -10000 -10000 10000 -10000 10000 10000 5000 10000 5000 5000 -5000 5000 -5000 10000 -10000 10000 0 6000 4356 1 14 0 0 6 0 6 8 2 8 2 7 5 7 4 6 3 5 3 6 0 6 0...
by Monsoon
Fri Jan 11, 2008 2:20 pm
Forum: Volume 113 (11300-11399)
Topic: 11381 - Elegant Strings
Replies: 8
Views: 2238

Ah, so you mean using T as the nodes, and from S we get the edges? Then we need a mincost maxflow algorithm? I won't say anything new, but it much helps when you think about reduction to minimum cost path cover of DAG. In CLR there is solution to minimum path cover of DAG and when someone understan...
by Monsoon
Sat Jan 05, 2008 9:20 pm
Forum: Volume 113 (11300-11399)
Topic: 11381 - Elegant Strings
Replies: 8
Views: 2238

11381 - Elegant Strings

What is answer for

Code: Select all

1
adsdsf

are there any tricky testcases?

EDIT: bug found
by Monsoon
Sat Dec 29, 2007 8:07 pm
Forum: Volume 113 (11300-11399)
Topic: 11375 - Matches
Replies: 18
Views: 6815

you want to compute sth like this

T[n][k] = number of different numbers that can be written using exactly n matches, and if k==0 all this numbers has the most significant digit equal to 0. When k==1 is the other case.
by Monsoon
Sat Dec 29, 2007 7:12 pm
Forum: Volume 113 (11300-11399)
Topic: 11372 - Arranging a Contest
Replies: 13
Views: 4536

I think it should be very easy to people who starts in TC. At TC there are often tasks similar to this. But when someone starts only in acm-style contests these type of tasks are rare...
by Monsoon
Sat Dec 29, 2007 6:47 pm
Forum: Volume 113 (11300-11399)
Topic: 11375 - Matches
Replies: 18
Views: 6815

answer for n=2000 380991565762946156874961678046621248253433343260828166545367762755853547457003499038458622477079682758742141386513319975114405240307719618690948965321410900088224844552836566105758097591449004688515434992539439752768136225045759156699926199653294201865214528567739408354408370046214...
by Monsoon
Sat Dec 29, 2007 6:45 pm
Forum: Volume 113 (11300-11399)
Topic: 11373 - Happy Birthday
Replies: 16
Views: 3877

11373 - Happy Birthday

Could anyone give some i/o ? ;-) EDIT: verify? 100 100 1 1 0 1 10 2 -2 -20 100 45 -100 -1 100 2 3 100 -4 -100 100 65 24 -43 24 -44 -45 78 -46 78 1046872.19 524243.69 648388.69 65709.36 962958.92 58058.69 EDIT': correct one, after finding very stupid bug... 1100617.88 450178.78 369184.75 342170.82 12...
by Monsoon
Sun Sep 09, 2007 5:33 pm
Forum: Volume 107 (10700-10799)
Topic: 10752 - Distant Jumping
Replies: 5
Views: 4547

Hi, could anyone help me?

http://online-judge.uva.es/board/viewtopic.php?t=21548

thanks in advance
by Monsoon
Fri Sep 07, 2007 3:55 pm
Forum: Volume 112 (11200-11299)
Topic: 11263 - Nested Rectangles
Replies: 10
Views: 3630

satej wrote:@goodwill I sent an e-mail to Miguel yesterday. I think they will fix it as soon as they can.
at new server i've still wa, it's becouse the tests aren't fixed yet or shall i look for bug in my code?

Go to advanced search