OJ Board

Ok... I've already removed my code... ^^.

I have changed my dp technique, so i got acc... What i don't realize so far is i do not need to trace the path one by one, i only need to store the minimum value for the path... And also i just realized that the dp table can help me to print the path... ^^.

Hi, Arif... Thanks for ur sample and reference ... I can understand it... Now i'm gonna fix my code... Thx....

Hi Arif, thx for ur reply...
Yup, u rite on it... But, could you give me some samples of the dp approach? Because, i still can't figure it out...

Can anyone help me to make it faster? I still have no idea how to store the lexicographically path efficiently.... I'm waiting for ur answer.... Thx... :)..


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

int cost[10][100], output[10][100];
int idx, num;
long min;

void lexico(int temp[100], int output ...

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

void main()
{
int s, i, j, k, l, row, col, idx;
char n[10];

do {
scanf("%d", &s);
scanf("%s", &n);
if(s==0) break;

col= s+2;
row= 2*s+3;
l= strlen(n);
if(n[0]!='0') for(idx=0;n[idx]=='0'&&idx<l;idx++);
else idx= l-1;
for(j=1;j<=row;j++) {
for(k ...