OJ Board

I'm still getting WA, i solved that problem using a heap and i'm sure it works. Do you have any "tricky" input sample to test my program ?

thx. i considered that but i thought that input looks like this:

word word word('\n')
word word(EOF)

now i've got AC. thx again.

#include <iostream>

using namespace std;

char buff;
int words;
bool is;

int main() {
while(!cin.eof()) {
buff = cin.get();
while(buff!='\n' && buff!=EOF) {
if( ( buff >= 'a' && buff <= 'z') || (buff >= 'A' && buff <= 'Z') ) {
if(!is) {
is = true;
words++;
}
}
else is = false;
buff ...

when i implemented Graham scan, i used the following points to check my Graham scan:

1
15 // number of points
0 0
0 1
0 2
0 3
0 4
1 3
2 2
3 3
4 4
4 3
4 1
4 0
3 0
2 0
1 0

i hope that can help.


Mind one thing... in 681 problem given input is naturaly sorted so we needn't to do that again. I ...

[; I fixed it , but still doesn't work.

WA WA WA WA...

so frustrating.

hm maybe that's wrong ... for this test:
1
7
0 6
-4 4
-6 2
-2 -2
0 -4
1 -4
4 4
anwser is:
1
7
0 -4
1 -4
4 4
0 6
-4 4
-6 2
0 -4

right?

Thx, then everything in my program seems to be alright. But it isn't :|

for this test :
1
15
0 0
1 0
2 0
3 0
4 0
4 1
4 2
4 3
4 4
3 3
2 2
1 3
0 4
0 3
0 2
0 1

anwser:
1
5
0 0
4 0
4 4
0 4
0 0
is correct?