Cod sursa(job #1553141)
Utilizator | Data | 19 decembrie 2015 12:26:57 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,i,a[134],sol[176];
void afis ()
{
for(int i=1;i<=m;++i)
{
g<<sol[i]<<" ";
}
g<<endl;
}
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;
}