Pagini recente » Cod sursa (job #3149902) | Cod sursa (job #3252408) | Cod sursa (job #2451411) | Cod sursa (job #1198739) | Cod sursa (job #1377511)
#include <fstream>
using namespace std;
ifstream is("combinari.in");
ofstream os("combinari.out");
int n, x[10], m;
bool a[10];
void Perm( int k );
void Write();
int main()
{
is >> n >> m;
Perm(1);
is.close();
os.close();
return 0;
}
void Perm( int k )
{
if ( k == m + 1 )
{
Write();
return;
}
for ( int i = 1; i <= n; i++ )
{
x[k] = i;
if ( a[i] == false && x[k] > x[k-1] )
{
a[i] = true;
Perm(k+1);
a[i] = false;
}
}
}
void Write()
{
for ( int i = 1; i <= m; i++ )
os << x[i] << ' ';
os << '\n';
}