Cod sursa(job #443828)
Utilizator | Data | 18 aprilie 2010 16:07:08 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
long n,k,x[20];
int back()
{
long i=1,j;
x[1]=0;
do
{
while (x[i]<n)
{
++x[i];
if (i==k)
{
for (j=1;j<=k;++j) out << x[j] << " ";
out << "\n";
} else {
++i;
x[i]=x[i-1];
}
}
--i;
}
while (i!=0);
return 0;
}
int main()
{
in >> n >> k;
back();
return 0;
}