Search found 8 matches

by lucky16g
Wed Mar 26, 2008 11:22 am
Forum: Volume 109 (10900-10999)
Topic: 10905 - Children's Game
Replies: 66
Views: 25743

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
by lucky16g
Wed Oct 17, 2007 6:06 am
Forum: Volume 111 (11100-11199)
Topic: 11105 - Semi-prime H-numbers
Replies: 16
Views: 11543

thanks for your debug
there's very helfull for me
thanks a lot!!!
by lucky16g
Tue Oct 16, 2007 5:14 pm
Forum: Volume 111 (11100-11199)
Topic: 11105 - Semi-prime H-numbers
Replies: 16
Views: 11543

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...
by lucky16g
Mon Jul 23, 2007 8:50 am
Forum: Volume 101 (10100-10199)
Topic: 10198 - Counting
Replies: 30
Views: 14373

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

and when n=14 is the anser equal to n=11 && n=44 & n=41??
by lucky16g
Thu Jul 19, 2007 10:25 am
Forum: Volume 100 (10000-10099)
Topic: 10037 - Bridge
Replies: 84
Views: 24110

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

i have try it
and got ac
the argrithm is right
by lucky16g
Wed Jul 11, 2007 11:49 am
Forum: Volume 109 (10900-10999)
Topic: 10910 - Marks Distribution
Replies: 26
Views: 13160

thanks to "mf" a lot

i have got ac
by lucky16g
Tue Jul 10, 2007 9:44 pm
Forum: Volume 109 (10900-10999)
Topic: 10910 - Marks Distribution
Replies: 26
Views: 13160

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

Code: Select all

i have got ac

thanks for mf's help

by lucky16g
Sun Jul 01, 2007 7:33 pm
Forum: Volume 110 (11000-11099)
Topic: 11088 - End up with More Teams
Replies: 30
Views: 17538

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

Code: Select all

i give up this method

Go to advanced search