Cod sursa(job #2710434)
Utilizator | Data | 22 februarie 2021 16:19:36 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,c[20];
void back(int pos)
{
int urm;
if(pos == k)
{
for(int i=0; i<k; i++)
{
g << c[i] << " ";
}
g << '\n';
return;
}
else
{
for(int i=c[pos-1]+1; i<=n; i++)
{
c[pos]=i;
back(pos+1);
}
}
}
int main()
{
f >> n >> k;
back(0);
return 0;
}