Cod sursa(job #1010090)
Utilizator | Data | 14 octombrie 2013 11:42:00 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
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 a[202],sol[202],n,m;
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);
return 0;
}