Pagini recente » Borderou de evaluare (job #853721) | Borderou de evaluare (job #1006265) | Borderou de evaluare (job #894446) | Borderou de evaluare (job #1628403) | Cod sursa (job #690687)
Cod sursa(job #690687)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m;
int s[20], uz[20];
void back(int k);
void afis();
int main()
{
fin >> n >> m;
back(1);
fin.close();
fout.close();
return 0;
}
void back(int k)
{
if ( k > m )
afis();
else
for ( int i = 1; i <= n; ++i )
{
if ( !uz[i] && s[k-1] <= i)
{
uz[i] = 1;
s[k] = i;
back(k+1);
uz[i] = 0;
}
}
}
void afis()
{
for ( int i = 1; i <= m; ++i )
fout << s[i] << ' ';
fout << '\n';
}