Cod sursa(job #1905647)
Utilizator | Data | 6 martie 2017 09:56:24 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout ("combinari.out");
int n,m,sol[101];
void afis()
{
for (int i=1;i<=m;i++)
fout<<sol[i]<<' ';
fout<<'\n';
}
void back(int k)
{int i;
if (k>m) afis();
else for (i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
back(k+1);
}
}
int main()
{fin>>n>>m;
back(1);
return 0;
}