Cod sursa(job #1135087)
| Utilizator | Data | 7 martie 2014 12:07:38 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int m,n,k,x[19];
void afis()
{
for(int i=1; i<=n; i++) g << x[i] << " ";
g << '\n';
}
void back()
{
k = 1; x[k] = 0;
do
{
while(x[k] + 1 <= m-n+k)
{
x[k]++;
if(k == n) afis();
else k++, x[k] = x[k-1];
}
k--;
}
while(k);
}
int main()
{
f >> m >> n;
back();
g.close();
return 0;
}
