Implementation of simple Topology Sorting

[Cpp]
* Implementation of topological sorting */
# Include <iostream>
# Include <iostream>
Using namespace std;
# Deprecision MAX 100
 
Int main ()
{
Int map [MAX] [MAX];
Int d [MAX];
Int c [MAX];
Int n, m;
While (cin> n> m)
{
If (m = 0 & n = 0) break;
Int a, B;
Memset (map, 0, sizeof (map ));
Memset (d, 0, sizeof (d ));
For (int I = 0; I <m; I ++)
{
Cin> a> B;
If (map [a] [B])
Continue;
Map [a] [B] = 1;
D [B] ++; // calculate the inbound level
}

// Find the value of 0
Int index = 0;
For (int I = 0; I <n; I ++)
{
For (int j = 0; j <n; j ++ ){
If (d [j] = 0)
{
D [j] --;
C [index ++] = j;
For (int k = 0; k <n; k ++)
If (map [j] [k])
D [k] --;
Break;
}
}
}
}
System ("pause ");
Return 0;
}