Cod sursa(job #2398246)
Utilizator | Data | 5 aprilie 2019 11:05:25 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int result[18];
void combinations(int n,int k,int index)
{
if(index==k)
{
for(int i=0; i<index; i++)
out<<result[i]<<" ";
out<<'\n';
}
for(int i=1; i<=n; i++)
{
if(index==0 ||result[index-1]<i)
{
result[index]=i;
combinations(n,k,index+1);
}
}
}
int main()
{
int n,k;
in>>n>>k;
combinations(n,k,0);
}