Cod sursa(job #1013870)
Utilizator | Data | 21 octombrie 2013 20:41:06 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int N,st[100],K;
void afisare (int k){
for(int i = 1; i <= k; i++){
fout<<st[i]<<" ";
}
fout<<"\n";
}
bool sol ( int k ){
return ( k == K );
}
void back(int k){
int i;
for(i=st[k-1]+1; i<=N; i++){
st[k]=i;
if(sol(k))
afisare(k);
else
back(k+1);
}
}
int main()
{
fin>>N>>K;
back(1);
return 0;
}