Cod sursa(job #1820787)
Utilizator | Data | 2 decembrie 2016 11:17:26 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int stv[15], n, k, fv[15];
void backu (int niv )
{int i;
if( niv == k+1 )
{
for( i=1; i<niv; i++ )
fout<<stv[i]<<" ";
fout<<"\n";
}
else
for( i=stv[niv-1] + 1 ; i<=n ; i++ )
{
stv[niv]=i;
backu(niv+1);
}
}
int main()
{
fin>>n>>k;
backu(1);
return 0;
}