Pagini recente » Cod sursa (job #2519702) | Cod sursa (job #2919550) | Cod sursa (job #1225956) | Cod sursa (job #3266415) | Cod sursa (job #1972999)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,a[20];
void afis()
{
int i;
for(i=m;i>=1;i--) g<<a[i]<<" ";
g<<'\n';
}
int ok(int k,int i)
{
int j;
for(j=k-1;j>=1;j--)
{
if(a[j]<=i) return 0;
}
return 1;
}
void backk(int k)
{
int i;
if(k>m) afis();
else
{
for(i=1;i<=n;i++)
{
if(ok(k,i)==1) {a[k]=i;backk(k+1);}
}
}
}
int main()
{
f>>n>>m;
backk(1);
return 0;
}