Cod sursa(job #2042896)
Utilizator | Bociat Daniel Tiberiu CriogeniX | Data | 19 octombrie 2017 12:55:24 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int N,K,st[20];
void back(int k)
{
for(int i=st[k-1]+1;i<=N;i++)
{
st[k]=i;
if(k==K)
{
for(int j=1;j<=K;j++)
out<<st[j]<<' ';
out<<'\n';
}
else
back(k+1);
}
}
int main()
{
in>>N>>K;
back(1);
return 0;
}