Cod sursa(job #2119303)
| Utilizator | Data | 31 ianuarie 2018 21:56:27 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,v[2000005];
void afisare()
{
for ( int i = 1 ; i <= m ; i ++ )
g << v[i] <<" ";
g << '\n' ;
}
void bkt(int k)
{
if(k == m + 1)
afisare();
else
for ( int i = v[k-1]+1; i <= n ; i ++ )
{
v[k]=i;
bkt(k+1);
}
}
int main()
{
f >> n >> m;
bkt(1);
return 0;
}
