Cod sursa(job #1863821)
Utilizator | Data | 31 ianuarie 2017 11:11:20 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
int n,m,x[100],k;
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void afish()
{
int i;
for(i=1;i<=m;i++)
fout<<x[i]<<" ";
fout<<"\n";
}
void permutari(int k)
{
for(x[k]=x[k-1]+1;x[k]<=n-m+k;x[k]++)
if(k==m)afish();
else permutari(k+1);
}
int main()
{
fin>>n>>m;
permutari(1);
}