Search found 38 matches
- Sat Aug 13, 2005 4:27 pm
- Forum: Algorithms
- Topic: IOI'05 electronic online contest
- Replies: 3
- Views: 1378
- Sat Aug 13, 2005 12:53 pm
- Forum: Algorithms
- Topic: IOI'05 electronic online contest
- Replies: 3
- Views: 1378
IOI'05 electronic online contest
This year's International Olympiad in Informatics will be accompanied by an Online Contest hosted at http://sio.mimuw.edu.pl/ioi2005/ . Posted tasks will be exactly the ones used during the real competition and will be graded using the same test data. Everybody is welcome to participate. Please regi...
- Fri Sep 24, 2004 6:05 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10049 - Self-describing Sequence
- Replies: 33
- Views: 14154
If you have already solved this problem, maybe it will help somebody else. My accepted solution gives: 56 12 521 269 651 533 471 388 693 658 619 252 675 601 492 356 55 169 398 227 245 737 450 199 27 40 407 502 525 542 545 245 576 454 389 126 545 638 648 495 354 684 609 722 707 507 223 461 304 677 28...
- Tue Jul 06, 2004 11:23 am
- Forum: Volume 5 (500-599)
- Topic: 517 - Word
- Replies: 13
- Views: 5848
- Tue Jul 06, 2004 11:21 am
- Forum: Volume 5 (500-599)
- Topic: 517 - Word
- Replies: 13
- Views: 5848
ok then, could any one explain to me what this means, As we mentioned above, the word can be written in any of n cyclic shifted forms. The output file contains the lexicographically smallest word, assuming that a < b. For example - if your computet output is 'bbaaba' you should output it as 'aababb'
- Tue Jul 06, 2004 11:18 am
- Forum: Volume 5 (500-599)
- Topic: 517 - Word
- Replies: 13
- Views: 5848
Re: 517 Word
shamim wrote: could someone give me a few more test cases.
Thanks.
Code: Select all
16
aabaabbaababbbba
aaab
aaba
abab
abba
baaa
babb
bbab
bbba
2000000000
Code: Select all
aabbbbbbabbbbbbb
- Sun Jan 04, 2004 5:04 pm
- Forum: Volume 2 (200-299)
- Topic: 274 - Cat and Mouse
- Replies: 16
- Views: 2498
- Sat Dec 27, 2003 1:08 am
- Forum: Volume 1 (100-199)
- Topic: 193 - Graph Coloring
- Replies: 93
- Views: 23995
Re: 193 Graph coloring algo
okay I have no idea about NP-complete problems nor any algo to solve them. Can anyone share something to help me especially on this problem? Is there any way besides backtracking? thx!! In this problem you should write some "simulation" algorithm. Simply write a program that randomly choo...
- Sat Dec 27, 2003 12:49 am
- Forum: Volume 1 (100-199)
- Topic: 103 - Stacking Boxes
- Replies: 200
- Views: 26131
Re: 103: wrong answer? *frustrated*
In this problem I've made a graph (edge A->B if A nests in B) and then used graph search in topological order (I think it's a bit DP solution).seg10 wrote:I have what I believe is a DP solution to the problem.
- Tue Dec 23, 2003 11:50 pm
- Forum: Volume 7 (700-799)
- Topic: 756 - Biorhythms
- Replies: 32
- Views: 10498
Re: 756 Biorythms Pascal
It's a multiple input problem.WR wrote:The program reproduces all output as it should be, following the posts.
Nevertheless I still get WA.
- Thu Nov 13, 2003 1:34 am
- Forum: Other words
- Topic: Newcomer problems
- Replies: 15
- Views: 14497
- Sun Nov 02, 2003 9:29 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10226 - Hardwood Species
- Replies: 121
- Views: 41842
Re: Same is the case with me
I also got TLE when using <string>. After changing strings to char* I got Acc in 6 sec. And I had my own hash table.ram wrote:I also used STL for solving this problem. But getting a TLE. Is anything wrong with the input or our algo?
- Thu Oct 16, 2003 9:23 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10573 - Geometry Paradox
- Replies: 33
- Views: 12623
- Thu Oct 16, 2003 11:38 am
- Forum: Volume 105 (10500-10599)
- Topic: 10573 - Geometry Paradox
- Replies: 33
- Views: 12623
- Mon Oct 13, 2003 9:28 am
- Forum: Volume 1 (100-199)
- Topic: 102 - Ecological Bin Packing
- Replies: 485
- Views: 72886