OJ Board

the input ends with an end of file marker
in unix systems its ^d and in dos based systems its ^z
if your program terminates at this commands then your TLE is not due to problems in receivng input/output.
check if u exceed numerical limits that would make your program run n an infinite loop
eg ...

YES!
my program gives the following output for ur input set:

the problem statement asks you to output a blank line after each set of output

you must delete all the unnecesary code and then if you send a clearer code with single line comments then i may be able enough to help you..

if u feel like sending me the .c file that compiled in you compiler heres my mail add:
ak_i6@yahoo.com

in the question the soln is obviously the the longest common substring

but if i compare
{
if(strlen(mother)!=strlen(father))
while(1);
gives me a timelimit exceeded
without it my code is running in 0:00:002 time but produces WA
heres is m code
can u help me

#include <stdio.h>
#include <string.h ...

thanx i got an AC
actually the prob was i was assuming that equality of sides implied fitting
thanx

well please see this example of card sorting in
DONALD E KNUTH
SORTING AND SEARCHING(vol 3)
sec. 5.2.5 Soring by distribution

well donot worry too much about a PE
the problem will be counted as solved only
yet,
the problem with ur progrm is that it outputs an extra space

if(a>1){printf("x ");}

when u print the last number u put an extra space
and thats all the mistake that u have done and nothing more

thanx
the idea of lexical sorting by soritng on the last first and then proceeding upwards is correct for sure

id soon write here the reference to this statement

can u still help me

can you add the fields overall rank

and rank of a problem in the online page that gives the users info

would be pretty useful and inspiring

in problem 103
i use the following algorithm
first i sort the dimensions of all the boxes
then i sort the boxes into lexicographic order depending on their dimensions
finally i use DP method
(similar to that used to find the longest monotonic subsequence)
and write the output
can u help me why i ...

i think there r two mistakes in ur program
1.
when u check for height in your for loop, u dont give chance for the input to contain boxes of height zero
hence instead of checking that
u must again check

i<n



2.
in ur code

min+=abs(height -rata);

is definitely wrong
the question asks u ...

the question specifies that in case of a tie the alphabetically first permutation has to be output

can anybody tell me how UTC is related to GMT ??

even for the simpleproblems that have obvious solutions andwhen my code is tight i get AC only in time 0.00.002
if i pursue my efforts by submitting again and again i end up with a 0 time .does any body else have the same problem