Pagini recente » Cod sursa (job #2692531) | Cod sursa (job #3207467) | Cod sursa (job #1730327) | Cod sursa (job #2398295) | Cod sursa (job #1533421)
#include <iostream>
#include <fstream>
using namespace std;
int a[200],n,t;
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 (k==t)
{
//if (diferit())
//{
for (j=1;j<=k;j++)
{
g<<a[j]<<" ";
}
g<<"\n";
//}
}
else (back(k+1));
}
}
int main()
{
f>>n>>t;
back(1);
return 0;
}