Cod sursa(job #1820745)
Utilizator | Data | 2 decembrie 2016 10:50:00 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <iostream>
#include <fstream>
using namespace std;
ofstream fout ("combinari.out");
ifstream fin ("combinari.in");
int n,v[15],a,b,m;
bool pp( int k )
{
for( int i = 1 ; i < k ; i++ )
if( v[ i ] >= v[ k ] )
return 0;
return 1;
}
void scrie()
{
for( int i = 1 ; i <= m ; i++ )
fout<<v[ i ]<<" ";
fout<<'\n';
}
void backtr( int k )
{
for( int i = 1 ; i <= n ; i++ )
{
v[ k ] = i;
if( pp( k ))
{
if( k == m )
scrie();
else
backtr( k + 1 );
}
}
}
int main()
{
fin>>n>>m;
backtr( 1 );
return 0;
}