// Danh sach ke ma tran ke

#include <iostream>
#include <fstream>
using namespace std;
#define MAX 100
int n; // n dinh, k canh
int MTK[MAX][MAX]; // ma tran ke
int DSK[MAX][MAX]; // danh sach canh
char str[MAX];
void chuyen()
{
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
MTK[i][j] = 0;
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
{
if(DSK[i][j])
MTK[i][DSK[i][j]] = 1;
}
}
void main()
{
//doc file danhsachke.in
ifstream dsk("danhsachke.in");
dsk.is_open();
dsk>>n;//doc n
for(int i = 0 ; i <= 100 ; i++)
{
dsk.get(str[i]);//doc file danh sach ke chuyen vao mang str[]
}
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
DSK[i][j] = 0;
int u = 1,v = 1,t = 1,y = 1;
char s[MAX];
while(u <= n)
{
y = 1;
while(y <= n)

{
if(str[t] == '1' || str[t] == '2' || str[t] == '3' || str[t] == '4' || str[t] == '5' || str[t] == '6' ||
str[t] == '7' || str[t] == '8' || str[t] == '9' || str[t] == ' ')
{
//chuyen so lieu tu mang str[] vao mang DSK[][]
s[0] = str[t];
DSK[u][v] = atoi(s);
v++; t++; y++;
}
else
{
if(str[t] == ' ')
{ t++; }
else
{ t++; v = 1; y++; u++; }
}
}
}
dsk.close();
/********************************************************/
chuyen();
//xuat file matranke.out
ofstream mtk("matranke.out");
mtk<<n<<"\n";
for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= n ; j++)
{
mtk<<MTK[i][j]<<" ";
}
mtk<<"\n";
}
mtk.close();
}

#include<iostream>
#include<fstream>
#include<string.h>
using namespace std;
int DSK[100][100],MTK[100][100],n,k,DSC[100][2],count = 0;
char str[100];
int chuaxet[100];
void chuyen_DSK_MTK()//chuyen tu danh sach ke sang ma tran ke
{
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
{
MTK[i][j] = 0;
}
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
{
if(DSK[i][j])
MTK[i][DSK[i][j]] = 1;
}
}
void chuyen_MTK_DSC()//chuyen tu ma tran ke sang danh sach canh
{
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
{
if(MTK[i][j] != 0)
{
DSC[i][1] = i;
DSC[i][2] = j;
count++;
}
}
}
void DFS(int k)//duyet cay theo chieu sau DFS
{
chuaxet[k] = 0;
for(int i = 1 ; i <= n ; i++)
if (MTK[k][i] == 1 && chuaxet[i] == 1 )
{
DFS(i);

}
else
{
MTK[k][i] = 0;
}
}
void duyet()//duyet cay theo chieu sau DFS
{
for(k = 1 ; k <= n ; k++)
chuaxet[k] = 1;
for(int k = 1 ; k <= n ; k++)
if(chuaxet[k])
DFS(k);
}
void main()
{
//doc file mang.in
ifstream mang("mang.in");
mang.is_open();
mang>>n;
mang>>k;
for(int i = 0 ; i <= 100 ; i++)
{
mang.get(str[i]);
}
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
DSK[i][j] = 0;
int u = 1,v = 1,t = 1,y = 1;
char s[100];
while(u <= n)
{
y = 1;
while(y <= n)
{
if(str[t] == '1' || str[t] == '2' || str[t] == '3' || str[t] == '4' || str[t] == '5' || str[t] == '6' ||
str[t] == '7' || str[t] == '8' || str[t] == '9')
{
s[0] = str[t];
DSK[u][v] = atoi(s);
v++; t++; y++;
}
else

{
if(str[t] == ' ')
{ t++; }
else
{ t++; v = 1; y++; u++; }
}
}
}
mang.close();
/**********************************************************/
chuyen_DSK_MTK();
duyet();
chuyen_MTK_DSC();
ofstream kq("ketqua.out");
kq<<n<<" "<<count<<"\n";
for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= 2 ; j++)
{
if(DSC[i][j] != 0)
kq<<DSC[i][j]<<" ";
}
kq<<"\n";
}
kq.close();
}

//BT 11 backtracking - text - chy

#include<iostream>
using namespace std;
int C[100][100],n,k,P = 0,B[100],bit[100];
void init(int n,int B[])
{
for (int i = 1 ; i <= n ; i++)
B[i] = 1;
}
void Try(int i,int n,int k,int C[][100],int bit[],int B[])
{
for(int j = 1 ; j <= n ; j++)
{
if(B[j])
{
bit[i] = j;
B[j] = 0;
P = P + C[i][j];
if(i == n )
{
if( P == k )
{
cout<<"\n";
for(int t = 1; t <= n ; t++)
cout<<bit[t]<<" ";
}
}
else
Try(i+1,n,k,C,bit,B);
B[j] = 1;
P = P - C[i][j];
}
}
}
void main()
{
int i = 1;
cout<<"nhap n,k = "; cin>>n;cin>>k;
for(int hang = 1; hang <= n ; hang++)
{
for(int cot = 1; cot <= n ; cot++)

{
cout<<"C["<<hang<<"]["<<cot<<"] =";
cin>>C[hang][cot];
}
}
init(n,B);
Try(i,n,k,C,bit,B);
}

Bi tp 5
#include<iostream>
#include<fstream>
#include<stdlib.h>
using namespace std;
int a[20][20],t[20][20];
int n,count,dinh;
int chuaxet[100];
void init_array(int n)
{
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
a[i][j]=0;
for(int i=1;i<=n;i++)
chuaxet[i]=1;
}
void input()
{
int u,v,k,j;
char str[100];
char s[100];
ifstream fi("c:\\thu.in");
fi.is_open();
fi>>n;fi>>dinh;
init_array(n);
k=0;
for( u=0 ; u <= n ; u++)
{
fi.getline(str,100);
for(int i=0 ; i <=strlen(str) ; i++)
if(str[i]==' '||str[i]=='\t'||str[i]=='\0')
{
if(k>0)
{
k = 0;
int v =atoi(s);
a[u][v]=1;
}
}
else s[k++]=str[i];
}
fi.close();
}
void DFS(int v)

int i;
chuaxet[v]=0;
for(i=1;i<=n;i++)
if (a[v][i]== 1 && chuaxet[i]== 1)
{
count++;
t[count][0]=v;t[count][1]=i;
DFS(i);
}

}
void main()
{
input();
count=0;
DFS(1);
for(int i=0;i<n;i++)
{
for(int j=0;j<2;j++)
cout<<t[i][j]<<" ";
cout<<"\n";
}
}

Bi tp 6
#include<iostream>
#include<fstream>
#include<stdlib.h>
#include<queue>
using namespace std;
int a[20][20],t[20][2];
int n,dem;
int chuaxet[100];
void init_array(int n)
{
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
a[i][j]=0;
for(int i=1;i<=n;i++) chuaxet[i]=1;
}
void input()
{
int u,v,k,j;
char str[100];

char s[100];
ifstream fi("c:\\thu.in");
fi.is_open();
fi>>n;
init_array(n);
k=0;
for(u=0;u<=n;u++)
{
fi.getline(str,100);
for(int i=0;i<=strlen(str);i++)
if(str[i]==' '||str[i]=='\t'||str[i]=='\0')
{ if(k>0) { k = 0; int v =atoi(s);a[u][v]=1;}
}
else s[k++]=str[i];
}
fi.close();
}
void BFS(int u)//duyet theo chieu rong BFS
{
queue<int> q;
q.empty();
q.push(u);
chuaxet[u] = false;
while(!q.empty())
{
q.pop();
for(int i = 1 ; i <= n ; i++)
if(chuaxet[i] && a[u][i])
{
q.push(i);
chuaxet[i] = false;
dem++;
t[dem][1] = u;
t[dem][2] = i;
}
}
}
void main()
{
input();
dem=0;
BFS(1);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=2;j++)

cout<<t[i][j]<<" ";
cout<<"\n";
}
}

#include<iostream>
#include<fstream>
#include<string.h>
using namespace std;
int DSK[100][100],MTK[100][100],n,k,DSC[100][2],count = 0;
char str[100];
int chuaxet[100];
void chuyen_DSK_MTK()//chuyen tu danh sach ke sang ma tran ke
{
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
{
MTK[i][j] = 0;
}
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
{
if(DSK[i][j])
MTK[i][DSK[i][j]] = 1;
}
}
void chuyen_MTK_DSC()//chuyen tu ma tran ke sang danh sach canh
{
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
{
if(MTK[i][j] != 0)
{
DSC[i][1] = i;
DSC[i][2] = j;
count++;
}
}
}
void DFS(int k)//duyet cay theo chieu sau DFS
{
chuaxet[k] = 0;
for(int i = 1 ; i <= n ; i++)
if (MTK[k][i] == 1 && chuaxet[i] == 1 )
{
DFS(i);

}
else
{
MTK[k][i] = 0;
}
}
void duyet()//duyet cay theo chieu sau DFS
{
for(k = 1 ; k <= n ; k++)
chuaxet[k] = 1;
for(int k = 1 ; k <= n ; k++)
if(chuaxet[k])
DFS(k);
}
void main()
{
//doc file mang.in
ifstream mang("mang.in");
mang.is_open();
mang>>n;
mang>>k;
for(int i = 0 ; i <= 100 ; i++)
{
mang.get(str[i]);
}
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
DSK[i][j] = 0;
int u = 1,v = 1,t = 1,y = 1;
char s[100];
while(u <= n)
{
y = 1;
while(y <= n)
{
if(str[t] == '1' || str[t] == '2' || str[t] == '3' || str[t] == '4' || str[t] == '5' || str[t] == '6' ||
str[t] == '7' || str[t] == '8' || str[t] == '9')
{
s[0] = str[t];
DSK[u][v] = atoi(s);
v++; t++; y++;
}
else

{
if(str[t] == ' ')
{ t++; }
else
{ t++; v = 1; y++; u++; }
}
}
}
mang.close();
/**********************************************************/
chuyen_DSK_MTK();
duyet();
chuyen_MTK_DSC();
ofstream kq("ketqua.out");
kq<<n<<" "<<count<<"\n";
for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= 2 ; j++)
{
if(DSC[i][j] != 0)
kq<<DSC[i][j]<<" ";
}
kq<<"\n";
}
kq.close();
}