Cod sursa(job #2186489)
Utilizator | Data | 25 martie 2018 17:51:22 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int s[20],n,K;
void afis(){
for(int i=1;i<=K;i++)
g<<s[i]<<' ';
g<<'\n';
}
bool valid(int k){
int i;
if(s[k]>s[k-1]) return true;
return false;
}
void Back(int k){
int i;
for(i=s[k-1]+1;i<=n-K+k;i++){
s[k]=i;
//if(valid(k))
{
if(k==K) afis();
else Back(k+1);
}
//s[i]=0;
}
}
int main()
{
f>>n>>K;
Back(1);
f.close();
g.close();
return 0;
}