Cod sursa(job #1553144)
Utilizator | Data | 19 decembrie 2015 12:27:55 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int sol[100000],n,m;
void afis()
{
int i;
for(i=1;i<=m;i++)
g<<sol[i]<<" ";
g<<'\n';
}
void back(int k)
{
if(k>m)afis();
else
for(int i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
back(k+1);
}
}
int main()
{
f>>n>>m;
back(1);
return 0;
}