OJ Board

I've used the Merge Sort approach and got Accepted with the long datatype. So, now a days I think long long is not necessary for this problem.
( <---- 24 November, 2010)

Also got Accepted in the BST approach... but it took greater runtime.

I just added two arrays next[52] and prev[52] for each piles and used those in the previous code. Now its Runtime is 0.256 sec that places me within the Top 20 List for this problem. And I am satisfied with this.

I also had started with STL stack & vector like stcheung and got TLE.
Then I used a data structure like:
struct pile{
char card[52][2];
int top;
} piles[52];
I just skipped the empty piles while traversing.
though it took 1.552 sec , but I got Accepted. :wink:
Now I am trying to improve the ...

What is wrong :( with my code ?


#include<stdio.h>
#include<math.h>

#define num 105

long w[num][num], cost;

long min(long a,long b) { return ( (a<b) ? a : b ) ; }

long max(long a,long b) { return ( (a>b) ? a : b ) ; }

void MaxMinWarshall(long n)
{
long i,j,k;

for (k=1; k<=n; k++)
for ...

I have used Dijkstra.
I have Read the Post of Misof in the board But didn't understand How to initialize the cost/weight-matrix .
I have Initialized The Weight-Matrix as follows:
For each edge (a,b) I have set W[a] = W [a] = dist :-?
Then I have (tried to) find the first shortest path using ...

Here is My Code For Which I Have got P.E.


#include<stdio.h>
#include<math.h>

int main(void)
{
double tb,takenTotal,takenPrev5,take;
long t,dataset = 1;
bool tag = false;

scanf("%lf",&tb);
while(tb!=0)
{
if(tag == false) tag = true;
else printf("\n");
...
...
...
...
...
dataset ...

Pleeeee...........ase Help me.
:roll:
I am getting WA in it.
Can Anyone give me some critical I/O Sets.?
Here Is My Code :



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

struct point{
int x,y;
};

bool compare(char a,char b)
{
if(a>='A' && a<='Z'){
a=a+32;
}
if(b>='A' && b<='Z'){
b=b+32;
}
if ...

I've Submitted The Code again Using 'gets()' instead of 'scanf(" %[^\n]")',.......AND GOT Accepted ! ''

:roll:
Shouldn't There Be ANY '\n' After The last output line?
I'm getting P.E. With this code :

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

void main()
{
int freq[128],i,j,highest_freq,len,tag1=0,tag2;
char arr[1001];

while(scanf(" %[^\n]",arr)==1){
if(tag1==0) tag1=1;
else printf("\n");
len ...