Cod sursa(job #2139191)
Utilizator | Data | 22 februarie 2018 10:58:09 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
int k,n,a[19];
ifstream in("combinari.in");
ofstream out("combinari.out");
void solutie(int cifre )
{
if(cifre == k)
{
for(int i=1;i<=k;++i)
out<<a[i]<<" ";
out<<'\n';
}
else
for(int i=a[cifre]+1;i<=n;++i)
{
a[cifre+1]=i;
solutie(cifre+1);
}
}
int main(){
in>>n>>k;
solutie(0);
return 0;
}