Cod sursa(job #2122903)
| Utilizator | Data | 5 februarie 2018 17:13:20 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,m,v[2000005];
void afisare()
{
for ( int i = 1 ; i <= m ; i ++ )
out << v[i] <<" ";
out << endl;
}
void backt(int k)
{
if(k == m + 1)
afisare();
else
for ( int i = v[k-1]+1; i <= n ; i ++ )
{
v[k]=i;
backt(k+1);
}
}
int main()
{
in >> n >> m;
backt(1);
return 0;
}
