UVa OJ Board

i have try it very times
and got WA
i finally find it
in compare we cant use atoi() or atof()
becourse the lenth is too long
when i try to compare one char by one char
i got ac
hope this will help the one who got wa

thanks for your debug
there's very helfull for me
thanks a lot!!!

for sample input 789 i got ans 64 follower are my 64 H-semi-primes can anyone tell me which two are not H-semi-primes 1 ) 5 5 =25 2 ) 5 9 =45 3 ) 5 13 =65 4 ) 5 17 =85 5 ) 5 21 =105 6 ) 5 29 =145 7 ) 5 33 =165 8 ) 5 37 =185 9 ) 5 41 =205 10 ) 5 49 =245 11 ) 5 53 =265 12 ) 5 57 =285 13 ) 5 61 =305 14...

when n=4, the output is 2 or 33?

and when n=14 is the anser equal to n=11 && n=44 & n=41??

then Strategy one: AB+A+YZ+B
Strategy two: AZ+A+AY+A

i have try it
and got ac
the argrithm is right

thanks to "mf" a lot

i have got ac

why my code got wrong anser

can anyone tell me what input will let it wrong

is it over flower for long long int ?

thx before

Greedy is as follows:
1. Take one guy with maximum value
2. Take two appropriate guys with minimum sum of values

i have try the mothod to sove it, but

wa
can any one help me?

thanks ahead