Pagini recente » Cod sursa (job #894059) | Cod sursa (job #1779372) | Cod sursa (job #2949917) | Cod sursa (job #2079272) | Cod sursa (job #640730)
Cod sursa(job #640730)
#include<fstream>
using namespace std;
fstream f("combinari.in",ios::in);
fstream g("combinari.out",ios::out);
int n,p,sol[10];
void back(int k)
{
int i;
if(k==p+1)
{
for(i=1; i<=p; i++)
g<<sol[i]<<" ";
g<<"\n";
}
else
{
if(k>1)
sol[k]=sol[k-1];
else
sol[k]=0;
while(sol[k]<n-p+k)
{
sol[k]++;
back(k+1);
}
}
}
int main()
{
f>>n;
f>>p;
back(1);
f.close(); g.close();
return 0;
}