OJ Board

Ok, I have done everything that I have been told, but I still get WA and I can't make it on my own.
I think that it works correctly to any input but I'm not so sure about the output.
I would really appreciate if any one can help me and run my code just to check if the way I do the output is ...

Ok, I have done everything that I have been told, but I still get WA and I can't make it on my own.
I thinks that it works correctly to any input and I don't know about the output.
I would really appreciate if any one can help me and run my code just to check if the way I do the output is correct ...

Thanks Ibrahim,

char inputline[81];

so I'll use while(scanf("%s",inputline)!=EOF)){
execute code
}
right?. Another question I have is
If we don't have to use files, do we have to process a line and then print it and so on, or do we have to process all lines and them print them all in one time ...

It's a problem that you have to do what it says to do, but i'm always getting WA and I have tried all the sample inputs that are on ACM North-Eastern European Regional Contest page.
Now here are some questions I have:
Do we have to use files?
If it says up to 40000 lines do we have to implement ...

ok, i'm starting to get it.
So i should try out one combination, then start cutting hopeless branches.
For example:
node node cost
1 2 5
2 3 3
2 3 5
3 4 2
3 5 4

My first try is (only odd vertex)
1,2 4,5 cost=5+2+4=11
then if i try
1,5 the cost already is 12 then i won't try this kind of ...

Thanks, but I do not know anything about backtraking. I've searched for information but it's really difficult to understand the main objective of this recursion, 'cause if never heard of it.
I just ask for help on this topic (backtracking/recursion) and if there exists any basic algorithm to ...

hi,
i'm new in this "programming world" and i need help on basic graph algorithms, specialy on the basic problem: Chinese postman problem. It consist on calculating the minimum cost for traveling from one vertex going trough all the edges and returning back to the initial vertex.
The solution is ...