Pagini recente » Cod sursa (job #493717) | Borderou de evaluare (job #2051291) | Cod sursa (job #298212) | Cod sursa (job #45552) | Cod sursa (job #1147573)
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int v[30],n,q;
int verif(int k)
{
int i;
for(i=1;i<k;i++)
if(v[k]<=v[i])
return 0;
return 1;
}
void back(int k)
{
int i;
if(k==q+1)
{
for(i=1;i<=q;i++)
out<<v[i]<<' ';
out<<'\n';
}
else
for(i=1;i<=n;i++)
{
v[k]=i;
if(verif(k))
back(k+1);
}
}
int main ()
{
in>>n>>q;
back(1);
}