Cod sursa(job #1970702)
| Utilizator | Data | 19 aprilie 2017 15:45:31 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,v[20];
void back(int p, int k, int n)
{
int i = 0;
if (p == k+1)
{
for (i=1; i<=k; i++)
fout << v[i] << " ";
fout << "\n";
}
else
{
for (i=v[p-1]+1; i<=n; i++)
{
v[p] = i;
back(p+1, k, n);
}
}
}
int main()
{
fin >> n >> k;
back(1, k, n);
return 0;
}
