Cod sursa(job #2603992)
Utilizator | Data | 21 aprilie 2020 14:14:26 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,s[20];
void back(int l)
{
if(l==k)
{
for (int i = 1; i <= k; ++i)
g<<s[i]<<' ';
g<<'\n';
} else
{
for (int i = s[l]+1; i <= n; ++i) {
s[l+1]=i;
back(l+1);
}
}
}
int main() {
f>>n>>k;
back(0);
return 0;
}