Pagini recente » Cod sursa (job #1730009) | Cod sursa (job #1059883) | Cod sursa (job #838235) | Cod sursa (job #1981796) | Cod sursa (job #1533396)
#include <iostream>
#include <fstream>
using namespace std;
int a[200],n;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
bool diferit()
{
int i,j;
for(i=1;i<=n;i++)
{
for(j=i+1;j<=n;j++)
{
if(a[i]==a[j])
return 0;
}
}
return 1;
}
void back (int k)
{
int i,j;
for (i=a[k-1]+1;i<=n;i++)
{
a[k]=i;
if (n==k)
{
if (diferit())
{
for (j=1;j<=n;j++)
{
g<<a[j]<<" ";
}
g<<"\n";
}
}
else (back(k+1));
}
}
int main()
{
int n,k,i;
f>>n>>k;
back(k);
return 0;
}