Cod sursa(job #1010079)
Utilizator | Data | 14 octombrie 2013 11:34:31 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
int i,n,sol[10],m;
bool pus[10];
ifstream f("combinari.in");
ofstream g("combinari.out");
void afis()
{int i;
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);
}