Cod sursa(job #1872596)
Utilizator | Data | 8 februarie 2017 13:42:31 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, p, k, x[20];
void afis()
{
for(int i = 1; i <= n; ++i)
g<<x[i]<<' ';
g<<'\n';
}
void backt()
{
k++;
for(int i = x[k-1] + 1; i <= p; ++i)
{
x[k] = i;
if(k == n) afis();
else backt();
}
k--;
}
int main()
{
f>>p>>n;
backt();
return 0;
}