Pagini recente » Cod sursa (job #1576763) | Cod sursa (job #1584987) | Cod sursa (job #594556) | Cod sursa (job #2026074) | Cod sursa (job #2079005)
/*#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int i,n,k,m,x[100];
inline void afis()
{
for(i=1;i<=m;i++)g<<x[i]<<" ";
g<<endl;
}
int cond(int k)
{
for(i=1;i<=k-1;i++)
if(x[k]<=x[i])return 0;
return 1;
}
void back()
{
k=1;
x[k]=0;
do
{
while(x[k]<n)
{
x[k]=x[k]+1;
if(cond(k))
if(k==m)afis();
else {k++;x[k]=0;}
}
k--;
}while(k>0);
}
int main()
{
f>>n>>m;
back();
return 0;
}
*/
#include<fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int n,m,S[20];
void g(int k)
{
int i;
if(k==m)
{
for(i=1; i<=m; i++)
fo<<S[i]<<" ";
fo<<"\n";
}
else
{
for(i=S[k]+1; i<=n; i++)
{
S[k+1]=i;
g(k+1);
}
}
}
int main()
{
fi>>n>>m;
g(0);
return 0;
}