Cod sursa(job #2423024)
| Utilizator | Data | 20 mai 2019 17:21:42 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
#define MOD 1999999973
#define ull unsigned long long
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int v[1000];
int n,m;
void backt(int k){
if(k == m+1){
for(int j = 1; j <= m; j++){
fout<<v[j]<<" ";
}
fout<<'\n';
return;
}
int i;
for(i = v[k-1]+1; i <= n; i++){
v[k] = i;
backt(k+1);
}
}
int main()
{
fin>>n>>m;
backt(1);
return 0;
}
