Pagini recente » Cod sursa (job #2190709) | Borderou de evaluare (job #1984167) | Cod sursa (job #564786) | Cod sursa (job #754772) | Cod sursa (job #1786752)
#include <iostream>
#include <fstream>
using namespace std;
int n,k;
int V[20];
ifstream f("combinari.in");
ofstream g("combinari.out");
void combinari(int l){
int i;
if (l==k+1) {
for (i=1;i<=k;i++){
g << V[i] << " ";
}
g << "\n";
}
else {
for (i=V[l-1]+1;i<=n;i++){
V[l]=i;
combinari(l+1);
V[l]=0;
}
}
}
int main()
{
f >> n >> k;
combinari(1);
}