Pagini recente » Cod sursa (job #2600362) | Cod sursa (job #103826) | Cod sursa (job #1884106) | Cod sursa (job #1302028) | Cod sursa (job #1583990)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, p, x[100];
int a, b;
void afisare()
{
for ( int i = 1; i <= p; i++) g << x[i]<<" ";
g<<endl;
}
int solutie(int x)
{
if( x == p ) return 1;
else return 0;
}
int conditie(int k)
{
for( int i = 1; i <= k; i++ ) if ( x[i] <= x[i-1] ) return 0;
return 1;
}
void back(int k)
{
x[k]=a-1;
while( x[k] < b )
{
x[k]++;
if(conditie(k)==1)
if(solutie(k)==1) afisare();
else back(k+1);
}
}
int main()
{
f>> n >> p;
a=1;
b=n;
back(1);
}