Pagini recente » Cod sursa (job #1999788) | Cod sursa (job #113860) | Cod sursa (job #1608097) | Cod sursa (job #1949645) | Cod sursa (job #544964)
Cod sursa(job #544964)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,s[100];
void afis()
{
for(int j=1;j<=m;j++)
g<<s[j]<<' ';
g<<"\n";
}
void back(int k)
{
for(int i=s[k-1]+1;i<=n-m+k;i++)
{
s[k]=i;
if(k==m)
afis();
else
back(k+1);
}
}
int main()
{
f>>n>>m;
back(1);
f.close();
g.close();
return 0;
}