## Search found 16 matches

Sat Jan 10, 2004 10:32 am
Forum: Volume 102 (10200-10299)
Topic: 10252 - Common Permutation
Replies: 150
Views: 53537

### I still confused with...

if

aaA
AAa

returns
aaa or aa (case sensitive, one a and one A)

"Is this problem is case-sensitive when compare two strings?"
Tue Jan 06, 2004 4:21 pm
Forum: Off topic (General chit-chat)
Replies: 2
Views: 1861

### oh, me too!

I come here to ask why number of solved problems are decreased! 55 -> 21 :evil: :evil: :evil: :evil: :evil: :evil: I can't find any notice about it... my statics' last submission is Last submission: Fri Sep 27, 08:15:03 UTC 2002 but I submit many programs in 2003! Is DB of acm.uva.es out of order? P...
Sat Aug 30, 2003 9:56 am
Forum: Volume 7 (700-799)
Topic: 721 - Invitation Cards
Replies: 25
Views: 8779

### Before programming.

I read the problem and now I think what I should do. I found that All the ACM student members leave the CCS each morning At the end of the day, all students travel back to CCS Then, can I believe that the maximum path for go to bus stop and back to CCS is less or equal than 23. (even morning is 0:00...
Sun Aug 24, 2003 11:39 am
Forum: Volume 7 (700-799)
Topic: 787 - Maximum Sub-sequence Product
Replies: 39
Views: 19841

### OH... Thanks...

I found that... [cpp]bool isBiggerThan(UnsignedBigNum dest){ if(size > dest.size){ return true; } else if(size==dest.size){ for(int i=0;i<size;i++){ if(num > dest.num ) return true; } return false; } else return false; }[/cpp] [cpp]bool isBiggerThan(UnsignedBigNum dest){ if(size > dest.size){ return...
Sun Aug 24, 2003 10:11 am
Forum: Volume 7 (700-799)
Topic: 787 - Maximum Sub-sequence Product
Replies: 39
Views: 19841

### 787 WA..

I made my own bignumber class. (Also tested) And I use it for this problem... I use O(n) algorithm to find positive production range ( the range with positives and even number of negatives.) I wanna check my input and output... Sample Input -22165 26479 -30519 20570 21926 5461 -21760 19738 36 27996 ...
Fri Aug 15, 2003 6:09 am
Forum: Volume 1 (100-199)
Topic: 122 - Trees on the level
Replies: 103
Views: 11285

### Thanks a lot...

My poor english makes me get wrong answer...
The meaning of the value was the position what i meant not the number.

Be happy Krzysztof Duleba
Thu Aug 14, 2003 3:15 pm
Forum: Volume 7 (700-799)
Replies: 49
Views: 15294

### It's very strange...

Ivan Golubev said, 1) Output in ranklist all teams which numbers less then or equal to largest team number in input. It's very strange to me. (eventhough I did not sent my solution yet.) It seems like error of online-judge program. How can we know that largest team who have submitted is the largest....
Thu Aug 14, 2003 11:52 am
Forum: Volume 8 (800-899)
Topic: 808 - Bee Breeding
Replies: 19
Views: 10864

### I use this way...

I assumed three axis with

x: down right (1 7 19 31 .. )
y: up (1 5 15 31 .. )
z: up right (1 6 17 34 ... )

After you can find the position x,y ( marian have said.. )

And find manhatan distance with coordinate xy, xz, or yz.

The shortest distance is shortest among them.
Thu Aug 14, 2003 8:54 am
Forum: Volume 8 (800-899)
Topic: 839 - Not so Mobile
Replies: 21
Views: 8709

### 839 WA. still confused.

Hi. Thanks for reading my question. I solved ( not yet ) this problem with stack ( to make mobile - as tree data type ), and dfs ( to traverse all the sub-mobiles ). I tested some kinds of input with several test cases. I thought my code would work well... But I got WA. (My code is so complex) typed...
Thu Aug 14, 2003 8:40 am
Forum: Volume 8 (800-899)
Topic: 839 - Not so Mobile
Replies: 21
Views: 8709
You wrote that 0 12 96 1 1 2 3 2 2 4 2 4 But how this input could be... 0 12 96 1 shows that this root mobile needs only one left sub - mobile. and 1 2 3 2 sub-mobile's total weight is 2 + 2 = 4 , not 1*2 + 3*2... the right definition of 'equilibrium' ? -> All sub-mobile's left-weight and right weig...
Wed Aug 13, 2003 6:16 am
Forum: Volume 105 (10500-10599)
Topic: 10534 - Wavio Sequence
Replies: 44
Views: 8116

### It's my simple (?) code

[cpp]int seqIndex; // left to right increase order for(seqIndex=0;seqIndex<size;seqIndex++){ incOrder[seqIndex]=1; for(int i=seqIndex-1;i>=0;i--){ if(seq == seq[seqIndex]-1 && incOrder[seqIndex] < incOrder +1){ incOrder[seqIndex]=incOrder +1; break; } if(seq < seq[seqIndex] && incOrder[seqIndex] < i...
Tue Aug 12, 2003 10:21 am
Forum: Volume 1 (100-199)
Topic: 122 - Trees on the level
Replies: 103
Views: 11285

### 122, still got WA,

:evil: I am totally confused with pb 122. I checked all the previous post about this 122 problem. I checked, no root. more than one position (ex (5,LLR) (4,LLR)) (also root) more than one same value (ex (5,LR) (5,RL)) even not given a value in a node (ex (,LR)) It's my sample input... (1,) (2,L) (3,...
Thu Aug 07, 2003 5:36 am
Forum: Volume 101 (10100-10199)
Topic: 10103 - Karpovich blocks
Replies: 21
Views: 8544

### I found some different example

RRR
RRR
RRR
RRR

RRR
RGR
RBB
RRR

RRR
RRR
RRR
RRR

In this case, only detail 'B' can be separated first,

and then, G can move down (in this view), right and right.
(or R move up, left, and left.

Did you test this thing? (I'm programming now so I test nothing.)
Fri Jul 26, 2002 7:37 am
Forum: Volume 2 (200-299)
Topic: 290 - Palindroms <---> smordnilaP
Replies: 31
Views: 7481

### 290 Palindromes... Are there any special cases? Nope~

I don't know why I still got WA. I programmed it twice.. Do I have to use longer array more than 300? Nope. cause max integer is 2^31 and... step will never be bigger than 100 so.. even step is reach to 100.. (even every time carry happen) no more 131 ... Then... Should I have to deal with 'lower ca...
Wed Jul 24, 2002 8:36 pm
Forum: Volume 1 (100-199)
Topic: 107 - The Cat in the Hat
Replies: 278
Views: 22844

### how can I find N in fast way...

// ^2 large_n=(first_height-last_number-1)/2; if(large_n*large_n==last_number){ times=2; } else{ calc1=log(first_height)/log(last_number); for(large_n=2;large_n<100000;large_n++){ if(fabs(calc1-a[large_n])<0.000000000001) break; } times=(int)((log(last_number)/log(large_n))+0.1); // adjust } is the...