Pagini recente » Cod sursa (job #872545) | Cod sursa (job #2634339) | Cod sursa (job #2858830) | Cod sursa (job #2054895) | Cod sursa (job #1626656)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[100],sol[100],n,i,k,m;
void afis()
{
int i;
for(i=1;i<=m;i++)
g<<sol[i]<<" ";
g<<endl;
}
bool OK(int k)
{
int i;
for(i=1;i<=k-1;i++)
if(sol[i]==sol[k])
return false;
return true;
}
void back(int k)
{
if (k>m) afis();
else for(i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
back(k+1);
}
}
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
back(m);
return 0;
}