OJ Board

thank you, Dmytro_Chernysh..

But my method doesn't work in such case:

input :
8 + 97 + 100 = 6 + 4 + 97 + 100

abs(205 - 207) = 2

Can't find swaping elements that resulting in decreasing abs(sum1-sum2),
so output "no solution".

But there exists one solution like:

6 + 100 + 100 = 8 + 4 + 97 ...

Could anyone give me some test data, please...

My method is

1. Move the minus operand to the opposite side, and memorize the
locations of all operators in each side.

2. Count the summation of each side, and count the abs(sum1-sum2).
If
abs(sum1 - sum2 ) is odd, then "no solution"
ELSE ...

Sorry,I can't proof.....

This method broke into my heart occasionally.

I just don't know why it's wrong...^^....

Ex.

1
6 8
1 2
1 3
2 4
2 5
3 4
3 6
4 6
5 6

Step 1. Construct all neighbors for each node

node neighbors degree can_be_color
1 2 3 2 true
2 1 4 5 3 true
3 1 4 6 3 ...

Sorry,I can't proof.....

This method broke into my heart occasionally.

I just don't know why it's wrong...^^....

Ex.

1
6 8
1 2
1 3
2 4
2 5
3 4
3 6
4 6
5 6

Step 1. Construct all neighbors for each node

node neighbors degree can_be_color
1 2 3 2 true
2 1 4 5 3 true
3 1 4 6 3 true
4 2 3 6 3 ...

Excuse me..

The problem says ...

"If several events are scheduled for the same day, order them by
relative importance (number of stars)."

Does not it mean that the order is date,star,then input stream..??

I have see you suggestion in bbs:\\ofo.twbbs.org
And I tried star, date then input ...

I have tried problem 158 more than ten days.....

I think my code can produce correct answers...

But I still get WA..WA...more than fifty times...


*****************
Is there any special case ?

Please help me to solve the problem...

Hi... I got AC today...

If you need my code to produce outputs for only comparing....

You can mail to me u891504@oz.nthu.edu.tw



You can test thise case..

/*<<<<<<INPUT >>>>>>>*/

This: is, the input.
bggg)
efef


/*<<<<<<<OUTPUT>>>>>>>*/

hisTay: isay, hetay inputay.
gggbay)
efefay

Hi

I've sent you my code 195.c

I implemented the problem 10098 yesterday,it is same as 195,the only
difference is the A<B<C <..<Z<a<b...<z and A<a<B<b<C<c..<Z<z

I found the problems are only initializaion and noting the order.


^^..

My algorithem is ...

Form the minimum degree node to the maxmum degree node,
if its all neighbors are not black,it is going to be colored.

Is it wrong ...??...

I can got correct results in many cases,but I got WA,WA,and WA...

Sorry,I don't know what's wrong with your code..
You can get my code,and test many inputs on your code and mine...
Maybe you will get a detection from the answers between them ..

Good lock...

If you want my code ..please mail to

u891504@oz.nthu.edu.tw

I will send my code to you as soon as ...

The last thing I can thought is ....

" Initialize.."

You can try these cases

3
aaBBe
bb
eeeb

At my first time,"bb" case has five characters.

Sorry,my program language background is poor.
So I can't understand you code.

But the only problem that I ran into is the sequence is

A<a<B<b<C<c.....<Z<z

Wish this suggestion can help you ....

Another request I think you don't check is ........


the IDD has (00), but the third number is in the range 0-9 (both include)

I think problem 139 include some requesets that are not clear..

1. the city name can has blank ... "Log Angles"
2. you need to check the subscriber IDD(4-10) STD(4-7)
*3. you should confirm that the call number has the head number on the
"begining" of call number..

I spent three hours in *3 ...

My program got WA...
Can you give me some inputs and outputs ..