OJ Board

I have working on Heapsort for my undergrad thesis. I derived a new heapsort thats complexity is nlogn + nloglogn - n where as the carlsson has nlongn + nloglogn As far i know that was the best heapsort. If so then my one is better than carlsson. Plz anyone let me know that i m alright.................

As far i know carlsson's heap sort algorithm is the best for heapsort even better than corman. Is there any better than carlsson and what is the complexity of that for number of comparisons

Is there any algorithm for a given convex hull and given radius(r), how many minimal point(with radious r) is needed for cover the whole area?
Like the mobile network, how many tower is needed for a particular area
if each tower cover r distance?

I really dont know why ur code
is not responding to my VC++(6) compiler
THese emotions are really problematic
is the case of brackets

I do feel trouble for such kind of input too. :( In some cases u will find input in range of long long and x[1], x[2], x[3].......x[n] in that range too. But numerator and denomirator may exeed the range in the cases of multipliction of guessian. The best way i think each time devide the numbers whi...

neo_tohin!
its really nice to get a reply about 2 years later on a topic!
anyway i really never heard about Bhagsash upopado".
U should know I m not smart like u..............
wt is that plz. explain.......

I completely agree with subeen............. :lol: The fun and the happiness gained by the solving is really excellent...... I can remember, to solve a program of I just took 2 month time(the prob no. was 602). By the time i got WA message more that 20 times... :-? But when i solved that i knew how m...

SAME 2 ME
HAVE 2 CHEAK CRITICAL INPUTS

Why there will bbe right?
if(StrCmp(line,"right") == 0)
Why not right on

It may also happened i u dont take all the variables in double
my 1st code with long (deg, min) proved WA

As far i know there is no cold war in between NSU & AIUB. (Like NDC or DC) So, I dont know wt Mr. ronty want to mean................ I completely agree with tomal bhai.... No one have the rights to say against a versity if just a single faculty is wrong(still we dont know is it true or false). I...

actually u dont need to break counting the sum.......
It means write in the following way......

if((*(p+i)>96&&*(p+i)<123)||(*(p+i)>64&&*(p+i)<91))
{
sum++;
}

Its cant be fair
If i can use atoi then why i wont allow for itoa..........
any way wt to do.....try with another alg.......

U shouldnt break the loop in the if statement run untill any new line entered and count sum..........
that all...............

if((*(p+i)>96&&*(p+i)<123)||(*(p+i)>64&&*(p+i)<91))
{
sum++;
break;
}

Plz give me just one reason for satisfing with compiler error! not prob of submiting i submits with acm site......... :cry: :x /* @JUDGE_ID: XXXXX 446 C++ */ #include <stdio.h> #include <stdlib.h> #include <string.h> void bin13(char x[], int l) { int i,j; if(l==1) printf("000000000"); else...