Cod sursa(job #1553135)
Utilizator | Data | 19 decembrie 2015 12:24:32 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int n,i,sol[23],m;
void afis()
{
for(i=1;i<=m;i++) g<<sol[i]<<' ';
g<<'\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()
{
f>>n>>m;
back(1);
return 0;
}