OJ Board

I got it. Thank you very much......

I still got Wrong Answer...What's going on...I have checked all possible input on my computer, and all answers are right..... Please help me...!
#include <stdio.h>
#include <iostream.h>
#include <math.h>

void pri(int no,int n)
{
int str[16];
int i,k;
for(i=0;i<16;i++)
str =0;
k=15;
while(no>0 ...

I got Wrong Answer....Please Help Me....
#include <stdio.h>
#include <iostream.h>
#include <math.h>

void pri(int no,int n)
{
int str[16];
int i,k;
for(i=0;i<16;i++)
str =0;
k=15;
while(no>0)
{
str[k--]=no%2;
no/=2;
}
for(i=16-n;i<16;i++)
cout<<str ;
cout<<endl;
}
int dis(int no)
{
int ...

while(cin>>n&&n>0)

have to change into while(cin>>n&&n>=0)

If input is "1 0", what is output?

Thanks for your help.

I got it.
Thanks you guys very much.

Thanks. I got it.

"If there is more than one path of minimal weight the path that is lexicographically smallest should be output."
Above is from question.

My English is not very good,so I don't understand What is lexicographically smallest path?Can you make an example?

Thanks.

If input is 6 1, what is answer?