Cod sursa(job #2012018)
| Utilizator | Data | 17 august 2017 17:10:11 | |
|---|---|---|---|
| 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 n,m,sol[20];
void bacc(int k)
{
if(k==m)
{
for(int i=0; i<m; i++)
g<<sol[i]<<' ';
g<<'\n';
return;
}
for(int v=(k==0)?0:sol[k-1];v<n;v++)
{
sol[k]=v+1;
bacc(k+1);
}
}
int main()
{
f>>n>>m;
bacc(0);
return 0;
}
