Cod sursa(job #489920)
Utilizator | Liviu P. BeRReT | Data | 4 octombrie 2010 09:01:10 |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<iostream.h>
int x[100], n, m, k;
int cont (int k){
int i;
for(i=1;i<=k-1;i++)
if(x[i]==x[k])
return 0;
return 1;
}
void tipar (){
for(int i =1; i<=m;i++)
cout<<x[i]<<" ";
cout<<"\n";
}
int main () {
cin>>n>>m;
k=1;
x[1]=0;
while (k!=0)
if(x[k]<n){
x[k]++;
if(cont(k))
if(k==m)
tipar ();
else {
k++;
x[k]=0;
}
}
else k--;
return 0;
}