OJ Board

Thanks for your great help!

Your tricky test case really useful. This test case fail my algorithm. It's seem that I should refigure out a better algorithm to prevent this kind of test case..
By the way, Thanks for paying so much attention to my problem ^^.

According to your input data, my program can produce the right answer.
And I also add some code to ignore the number that > 50 but still got Wrong Answer! :cry:. I haven't started to optimize my efficiency of my program but at least there is some simple input case that I still don't consider in my ...

Can anybody help me what the flaw of algorithm I used in this problem? :cry:

1.read in all sticks, store them in a array and sort them in a decreasing order according to their length.
2.when reading in the sticks, I also use a variable to record the maximum length stick and sum of all sticks ...

I have test as many case(negative number,empty tree) as I can, but still get WA, can anybody help me?

/* problem 112 C++ */
#include<iostream.h>
#include<vector>

char cursor,sign,precursor;
int num,query,i,j,sum,level;
bool result;

using namespace std;

void main(void)
{
vector<int> numlv ...

Here is my code:)

#include<iostream.h>
#include<stdlib.h>

struct bumperprofile
{
int value;
int cost;
};

short row,col,bumpernum,bumperrow,bumpercol,i,j,index;
short ballrow,ballcol,lifetime,direction,oricol,orirow;
int wallcost,totalscore,partialscore;

void main(void)
{
while(cin>>col>>row ...

Does this problem have any special test case to let me get WA?

#include<iostream.h>
#include<math.h>
#include<vector>

using namespace std;

short N,C,i,j,count,midindex,temp;

void main(void)
{
vector <short> primelist;
primelist.push_back(1);
primelist.push_back(2);
primelist.push_back(3);
for (i=4;i<1001;i++) /* make a list of prime number at range 1 ...

Does anybody know any other ACM forum ??

Any tricky input in this problem?? I got WA so many times...

Does anybody have any idea of tricky input ?? I got so many times wrong answer...><

Here is my algorithm:

0.three array: ignore,title,keyword(also store "the title it come from"and "keyword position in the title").
1.Read in words to ignore and stored them in a array(ignore).
2.Read in titles, one word at a time to a string.(If read in a upper
case letter, it will be changed ...

Can anybody help me why I always got Runtime Error (signal 11 (SIGSEGV) Invalid memory reference )? :cry:

#include<iostream.h>
#include<string.h>

typedef struct /* structure for transaction */
{
char accountnum[3]; /* transaction account */
float money; /* transaction charge */
}transac ...

dawynn is right !! Got accepted is just a little meaning..What you learn from coding is the most important.

Your wisdom really do me a great favor. I finally got accept!! Thank you for paying so much attention to my problem