Pagini recente » Cod sursa (job #2240607) | Cod sursa (job #1807734) | Cod sursa (job #914840) | Cod sursa (job #1033715) | Cod sursa (job #1142922)
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
short a[19],n,k;
int bun(int i)
{
if(a[i-1]>a[i])return 0;
for(int j=1;j<i;j++)
if(a[i]==a[j])return 0;
return 1;
}
void combinari(int i)
{
if(i>k)
{
for(int j=1;j<=k;j++)
g<<a[j]<<" ";
g<<'\n';
}
else
for(int j=1;j<=n;j++)
{
a[i]=j;
if(bun(i))
combinari(i+1);
}
}
int main()
{
f>>n>>k;
combinari(1);
return 0;
}