9.txt

Data Structure Question

数字旅游

//数字旅游
#include <iostream.h>
#include <iomanip.h>
#include <conio.h>
void sum(int);
int a[20];
int i,j,m1,n1;
int main()
{
    cout<<"Input m:";cin>>m1;
    cout<<"Input n:";cin>>a[0];
a[0]=a[0]-m1*(m1+1)/2;
j=0;
if(a[0]>1)
{
    for(i=1;i<=a[0]/2;i++)
{
    a[1]=i;
a[2]=a[0]-a[1];
sum(2);
}
}
cout<<"Program End.";
getch();
return 0;
}
void sum(int kx)
{
    int k,m,l,qq,kk,lj;
if(kx==m1-1)
{
    j=j+1;
    cout<<"Road No."<<setw(3)<<j<<":"<<"1"<<"->";
qq=a[1],lj=0;
    for(k=1;k<=kx;k++)
{
if(qq!=a[k])
{
for(kk=qq+1;kk<=a[k];kk++)cout<<kk<<"->";
    qq=a[k];
lj++;
}
        if(a[k]!=6)cout<<a[k]<<"->";
}
for(kk=qq+1;kk<6;kk++)cout<<kk<<"->";
        cout<<"6";
    cout<<" L=";
if(a[1]==1&&a[kx]==m1)lj=lj*2;
if(a[1]==1&&a[kx]!=m1)lj=lj*2+1;
if(a[1]!=1&&a[kx]==m1)lj=lj*2+1;
if(a[1]!=1&&a[kx]!=m1)lj=lj*2+2;
cout<<lj<<endl;
}
k=kx;l=a[k];
for(m=a[k-1];m<=l/2;m++)
{
    a[k]=m;a[k+1]=l-m;
    sum(k+1);
}
}