Cod sursa(job #1917200)
| Utilizator | Data | 9 martie 2017 11:33:01 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k;
int x[20];
int conditie(int i)
{
if(i>1&&x[i-1]>=x[i])
return 0;
return 1;
}
void tiparire(int i)
{
for(int j=1;j<=i;j++)
fout<<x[j]<<" ";
fout<<"\n";
}
int main()
{
fin>>n>>k;
int i=1;
x[i]=0;
while(i>=1)
if(x[i]<n)
{x[i]++;
if(conditie(i)==1)
if(i==k)
tiparire(i);
else
i++,x[i]=0;
}
else
i--;
return 0;
}
