OJ Board

if

aaA
AAa

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

"Is this problem is case-sensitive when compare two strings?"

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 ...

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 ...

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 ...

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 ...

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

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 ...

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.

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 ...

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 ...

[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 ...

: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 ...

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.)

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 ...

// ^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 ...