OJ Board

Hello,

I got WA.
Please provide me a test file for which my code output is wrong.
I used a well known algorithm for finding the number of atomic symbols.
[I will not name it because I suppose this is a spoiler.]
I think my bug is in reading the input and preparing the string which will be coded ...

Think if you really need to compare temp1 with n.

Because you have the lines: count will always be 0 in this if ...

It seems it is important that you learn to debug the code.
Set a breakpoint at line:
count++;
and watch the variable i.

Your code displays many times the same pair, like:

Thank you!
You're right. I used int, having in mind the statement for a similar problem, 10750 - Beautiful Points.
Sorry for my initial message ...

I suppose that the judge is stopped for some maintenance and our submissions will be judged soon. It would be nice if somebody from staff will post a reply about the judge status ...

"Output will consist of a series of lines, one for each line of the input."
Please remove your code after accepted.

Running your code, I found my mistake. Thank you!

10245 - The Closest Pair Problem

After some TLEs, I submited a source which just reads data and I found that there are over 8000000 datasets. :o
The time limit is set to 3 seconds, not to 8 seconds as reads in the problem statement.
8000000 datasets were read in near 3 seconds, but there are more ...

Please tell me what is wrong in the next code, or tell me a test case for which the code produce wrong results.


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

using namespace std;

#ifndef ONLINE_JUDGE
#include <fstream>
#define cin fi
#define cout fo
fstream fi("BeautifulPoints.in ...

You use too small data structures. Just think how many edges can be.

Reading your code I found that after last output there need only one endl and got ACC my code. Thank you!

In my beginner opinion, judging as WA if there are 0 or 2 endl it is a "little" ... unpleasant ...