Pagini recente » Cod sursa (job #1439445) | Cod sursa (job #109668) | Cod sursa (job #2331988) | Cod sursa (job #3229369) | Cod sursa (job #1403893)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int k;
int x[20];
int verif(int i)
{
if(i==1) return 1;
return (x[i-1]<x[i]);
}
void afis()
{
int i;
for(i=1;i<=k;i++)
g<<x[i]<<" ";
g<<'\n';
}
int main()
{
int n,i;
f>>n;
f>>k;
i=1;
while(i>0)
{
x[i]++;
if(x[i]>n-k+i)
{
x[i]=0;
i--;
}
else
if(verif(i)==1)
{
if(i==k) afis();
else
{
i++;
x[i]=x[i-1];
}
}
}
f.close();
g.close();
return 0;
}