Pagini recente » Cod sursa (job #868307) | Cod sursa (job #1953170) | Cod sursa (job #914265) | Cod sursa (job #1778772) | Cod sursa (job #360195)
Cod sursa(job #360195)
#include <iostream>
#include <fstream>
using namespace std;
int n,p, perm[10], use[10];
void back (int k);
ifstream I ("permutari.in");
ofstream O ("permutari.out");
int main () {
I >> n >>p;
back (1);
return 0;
}
void back (int k) {
int i;
for ( i=1; i<=n; i++) {
if (use[i]==0) {
use[i]=1;
perm[k]=i;
if (k==n-p+2) {
for (int i=1; i<=p; i++)
O << perm[i] <<" ";
O<<"\n";
}
else
back(k+1);
use[i]=0;
}
}
}