Pagini recente » Cod sursa (job #1078379) | Cod sursa (job #314018) | Cod sursa (job #383703) | Cod sursa (job #2621400) | Cod sursa (job #1312275)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, m, k,x[19];
void afis()
{
for(int i=1;i<=n;i++)
g<<x[i]<<" ";
g<<endl;
}
void back()
{
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>0);
}
int main()
{
f>>m>>n;
back();
g.close(); return 0;
}