Cod sursa(job #2139912)
Utilizator | Data | 22 februarie 2018 21:28:50 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int sol[20];
int n,t;
void afisare()
{
for(int i=1;i<=t;i++)
fo<<sol[i]<<" ";
fo<<'\n';
}
void perm(int k)
{
for(int i=sol[k-1]+1;i<=n-t+k;i++)
{
sol[k]=i;
if(k==t)
afisare();
else
perm(k+1);
}
}
int main()
{
fi>>n>>t;
perm(1);
return 0;
}