OJ Board

I'm getting many WAs on this problem. Can someone who got AC tell me what the output should be in following case: 11 "AyB" "A"->"ab" "Ay"->"cdy" "B"->"w" "B"->"x" "" ""->"a" "...

you need not calculate the whole array for checking automorphic number.. For example, 25 25 ---625 save the result and extend it for 625 625 -- do not calculate 25*25 again, just extend it for the last 6. -- hope i am clear.. and it will help you.. This is helpful but it's not enough to get AC. Her...

Thank you...but I don't understand what you mean by "This kind of data structures are those that just don't type and debug during a contest instead of using a previously written and tested code."

Do you mean he coded and tested it in advance so he doesn't need to debug?

Thanks

To little joey:
how did you store those strings? hos did you lookup the dictionary?
You wrote a hash table during the contest?

Thank you

trulo17 wrote:i got acc in this one just within time( 8.443 seconds) so i would like to know a better way to do this task.What i'm doing is to see for every word in dictionary if it can be formed with the p letters.

This is similar to what I did...but I got TLE...

How do people solve this question so that the program runs within 10 seconds?

(I even saw some people's programs that ran within 2 seconds during the contest. )

Thank you

Thank you

I got accepted now!! Thank you sooo much!

By the way, how did other people approach this problem?
How could they solve the question within 1 sec?

Solaris wrote:

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

I got PE even if I put
cout<<sol<<' '<<totalw-sol<<endl<<endl;
Why?

Thanks for your suggestion...
this time I am getting a prenstation error...

I am getting TLE even though I use DP. My run time is (number of people * number of people/2 * total weight/2) I use a boolean array "array[3][100]=true" means it is possible to have 3 people with total weight=100. Does it sound right? How do people approach this problem? Thank you (should...

I used a priority queue (implemented by heap) and the program runs 0.2s

OH........why was I that stupid...>.<||

Thank you sooooo much~~
I got AC now!!

My program outputs 29 for that test case.

2+2=4
4+2=6
6+2=8
8+3=11

4+6+8+11=29

I absolutely no idea why I am getting a WA. I got WA even after changing uint to double, sorting the numbers... #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { typedef unsigned int uint; int N; while(cin>>N && N!=0) { vector<uint> table(N); for (N...