OJ Board

this is saying MLE, which should not be. can anyone help me? here fx & fy r local & other 2 r global. #define SIZE 751 struct Edge { int u, v; double w; bool is_MST; }; struct Node { int size; int father; }; Node forest[SIZE]; Edge A[SIZE * SIZE]; double fx[SIZE],fy[SIZE];

thanks. but if i dont use special case (for n > 49, result always let me try) then it only results MLE. so i had to use special checking. is there any way to solve this without this special checking?

1. there is a convex polygon of size n (may not be regular). what is the maximum number of regions created inside it by all its diagonals. for example if n = 3 then region = 1 and n = 4 then region = 4. 2. there are n circles. what is the maximum number of regions created by their intersection. e.g....

i think this problem can be solved by using bfs. but my following code give wa. can anyone help? my idea is wrong or i just made wrong implementation of bfs?

// code deleted after AC

"the words should be output in alphabetically ascending order".
check this input:
1
aB

output:
aB
Ba

correction of previous post :
"but i made a small mistake in my implementation & after rechecking now its AC."
im in sleepy mind.

yes, nothing additional is needed after this algorithm. but i made a small mistake in my implementation after rechecking & now its AC.

i dont understand what's ur problem, wa or tle? if tle, then try to store the values without recompute every time.

thanks. yes, this program falls in an infinite recursion when n > 1. in fact, it's not possible to solve this by using recursive call.

java suporrt in judge is not good. i think class BigInteger is not available yet. read this
http://acm.uva.es/problemset/java.html

If there are several such X and Y, you should output that pair for which |X|+|Y| is the minimal (primarily) and X<=Y (secondarily). how can i test this? i use following algorithm-- Extended(a,b) if b = 0 then return (a,1,0) (d1, x1, y1) <--- Extended (b, a mod b) (d, x, y) <---- (d1, y1, x1 - floor(...

can anyone give me n-queen problems except 167, 750 & 10094

its better to describe ur algo. i dont know pascal & so i cant check the code. i solved it just simulating the commands.

thanks, but i still not found any error.

i have tried many times but still wa. i need the ans of some question 1. what is the output if no common sequence found 2. what to do if empty text occure 3. is there any punctuation in input. i use isgraph() to parse different words but no other character other than a...z will be in the output 4. f...