Pagini recente » Cod sursa (job #602059) | Cod sursa (job #2943881) | Cod sursa (job #1759081) | Cod sursa (job #399144) | Cod sursa (job #1379988)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,p;
int v[20];
bool valid(int m,int k)
{
for(int i=1;i<k;i++)
if(v[i]==m)
return 0;
return 1;
}
void back(int k)
{
for(int i=v[k-1];i<=n;i++)
if(valid(i,k))
{
v[k]=i;
if(k==p)
{
for(int i=1;i<=p;i++)
g<<v[i]<<" ";
g<<"\n";
}
else
back(k+1);
}
}
int main()
{
f>>n>>p;
f.close();
v[0]=1;
back(1);
}