Cod sursa(job #1854517)
| Utilizator | Data | 22 ianuarie 2017 20:08:15 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ofstream fout("combinari.out");
int n,k,st[20];
void afisare()
{
for (int i=1;i<=k;i++)
fout<<st[i]<<' ';
fout<<'\n';
}
void combina()
{
int p=1;
while (p>0)
{
if (st[p]<n)
{
st[p]++;
if (p==k)
afisare();
else
st[++p]=st[p-1];
}
else p--;
}
}
int main()
{
ifstream fin("combinari.in");
fin>>n>>k;
combina();
fin.close();
fout.close();
return 0;
}
