Search found 19 matches

by sunhong
Tue Jun 17, 2003 6:25 am
Forum: Volume 105 (10500-10599)
Topic: 10508 - Word Morphing
Replies: 35
Views: 12163

10508 - Word Morphing

The description of this problem include:The number of words are unlimited! But I don't know how many words there are in one case at most. I've used array of 10000 to store the words but got runtime error! Please help me, thank you!
by sunhong
Fri Jun 13, 2003 11:35 am
Forum: Volume 104 (10400-10499)
Topic: 10496 - Collecting Beepers
Replies: 19
Views: 10091

I think the method of backtrack can solve the problem. I use it and get
Accepted!
by sunhong
Sun Jun 08, 2003 12:19 pm
Forum: Volume 104 (10400-10499)
Topic: 10494 - If We Were a Child Again
Replies: 55
Views: 17406

Thank you for your reply, but I'm not familiar with the bigint operation. So I don't know which datatype I should use to caculate the result, can you tell me please?
by sunhong
Sun Jun 08, 2003 6:54 am
Forum: Volume 104 (10400-10499)
Topic: 10494 - If We Were a Child Again
Replies: 55
Views: 17406

I got several WA at this problem! But I can't find anything wrong in my program. And here is my code, please tell me what is incorrect. Thank you! #include <iostream.h> #include <math.h> #include <iomanip.h> int main() {long double a,b,result; char ch; while (cin>>a) {cin>>ch; while (ch!='/' && ch!=...

Go to advanced search