Pagini recente » Cod sursa (job #1366778) | Cod sursa (job #2876106) | Cod sursa (job #2569013) | Cod sursa (job #1717841) | Cod sursa (job #1474926)
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[21],n,i,k;
int valid(int k)
{
int i;
for(i=1;i<=k-1;i++)
if(a[i]>=a[k])
return 0;
return 1;
}
int main()
{
f>>n>>k;
i=1;
do
{
do
{
a[i]++;
if(a[i]>n)
{
a[i]=0;
i--;
}
else
if(valid(i))
i++;
}while(i<=k&&i>0);
if(i>k)
{
for(i=1;i<=k;i++)
g<<a[i]<<" ";
g<<"\n";
i=k;
}
}while(i>0);
return 0;
}