Cod sursa(job #2140360)
Utilizator | Data | 23 februarie 2018 12:38:49 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m;
int v[40];
void tipar(int k)
{
for(int i=1;i<=k;i++)
{
g<<v[i]<<" ";
}
g<<"\n";
}
void bkt()
{
int k;
k=1;
v[k]=0;
while(k)
{
if(v[k]<n)
{
v[k]++;
if(k==m)
{
tipar(k);
}
else
{
k++;
v[k]=v[k-1];
}
}
else
k--;
}
}
int main()
{
f>>n>>m;
bkt();
return 0;
}