Cod sursa(job #1623295)
Utilizator | Data | 1 martie 2016 18:39:42 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int s[21];
int n, k;
void backtr (int t)
{
int i;
if(t == k){
for(i = 1; i<=k; i++)
fout<<s[i] <<" ";
fout << "\n";
}
else
for( i = s[t]+1; i <=n;i++){
s[t+1]= i;
backtr(t+1);
}
}
int main()
{
fin >> n >> k;
backtr(0);
return 0;
}