Cod sursa(job #893031)
| Utilizator | Data | 26 februarie 2013 12:43:17 | |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
using namespace std;
int n;
int C[100][100];
void GenerareCod(int x){
if(x==1){
C[1][0]=1;}
else{
GenerareCod(x-1);
for(int i=(1<<(x-1))-1;i>=0;i--){
for(int j=0;j<x-1;j++){
C[(1<<x)-i-1][j]=C[i][j];}
C[(1<<x)-i-1][x-1]=1;}
}
}
int main()
{
cin>>n;
GenerareCod(n);
for(int i=0;i< 1<<n;i++){
for(int j=0;j<n;j++){
cout<<C[i][j]<<" ";}
cout<<'\n';
}
return 0;
}
