Pagini recente » Cod sursa (job #1532606) | Istoria paginii utilizator/maxampjo | Cod sursa (job #2988106) | Cod sursa (job #1419809) | Cod sursa (job #2799941)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int m,n,x[11];
void afis()
{ for(int i=1;i<=n;i++) g<<x[i]<<" ";
g<<'\n';
}
void back()
{ int k=1;
x[k]=0;
do
{ while(x[k]<m-n+k)
{ x[k]++;
if(k==n) afis();
else {k++; x[k]=x[k-1];}
}
k--;
}
while(k);
}
int main()
{ f>>m>>n;
back();
return 0;
}